A hybrid genetic algorithm approach for backbone design of communication networks

Abdullah Konak, Alice E. Smith

Research output: Contribution to conferencePaper

24 Scopus citations

Abstract

The paper presents a hybrid approach of a genetic algorithm (GA) and local search algorithms for the backbone design of communication networks. The backbone network design problem is defined as finding the network topology minimizing the design/operating cost of a network under performance and survivability considerations. This problem is known to be NP-hard. In the hybrid approach, the local search algorithm efficiently improves the solutions in the population by using domain-specific information while the GA recombines good solutions in order to investigate different regions of the solution space. The results of the test problems show that the hybrid methodology improves upon previous approaches.

Original languageEnglish (US)
Pages1817-1823
Number of pages7
DOIs
StatePublished - Jan 1 1999
Event1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States
Duration: Jul 6 1999Jul 9 1999

Other

Other1999 Congress on Evolutionary Computation, CEC 1999
CountryUnited States
CityWashington, DC
Period7/6/997/9/99

All Science Journal Classification (ASJC) codes

  • Computational Mathematics

Fingerprint Dive into the research topics of 'A hybrid genetic algorithm approach for backbone design of communication networks'. Together they form a unique fingerprint.

  • Cite this

    Konak, A., & Smith, A. E. (1999). A hybrid genetic algorithm approach for backbone design of communication networks. 1817-1823. Paper presented at 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, United States. https://doi.org/10.1109/CEC.1999.785495