Applying a hybrid binary harmony search algorithm for the obnoxious p-median problem

被引:0
|
作者
Lin, Geng [1 ]
Dong, Zhengshan [1 ]
Luo, Jinyan [1 ]
Chen, Xiang [1 ]
Xu, Meiqin [1 ]
机构
[1] Minjiang Univ, Coll Math & Data Sci, Fuzhou, Peoples R China
来源
2021 14TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI 2021) | 2021年
关键词
D O I
10.1109/CISP-BMEI53629.2021.9624340
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
The obnoxious p-median problem is one of the most important facility location problems. It is known to be NP-hard, and has many practical applications. In this work, a hybrid binary harmony search algorithm (HHSA) is applied to solve the obnoxious p-median problem. Firstly, the harmony memory consideration rule is proposed to produce a new solution. The new solution is immediately conducted by a pitch adjustment rule. Second, a repair operator is used to repair the new produced solutions. Finally, a local search method is employed to improve the solution quality. A set of 72 instances is used to test the performance of the HHSA. Experimental results show that the HHSA is able to obtain high quality solutions.
引用
收藏
页数:4
相关论文
共 50 条
  • [1] A hybrid binary particle swarm optimization for the obnoxious p-median problem
    Lin, Geng
    Guan, Jian
    INFORMATION SCIENCES, 2018, 425 : 1 - 17
  • [2] An iterated greedy algorithm for the obnoxious p-median problem
    Gokalp, Osman
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 92
  • [3] Hybrid harmony search for conditional p-median problems
    Kaveh, A.
    Esfahani, H. Nasr
    INTERNATIONAL JOURNAL OF CIVIL ENGINEERING, 2012, 10 (01) : 32 - 36
  • [4] A parallel variable neighborhood search approach for the obnoxious p-median problem
    Herran, Alberto
    Colmenar, Jose M.
    Marti, Rafael
    Duarte, Abraham
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) : 336 - 360
  • [5] The obnoxious facilities planar p-median problem
    Kalczynski, Pawel
    Drezner, Zvi
    OR SPECTRUM, 2021, 43 (02) : 577 - 593
  • [6] Alternative formulations for the obnoxious p-median problem
    Lin, Chang-Chun
    Chiang, Yen-, I
    DISCRETE APPLIED MATHEMATICS, 2021, 289 : 366 - 373
  • [7] The obnoxious facilities planar p-median problem
    Pawel Kalczynski
    Zvi Drezner
    OR Spectrum, 2021, 43 : 577 - 593
  • [8] Random Search Algorithm for the p-Median Problem
    Antamoshkin, Alexander N.
    Kazakovtsev, Lev A.
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2013, 37 (03): : 267 - 278
  • [9] A Hybrid VNS/TABU Search Algorithm for Solution the P-Median Problem
    Montoya, Mauricio Romero
    Martinez, Erika Granillo
    Velazquez, Rogelio Gonzalez
    Bernabe Loranca, Maria Beatriz
    Analco, Martin Estrada
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2020, 11 (02): : 67 - 74
  • [10] Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem
    Manuel Colmenar, J.
    Greistorfer, Peter
    Marti, Rafael
    Duarte, Abraham
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (02) : 432 - 442