An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks
We consider the problem of designing a reliable network defined as follows: Given an undirected graph, the objective of the problem is to find a minimum cost network configuration such that the flow balance equations are satisfied and the network is two-edge connected. The cost function for each edge consists of a fixed component and a variable component, which is proportional to the flow passing through the edge. We present a novel ant colony approach for the solution of the above problem. Computational experience is reported.
KeywordsTravelling Salesman Problem Network Design Problem Quadratic Assignment Problem Minimum Cost Network Hard Optimization Problem
Unable to display preview. Download preview PDF.
- Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. Technical Report TR/IRIDIA/1996-3, Université Libre de Bruxelles (1996)Google Scholar
- Dorigo, M., Stützle, T.: The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, vol. ch. 9, pp. 251–285. Kluwer Academic, Dordrecht (2003)Google Scholar
- Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimization, pp. 63–76. McGraw-Hill, London (1999)Google Scholar