An example where a heuristic using a tabu search approach is used
Network design - Algorithms
| Example name | Description |
|---|---|
| FA_TS_minCongestion11.java | Minimum bottleneck utilization routing using a tabu search heuristic Keywords: Flow assignment (FA), Protection algorithm, Tabu search (TS) Given a set of nodes and links, gith their capacities, an offered traffic, and a set of admissible paths for each demand (given by the k-shortest paths in km for each demand, being k a user-defined parameter), this algorithm uses a tabu search metaheuristic to find for each demand a link-disjoint 1+1 routes, so that the network congestion is minimized. For each demand, the candidate 1+1 pairs are computed as all the link disjoint pairs p1,p2, such that p1 and p2 are admissible paths. |
