{"type":"ScholarlyArticle","title":"Vertex Weighting-Based Tabu Search for p-Center Problem","authors":[{"name":"Qingyun Zhang","slug":"qingyun-zhang","given":"Qingyun","family":"Zhang","affiliation":"SMART , School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Zhipeng Lü","slug":"zhipeng-lu","given":"Zhipeng","family":"Lü","affiliation":""},{"name":"Zhouxing Su","slug":"zhouxing-su","given":"Zhouxing","family":"Su","affiliation":"SMART , School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Chumin Li","slug":"chumin-li","given":"Chumin","family":"Li","affiliation":"MIS , Université de Picardie Jules Verne , France"},{"name":"Yuan Fang","slug":"yuan-fang","given":"Yuan","family":"Fang","affiliation":"SMART , School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Fuda Ma","slug":"fuda-ma","given":"Fuda","family":"Ma","affiliation":"Huawei Cloud Alkaid Lab , Huawei Technologies Co., Ltd. , China"}],"abstract":"The p-center problem consists of choosing p centers from a set of candidates to minimize the maximum cost between any client and its assigned facility. In this paper, we transform the p-center problem into a series of set covering subproblems, and propose a vertex weighting-based tabu search (VWTS) algorithm to solve them. The proposed VWTS algorithm integrates distinguishing features such as a vertex weighting technique and a tabu search strategy to help the search to jump out of the local optima. Computational experiments on 138 most commonly used benchmark instances show that VWTS is highly competitive comparing to the state-of-the-art methods in spite of its simplicity. As a well-known NP-hard problem which has already been studied for over half a century, it is a challenging task to break the records on these classic datasets. Yet VWTS improves the best known results for 14 out of 54 large instances, and matches the optimal results for all remaining 84 ones. In addition, the computational time taken by VWTS is much shorter than other algorithms in the literature.","doi":"10.24963/ijcai.2020/206","url":"https://ijcai.org/proceedings/2020/206","pdf":"https://ijcai.org/proceedings/2020/0206.pdf","markdown":"https://ijcai.org/proceedings/2020/206.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/206","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Heuristic Search and Game Playing","track":"Main track","number":206,"pages":{"first":1481,"last":1487},"keywords":["Heuristic Search and Game Playing: Meta-Reasoning and Meta-heuristics","Planning and Scheduling: Planning Algorithms","Heuristic Search and Game Playing: Heuristic Search","Heuristic Search and Game Playing: Combinatorial Search and Optimisation"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24410/file_24410.m3u8","length_sec":280,"provider":"hls"}],"references":[{"position":1,"raw":"[Amiri, 2006] Ali Amiri. Designing a distribution network in a supply chain system: Formulation and efficient solution procedure. European Journal of Operational Research, 171(2):567-576, 2006.","title":"Designing a distribution network in a supply chain system: Formulation and efficient solution procedure","authors":"Ali Amiri","year":"2006","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Badri et al., 1998] Masood A Badri, Amr K Mortagy, and Colonel Ali Alsayed. A multi-objective model for locating fire stations. European Journal of Operational Research, 110(2):243-260, 1998.","title":"A multi-objective model for locating fire stations","authors":"A Masood, Amr K Badri, Colonel Mortagy, Alsayed Ali","year":"1998","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Beasley, 1990] John E Beasley. OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069-1072, 1990.","title":"OR-library: distributing test problems by electronic mail","authors":"John E Beasley","year":"1990","venue":"Journal of the Operational Research Society","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cai et al., 2011] Shaowei Cai, Kaile Su, and Abdul Sat- tar. Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artificial Intelligence, 175(9-10):1672-1696, 2011.","title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","authors":"Shaowei Cai, Kaile Su, Abdul Sattar","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calik and Tansel, 2013] Hatice Calik and Barbaros C Tansel. Double bound method for solving the p-center location problem. Computers & Operations Research, 40(12):2991-2999, 2013.","title":"Double bound method for solving the p-center location problem","authors":"Tansel ; ] Hatice Calik, Barbaros C Calik, Tansel","year":"2013","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Caruso et al., 2003] C Caruso, A Colorni, and L Aloi. Dom- inant, an algorithm for the p-center problem. European Journal of Operational Research, 149(1):53-64, 2003.","title":"Dominant, an algorithm for the p-center problem","authors":"Caruso, L Colorni, Aloi","year":"2003","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chvatal, 1979] Vasek Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Re- search, 4(3):233-235, 1979.","title":"A greedy heuristic for the set-covering problem","authors":"Vasek Chvatal, Chvatal","year":"1979","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Daskin, 2002] Mark S Daskin. A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results. Communications of the Operations Research Society of Japan, 45:428-436, 2002.","title":"A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results","authors":"Mark S Daskin","year":"2002","venue":"Communications of the Operations Research Society of Japan","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Davidović et al., 2011] Tatjana Davidović, Dušan Ramljak, Milica Šelmić, and Dušan Teodorović. Bee colony opti- mization for the p-center problem. Computers & Opera- tions Research, 38(10):1367-1376, 2011.","title":"Bee colony optimization for the p-center problem","authors":"Tatjana Davidović, Dušan Ramljak, Milica Šelmić, Dušan Teodorović","year":"2011","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Elloumi et al., 2004] Sourour Elloumi, Martine Labbé, and Yves Pochet. A new formulation and resolution method for the p-center problem. INFORMS Journal on Comput- ing, 16(1):84-94, 2004.","title":"Sourour Elloumi, Martine Labbé, and Yves Pochet. A new formulation and resolution method for the p-center problem","authors":"Elloumi","year":"2004","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ferone et al., 2017] Daniele Ferone, Paola Festa, Antonio Napoletano, and Mauricio GC Resende. A new local search for the p-center problem based on the critical ver- tex concept. In International Conference on Learning and Intelligent Optimization, pages 79-92. Springer, 2017.","title":"A new local search for the p-center problem based on the critical vertex concept","authors":"Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio Gc Resende","year":"2017","venue":"International Conference on Learning and Intelligent Optimization","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Floyd, 1962] Robert W Floyd. Algorithm 97: shortest path. Communications of the ACM, 5(6):345, 1962.","title":"Algorithm 97: shortest path","authors":"Floyd Robert","year":"1962","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gao et al., 2015] Chao Gao, Xin Yao, Thomas Weise, and Jinlong Li. An efficient local search heuristic with row weighting for the unicost set covering problem. European Journal of Operational Research, 246(3):750-761, 2015.","title":"An efficient local search heuristic with row weighting for the unicost set covering problem","authors":"Chao Gao, Xin Yao, Thomas Weise, Jinlong Li","year":"2015","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hakimi, 1964] S Louis Hakimi. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3):450-459, 1964.","title":"Optimum locations of switching centers and the absolute centers and medians of a graph","authors":"Hakimi Louis","year":"1964","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ilhan et al., 2002] T Ilhan, F Ozsoy, and M Pinar. An effi- cient exact algorithm for the vertex p-center problem and computational experiments for different set covering sub- problems. Technical report, Bilkent University, Depart- ment of Industrial Engineering, 2002.","title":"An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems","authors":"Ilhan","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kariv and Hakimi, 1979] Oded Kariv and S Louis Hakimi. An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied Mathematics, 37(3):513-538, 1979.","title":"An algorithmic approach to network location problems. I: The p-centers","authors":"Hakimi ; ] Oded Kariv, S Kariv, Hakimi Louis","year":"1979","venue":"SIAM Journal on Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Luo et al., 2012] Chuan Luo, Kaile Su, and Shaowei Cai. Improving local search for random 3-SAT using quantita- tive configuration checking. In Proceedings of the 20th Eu- ropean Conference on Artificial Intelligence, pages 570- 575. IOS Press, 2012.","title":"Improving local search for random 3-SAT using quantitative configuration checking","authors":"Chuan Luo, Kaile Su, Shaowei Cai","year":"2012","venue":"Proceedings of the 20th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Minieka, 1970] Edward Minieka. The m-center problem. SIAM Review, 12(1):138-139, 1970.","title":"Edward Minieka. The m-center problem","authors":"Minieka","year":"1970","venue":"SIAM Review","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mladenović et al., 2003] Nenad Mladenović, Martine Labbé, and Pierre Hansen. Solving the p-center problem with tabu search and variable neighborhood search. Networks: An International Journal, 42(1):48-64, 2003.","title":"Solving the p-center problem with tabu search and variable neighborhood search","authors":"Nenad Mladenović, Martine Labbé, Pierre Hansen","year":"2003","venue":"Networks: An International Journal","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Pullan, 2008] Wayne Pullan. A memetic genetic algorithm for the vertex p-center problem. Evolutionary Computa- tion, 16(3):417-436, 2008.","title":"A memetic genetic algorithm for the vertex p-center problem","authors":"Wayne Pullan","year":"2008","venue":"Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Reinelt, 1991] Gerhard Reinelt. TSPLIB-a traveling sales- man problem library. ORSA Journal on Computing, 3(4):376-384, 1991.","title":"TSPLIB-a traveling salesman problem library","authors":"Gerhard Reinelt","year":"1991","venue":"ORSA Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Tansel et al., 1983] B. C. Tansel, R. L. Francis, and T. J. Lowe. Location on networks: A survey. Management Sci- ence, 29:482-511, 1983.","title":"Location on networks: A survey","authors":"B C Tansel, R L Francis, T J Lowe","year":"1983","venue":"Management Science","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Toregas et al., 1971] Constantine Toregas, Ralph Swain, Charles ReVelle, and Lawrence Bergman. The location of emergency service facilities. Operations Research, 19(6):1363-1373, 1971.","title":"The location of emergency service facilities","authors":"Constantine Toregas, Ralph Swain, Charles Revelle, Lawrence Bergman","year":"1971","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Tran et al., 2016] Trung Hieu Tran, Jesse R O' Hanley, and M Paola Scaparra. Reliable hub network design: Formu- lation and solution techniques. Transportation Science, 51(1):358-375, 2016.","title":"Reliable hub network design: Formulation and solution techniques","authors":"Trung Hieu Tran, Jesse, R O' Hanley, Paola Scaparra","year":"2016","venue":"Transportation Science","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Voudouris and Tsang, 2003] Christos Voudouris and Ed- ward P. K.\" Tsang. Guided Local Search, pages 185-218.","title":"Guided Local Search","authors":"Christos Voudouris, P K Edward, Tsang","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Yin et al., 2017] Ai-Hua Yin, Tao-Qing Zhou, Jun-Wen Ding, Qing-Jie Zhao, and Zhi-Peng Lv. Greedy random- ized adaptive search procedure with path-relinking for the vertex p-center problem. Journal of Computer Science and Technology, 32(6):1319-1334, 2017.","title":"Greedy randomized adaptive search procedure with path-relinking for the vertex p-center problem","authors":"Ai-Hua Yin, Tao-Qing Zhou, Jun-Wen Ding, Qing-Jie Zhao, Zhi-Peng Lv","year":"2017","venue":"Journal of Computer Science and Technology","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}