On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem

Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that can be applied to the design of static flows in connection-oriented computer networks. Next, through numerical simulation, we study the influence of algorithm’s parameters setting on the quality of solutions. We compare and discuss two variants of the algorithm: without and with feasible initial solution.

• Type: Conference
• Year: 2004
• Where: ICAISC
• Authors: Krzysztof Walkowiak
• Keywords: Ant Algorithm, Artificial Intelligence, Feasible Initial Solution, ICAISC 2004, Multicommodity flow Problem