{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:18:56Z","timestamp":1768558736204,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11390-017-1802-3","type":"journal-article","created":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T08:50:30Z","timestamp":1512550230000},"page":"1319-1334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Greedy Randomized Adaptive Search Procedure with Path-Relinking for the Vertex p-Center Problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Ai-Hua","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao-Qing","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Wen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing-Jie","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Peng","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,8]]},"reference":[{"issue":"3","key":"1802_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S L. An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied Mathematics, 1979, 37(3): 513-538.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"1802_CR2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S L. An algorithmic approach to network location problems. II: The p-medians. SIAM Journal on Applied Mathematics, 1979, 37(3): 539-560.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"1802_CR3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi S L. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 1964, 12(3): 450-459.","journal-title":"Operations Research"},{"issue":"1","key":"1802_CR4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","volume":"12","author":"E Minieka","year":"1970","unstructured":"Minieka E. The m-center problem. SIAM Review, 1970, 12(1): 138-139.","journal-title":"SIAM Review"},{"key":"1802_CR5","doi-asserted-by":"crossref","unstructured":"Daskin M S. Network and Discrete Location: Models Algorithms and Applications. John Wiley & Sons, 1995.","DOI":"10.1002\/9781118032343"},{"issue":"9","key":"1802_CR6","first-page":"428","volume":"45","author":"MS Daskin","year":"2000","unstructured":"Daskin M S. A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results. Communications of the Operations Research Society of Japan, 2000, 45(9): 428-436.","journal-title":"Communications of the Operations Research Society of Japan"},{"key":"1802_CR7","unstructured":"Ilhan T, Pinar M C. An efficient exact algorithm for the vertex p-center problem. http:\/\/www.optimizationonline.org\/DB HTML\/2001\/09\/376.html, June 2017."},{"issue":"1","key":"1802_CR8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S Elloumi","year":"2004","unstructured":"Elloumi S, Labb\u00e9 M, Pochet Y. A new formulation and resolution method for the p-center problem. INFORMS Journal on Computing, 2004, 16(1): 84-94.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1802_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10852-004-4072-3","volume":"4","author":"A Al-Khedhairi","year":"2005","unstructured":"Al-Khedhairi A, Salhi S. Enhancements to two exact algorithms for solving the vertex p-center problem. Journal of Mathematical Modelling and Algorithms, 2005, 4(2): 129-147.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"1802_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum D S, Shmoys D B. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 1985, 10(2): 180-184.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"1802_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/1520-6750(198804)35:2<185::AID-NAV3220350204>3.0.CO;2-R","volume":"35","author":"JS Martinich","year":"1988","unstructured":"Martinich J S. A vertex-closing approach to the p-center problem. Naval Research Logistics, 1988, 35(2): 185-201.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"1802_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk J. A heuristic for the p-center problems in graphs. Discrete Applied Mathematics, 1987, 17(3): 263-268.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1802_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107 N, Labb\u00e9 M, Hansen P. Solving the p-center problem with tabu search and variable neighborhood search. Networks, 2003, 42(1): 48-64.","journal-title":"Networks"},{"issue":"2","key":"1802_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0377-2217(02)00825-1","volume":"151","author":"R Hassin","year":"2003","unstructured":"Hassin R, Levin A, Morad D. Lexicographic local search and the p-center problem. European Journal of Operational Research, 2003, 151(2): 265-279.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1802_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0377-2217(02)00464-2","volume":"149","author":"C Caruso","year":"2003","unstructured":"Caruso C, Colorni A, Aloi L. Dominant, an algorithm for the p-center problem. European Journal of Operational Research, 2003, 149(1): 53-64.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"1802_CR16","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1016\/j.cor.2004.04.009","volume":"32","author":"JA Pacheco","year":"2005","unstructured":"Pacheco J A, Casado S. Solving two location models with few facilities by using a hybrid heuristic: A real health resources case. Computers & Operations Research, 2005, 32(12): 3075-3091.","journal-title":"Computers & Operations Research"},{"issue":"10","key":"1802_CR17","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","volume":"38","author":"T Davidovi\u0107","year":"2011","unstructured":"Davidovi\u0107 T, Ramljak D, \u0160elmi\u0107 M, Teodorovi\u0107 D. Bee colony optimization for the p-center problem. Computers & Operations Research, 2011, 38(10): 1367-1376.","journal-title":"Computers & Operations Research"},{"key":"1802_CR18","first-page":"824196","volume":"2014","author":"A Yurtkuran","year":"2014","unstructured":"Yurtkuran A, Emel E. A modified artificial bee colony algorithm for p-center problems. The Scientific World Journal, 2014, 2014: 824196.","journal-title":"The Scientific World Journal"},{"issue":"4","key":"1802_CR19","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.20000","volume":"43","author":"MP Scaparra","year":"2004","unstructured":"Scaparra M P, Pallottino S, Scutell\u00e0 M G. Large-scale local search heuristics for the capacitated vertex p-center problem. Networks, 2004, 43(4): 241-255.","journal-title":"Networks"},{"issue":"8","key":"1802_CR20","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1016\/j.cor.2005.08.013","volume":"34","author":"TCE Cheng","year":"2007","unstructured":"Cheng T C E, Kang L Y, Ng C T. An improved algorithm for the p-center problem on interval graphs with unit lengths. Computers & Operations Research, 2007, 34(8): 2215-2222.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1802_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","volume":"56","author":"SO Krumke","year":"1995","unstructured":"Krumke S O. On a generalization of the p-center problem. Information Processing Letters 1995, 56(2): 67-71.","journal-title":"Information Processing Letters"},{"issue":"2","key":"1802_CR22","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.ijpe.2005.08.010","volume":"103","author":"MA Arostegui Jr","year":"2006","unstructured":"Arostegui M A Jr, Kadipasaoglu S N, Khumawala B M. An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 2006, 103(2): 742-754.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"1802_CR23","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1162\/evco.2008.16.3.417","volume":"16","author":"W Pullan","year":"2008","unstructured":"Pullan W. A memetic genetic algorithm for the vertex p-center problem. Evolutionary Computation, 2008, 16(3): 417-436.","journal-title":"Evolutionary Computation"},{"issue":"1","key":"1802_CR24","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna M, Marti R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 1999, 11(1): 44-52.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1802_CR25","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"RM Aiex","year":"2005","unstructured":"Aiex R M, Resende M G C, Pardalos P M, Toraldo G. GRASP with path relinking for three-index assignment. INFORMS Journal on Computing, 2005, 17(2): 224-247.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"1802_CR26","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro C C, Uchoa E,Werneck R F. A hybrid GRASP with perturbations for the steiner problem in graphs. INFORMS Journal on Computing, 2002, 14(3): 228-246.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"1802_CR27","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"RM Aiex","year":"2003","unstructured":"Aiex R M, Binato S, Resende M G C. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 2003, 29(4): 393-430.","journal-title":"Parallel Computing"},{"key":"1802_CR28","doi-asserted-by":"crossref","unstructured":"Oliveira C A S, Pardalos P M, Resende M G C. GRASP with path-relinking for the quadratic assignment problem. In Proc. the 3rd Int Workshop on Experimental and Efficient Algorithms, May 2004, pp.356-368.","DOI":"10.1007\/978-3-540-24838-5_27"},{"issue":"6","key":"1802_CR29","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P Festa","year":"2002","unstructured":"Festa P, Pardalos P M, Resende M G C, Ribeiro C C. Randomized heuristics for the max-cut problem. Optimization Methods and Software, 2002, 17(6): 1033-1058.","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"1802_CR30","volume":"72","author":"WQ Huang","year":"2005","unstructured":"Huang W Q, Lv Z P, Shi H. Growth algorithm for finding low energy configurations of simple lattice proteins. Physical Review E, 2005, 72(1): 016704.","journal-title":"Physical Review E"},{"issue":"6","key":"1802_CR31","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1007\/BF02973434","volume":"19","author":"P Zou","year":"2004","unstructured":"Zou P, Zhou Z, Wan Y Y, Chen G L, Gu J. New metaheuristic for combinatorial optimization problems: Intersection based scaling. Journal of Computer Science and Technology, 2004, 19(6): 740-751.","journal-title":"Journal of Computer Science and Technology"},{"issue":"3","key":"1802_CR32","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10951-013-0351-z","volume":"17","author":"HY Xu","year":"2014","unstructured":"Xu H Y, Lv Z, Cheng T C E. Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. Journal of Scheduling, 2014, 17(3): 271-287.","journal-title":"Journal of Scheduling"},{"key":"1802_CR33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cor.2014.04.009","volume":"50","author":"HY Xu","year":"2014","unstructured":"Xu H Y, Lv Z P, Yin A H, Shen L J, Buscher U. A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Computers & Operations Research, 2014, 50: 47-60.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1802_CR34","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F. Tabu search-part I. ORSA Journal on Computing, 1989, 1(3): 190-206.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"1802_CR35","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02947312","volume":"17","author":"Q HuangW","year":"2002","unstructured":"HuangW Q, Zhang D F, Wang H X. An algorithm based on tabu search for satisfiability problem. Journal of Computer Science and Technology, 2002, 17(3): 340-346.","journal-title":"Journal of Computer Science and Technology"},{"issue":"5","key":"1802_CR36","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1016\/j.cor.2012.09.003","volume":"40","author":"XJ Lai","year":"2013","unstructured":"Lai X J, Lv Z P. Multistart iterated tabu search for bandwidth coloring problem. Computers & Operations Research, 2013, 40(5): 1401-1409.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1802_CR37","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/s11390-016-1639-1","volume":"31","author":"J Wu","year":"2016","unstructured":"Wu J, Rosin P L, Sun X F, Martin R R. Improving shape from shading with interactive tabu search. Journal of Computer Science and Technology, 2016, 31(3): 450-462.","journal-title":"Journal of Computer Science and Technology"},{"key":"1802_CR38","doi-asserted-by":"crossref","unstructured":"Glover F. Tabu search and adaptive memory programming\u2014Advances, applications and challenges. In Interfaces in Computer Science and Operations Research. Operations Research\/Computer Science Interfaces Series, Barr R S, Helgason R V, Kennington J L (eds.), Springer 1997, pp.1-75.","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"1802_CR39","doi-asserted-by":"crossref","unstructured":"Glover F. Multi-start and strategic oscillation methods\u2014 Principles to exploit adaptive memory. In Computing Tools for Modeling Optimization and Simulation Operations Research\/Computer Science Interfaces Series, Laguna M, Velarde J L G (eds.), Springer, 2000 pp.1-23.","DOI":"10.1007\/978-1-4615-4567-5_1"},{"issue":"3","key":"1802_CR40","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M, Mart\u00ed R. Fundamentals of scatter search and path relinking. Control and Cybernetics, 2000, 29(3): 653-684.","journal-title":"Control and Cybernetics"},{"key":"1802_CR41","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, Lv Z P, Cheng T C E. A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers & Operations Research, 2015, 53: 154-164.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1802_CR42","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G. TSPLIB\u2014A traveling salesman problem library. ORSA Journal on Computing, 1991, 3(4): 376-384.","journal-title":"ORSA Journal on Computing"},{"key":"1802_CR43","doi-asserted-by":"crossref","unstructured":"Floyd R W. Algorithm 97: Shortest path. Communications of the ACM, 1962, 5(6): Article No. 345.","DOI":"10.1145\/367766.368168"},{"key":"1802_CR44","doi-asserted-by":"crossref","unstructured":"Louren\u00b8co H R, Martin O C, St\u00fctzle T. Iterated local search. In Handbook of Metaheuristics, Glover F, Kochenberger G A (eds.), Springer, 2003, pp.320-353.","DOI":"10.1007\/0-306-48056-5_11"},{"key":"1802_CR45","unstructured":"Boese K D. Cost versus distance in the traveling salesman problem. Technical report TR-950018 UCLA CS Department, 1995."},{"key":"1802_CR46","unstructured":"St\u00fctzle T, Dorigo M. ACO algorithms for the quadratic assignment problem. In New Ideas in Optimization, Corne D, Dorigo M, Glover F et al. (eds.), McGraw-Hill Ltd., 1999, pp.33-50."},{"issue":"1","key":"1802_CR47","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation, 2000, 8(1): 61-91.","journal-title":"Evolutionary Computation"},{"key":"1802_CR48","doi-asserted-by":"crossref","unstructured":"Misevicius A. An improved hybrid genetic algorithm: New results for the quadratic assignment problem. Knowledge-Based Systems, 2004, 17(2\/3\/4): 65-73.","DOI":"10.1016\/j.knosys.2004.03.001"},{"issue":"5","key":"1802_CR49","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U Benlic","year":"2011","unstructured":"Benlic U, Hao J K. A multilevel memetic approach for improving graph k-partitions. IEEE Trans. Evolutionary Computation, 2011, 15(5): 624-642.","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"1","key":"1802_CR50","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.ejor.2006.06.010","volume":"181","author":"MJ Geiger","year":"2007","unstructured":"Geiger M J. On operators and search space topology in multi-objective flow shop scheduling. European Journal of Operational Research, 2007, 181(1): 195-206.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-017-1802-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1802-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1802-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T14:21:03Z","timestamp":1570458063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-017-1802-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1802"],"URL":"https:\/\/doi.org\/10.1007\/s11390-017-1802-3","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}