论文信息 - Parallel Island-Based Genetic Algorithm for Radio Network Design

Parallel Island-Based Genetic Algorithm for Radio Network Design

This paper uses a realistic combinatorial optimization problem as an example to show how a genetic algorithm can be parallelized in an efficient way. The problem considered is the selection of the best set of transmitter locations in order to cover a given geographical region at optimal cost. It is shown that it is possible to obtain good solutions to the problem even with a very low communication load. The parallel program is tested, first on an artificial example, then on a real-life case.

[1] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .

[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3] Fred Glover,et al. Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[4] S. Ubeda,et al. Parallel computing of radio coverage , 1996, Proceedings of Vehicular Technology Conference - VTC.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[7] P. Kuonen,et al. Genetic approach to radio network optimization for mobile systems , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[8] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.

[9] Inman Harvey,et al. Fourth European Conference on Artificial Life , 1997 .

[10] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.