{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:20:49Z","timestamp":1774952449387,"version":"3.50.1"},"reference-count":70,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":324,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Gaspard-Monge, PGMO","award":["BENMIP"],"award-info":[{"award-number":["BENMIP"]}]},{"name":"Gaspard-Monge, PGMO","award":["BENMIP"],"award-info":[{"award-number":["BENMIP"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13676-019-00141-w","type":"journal-article","created":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:04:29Z","timestamp":1556791469000},"page":"597-631","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"title":["The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach"],"prefix":"10.1016","volume":"8","author":[{"given":"Kassem","family":"Danach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Gelareh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5192-5247","authenticated-orcid":false,"given":"Rahimeh","family":"Neamatian Monemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"23","key":"10.1007\/s13676-019-00141-w_bib1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","article-title":"A hybrid heuristic for the un-capacitated hub location problem","volume":"106","author":"Abdinnour-Helm","year":"1998","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM SIGMOD record, ACM, Vol\u00a022, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"issue":"7","key":"10.1007\/s13676-019-00141-w_bib3","first-page":"1799","article-title":"Using market basket analysis in management research","volume":"39","author":"Aguinis","year":"2012","journal-title":"J Manag"},{"issue":"13","key":"10.1007\/s13676-019-00141-w_bib4","doi-asserted-by":"crossref","first-page":"5463","DOI":"10.1016\/j.eswa.2015.02.059","article-title":"Solving high school timetabling problems worldwide using selection hyper-heuristics","volume":"42","author":"Ahmed","year":"2015","journal-title":"Exp Syst Appl"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","article-title":"Network hub location problems: the state of the art","volume":"190","author":"Alumur","year":"2008","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13676-019-00141-w_bib6","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1007\/s11227-014-1373-9","article-title":"A hyper-heuristic approach for resource provisioning-based scheduling in grid environment","volume":"71","author":"Aron","year":"2015","journal-title":"J Supercomput"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","article-title":"The volume algorithm revisited: relation with bundle methods","volume":"94","author":"Bahiense","year":"2002","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13676-019-00141-w_bib8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","article-title":"The volume algorithm: producing primal solutions with a subgradient method","volume":"87","author":"Barahona","year":"2000","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13676-019-00141-w_bib9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10732-008-9091-1","article-title":"Algorithms for the non-bifurcated network design problem","volume":"15","author":"Bartolini","year":"2009","journal-title":"J Heuristics"},{"key":"10.1007\/s13676-019-00141-w_bib10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.asoc.2015.06.063","article-title":"Robust hyper-heuristic algorithms for the offline oriented\/non-oriented 2d bin packing problems","volume":"36","author":"Beyaz","year":"2015","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13676-019-00141-w_bib11","doi-asserted-by":"crossref","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Handbook of meta-heuristics, Springer, pp 457\u2013474","DOI":"10.1007\/0-306-48056-5_16"},{"key":"10.1007\/s13676-019-00141-w_bib12","unstructured":"Burke E, Soubeiga E (2003) Scheduling nurses using a tabu-search hyper-heuristic. In: Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications (MISTA 2003), Nottingham, pp 180\u2013197"},{"key":"10.1007\/s13676-019-00141-w_bib13","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Qu R (2009) A survey of hyper-heuristics. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham, Nottingham"},{"key":"10.1007\/s13676-019-00141-w_bib14","series-title":"Handbook of Metaheuristics","first-page":"449","article-title":"A Classification of Hyper-heuristic Approaches","author":"Burke","year":"2010"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib15","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2005.09.024","article-title":"The p-hub center allocation problem","volume":"176","author":"Campbell","year":"2007","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib16","unstructured":"Cetiner S, Sepil C, Sural H (2006) Hubbing and routing in postal delivery systems. Tech. rep., Industrial Engineering Department, Middle East Technical University, Ankara"},{"key":"10.1007\/s13676-019-00141-w_bib17","series-title":"Single-allocation hub location problems with capacity choices","author":"Correia","year":"2009"},{"key":"10.1007\/s13676-019-00141-w_bib18","doi-asserted-by":"crossref","unstructured":"Cowling P, Chakhlevitch K (2003) Hyper-heuristics for managing a large collection of low level heuristics to schedule personnel. In: Evolutionary computation, 2003, CEC'03. The 2003 Congress on, IEEE, Vol\u00a02, pp 1214\u20131221","DOI":"10.1109\/CEC.2003.1299807"},{"key":"10.1007\/s13676-019-00141-w_bib19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","article-title":"A Hyperheuristic Approach to Scheduling a Sales Summit","author":"Cowling","year":"2001"},{"key":"10.1007\/s13676-019-00141-w_bib20","series-title":"Parallel Problem Solving from Nature \u2014 PPSN VII","first-page":"851","article-title":"Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling","author":"Cowling","year":"2002"},{"key":"10.1007\/s13676-019-00141-w_bib21","series-title":"Evolutionary Scheduling","first-page":"543","article-title":"Using a Large Set of Low Level Heuristics in a Hyperheuristic Approach to Personnel Scheduling","author":"Cowling","year":"2007"},{"key":"10.1007\/s13676-019-00141-w_bib22","doi-asserted-by":"crossref","unstructured":"Danach K, Hassan JA-H, Khalil W, Gelareh S (2015a) Routing heterogeneous mobile hospital with different patients priorities: hyper-heuristic approach. In: Digital information and communication technology and its applications (DICTAP), 2015 5th international conference on, IEEE, pp 155\u2013158","DOI":"10.1109\/DICTAP.2015.7113189"},{"key":"10.1007\/s13676-019-00141-w_bib23","doi-asserted-by":"crossref","unstructured":"Danach K, Khalil W, Gelareh S (2015b) Multiple strings planing problem in maritime service network: Hyper-heuristic approach. In: Technological advances in electrical, electronics and computer engineering (TAEECE), 2015 3rd international conference on, IEEE, pp 85\u201388","DOI":"10.1109\/TAEECE.2015.7113605"},{"issue":"12","key":"10.1007\/s13676-019-00141-w_bib24","doi-asserted-by":"crossref","first-page":"7465","DOI":"10.1016\/j.apm.2013.02.035","article-title":"A new formulation and an exact approach for the many-to-many hub location-routing problem","volume":"37","author":"de Camargo","year":"2013","journal-title":"Appl Math Modell"},{"key":"10.1007\/s13676-019-00141-w_bib25","doi-asserted-by":"crossref","unstructured":"Drake JH, Ozcan E, Burke EK (2015) A modified choice function hyper-heuristic controlling unary and binary operators. In: Proceedings of the IEEE congress on evolutionary computation (CEC 2015)","DOI":"10.1109\/CEC.2015.7257315"},{"key":"10.1007\/s13676-019-00141-w_bib26","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","article-title":"The capacitated multiple allocation hub location problem: formulations and algorithms","volume":"120","author":"Ebery","year":"2000","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","article-title":"Solution algorithms for the capacitated single allocation hub location problem","volume":"86","author":"Ernst","year":"1999","journal-title":"Ann Oper Res"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib28","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","article-title":"Solving the orienteering problem through branch-and-cut","volume":"10","author":"Fischetti","year":"1998","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Manag Sci"},{"issue":"12\u2013supplement","key":"10.1007\/s13676-019-00141-w_bib30","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","article-title":"The lagrangian relaxation method for solving integer programming problems","volume":"50","author":"Fisher","year":"2004","journal-title":"Manag Sci"},{"key":"10.1007\/s13676-019-00141-w_bib31","doi-asserted-by":"crossref","unstructured":"Frangioni A (1995) Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Technical report","DOI":"10.1016\/0305-0548(96)00006-8"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib32","first-page":"29","article-title":"A flexible and adaptive hyper-heuristic approach for (dynamic) capacitated vehicle routing problems","volume":"119","author":"Garrido","year":"2012","journal-title":"Fund Inf"},{"issue":"6","key":"10.1007\/s13676-019-00141-w_bib33","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","article-title":"Dvrp: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic","volume":"16","author":"Garrido","year":"2010","journal-title":"J Heuristics"},{"key":"10.1007\/s13676-019-00141-w_bib34","unstructured":"Ge D, Ye Y, Zhang J (2007) The fixed-hub single allocation problem: a geometric rounding approach. http:\/\/www.stanford.edu\/~yyye\/revisedHub.pdf"},{"issue":"5","key":"10.1007\/s13676-019-00141-w_bib35","doi-asserted-by":"crossref","first-page":"3307","DOI":"10.1016\/j.apm.2012.07.017","article-title":"Hub-and-spoke network design and fleet deployment for string planning of liner shipping","volume":"37","author":"Gelareh","year":"2013","journal-title":"Appl Math Modell"},{"key":"10.1007\/s13676-019-00141-w_bib36","unstructured":"Gelareh S, Monemic RN, Semet F, (2015) Capacitated bounded cardinality hub routing problem: model and solution algorithm. Technical report arXiv:1705.07985"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib37","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","article-title":"Lagrangean relaxation applied to capacitated facility location problems","volume":"10","author":"Geoffrion","year":"1978","journal-title":"AIIE Trans"},{"key":"10.1007\/s13676-019-00141-w_bib38","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math Program Stud"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib39","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","article-title":"Lagrangian relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"TOP"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib40","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: part II","volume":"1","author":"Held","year":"1971","journal-title":"Math Program"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib41","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"A general variable neighborhood search for solving the un-capacitated single allocation p-hub median problem","volume":"206","author":"Ili\u0107","year":"2010","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib42","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","article-title":"Variable neighborhood search for location routing","volume":"40","author":"Jarboui","year":"2013","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib43","doi-asserted-by":"crossref","unstructured":"Kendall G, Mohamad M, (2004) Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Networks, 2004 (ICON 2004). Proceedings of 12th IEEE international conference on, IEEE, Vol\u00a02, pp 769\u2013773","DOI":"10.1109\/ICON.2004.1409283"},{"issue":"5\u20136","key":"10.1007\/s13676-019-00141-w_bib44","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","article-title":"Optimization by simulated annealing: quantitative studies","volume":"34","author":"Kirkpatrick","year":"1984","journal-title":"J Stat Phys"},{"key":"10.1007\/s13676-019-00141-w_bib45","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02060483","article-title":"Avoiding local optima in the p-hub location problem using tabu search and grasp","volume":"40","author":"Klincewicz","year":"1992","journal-title":"Ann Oper Res"},{"issue":"4","key":"10.1007\/s13676-019-00141-w_bib46","first-page":"415","article-title":"Genetic algorithm for solving un-capacitated multiple allocation hub location problem","volume":"24","author":"Kratica","year":"2012","journal-title":"Comput Inf"},{"key":"10.1007\/s13676-019-00141-w_bib47","series-title":"An extension of Davidon methods to non differentiable problems. Nondifferentiable optimization","first-page":"95","author":"Lemarechal","year":"1975"},{"key":"10.1007\/s13676-019-00141-w_bib48","series-title":"Integer Programming and Combinatorial Optimization","first-page":"93","article-title":"Polynomial-Time Separation of Simple Comb Inequalities","author":"Letchford","year":"2002"},{"key":"10.1007\/s13676-019-00141-w_bib49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/978-3-319-13563-2_56","article-title":"Developing a Hyper-Heuristic Using Grammatical Evolution and the Capacitated Vehicle Routing Problem","author":"Marshall","year":"2014"},{"key":"10.1007\/s13676-019-00141-w_bib50","series-title":"Evolutionary Computation in Combinatorial Optimization","first-page":"99","article-title":"Hyper-heuristic Operator Selection and Acceptance Criteria","author":"Marshall","year":"2015"},{"issue":"9","key":"10.1007\/s13676-019-00141-w_bib51","doi-asserted-by":"crossref","first-page":"4493","DOI":"10.1016\/j.eswa.2015.01.046","article-title":"Solution methods for scheduling of heterogeneous parallel machines applied to the workover rig problem","volume":"42","author":"Monemi","year":"2015","journal-title":"Exp Syst Appl"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib52","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02564791","article-title":"The many-to-many location-routing problem.","volume":"6","author":"Nagy","year":"1998","journal-title":"Top"},{"key":"10.1007\/s13676-019-00141-w_bib53","series-title":"Computer and Information Sciences II","first-page":"557","article-title":"A Hyper-Heuristic Based on Random Gradient, Greedy and Dominance","author":"\u00d6zcan","year":"2011"},{"key":"10.1007\/s13676-019-00141-w_bib54","doi-asserted-by":"crossref","unstructured":"\u00d6zcan E, M\u0131s\u0131r M, Ochoa G, Burke EK (2012) A reinforcement learning: great-deluge hyper-heuristic. Modeling, analysis, and applications in meta-heuristic computing: advancements and trends, p 34","DOI":"10.4018\/978-1-4666-0270-0.ch003"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib55","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"Padberg","year":"1982","journal-title":"Math Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib56","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2013.08.026","article-title":"Grasp for the un-capacitated r-allocation p-hub median problem","volume":"43","author":"Peir\u00f3","year":"2014","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-019-00141-w_bib57","first-page":"405","article-title":"Solving un-capacitated multiple allocation p-hub center problem by dijkstra's algorithm-based genetic algorithm and simulated annealing","volume":"6","author":"Rabbani","year":"2015","journal-title":"Int J Ind Eng Comput"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib58","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-007-9069-1","article-title":"Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation","volume":"39","author":"Randall","year":"2008","journal-title":"Comput Optim Appl"},{"key":"10.1007\/s13676-019-00141-w_bib59","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2014.04.014","article-title":"A branch-and-cut algorithm for the hub location and routing problem","volume":"50","author":"Rodr\u00edguez-Mart\u00edn","year":"2014","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib60","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","article-title":"An efficient tabu search procedure for the p-median problem","volume":"96","author":"Rolland","year":"1997","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00141-w_bib61","unstructured":"Ross P, Schulenburg S, Mar\u00edn-Bl\u00e1zquez JG, Hart E (2002) Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: GECCO, pp 942\u2013948"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib62","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1162\/EVCO_a_00121","article-title":"A lifelong learning hyper-heuristic method for bin packing","volume":"23","author":"Sim","year":"2015","journal-title":"Evolut Comput"},{"key":"10.1007\/s13676-019-00141-w_bib63","first-page":"669","article-title":"An efficient genetic algorithm for the un-capacitated multiple allocation p-hub median problem","volume":"37","author":"Stanimirovic","year":"2008","journal-title":"Control Cybern"},{"key":"10.1007\/s13676-019-00141-w_bib64","series-title":"Reinforcement learning: an introduction","author":"Sutton","year":"1998"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib65","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","article-title":"A multiple ant colony optimization algorithm for the capacitated location routing problem","volume":"141","author":"Ting","year":"2013","journal-title":"Int J Product Econ"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib66","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","article-title":"A two-phase tabu search approach to the location routing problem","volume":"116","author":"Tuzun","year":"1999","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13676-019-00141-w_bib67","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ijpe.2003.12.002","article-title":"An integrated multi-depot hub-location vehicle routing model for network planning of parcel service","volume":"90","author":"Wasner","year":"2004","journal-title":"Int J Product Econ"},{"issue":"2","key":"10.1007\/s13676-019-00141-w_bib68","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","article-title":"A simulated annealing heuristic for the capacitated location routing problem","volume":"58","author":"Yu","year":"2010","journal-title":"Comput Ind Eng"},{"issue":"3","key":"10.1007\/s13676-019-00141-w_bib69","first-page":"1203","article-title":"An empirical comparison of simulated annealing and iterated local search for the hierarchical single allocation hub median location problem","volume":"22","author":"Zarandi","year":"2015","journal-title":"Sci Iran Trans E Ind Eng"},{"issue":"1","key":"10.1007\/s13676-019-00141-w_bib70","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/TITS.2014.2331239","article-title":"Emergency railway transportation planning using a hyper-heuristic approach","volume":"16","author":"Zheng","year":"2015","journal-title":"Intell Transp Syst IEEE Trans"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-019-00141-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-019-00141-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-019-00141-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:29Z","timestamp":1761882209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":70,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["S2192437620300388"],"URL":"https:\/\/doi.org\/10.1007\/s13676-019-00141-w","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-019-00141-w","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2019 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}