Abstract
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.
Keywords
- Travelling Salesman Problem
- Network Design Problem
- Quadratic Assignment Problem
- Minimum Cost Network
- Hard Optimization Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonabeau, E., Dorigo, M., Theraulaz, G.: Inspiration for optimization from social insect behavior. Nature 406, 39–42 (2000)
Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial optimization problems. International Transactions in Operational Research 3(1), 1–21 (1996)
Costa, D., Hertz, A.: Ants can colour graphs. Journal of the Operational Research Sociaty 48, 295–305 (1997)
Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. Technical Report TR/IRIDIA/1996-3, Université Libre de Bruxelles (1996)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics (Part B) 26(1), 29–41 (1996)
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)
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)
Gomez, J., Khodr, H., De Oliveira, P., Ocque, L., Yusta, J., Villasana, R., Urdaneta, A.: Ant colony system algorithm for the planning of primary distribution circuits. IEEE Transactions on Power Systems 19(2), 996–1004 (2004)
Hochbaum, D.S., Segev, A.: Analysis of a flow problem with fixed charges. Networks 19, 291–312 (1989)
Talbi, E.-G., Roux, O., Fonlupt, C., Robillard, D.: Parallel and colonies for the quadratic assignment problem. Future Generation Computer Systems 17(4), 441–449 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rappos, E., Hadjiconstantinou, E. (2004). An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive