Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 2, 2003, Pages 189-203

  Weicker, Nicole ^a   Szabo, Gabor ^b   Weicker, Karsten ^a   Widmayer, Peter ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Antennas; Evolutionary algorithm; Multiobjective; Radio spectrum management; Transmitters

Indexed keywords

ANTENNAS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; PARETO PRINCIPLE; POLYNOMIALS;

RADIO SPECTRUM MANAGEMENT;

TRANSMITTERS;

EID: 0037598652     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2003.810760     Document Type: Article

References (31)

1. F. S. Al-Khaled, "Optimal radio channel assignment through the new binary dynamic simulated annealing algorithm," Int. J. Commun. Syst., pp. 327-336, 1998.
2. E. Amaldi, A. Capone, and F. Malucelli, "Discrete models and algorithms for the capacitated location problem arising in umts network planning," in Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM. New York: ACM Press, 2001, pp. 1-8.
3. D. Beckmann and U. Killat, "Frequency planning with respect to interference minimization in cellular radio networks,", Vienna, Austria, TD(99)032, Tech. Rep. COST259, 1999.
4. _, "A new strategy for the application of genetic algorithms to the channel-assignment problem," IEEE Trans. Veh. Technol., vol. 48, pp. 1261-1269, 1999.
5. L. Davis, Ed., Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
6. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, "A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II," in Parallel Problem Solving From Nature - PPSN VI, M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, Eds. Berlin, Germany: Springer, 2000, pp. 849-858.
7. M. Fischetti, C. Lepschy, G. Minerva, G. Romanin-Jacur, and E. Toto, "Frequency assignment in mobile radio systems using branch-and-cut techniques," Eur. J. Oper. Res., vol. 123, pp. 241-255, 2000.
8. L. C. P. Floriani and G. R. Mateus, "An optimization model for the bst location problem in outdoor cellular and pcs systems," in Proc. 15th Int. Teletraffic Congress ITC, 1997.
9. C. M. Fonseca and P. J. Fleming, "Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization," in Proc. 5th International Conference on Genetic Algorithms, S. Forrest, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 416-423.
10. M. Galota, C. Glasser, S. Reith, and H. Vollmer, "A polynomial-time approximation scheme for base station positioning in UMTS networks," in Proc. 5th Discrete Algorithms and Methods for Mobile Computing and Communications Conf., 2000, pp. 52-59.
11. C. Glasser, S. Reith, and H. Vollmer, "The complexity of base station positioning in cellular networks," in ICALP Satellite Workshops. Geneva, Switzerland: Carleton Scientific, 2000, pp. 167-178.
12. J. Horn, N. Nafpliotis, and D. E. Goldberg, "A niched Pareto algorithm for multiobjective optimization," in Proceedings of the 1st IEEE Conference on Evolutionary Computation. Piscataway, NJ: IEEE, 1994, vol. 1, pp. 82-87.
13. B. Jaumard, O. Marcotte, and C. Meyer, "Mathematical models and exact methods for channel assignment in cellular networks," in Telecommunications Network Planning, B. Sansáo and P. Soriano, Eds. Boston, MA: Kluver, 1999, ch. 13, pp. 239-255.
14. J. Kalvenes and R. Gupta, "Hierarchical cellular network design with channel allocation," in Proc. 2000 Telecommunications Conf. - Informs Select, 2000.
15. K. Mehlhorn and S. Näher, The LEDA Platform of Combinatorial and Geometric Computing. Cambridge, U.K.: Cambridge Univ. Press, 1999.
16. V. Pareto, Cours D'Economie Politique. Lausanne, Switzerland: F. Rouge, 1896.
17. B. J. Ritzel, J. W. Eheart, and S. Ranjithan, "Using genetic algorithms to solve a multiple objective groundwater pollution containment problem," Water Resour. Res., vol. 30, no. 5, pp. 1589-1603, 1994.
18. P. Ross, D. Corne, and H.-L. Fang, "Improving evolutionary timetabling with delta evaluation and directed mutation," in Parallel Problem Solving from Nature - PPSN III. ser. Lecture Notes in Computer Science 866, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds. Berlin, Germany: Springer, 1994, pp. 556-565.
19. J. D. Schaffer, "Multiple objective optimization with vector evaluated genetic algorithms," in Proceedings of the 1st International Conference on Genetic Algorithms, J. J. Grefenstette, Ed. Hillsdale, NJ: Lawrence Erlbaum, 1985, pp. 93-100.
20. N. Srinivas and K. Deb, "Multiobjective optimization using nondominated sorting in genetic algorithms," Evol. Comput., vol. 2, no. 3, pp. 221-248, 1995.
21. G. Syswerda and J. Palmucci, "The application of genetic algorithms to resource scheduling," in Proceedings of the 4th International Conference on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, 1991, pp. 502-508.
22. G. Szabo, N. Weicker, and P. Widmayer, "Base station transmitter placement with frequency assignment: An evolutionary approach (extended abstract)," in Advances in Nature-Inspired Computation: The PPSN VII Workshops, D. Corne, G. Fogel, W. Hart, J. Knowles, N. Krasnogor, R. Roy, J. Smith, and A. Tiwari, Eds. Reading, U.K.: PEDAL (Parallel, Emergent and Distributed Architectures Lab), Univ. of Reading, 2002, pp. 47-48.
23. K. Tutschku, T. Leskien, and P. Tran-Gia, "Traffic estimation and characterization for the design of mobile communication networks," Univ. of Würzburg, Würzburg, Germany, Tech. Rep. 171, ser. Inst. of Comput. Sci. Res. Rep. Series, 1997.
24. K. Tutschku, R. Mathar, and T. Niessen, "Interference minimization in wireless communication systems by optimal cell site selection," in Proc. EPMCC'99, Paris, France, 1999, pp. 208-213.
25. D. A. Van Veldhuizen and G. B. Lamont, "Multiobjective optimization with messy genetic algorithms," in Proceedings of the 2000 ACM Symposium on Applied Computing. New York: ACM, 2000, pp. 470-476.
26. N. Weicker, Qualitative No Free Lunch Aussagen für Evolutionäre Algorithmen. Göttingen, Germany: Cuvillier, 2001.
27. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, pp. 67-82, 1997.
28. T. Yu and P. Bentley, "Methods to evolve legal phenotypes," in Parallel Problem Solving from Nature - PPSN V. ser. Lecture Notes in Computer Science 1498, A. E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, Eds. Berlin, Germany: Springer, 1998, pp. 280-291.
29. X. Zhou and T. Nishizeki, "Efficient algorithms for weighted colorings of series-parallel graphs," in Algorithms and Computation, 12th International Symposium (ISAAC 2001), P. Eades and T. Takaoka, Eds. Berlin, Germany: Springer, 2001, pp. 514-524.
30. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization," in Evolutionary Methods for Design, Optimization and Control, K. Giannakoglou, D. Tsahajis, J. Periaux, K. Papailiou, and T. Fogarty, Eds. Barcelona, Spain: CIMNE, 2002.
31. E. Zitzler and L. Thiele, "Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach," IEEE Trans. Evol. Comput., vol. 3, pp. 257-271, 1999.