메뉴 건너뛰기




Volumn , Issue , 2003, Pages 714-720

Multi-objective optimization in area coverage problems for cellular communication networks: Evaluation of an elitist evolutionary strategy

Author keywords

Cell planning; Evolutionary algorithm; Multi objective problem

Indexed keywords

ALGORITHMS; OPTIMIZATION; TRANSMITTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0038675298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (19)
  • 1
    • 0037574138 scopus 로고    scopus 로고
    • The automatic location of base-stations for optimised cellular coverage: A new combinatorial approach
    • G. A. A. Molina and A. Nix. The automatic location of base-stations for optimised cellular coverage: A new combinatorial approach. In IEEE Vehicular Technology Conference, 1999.
    • (1999) IEEE Vehicular Technology Conference
    • Molina, G.A.A.1    Nix, A.2
  • 2
    • 84947923627 scopus 로고    scopus 로고
    • The pareto envelope-based selection algorithm for multiobjective optimization
    • J. K. D.W. Corne and M. Gates. The pareto envelope-based selection algorithm for multiobjective optimization. In Lecture Notes in Computer Science, volume 1917, pages 839-848, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1917 , pp. 839-848
    • Corne, J.K.D.W.1    Gates, M.2
  • 5
    • 0019045740 scopus 로고
    • Empirical formula for propogation loss in land mobile radio services
    • August
    • M. Hata. Empirical formula for propogation loss in land mobile radio services. IEEE Transactions on Vehicular Technology, 29(3):317-325, August 1980.
    • (1980) IEEE Transactions on Vehicular Technology , vol.29 , Issue.3 , pp. 317-325
    • Hata, M.1
  • 9
    • 84947926042 scopus 로고    scopus 로고
    • A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii
    • A. P. K. Deb, S. Agrawal and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In Lecture Notes in Computer Science, volume 1917, pages 848-849, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1917 , pp. 848-849
    • Deb, A.P.K.1    Agrawal, S.2    Meyarivan, T.3
  • 10
    • 0034261876 scopus 로고    scopus 로고
    • Cell planning with capacity expansion in mobile communications: A tabu search approach
    • C. Lee and H. Kang. Cell planning with capacity expansion in mobile communications: A tabu search approach. IEEE Transactions on Vehicular Technology, 49(5):1678-1691, 2000.
    • (2000) IEEE Transactions on Vehicular Technology , vol.49 , Issue.5 , pp. 1678-1691
    • Lee, C.1    Kang, H.2
  • 12
    • 0034486529 scopus 로고    scopus 로고
    • Optimum positioning of base stations for cellular radio networks
    • R. Mathar and T. Neissen. Optimum positioning of base stations for cellular radio networks. Wireless Networks, 6:421-428, 2000.
    • (2000) Wireless Networks , vol.6 , pp. 421-428
    • Mathar, R.1    Neissen, T.2
  • 13
    • 0028563269 scopus 로고
    • Optimizing microcell base station locations using simulated annealing techniques
    • IEEE
    • J. McGeehan and H. Anderson. Optimizing microcell base station locations using simulated annealing techniques. In 44th IEEE Vehicular Technology Conference, pages 858-862. IEEE, 1994.
    • (1994) 44th IEEE Vehicular Technology Conference , pp. 858-862
    • McGeehan, J.1    Anderson, H.2
  • 14
    • 0035071298 scopus 로고    scopus 로고
    • A study of the continuous casting mold using a pareto-converging genetic algorithm
    • R. K. N. Chakraborti and D. Jain. A study of the continuous casting mold using a pareto-converging genetic algorithm. Applied Mathematical Modelling, 25:287-297, 2000.
    • (2000) Applied Mathematical Modelling , vol.25 , pp. 287-297
    • Chakraborti, R.K.N.1    Jain, D.2
  • 15
    • 0002456462 scopus 로고    scopus 로고
    • Frequency assignment problems
    • D.Z.Du and P.M.Pardalos, editors, chapter 6. Kluwer Academic Publishers, Netherlands
    • P. P. R.A. Murphey and M. Resende. Frequency assignment problems. In D.Z.Du and P.M.Pardalos, editors, Handbook of Combinatorial Optimization, chapter 6. Kluwer Academic Publishers, Netherlands, 1999.
    • (1999) Handbook of Combinatorial Optimization
    • Murphey, P.P.R.A.1    Resende, M.2
  • 16
    • 84949500527 scopus 로고    scopus 로고
    • Genetic algorithms as prototyping tools for multi-agent systems: An application to the antenna setting problem
    • A. K. T. Lissajoux, V. Hilaire and A. Caminada. Genetic algorithms as prototyping tools for multi-agent systems: An application to the antenna setting problem. Lecture Notes in Computer Science, 1437:17-18, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1437 , pp. 17-18
    • Lissajoux, A.K.T.1    Hilaire, V.2    Caminada, A.3
  • 17
    • 84901418616 scopus 로고    scopus 로고
    • A simple evolutionary algorithm for multi-objective optimisation(seamo)
    • C. Valenzuela. A simple evolutionary algorithm for multi-objective optimisation(seamo). In IEEE Congress on Evolutionary Computation, pages 717-722, 2002.
    • (2002) IEEE Congress on Evolutionary Computation , pp. 717-722
    • Valenzuela, C.1
  • 19
    • 0033318858 scopus 로고    scopus 로고
    • Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach
    • E. Zitzler and L. Thiele. Multi-objective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271, 1999.
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.