The AntSynNet algorithm: Network synthesis using ant colony optimization

Proceedings of the International Conference on Artificial Intelligence, IC-AI'04

Volumn 2, Issue , 2004, Pages 648-654

  Wilkinson, Simon ^a   White, Tony ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANTO COLONY OPTIMIZATION (ACO); NETWORK SYNTHESIS; QUADRATIC ASSIGNMENT PROBLEM (QAP); SOCIAL INSECTS;

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; INFORMATION TECHNOLOGY; MATRIX ALGEBRA; METADATA; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS; TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 12744269938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Berry, L., Murtagh, B., Sugden, S. and McMahon, G. (1997) An Integrated GA_LP Approach to Communication Network Design, Proceedings of the 2nd IFIP Workshop on Traffic Management and Synthesis of ATM Networks, Canada.
2. Berry, L. McMahon, G., Sugden, S. Murtagh, B. and Randall, M (1999) Fast Network Design for Telecommunications, TR99-11, School of Information Technology, Bond University.
3. Brander, A. and Sinclair. M. (1995) A comparative study of K-shortest path algorithms, In Proc. of 11th UK Performance Engineering Workshop, pp 370-379.
4. Bullnheimer B., R.F. Hartl and C. Strauss (1999). An Improved Ant system Algorithm for the Vehicle Routing Problem. Paper presented at the Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna (Austria), May 21-23, 1997, to appear in: Annals of Operations Research (Dawid, Feichtinger and Hartl (eds.): Nonlinear Economic Dynamics and Control, 1999.
5. Cantarella, G.E., Pavone, G. and Vitetta, A. (2002) Heuristics for the Network Design Problem, EWGT2002, Bari, Italy.
6. Costa D. and A. Hertz (1997). Ants Can Colour Graphs. Journal of the Operational Research Society, 48, 295-305.
7. th International Conference on Genetic Algorithms, Morgan Kauffman, 1993, pp. 408-415.
8. Di Caro G. & Dorigo M. (1998). AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317-365.
9. Dorigo M., V. Maniezzo & A. Colorni (1991) The Ant System: An Autocatalytic Optimizing Process, Technical Report No. 91-016 Revised, Politecnico di Milano, Italy.
10. Dorigo M. and G. Di Caro (1999). The Ant Colony Optimization Meta-Heuristic. In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, 11-32.
11. Dorigo M., G. Di Caro & L. M. Gambardella (1999). Ant Algorithms for Discrete Optimization. Artificial Life, 5(2):137-172.
12. Eppstein, D., (1994) Finding the k shortest paths, 35th IEEE Symp. Foundations of Computer Science, Santa Fe, pp. 154-165.
13. Lawler, E. L. (1972) A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18, pp. 401-405.
14. Minoux, M. (1989) Network Synthesis and Optimum Network Design Problem: Models, Solution Methods and Applications, Networks, 19, pp. 313-360
15. Myslek, A. and Karas, P. (2002) Heuristic Methods for Topological Design of Telecommunications Networks, 2nd Polish-German Teletraffic Symposium PGTS 2002
16. Navarro Varela, G. & Sinclair, M.C., (1999) Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation, Proc. Congress on Evolutionary Computation (CEC'99), Washington DC, USA, pp.1809-1816.
17. Randall, M. and Tonkes, E. (2001) Solving Network Synthesis Problems Using Ant Colony Optimization, Engineering of Intelligent Systems, 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE, Budapest, Hungary.
18. Randall, M., McMahon, G. and Sugden, S. (2002) A Simulated Annealing Approach to Communication Network Design, Journal of Combinatorial Optimization, 6(1), pp. 55-65; Mar 2002.
19. Schoonderwoerd, R., Holland, O., Bruten, J. and Rothcrantz, L. (1996) Ant-based Load Balancing in Telecommunication Networks, Adaptive Behaviour, 5, pp. 169-207.
20. Singh, G., Das, S., Gosavi, S. and Pujar, S. (2003) Ant Colony Algorithms for Steiner Trees: An Application to Routing in Sensor Networks, Recent Developments in Biologically Inspired Computing, Eds. L. N. de Castro, F. J. von Zuben, in preparation.
21. White, T., Mann, J., and Smith G.D., (1999) Genetic Algorithms and Network Ring Design, Annals of Operational Research 86, pp. 347-371.
22. Yen, J. Y. (1971) Finding the K shortest loopless paths in a network. Management Science, 17, pp. 712-716.