One genetic algorithm for hierarchical covering location problem

被引：0
|
作者：
Maric, Miroslav [1 ]
Tuba, Milan [1 ]
Kratica, Jozef [1 ]
机构：
[1] Univ Belgrade, Fac Math, Belgrade 11000, Serbia
来源：
ADVANCED TOPICS ON EVOLUTIONARY COMPUTING | 2008年
关键词：
evolutionary computation; hierarchical location; covering models;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we present a new heuristic approach to solve the Hierarchical Covering Location Problem - HCLP. The binary encoding with the new genetic operators that keep the feasibility of individuals is proposed. The caching GA technique was used, in order to improve computational performance. Results were obtained for test problems available in the literature with 100 and 150 vertices. GA results were compared with exact results obtained using CPLEX. In all cases the computing times were reasonable.
引用
收藏
页码：122 / 125
页数：4
相关论文
共 50 条
  • [1] A genetic algorithm approach to solving the anti-covering location problem
    Chaudhry, Sohail S.
    [J]. EXPERT SYSTEMS, 2006, 23 (05) : 251 - 257
  • [2] Solving maximal covering location problem using genetic algorithm with local refinement
    Atta, Soumen
    Mahapatra, Priya Ranjan Sinha
    Mukhopadhyay, Anirban
    [J]. SOFT COMPUTING, 2018, 22 (12) : 3891 - 3906
  • [3] Solving maximal covering location problem using genetic algorithm with local refinement
    Soumen Atta
    Priya Ranjan Sinha Mahapatra
    Anirban Mukhopadhyay
    [J]. Soft Computing, 2018, 22 : 3891 - 3906
  • [4] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [5] A genetic algorithm for the set covering problem
    AlSultan, KS
    Hussain, MF
    Nizami, JS
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
  • [6] Solving a Capacitated Single-Allocation Hub Covering Location Problem by a Genetic Algorithm
    Mohammadi, Mehrdad
    Tavakkoli-Moghaddam, Reza
    Ghodratnama, Ali
    Rostami, Hamideh
    [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 776 - 783
  • [7] New Variants of the Covering Location Problem: Modeling and a Two-Stage Genetic Algorithm
    Bouaziz, Souhir Ghariani
    Mellouli, Racem
    Dammak, Abdelaziz
    Al-Hassan, Mohammad
    [J]. 2015 2ND WORLD SYMPOSIUM ON WEB APPLICATIONS AND NETWORKING (WSWAN), 2015,
  • [8] Tabu based heuristics for the generalized hierarchical covering location problem
    Lee, Jung Man
    Lee, Young Hoon
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (04) : 638 - 645
  • [9] Dual-based heuristics for a hierarchical covering location problem
    Espejo, LGA
    Galvao, RD
    Boffey, B
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (02) : 165 - 180
  • [10] An algorithm portfolio for the dynamic maximal covering location problem
    Calderin, Jenny Fajardo
    Masegosa, Antonio D.
    Pelta, David A.
    [J]. MEMETIC COMPUTING, 2017, 9 (02) : 141 - 151
12345