skip to main content
10.1145/2093698.2093822acmotherconferencesArticle/Chapter ViewAbstractPublication PagesisabelConference Proceedingsconference-collections
research-article

Genetic and local search algorithms applied to balanced communication networks

Published: 26 October 2011 Publication History

Abstract

In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms.

References

[1]
Abuali, F., Schoenefeld, D. and Wainwright, R. 1994. Terminal assignment in a Communications Network Using Genetic Algorithms. In Proceedings of the 22nd Annual ACM Computer Science Conference (Phoenix, Arizona, United States, 1994). ACM, New York, NY, 74--81.
[2]
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Gómez-Pulido, J. and Vega-Rodríguez, M. 2008. Tabu Search vs Hybrid Genetic Algorithm to solve the terminal assignment problem. In Proceedings of the IADIS International Conference Applied Computing (Algarve, Portugal, April 10--13, 2008). IADIS Press, 404--409.
[3]
Cerny, V. 1985. A Thermodynamical Approach to the Travelling Salesman Problem: an efficient Simulation Algorithm. J. Optimization Theory and Applications. 45, 1 (Jan. 1985), 41--51.
[4]
Gen, M. and Chung, R. 1999. Genetic algorithms and engineering optimization. Wiley, New York.
[5]
Glover, F. 1986. Future paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research. 13, 5 (May 1986), 533--549.
[6]
Glover, F. and Laguna, M. 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA.
[7]
Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Boston, MA, USA.
[8]
Khuri, S. and Chiu, T. 1997. Heuristic Algorithms for the Terminal Assignment Problem. In Proceedings of the 1997 ACM Symposium on Applied Computing (San Jose, California, USA, 1997). ACM, New York, NY, 247--251.
[9]
Kirkpatrick, S. Gelatt, C. D. and Vecchi, M. P. 1983. Optimization by Simulated Annealing. J. Science. 220, 4598 (May 1983), 671--680.
[10]
Lourenço, H. R., Martin, O. and Stutzle, T. 2003. Iterated local search. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. Kluwer Academic Publishers, Boston, MA, USA, 321--353.
[11]
Metropolis, N. Rosenbluth, A. W. Rosenbluth, M. N. Teller, A. H. and Teller, E. 1953. Equations of State Calculations by Fast Computing Machines. J. Chemical Physics. 21, 6 (June 1953), 1087--1092.
[12]
Salcedo-Sanz, S. and Yao, X. 2004. A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transaction On Systems, Man and Cybernetics. 34, 6 (Dec. 2004), 2343--2353.
[13]
Xu, Y., Salcedo-Sanz, S. and Yao, X. 2004. Non-standard cost terminal assignment problems using tabu search approach. In IEEE Congress on Evolutionary Computation, (June 19--23, 2004). 2302--2306.
[14]
Yao, X., Wang, F., Padmanabhan, K. and Salcedo-Sanz, S. 2005. Hybrid evolutionary approaches to terminal assignment in communications networks. In Recent Advances in Memetic Algorithms and related search technologies, W. Hart, J. Smith and N. Krasnogor, Eds. Studies in Fuzziness and Soft Computing. Springer, Berlin/Heidelberg, 129--159.

Index Terms

  1. Genetic and local search algorithms applied to balanced communication networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      ISABEL '11: Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
      October 2011
      949 pages
      ISBN:9781450309134
      DOI:10.1145/2093698
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      • Universitat Pompeu Fabra
      • IEEE
      • Technical University of Catalonia Spain: Technical University of Catalonia (UPC), Spain
      • River Publishers: River Publishers
      • CTTC: Technological Center for Telecommunications of Catalonia
      • CTIF: Kyranova Ltd, Center for TeleInFrastruktur

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 26 October 2011

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. communication networks
      2. genetic algorithm
      3. iterated local search
      4. simulated annealing
      5. tabu search
      6. terminal assignment problem

      Qualifiers

      • Research-article

      Conference

      ISABEL '11
      Sponsor:
      • Technical University of Catalonia Spain
      • River Publishers
      • CTTC
      • CTIF

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 61
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 10 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media