• Citer

Ant colony optimization for the maximum edge-disjoint paths problem

par Blesa, Maria;Blum, Christian
Référence Lecture notes in computer science, 3005, page (160-169)
Publication Publié, 2004

Article révisé par les pairs

• Détails
• Contenu

Résumé :

Given a graph G representing a network topology, and a collection T ={(s1, t1)... (sk,tk)} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NPhard problem which consists in determining the maximum number of pairs in T that can be routed in G by mutually edge-disjoint S i-ti; paths. We propose an Ant Colony Optimization (ACO) algorithm to solve this problem. AGO algorithms are inspired by the foraging behavior of real ants, whose distributed nature makes them suitable for the application in network environments. Our current version is aimed for the application in static graphs. In comparison to a multi-start greedy approach, our algorithm has advantages especially when speed is an issue. © Springer-Verlag 2004.