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 language | English (US) |
---|---|
Pages | 1817-1823 |
Number of pages | 7 |
DOIs | |
State | Published - Jan 1 1999 |
Event | 1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States Duration: Jul 6 1999 → Jul 9 1999 |
Other
Other | 1999 Congress on Evolutionary Computation, CEC 1999 |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 7/6/99 → 7/9/99 |
All Science Journal Classification (ASJC) codes
- Computational Mathematics