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 条
  • [31] A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
    Sanchez-Oro, Jesus
    Lopez-Sanchez, Ana D.
    Colmenar, J. Manuel
    OPTIMIZATION LETTERS, 2022, 16 (01) : 301 - 331
  • [32] A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
    Jesús Sánchez-Oro
    Ana D. López-Sánchez
    J. Manuel Colmenar
    Optimization Letters, 2022, 16 : 301 - 331
  • [33] An exact algorithm for the fuzzy p-median problem
    Canós, MJ
    Ivorra, C
    Liern, V
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 116 (01) : 80 - 86
  • [34] A Branch Decomposition Algorithm for the p-Median Problem
    Fast, Caleb C.
    Hicks, Illya V.
    INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) : 474 - 488
  • [35] An efficient genetic algorithm for the p-median problem
    Alp, O
    Erkut, E
    Drezner, Z
    ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 21 - 42
  • [36] An Efficient Genetic Algorithm for the p-Median Problem
    Osman Alp
    Erhan Erkut
    Zvi Drezner
    Annals of Operations Research, 2003, 122 : 21 - 42
  • [37] HYBRID ALGORITHMS WITH ALTERNATIVE EMBEDDED LOCAL SEARCH SCHEMES FOR THE P-MEDIAN PROBLEM
    Rezova, Natalya
    Kazakovtsev, Lev
    Rozhnov, Ivan
    Stanimirovic, Predrag S.
    Shkaberina, Guzel
    INTERNATIONAL JOURNAL ON INFORMATION TECHNOLOGIES AND SECURITY, 2023, 15 (04): : 61 - 72
  • [38] A genetic algorithm for solving the P-median problem
    Abu Dalhoum, AL
    Moh'd, AZ
    de la Cruz, M
    Ortega, A
    Alfonseca, M
    MODELLING AND SIMULATION 2005, 2005, : 141 - 145
  • [39] An ant colony algorithm for P-median problem
    Chen, Ye
    Zheng, Houtian
    Li, Youmei
    Proceedings of the Third International Conference on Information and Management Sciences, 2004, 3 : 367 - 368
  • [40] A hybrid binary harmony search algorithm for solving the winner determination problem
    Lin G.
    Li Z.
    International Journal of Innovative Computing and Applications, 2019, 10 (01): : 59 - 68