Article ID: | iaor20083368 |
Country: | United Kingdom |
Volume: | 6 |
Issue: | 3 |
Start Page Number: | 361 |
End Page Number: | 391 |
Publication Date: | Sep 2007 |
Journal: | Journal of Mathematical Modelling and Algorithms |
Authors: | Blum Christian, Blesa Maria J. |
Keywords: | heuristics: ant systems |
One of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to quality-of-service and survivability requirements, it is required that no two routes interfere with each other. These requirements apply in particular to routing and admission control in large-scale, high-speed and optical networks. The same requirements also arise in a multitude of other applications such as real-time communications, vlsi design, scheduling, bin packing, and load balancing. This problem can be modeled as a combinatorial optimization problem as follows. Given a graph