{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:22:18Z","timestamp":1779358938946,"version":"3.51.4"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00521-019-04666-z","type":"journal-article","created":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T12:46:02Z","timestamp":1576068362000},"page":"13267-13288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window"],"prefix":"10.1007","volume":"32","author":[{"given":"Mohadese","family":"Basirati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Akbari Jokar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7420-6621","authenticated-orcid":false,"given":"Erfan","family":"Hassannayebi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,11]]},"reference":[{"key":"4666_CR1","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00521-016-2520-4","volume":"29","author":"MR Amin-Naseri","year":"2018","unstructured":"Amin-Naseri MR, Yazdekhasti A, Salmasnia A (2018) Robust bi-objective optimization of uncapacitated single allocation p-hub median problem using a hybrid heuristic algorithm. Neural Comput Appl 29:511\u2013532","journal-title":"Neural Comput Appl"},{"key":"4666_CR2","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"key":"4666_CR3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","volume":"65","author":"R Ba\u00f1os","year":"2013","unstructured":"Ba\u00f1os R, Ortega J, Gil C, M\u00e1rquez AL, De Toro FJC, Engineering I (2013) A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Comput Ind Eng 65:286\u2013296","journal-title":"Comput Ind Eng"},{"key":"4666_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.apm.2017.09.032","volume":"54","author":"M Bashiri","year":"2018","unstructured":"Bashiri M, Rezanezhad M, Tavakkoli-Moghaddam R, Hasanzadeh HJAMM (2018) Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm. Appl Math Model 54:151\u2013169","journal-title":"Appl Math Model"},{"key":"4666_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9 J-F, Gendreau M, Potvin J-Y (2009) An exact \u03f5-constraint method for bi-objective combinatorial optimization problems: application to the Traveling Salesman Problem with Profits. Eur J Oper Res 194:39\u201350","journal-title":"Eur J Oper Res"},{"key":"4666_CR6","doi-asserted-by":"crossref","unstructured":"Bostel N, Dejax P, Zhang M (2015) A model and a metaheuristic method for the Hub location routing problem and application to postal services. In: 2015 international conference on industrial engineering and systems management (IESM), IEEE, pp 1383\u20131389","DOI":"10.1109\/IESM.2015.7380332"},{"key":"4666_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s40314-014-0179-y","volume":"35","author":"FH Boukani","year":"2016","unstructured":"Boukani FH, Moghaddam BF, Pishvaee MSJ (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35:45\u201360","journal-title":"Comput Appl Math"},{"key":"4666_CR8","doi-asserted-by":"crossref","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:387\u2013405","journal-title":"Eur J Oper Res"},{"key":"4666_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01442131","volume":"4","author":"Y Censor","year":"1977","unstructured":"Censor Y (1977) Pareto optimality in multiobjective problems. Appl Math Optim 4:41\u201359","journal-title":"Appl Math Optim"},{"key":"4666_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-010-0705-2","volume":"181","author":"S \u00c7etiner","year":"2010","unstructured":"\u00c7etiner S, Sepil C, S\u00fcral HJ (2010) Hubbing and routing in postal delivery systems. Ann Oper Res 181:109\u2013124","journal-title":"Ann Oper Res"},{"key":"4666_CR11","volume-title":"Multiobjective programming and planning","author":"JL Cohon","year":"2004","unstructured":"Cohon JL (2004) Multiobjective programming and planning. Courier Corporation, Chelmsford"},{"key":"4666_CR12","doi-asserted-by":"crossref","first-page":"7465","DOI":"10.1016\/j.apm.2013.02.035","volume":"37","author":"RS de Camargo","year":"2013","unstructured":"de Camargo RS, de Miranda G, L\u00f8kketangen AJAMM (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37:7465\u20137480","journal-title":"Appl Math Model"},{"key":"4666_CR13","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: International conference on parallel problem solving from nature. Springer, pp 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"key":"4666_CR14","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C Duhamel","year":"2010","unstructured":"Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP\u2009\u00d7\u2009ELS approach for the capacitated location-routing problem. Comput Oper Res 37:1912\u20131923","journal-title":"Comput Oper Res"},{"key":"4666_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.cor.2017.03.013","volume":"85","author":"O Dukkanci","year":"2017","unstructured":"Dukkanci O, Kara BY (2017) Routing and scheduling decisions in the hierarchical hub location problem. Comput Oper Res 85:45\u201357","journal-title":"Comput Oper Res"},{"issue":"17","key":"4666_CR16","doi-asserted-by":"crossref","first-page":"8829","DOI":"10.1016\/j.amc.2013.03.099","volume":"219","author":"R Enayatifar","year":"2013","unstructured":"Enayatifar R, Yousefi M, Abdullah AH, Darus AN (2013) MOICA: a novel multi-objective approach based on imperialist competitive algorithm. Appl Math Comput 219(17):8829\u20138841","journal-title":"Appl Math Comput"},{"issue":"5","key":"4666_CR17","first-page":"1271","volume":"13","author":"M Esmaeili","year":"2018","unstructured":"Esmaeili M, Sedehzade S (2018) Designing a hub location and pricing network in a competitive environment. J Ind Manag Optim 13(5):1271\u20131295","journal-title":"J Ind Manag Optim"},{"key":"4666_CR18","unstructured":"Feili H, Ahmadian P, Rabiei E, Karimi J, Majidi B (2015) Ranking of suitable renewable energy location using AHP method and scoring systems with sustainable development perspective. In: 6th International conference on economics, management, engineering science and art. Brussels, Belgium"},{"key":"4666_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tre.2014.12.016","volume":"75","author":"S Gelareh","year":"2015","unstructured":"Gelareh S, Monemi RN, Nickel SJ (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"},{"key":"4666_CR20","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2018.07.022","volume":"100","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab N, Van Woensel T, Minner S (2018) A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms. Comput Oper Res 100:140\u2013154","journal-title":"Comput Oper Res"},{"key":"4666_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00500-016-2326-4","volume":"22","author":"V Ghezavati","year":"2018","unstructured":"Ghezavati V, Hosseinifar P (2018) Application of efficient metaheuristics to solve a new bi-objective optimization model for hub facility location problem considering value at risk criterion. Soft Comput 22:195\u2013212","journal-title":"Soft Comput"},{"key":"4666_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ijpe.2013.12.028","volume":"152","author":"K Govindan","year":"2014","unstructured":"Govindan K, Jafarian A, Khodaverdi R, Devika KJ (2014) Two-echelon multiple-vehicle location\u2013routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int J Prod Econ 152:9\u201328","journal-title":"Int J Prod Econ"},{"key":"4666_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0966-8349(98)00053-9","volume":"6","author":"HW Hamacher","year":"1998","unstructured":"Hamacher HW, Nickel SJLS (1998) Classification of location models. Locat Sci 6:229\u2013242","journal-title":"Locat Sci"},{"key":"4666_CR24","doi-asserted-by":"crossref","first-page":"106110","DOI":"10.1016\/j.cie.2019.106110","volume":"138","author":"E Hassannayebi","year":"2019","unstructured":"Hassannayebi E, Boroun M, Jordehi SA, Kor H (2019) Train schedule optimization in a high-speed railway system using a hybrid simulation and meta-model approach. Comput Ind Eng 138:106110","journal-title":"Comput Ind Eng"},{"key":"4666_CR25","doi-asserted-by":"publisher","DOI":"10.1080\/17477778.2019.1664267","author":"E Hassannayebi","year":"2019","unstructured":"Hassannayebi E, Memarpour M, Mardani S, Shakibayifar M, Bakhshayeshi I, Espahbod S (2019) A hybrid simulation model of passenger emergency evacuation under disruption scenarios: a case study of a large transfer railway station. J Simul. https:\/\/doi.org\/10.1080\/17477778.2019.1664267","journal-title":"J Simul"},{"key":"4666_CR26","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s12351-016-0232-2","volume":"17","author":"E Hassannayebi","year":"2017","unstructured":"Hassannayebi E, Zegordi SH, Amin-Naseri MR, Yaghini MJ (2017) Train timetabling at rapid rail transit lines: a robust multi-objective stochastic programming approach. Oper Res Int J 17:435\u2013477","journal-title":"Oper Res Int J"},{"key":"4666_CR27","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.ejor.2010.09.017","volume":"210","author":"R Ishfaq","year":"2011","unstructured":"Ishfaq R, Sox CRJ (2011) Hub location\u2013allocation in intermodal logistic networks. Eur J Oper Res 210:213\u2013230","journal-title":"Eur J Oper Res"},{"key":"4666_CR28","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.apm.2018.01.012","volume":"57","author":"H Karimi","year":"2018","unstructured":"Karimi H, Setak M (2018) A bi-objective incomplete hub location-routing problem with flow shipment scheduling. Appl Math Model 57:406\u2013431","journal-title":"Appl Math Model"},{"key":"4666_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cie.2017.12.020","volume":"116","author":"H Karimi","year":"2018","unstructured":"Karimi H (2018) The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems. Comput Ind Eng 116:47\u201358","journal-title":"Comput Ind Eng"},{"key":"4666_CR30","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tre.2017.10.004","volume":"108","author":"Z Kartal","year":"2017","unstructured":"Kartal Z, Hasgul S, Ernst A (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":"4666_CR31","doi-asserted-by":"crossref","first-page":"393","DOI":"10.5267\/j.uscm.2017.12.005","volume":"6","author":"S Khosravi","year":"2018","unstructured":"Khosravi S, Jokar M (2018) Many to many hub and spoke location routing problem based on the gravity rule. Uncertain Supp Chain Manag 6:393\u2013406","journal-title":"Uncertain Supp Chain Manag"},{"key":"4666_CR32","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1538-4632.2009.00755.x","volume":"41","author":"H Kim","year":"2009","unstructured":"Kim H, O\u2019Kelly M (2009) Reliable p-hub location problems in telecommunication networks. Geogr Anal 41:283\u2013306","journal-title":"Geogr Anal"},{"key":"4666_CR33","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tre.2018.03.007","volume":"114","author":"C-C Lin","year":"2018","unstructured":"Lin C-C, Lee S-C (2018) Hub network design problem with profit optimization for time-definite LTL freight transportation. Transp Res Part E Logist Transp Rev 114:104\u2013120","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"4666_CR34","doi-asserted-by":"crossref","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 MG, Miyazawa F (2016) Heuristics for a hub location-routing problem. Networks 68:54\u201390","journal-title":"Networks"},{"key":"4666_CR35","doi-asserted-by":"crossref","first-page":"9652","DOI":"10.1016\/j.amc.2013.03.002","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas G, Florios K (2013) An improved version of the augmented \u03b5-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems. Appl Math Comput 219:9652\u20139669","journal-title":"Appl Math Comput"},{"key":"4666_CR36","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas G (2009) Effective implementation of the \u03b5-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455\u2013465","journal-title":"Appl Math Comput"},{"key":"4666_CR37","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1111\/itor.12270","volume":"24","author":"JF Meier","year":"2017","unstructured":"Meier JF (2017) An improved mixed integer program for single allocation hub location problems with stepwise cost function. Int Trans Oper Res 24:983\u2013991","journal-title":"Int Trans Oper Res"},{"key":"4666_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00510-3","author":"M Memarpour","year":"2019","unstructured":"Memarpour M, Hassannayebi E, Miab NF, Farjad A (2019) Dynamic allocation of promotional budgets based on maximizing customer equity. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-019-00510-3","journal-title":"Oper Res Int J"},{"key":"4666_CR39","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.cie.2016.12.027","volume":"104","author":"D Mogale","year":"2017","unstructured":"Mogale D, Kumar SK, M\u00e1rquez FPG, Tiwari MKJC, Engineering I (2017) Bulk wheat transportation and storage problem of public distribution system. Comput Ind Eng 104:80\u201397","journal-title":"Comput Ind Eng"},{"key":"4666_CR40","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1016\/j.mcm.2011.06.038","volume":"54","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Jolai F, Rostami HJM, Modelling C (2011) An M\/M\/c queue model for hub covering location problem. Math Comput Model 54:2623\u20132638","journal-title":"Math Comput Model"},{"key":"4666_CR41","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.jocs.2017.04.003","volume":"21","author":"MA Mohammed","year":"2017","unstructured":"Mohammed MA, Ghani MKA, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA (2017) Solving vehicle routing problem by using improved genetic algorithm for optimal solution. J Comput Sci 21:255\u2013262","journal-title":"J Comput Sci"},{"key":"4666_CR42","first-page":"647","volume":"3","author":"N Mokhtari","year":"2015","unstructured":"Mokhtari N, Abbasi M (2015) Applying VNPSO algorithm to solve the many-to-many hub location-routing problem in a large scale. Eur Online J Nat Soc Sci Proc 3:647\u2013656","journal-title":"Eur Online J Nat Soc Sci Proc"},{"key":"4666_CR43","first-page":"164","volume":"7","author":"R Moraga","year":"2017","unstructured":"Moraga R, Rabiei Hosseinabad E (2017) A system dynamics approach in air pollution mitigation of metropolitan areas with sustainable development perspective: a case study of Mexico City. J Appl Environ Biol Sci 7:164\u2013174","journal-title":"J Appl Environ Biol Sci"},{"key":"4666_CR44","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649\u2013672","journal-title":"Eur J Oper Res"},{"key":"4666_CR45","doi-asserted-by":"crossref","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:261\u2013275","journal-title":"Top"},{"key":"4666_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2297701","volume":"51","author":"DM Newbery","year":"1984","unstructured":"Newbery DM, Stiglitz J (1984) Pareto inferior trade. Rev Econ Stud 51:1\u201312","journal-title":"Rev Econ Stud"},{"key":"4666_CR47","first-page":"36","volume":"17","author":"E Nikbakhsh","year":"2010","unstructured":"Nikbakhsh E, Zegordi S (2010) A heuristic algorithm and a lower bound for the two-echelon location-routing problem with soft time window constraints. Sci Iran Trans E Ind Eng 17:36","journal-title":"Sci Iran Trans E Ind Eng"},{"key":"4666_CR48","doi-asserted-by":"crossref","first-page":"1890","DOI":"10.1016\/j.camwa.2008.10.004","volume":"57","author":"B Qu","year":"2009","unstructured":"Qu B, Weng K (2009) Path relinking approach for multiple allocation hub maximal covering problem. Comput Math Appl 57:1890\u20131894","journal-title":"Comput Math Appl"},{"key":"4666_CR49","doi-asserted-by":"crossref","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:863\u2013878","journal-title":"Eur J Oper Res"},{"key":"4666_CR50","first-page":"392","volume":"17","author":"A Sajedinejad","year":"2018","unstructured":"Sajedinejad A, Chaharsooghi SK (2018) Multi-criteria supplier selection decisions in supply chain networks: a multi-objective optimization approach. Ind Eng Manag Syst 17:392\u2013406","journal-title":"Ind Eng Manag Syst"},{"key":"4666_CR51","first-page":"12","volume":"6","author":"B Song","year":"2003","unstructured":"Song B, Zhuo FJSE (2003) An improved genetic algorithm for vehicle routing problem with soft time windows. Syst Eng 6:12\u201315","journal-title":"Syst Eng"},{"key":"4666_CR52","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.3390\/en6031439","volume":"6","author":"B Tomoiag\u0103","year":"2013","unstructured":"Tomoiag\u0103 B, Chindri\u015f M, Sumper A, Sudria-Andreu A, Villafafila-Robles R (2013) Pareto optimal reconfiguration of power distribution systems using a genetic algorithm based on NSGA-II. Energies 6:1439\u20131455","journal-title":"Energies"},{"issue":"Suppl 5","key":"4666_CR53","first-page":"12551","volume":"22","author":"L Tong","year":"2018","unstructured":"Tong L, Nie L, Guo G-C, Leng N-N, Xu R-X (2018) Layout scheme of high-speed railway transfer hubs: bi-level modeling and hybrid genetic algorithm approach. Clust Comput 22(Suppl 5):12551","journal-title":"Clust Comput"},{"key":"4666_CR54","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ijpe.2003.12.002","volume":"90","author":"M Wasner","year":"2004","unstructured":"Wasner M, Z\u00e4pfel G (2004) An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. Int J Prod Econ 90:403\u2013419","journal-title":"Int J Prod Econ"},{"key":"4666_CR55","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1111\/j.1467-8640.2012.00446.x","volume":"29","author":"M Winsper","year":"2013","unstructured":"Winsper M, Chli M (2013) Decentralized supply chain formation using max-sum loopy belief propagation. Comput Intell 29:281\u2013309","journal-title":"Comput Intell"},{"key":"4666_CR56","doi-asserted-by":"crossref","first-page":"5385","DOI":"10.1007\/s00500-018-3056-6","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu X, Zheng Y, Yu L (2018) A bi-level optimization model of LRP in collaborative logistics network considered backhaul no-load cost. Soft Comput 22:5385\u20135393","journal-title":"Soft Comput"},{"key":"4666_CR57","first-page":"69","volume":"33","author":"T-H Yang","year":"2016","unstructured":"Yang T-H, Chiu T-YJJOI (2016) Airline hub-and-spoke system design under stochastic demand and hub congestion. J Ind Prod Eng 33:69\u201376","journal-title":"J Ind Prod Eng"},{"key":"4666_CR58","doi-asserted-by":"crossref","unstructured":"Yetgin H, Cheung KTK, Hanzo L (2012) Multi-objective routing optimization using evolutionary algorithms. In: IEEE, pp 3030\u20133034","DOI":"10.1109\/WCNC.2012.6214324"},{"key":"4666_CR59","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s40092-014-0076-4","volume":"10","author":"AE Zade","year":"2014","unstructured":"Zade AE, Sadegheih A, Lotfi MM (2014) A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments. J Ind Eng Int 10:185\u2013197","journal-title":"J Ind Eng Int"},{"key":"4666_CR60","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.knosys.2012.09.007","volume":"37","author":"MHF Zarandi","year":"2013","unstructured":"Zarandi MHF, Hemmati A, Davari S, Turksen IB (2013) Capacitated location-routing problem with time windows under uncertainty. Knowl-Based Syst 37:480\u2013489","journal-title":"Knowl-Based Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04666-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04666-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04666-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T16:17:32Z","timestamp":1613060252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04666-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,11]]},"references-count":60,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4666"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04666-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,11]]},"assertion":[{"value":"10 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors reported no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}