Abstract
Ant colony optimisation is a relatively new meta-heuristic search technique for solving optimisation problems. To date, much research has concentrated on solving standard benchmark problems such as the travelling salesman problem, quadratic assignment problem and the job sequencing problem. In this paper, we investigate the application of ant colony optimisation to practical telecommunication design and synthesis problems having real-world constraints. We consider a modelling approach suitable for ant colony optimisation implementation and compare the results to the simulated annealing meta-heuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balakrishnan, A., Magnanti, T., Shulman, A. and Wong, R. (1991)“Models for Planning Capacity Expansion in Local Access Telecommunication Networks”, Annals of Operations Research, vol. 33, pp. 239–284.
Berry, L., Murtagh, B., Sugden, S. and McMahon, G. (1995) “Application of a Genetic-based Algorithm for Optimal Design of Tree-structured Communications Networks”, Proceedings of the Regional Teletraffic Engineering Conference of the International Teletraffic Congress, South Africa, pp. 361–370.
Berry, L., Murtagh, B., Sugden, S. and McMahon, G. (1997) “An Integrated GALP Approach to Communication Network Design, ” Proceedings of the 2nd IFIP Workshop on Traffic Management and Synthesis of ATM Networks, Canada.
Berry, L, Murtagh, B, McMahon, G. Randall, M. and Sugden, S. Ñ(1999) “Network Design with a Genetic Algorithm”, TR99-12 School of Information Technology, Bond University.
Burkard, R. (1984) “Quadratic Assignment Problems”, European Journal of Operational Research, 15, pp. 283–289.
Colorni, A., Dorigo, M and Maniezzo, V., (1991) “Distributed Optimization by Ant Colonies”, Proceedings of ECAL91, Elsevier, pp. 134–142.
Di Caro, G. and Dorigo, M. (1998) “Mobile Agents for Adaptive Routing”, Proceedings of the 31st Hawaii International Conference on Systems Science, pp. 74–83.
Dorigo, M., Maniezzo, V. and Colorni, A. (1996) “The Ant System: Optimization by a Colony of Cooperating Agents”, IEEE Transactions on Systems, Man and Cybernetics, 26, pp. 29–41.
Dorigo, M. and Gambardella, L. (1997) “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, IEEE Transactions on Evolutionary Computation, 1, pp. 53–66.
Dorigo, M and Di Caro, G. (1999) “The Ant Colony Optimization Meta-Heuristic”, in Corne, D., Dorigo, M. and Glover, F. (eds), New Ideas in Optimization, McGraw-Hill, pp. 11–32.
Gavish, B. (1985) “Augmented Lagrangian based Algorithms for Centralised Network Design”, IEEE Transactions on Communications, 33, pp. 1247–1257.
Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic Publishers, Boston, 402 pages.
Kershenbaum, A. and Peng, S. (1986) “Neighbor Finding Algorithms for CMST Customer Calculations, ” IEEE INFOCOM, Miami, Florida.
Lawler, E., Lenstra, J., Rinnoy Kan, A. and Shmoys, D. (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 465 pages.
Minoux, M. (1989) “Network Synthesis and Optimum Network Design Problem: Models, Solution Methods and Applications”, Networks, 19, pp. 313–360.
Randall, M., McMahon, G. and Sugden, S. (1999) “A Simulated Annealing Approach to Communication Network Design”, Journal of Combinatorial Optimization (to appear).
Randall, M. and Abramson, D. (2000) “A General Meta-heuristic based Solver for Combinatorial Optimisation Problems”, Journal of Computational Optimization and Applications (to appear).
Randall, M. and Montgomery, J. (2001) “Candidate Set Strategies for Ant Colony Optimisation”, Working paper
Randall, M. and Lewis, A (2000) “A Parallel Implementation of Ant Colony Optimisation”, Submitted to the Journal of Parallel and Distributed Computing.
Schoonderwoerd, R., Holland, O., Bruten, J. and Rothcrantz, L. (1996) “Ant-based Load Balancing in Telecommunication Networks”, Adaptive Behavior, 5, pp. 169–207.
Sharma, U., Mistra, K. and Bhattacharji, A. (1991) “Applications of an Efficient Search Techniques for Optimal Design of Computer Communication Networks”, Micro Electronics and Reliability, 31, pp. 337–341.
Varela, G. and Sinclair, M. (1999) “Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation”, Proceedings of the Congress on Evolutionary Computation, Washington DC.
White, T., Pagurek, B. and Oppacher, F. (1998) “Connection Management by Ants: An Application of Mobile Agents in Network management”, Proceedings of Combinatorial Optimization, Brussels
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Randall, M., Tonkes, E. (2001). Solving Network Synthesis Problems Using Ant Colony Optimisation. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-45517-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42219-8
Online ISBN: 978-3-540-45517-2
eBook Packages: Springer Book Archive