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.

[1]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2]  Michal Wozniak.  Application of the Confidence Measure in Knowledge Acquisition Process , 2003, International Conference on Computational Science.

[3]  M. C. Sinclair,et al.  Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[5]  Jack Dongarra,et al.  Computational Science — ICCS 2003 , 2003, Lecture Notes in Computer Science.