{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:25:21Z","timestamp":1776687921373,"version":"3.51.2"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T00:00:00Z","timestamp":1531785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00291-018-0526-2","type":"journal-article","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T11:17:26Z","timestamp":1531826246000},"page":"99-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Heuristic algorithms for the single allocation p-hub center problem with routing considerations"],"prefix":"10.1007","volume":"41","author":[{"given":"Z\u00fchal","family":"Kartal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,17]]},"reference":[{"issue":"5","key":"526_CR1","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"TJ Ai","year":"2009","unstructured":"Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36(5):1693\u20131702","journal-title":"Comput Oper Res"},{"issue":"1","key":"526_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"10","key":"526_CR3","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1057\/jors.2008.92","volume":"60","author":"S Alumur","year":"2009","unstructured":"Alumur S, Kara BY (2009) A hub covering network design problem for cargo applications in Turkey. J Oper Res Soc 60(10):1349\u20131359","journal-title":"J Oper Res Soc"},{"issue":"10","key":"526_CR4","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.trb.2009.04.004","volume":"43","author":"SA Alumur","year":"2009","unstructured":"Alumur SA, Kara BY, Karasan OE (2009) The design of single allocation incomplete hub networks. Transp Res Part B Methodol 43(10):936\u2013951","journal-title":"Transp Res Part B Methodol"},{"issue":"6","key":"526_CR5","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.omega.2012.02.005","volume":"40","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Kara BY, Karasan OE (2012a) Multimodal hub location and hub network design. Omega 40(6):927\u2013939","journal-title":"Omega"},{"issue":"6","key":"526_CR6","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.tre.2012.04.001","volume":"48","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Yaman H, Kara BY (2012b) Hierarchical multimodal hub location problem with time-definite deliveries. Transp Res Part E Logist Transp Rev 48(6):1107\u20131120","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"526_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0377-2217(93)E0173-U","volume":"83","author":"T Aykin","year":"1995","unstructured":"Aykin T (1995) The hub location and routing problem. Eur J Oper Res 83(1):200\u2013219","journal-title":"Eur J Oper Res"},{"issue":"5","key":"526_CR8","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.apm.2012.07.018","volume":"37","author":"M Bashiri","year":"2013","unstructured":"Bashiri M, Mirzaei M, Randall M (2013) Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution. Appl Math Model 37(5):3513\u20133525","journal-title":"Appl Math Model"},{"key":"526_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2015","unstructured":"Brimberg J, Mladenovic N, Todosijevic R, Dragan U (2015) A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -hub center problem. Optim Lett 11:313\u2013327","journal-title":"Optim Lett"},{"issue":"2","key":"526_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s002910050106","volume":"22","author":"A Bruns","year":"2000","unstructured":"Bruns A, Klose A, Stahly P (2000) Restructuring of swiss parcel delivery services. OR-Spektrum 22(2):285\u2013302","journal-title":"OR-Spektrum"},{"key":"526_CR11","first-page":"25","volume":"7","author":"B Bullnheimer","year":"1997","unstructured":"Bullnheimer B, Hartl RF, Strau\u00df C (1997) A new rank based version of the ant system\u2014a computational study. Cent Eur J Oper Res Econ 7:25\u201338","journal-title":"Cent Eur J Oper Res Econ"},{"issue":"1213","key":"526_CR12","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1016\/j.apm.2013.02.035","volume":"37","author":"RSD Camargo","year":"2013","unstructured":"Camargo RSD, Miranda GD, Lokketangen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37(1213):7465\u20137480","journal-title":"Appl Math Model"},{"issue":"2","key":"526_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387\u2013405","journal-title":"Eur J Oper Res"},{"issue":"2","key":"526_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell JF, O\u2019Kelly ME (2012) Twenty-five years of hub location research. Transp Sci 46(2):153\u2013169","journal-title":"Transp Sci"},{"key":"526_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-56082-8_12","volume-title":"Facility location: applications and theory","author":"JF Campbell","year":"2002","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location: applications and theory. Springer, Berlin, pp 373\u2013408"},{"key":"526_CR16","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0167-8191(03)00042-5","volume":"29","author":"JF Campbell","year":"2003","unstructured":"Campbell JF, Stiehr G, Ernst AT, Krishnamoorthy M (2003) Solving hub arc location problems on a cluster of workstations. Parallel Comput 29:555\u2013574","journal-title":"Parallel Comput"},{"key":"526_CR17","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1287\/mnsc.1050.0406","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: part I\u2014introduction and results. Manag Sci 51:1540\u20131555","journal-title":"Manag Sci"},{"key":"526_CR18","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1287\/mnsc.1050.0407","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: part II\u2014formulations and optimal algorithms. Manag Sci 51:1556\u20131571","journal-title":"Manag Sci"},{"issue":"1","key":"526_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10479-010-0705-2","volume":"181","author":"S Cetiner","year":"2010","unstructured":"Cetiner S, Sepil C, Sural H (2010) Hubbing and routing in postal delivery systems. Ann Oper Res 181(1):109\u2013124","journal-title":"Ann Oper Res"},{"issue":"Part C","key":"526_CR20","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ijpe.2015.03.021","volume":"170","author":"CY Cheng","year":"2015","unstructured":"Cheng CY, Chen YY, Chen TL, Yoo JJW (2015) Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem. Int J Prod Econ 170(Part C):805\u2013814","journal-title":"Int J Prod Econ"},{"issue":"2","key":"526_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997a) Ant colonies for the travelling salesman problem. Biosystems 43(2):73\u201381","journal-title":"Biosystems"},{"issue":"1","key":"526_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997b) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53\u201366","journal-title":"IEEE Trans Evolut Comput"},{"key":"526_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4419-1665-5_8","volume-title":"Handbook of metaheuristics","author":"M Dorigo","year":"2010","unstructured":"Dorigo M, Stutzle T (2010) Ant colony optimization: overview and recent advances. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, US, Berlin, pp 227\u2013263"},{"issue":"1","key":"526_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"3","key":"526_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139\u2013154","journal-title":"Locat Sci"},{"issue":"7","key":"526_CR26","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1016\/j.cor.2008.08.021","volume":"36","author":"AT Ernst","year":"2009","unstructured":"Ernst AT, Hamacher H, Jiang H, Krishnamoorthy M, Woeginger G (2009) Uncapacitated single and multiple allocation \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -hub center problems. Comput Oper Res 36(7):2230\u20132241","journal-title":"Comput Oper Res"},{"key":"526_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tre.2014.12.016","volume":"75","author":"S Gelareh","year":"2015","unstructured":"Gelareh S, Monemi RN, Nickel S (2015) Multi-period hub location problems in transportation. Transp Res Part E Logist Transp Rev 75:67\u201394","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"526_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","volume":"65","author":"FP Goksal","year":"2013","unstructured":"Goksal FP, Karaoglan I, Altiparmak F (2013) A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput Ind Eng 65(1):39\u201353","journal-title":"Comput Ind Eng"},{"issue":"3","key":"526_CR29","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/S0377-2217(99)00274-X","volume":"125","author":"BY Kara","year":"2000","unstructured":"Kara BY, Tansel B (2000) On the single-assignment p-hub center problem. Eur J Oper Res 125(3):648\u2013655","journal-title":"Eur J Oper Res"},{"issue":"10","key":"526_CR30","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1287\/mnsc.47.10.1408.10258","volume":"47","author":"BY Kara","year":"2001","unstructured":"Kara BY, Tansel B (2001) The latest arrival hub location problem. Manag Sci 47(10):1408\u20131420","journal-title":"Manag Sci"},{"issue":"3","key":"526_CR31","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.apm.2013.07.033","volume":"38","author":"H Karimi","year":"2014","unstructured":"Karimi H, Setak M (2014) Proprietor and customer costs in the incomplete hub location-routing network topology. Appl Math Model 38(3):1011\u20131023","journal-title":"Appl Math Model"},{"key":"526_CR32","first-page":"1724","volume-title":"21st International Congress on Modelling and Simulation","author":"Z Kartal","year":"2015","unstructured":"Kartal Z, Ernst AT (2015) Integer programming formulations for the uncapacitated vehicle routing p-hub center problem. In: Weber T, McPhee M, Anderssen R (eds) 21st International Congress on Modelling and Simulation. Modelling and Simulation Society of Australia and New Zealand, Gold Coast, pp 1724\u20131730"},{"key":"526_CR33","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tre.2017.10.004","volume":"108","author":"Z Kartal","year":"2017","unstructured":"Kartal Z, Hasgul S, Ernst AT (2017) Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery. Transp Res Part E Logist Transp Rev 108:141\u2013159","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"526_CR34","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"04","key":"526_CR35","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1142\/S0217595906001042","volume":"23","author":"J Kratica","year":"2006","unstructured":"Kratica J, Stanimirovic Z (2006) Solving the uncapacitated multiple allocation \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -hub center problem by genetic algorithm. Asia Pac J Oper Res 23(04):425\u2013437","journal-title":"Asia Pac J Oper Res"},{"key":"526_CR36","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/B978-0-12-405163-8.00007-7","volume-title":"Swarm intelligence and bio-inspired computation","author":"J Krause","year":"2013","unstructured":"Krause J, Cordeiro J, Parpinelli RS, Lopes HS (2013) A survey of swarm algorithms applied to discrete optimization problems. In: Yang XS, Cui Z, Xiao R, Gandomi AH, Karamanoglu M (eds) Swarm intelligence and bio-inspired computation. Elsevier, Oxford, pp 169\u2013191"},{"issue":"22","key":"526_CR37","doi-asserted-by":"publisher","first-page":"8881","DOI":"10.1016\/j.eswa.2015.07.043","volume":"42","author":"Z Li","year":"2015","unstructured":"Li Z, Wang W, Yan Y, Li Z (2015) PSABC: a hybrid algorithm based on particle swarm and artificial bee colony for high-dimensional optimization problems. Expert Syst Appl 42(22):8881\u20138895","journal-title":"Expert Syst Appl"},{"issue":"1","key":"526_CR38","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1002\/net.21685","volume":"68","author":"MC Lopes","year":"2016","unstructured":"Lopes MC, de Andrade CE, de Queiroz TA, Resende MGC, Miyazawa FK (2016) Heuristics for a hub location-routing problem. Networks 68(1):54\u201390","journal-title":"Networks"},{"key":"526_CR39","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of metaheuristics","author":"H Lourenco","year":"2003","unstructured":"Lourenco H, Martin O, Stutzle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Springer, US, Berlin, pp 320\u2013353"},{"key":"526_CR40","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of metaheuristics","author":"H Lourenco","year":"2010","unstructured":"Lourenco H, Martin O, Stutzle T (2010) Iterated local search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, US, Berlin, pp 363\u2013397"},{"issue":"Part B","key":"526_CR41","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.chemolab.2015.08.020","volume":"149","author":"F Marini","year":"2015","unstructured":"Marini F, Walczak B (2015) Particle swarm optimization (PSO). A tutorial. Chemom Intell Lab Syst 149(Part B):153\u2013165","journal-title":"Chemom Intell Lab Syst"},{"issue":"2","key":"526_CR42","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02564791","volume":"6","author":"G Nagy","year":"1998","unstructured":"Nagy G, Salhi S (1998) The many-to-many location-routing problem. Top 6(2):261\u2013275","journal-title":"Top"},{"key":"526_CR43","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.measurement.2014.10.024","volume":"62","author":"N Norouzi","year":"2015","unstructured":"Norouzi N, Sadegh-Amalnick M, Alinaghiyan M (2015) Evaluating of the particle swarm optimization in a periodic vehicle routing problem. Measurement 62:162\u2013169","journal-title":"Measurement"},{"issue":"4","key":"526_CR44","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421\u2013451","journal-title":"Ann Oper Res"},{"issue":"5","key":"526_CR45","first-page":"399","volume":"33","author":"F Pamuk","year":"2001","unstructured":"Pamuk F, Sepil C (2001) A solution to the hub center problem via a single-relocation algorithm with tabu search. IIE Trans 33(5):399\u2013411","journal-title":"IIE Trans"},{"issue":"9","key":"526_CR46","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807\u20132839","journal-title":"Comput Oper Res"},{"issue":"2","key":"526_CR47","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10589-007-9069-1","volume":"39","author":"M Randall","year":"2008","unstructured":"Randall M (2008) Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation. Comput Optim Appl 39(2):239\u2013261","journal-title":"Comput Optim Appl"},{"issue":"4","key":"526_CR48","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann M, Doerner K, Hartl RF (2004) D-ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31(4):563\u2013591","journal-title":"Comput Oper Res"},{"issue":"3","key":"526_CR49","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/j.ejor.2013.12.021","volume":"236","author":"J Rieck","year":"2014","unstructured":"Rieck J, Ehrenberg C, Zimmermann J (2014) Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery. Eur J Oper Res 236(3):863\u2013878","journal-title":"Eur J Oper Res"},{"key":"526_CR50","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.cor.2014.04.014","volume":"50","author":"I Rodriguez-Martin","year":"2014","unstructured":"Rodriguez-Martin I, Salazar-Gonzalez JJ, Yaman H (2014) A branch-and-cut algorithm for the hub location and routing problem. Comput Oper Res 50:161\u2013174","journal-title":"Comput Oper Res"},{"key":"526_CR51","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2014.01.009","volume":"47","author":"M Sasaki","year":"2014","unstructured":"Sasaki M, Campbell JF, Krishnamoorthy M, Ernst AT (2014) A stackelberg hub arc location model for a competitive environment. Comput Oper Res 47:27\u201341","journal-title":"Comput Oper Res"},{"key":"526_CR52","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.trb.2016.01.011","volume":"86","author":"EZ Serper","year":"2016","unstructured":"Serper EZ, Alumur SA (2016) The design of capacitated intermodal hub networks with different vehicle types. Transp Res Part B Methodol 86:51\u201365","journal-title":"Transp Res Part B Methodol"},{"issue":"8","key":"526_CR53","first-page":"4365","volume":"218","author":"HL Shieh","year":"2011","unstructured":"Shieh HL, Kuo CC, Chiang CM (2011) Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification. Appl Math Comput 218(8):4365\u20134383","journal-title":"Appl Math Comput"},{"issue":"3","key":"526_CR54","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T Stutzle","year":"2006","unstructured":"Stutzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519\u20131539","journal-title":"Eur J Oper Res"},{"issue":"9","key":"526_CR55","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle T, Hoos HH (2000) Max\u2013min ant system. Future Gener Comput Syst 16(9):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"526_CR56","first-page":"1188","volume":"409\u2013410","author":"JU Sun","year":"2013","unstructured":"Sun JU (2013) An integrated hub location and multi-depot vehicle routing problem. Appl Mech Mater 409\u2013410:1188\u20131192","journal-title":"Appl Mech Mater"},{"issue":"Part B","key":"526_CR57","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.trb.2016.03.005","volume":"93","author":"Z Sun","year":"2016","unstructured":"Sun Z, Zheng J (2016) Finding potential hub locations for liner shipping. Transp Res Part B Methodol 93(Part B):750\u2013761","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"526_CR58","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1002\/net.20139","volume":"49","author":"PZ Tan","year":"2007","unstructured":"Tan PZ, Kara BY (2007) A hub covering model for cargo delivery systems. Networks 49(1):28\u201339","journal-title":"Networks"},{"issue":"3","key":"526_CR59","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"issue":"1","key":"526_CR60","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ijpe.2008.03.015","volume":"121","author":"SK Tchomte","year":"2009","unstructured":"Tchomte SK, Gourgand M (2009) Particle swarm optimization: a study of particle displacement for solving continuous and combinatorial optimization problems. Int J Prod Econ 121(1):57\u201367","journal-title":"Int J Prod Econ"},{"issue":"1","key":"526_CR61","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","volume":"141","author":"CJ Ting","year":"2013","unstructured":"Ting CJ, Chen CH (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Int J Prod Econ 141(1):34\u201344","journal-title":"Int J Prod Econ"},{"issue":"3","key":"526_CR62","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ijpe.2003.12.002","volume":"90","author":"M Wasner","year":"2004","unstructured":"Wasner M, Zapfel G (2004) An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. Int J Prod Econ 90(3):403\u2013419","journal-title":"Int J Prod Econ"},{"issue":"6","key":"526_CR63","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.trb.2009.01.005","volume":"43","author":"H Yaman","year":"2009","unstructured":"Yaman H (2009) The hierarchical hub median problem with single assignment. Transp Res Part B Methodol 43(6):643\u2013658","journal-title":"Transp Res Part B Methodol"},{"issue":"8","key":"526_CR64","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.trb.2007.03.003","volume":"41","author":"H Yaman","year":"2007","unstructured":"Yaman H, Kara BY, Tansel B (2007) The latest arrival hub location problem for cargo delivery systems with stopovers. Transp Res Part B 41(8):906\u2013919","journal-title":"Transp Res Part B"},{"issue":"1","key":"526_CR65","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.cie.2012.09.006","volume":"64","author":"K Yang","year":"2013","unstructured":"Yang K, Liu Y, Yang G (2013a) An improved hybrid particle swarm optimization algorithm for fuzzy \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -hub center problem. Comput Ind Eng 64(1):133\u2013142","journal-title":"Comput Ind Eng"},{"issue":"5","key":"526_CR66","doi-asserted-by":"publisher","first-page":"2624","DOI":"10.1016\/j.asoc.2012.11.024","volume":"13","author":"K Yang","year":"2013","unstructured":"Yang K, Liu YK, Yang GQ (2013b) Solving fuzzy \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -hub center problem by genetic algorithm incorporating local search. Appl Soft Comput 13(5):2624\u20132632","journal-title":"Appl Soft Comput"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0526-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0526-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0526-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T18:41:55Z","timestamp":1570732915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0526-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,17]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0526-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,17]]},"assertion":[{"value":"9 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}