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. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Rappos, E., & Hadjiconstantinou, E. (2004). An ant colony heuristic for the design of two-edge connected flow networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 270–277). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
