{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T05:49:11Z","timestamp":1778737751208,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T00:00:00Z","timestamp":1518393600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71771208"],"award-info":[{"award-number":["71771208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","award":["17CX04023B"],"award-info":[{"award-number":["17CX04023B"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00500-018-3056-6","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T13:56:57Z","timestamp":1518443817000},"page":"5385-5393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A bi-level optimization model of LRP in collaborative logistics network considered backhaul no-load cost"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5619-2126","authenticated-orcid":false,"given":"Xiaofeng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lean","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,12]]},"reference":[{"issue":"5","key":"3056_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":"3","key":"3056_CR2","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2014.10.048","volume":"242","author":"S Allahyari","year":"2015","unstructured":"Allahyari S, Salari M, Vigo D (2015) A hybrid metaheuristic algorithm for the multi-depot covering. Eur J Oper Res 242(3):756\u2013768","journal-title":"Eur J Oper Res"},{"key":"3056_CR3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.amc.2014.09.013","volume":"247","author":"MJ Alves","year":"2014","unstructured":"Alves MJ, Costa JP (2014) An algorithm based on particle swarm optimization for multi objective bilevel linear problems. Appl Math Comput 247:547\u2013561","journal-title":"Appl Math Comput"},{"issue":"2","key":"3056_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.cor.2007.09.012","volume":"36","author":"D Ambrosino","year":"2009","unstructured":"Ambrosino D, Sciomachen A, Scutell\u00e0 MG (2009) A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem. Comput Oper Res 36(2):442\u2013460","journal-title":"Comput Oper Res"},{"key":"3056_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza S, Hansen P, Laporte G (2014) A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput Oper Res 52:269\u2013281","journal-title":"Comput Oper Res"},{"key":"3056_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Ayed O, Blair CE (1990) Computational difficulties of bilevel linear programming. Informs, Catonsville","DOI":"10.1287\/opre.38.3.556"},{"issue":"2","key":"3056_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1111\/j.1467-9787.1961.tb01276.x","volume":"3","author":"V Boventer","year":"1961","unstructured":"Boventer V (1961) The relationship between transportation costs and location rent in transportation problems. J Reg Sci 3(2):27\u201340","journal-title":"J Reg Sci"},{"issue":"1","key":"3056_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.21.1.30","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken J, Mcgill JT (1973) A convex programming model for optimizing SLBM attack of bomber bases. Oper Res 21(1):30\u201336","journal-title":"Oper Res"},{"issue":"6","key":"3056_CR9","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s11116-010-9266-0","volume":"37","author":"RN Buliung","year":"2010","unstructured":"Buliung RN, Soltys K, Bui R (2010) Catching a ride on the information super-highway: toward an understanding of internet-based carpool formation and use. Transportation 37(6):849\u2013873","journal-title":"Transportation"},{"issue":"5","key":"3056_CR10","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1057\/palgrave.jors.2602028","volume":"57","author":"JF Chen","year":"2006","unstructured":"Chen JF, Wu TH (2006) Vehicle routing problem with simultaneous deliveries and pickup. J Oper Res Soc 57(5):579\u2013587","journal-title":"J Oper Res Soc"},{"issue":"2","key":"3056_CR11","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.ejor.2015.09.059","volume":"250","author":"C Defryn","year":"2016","unstructured":"Defryn C, Sorensen K, Cornelissens T (2016) The selective vehicle routing problem in a collaborative environment. Eur J Oper Res 250(2):400\u2013411","journal-title":"Eur J Oper Res"},{"key":"3056_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1016\/j.trpro.2017.05.460","volume":"25","author":"M Dircksen","year":"2017","unstructured":"Dircksen M, Magnin G (2017) Evaluation of synergy potentials in transportation networks managed by a fourth party logistics provider. Transp Res Proc 25:824\u2013841","journal-title":"Transp Res Proc"},{"key":"3056_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2017.02.011","volume":"399","author":"J Du","year":"2017","unstructured":"Du J, Li X, Yu L, Dan R, Zhou J (2017) Multi-deport vehicle routing problem for hazardous materials transportation. Inf Sci 399:201\u2013218","journal-title":"Inf Sci"},{"issue":"1","key":"3056_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2015.07.027","volume":"29","author":"F Errico","year":"2016","unstructured":"Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau LM (2016) A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur J Oper Res 29(1):55\u201366","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3056_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10479-016-2347-5","volume":"253","author":"M Fattahi","year":"2016","unstructured":"Fattahi M, Govindan K (2016) Integrated forward\/reverse logistics network design under uncertainty with pricing for collection of used products. Annu Oper Res 253(1):193\u2013225","journal-title":"Annu Oper Res"},{"issue":"1","key":"3056_CR16","first-page":"189","volume":"24","author":"S Hossein","year":"2013","unstructured":"Hossein S, Doulabi H, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 24(1):189\u2013208","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3056_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ijpe.2013.03.007","volume":"145","author":"M Huang","year":"2013","unstructured":"Huang M, Cui Y, Yang SX, Wang XW (2013) Fourth party logistics routing problem with fuzzy duration time. Int J Prod Econ 145(1):107\u2013116","journal-title":"Int J Prod Econ"},{"issue":"24","key":"3056_CR18","doi-asserted-by":"publisher","first-page":"9434","DOI":"10.1016\/j.eswa.2015.08.003","volume":"42","author":"S Ishikawa","year":"2015","unstructured":"Ishikawa S, Kubota R, Horio K (2015) Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem. Exper Syst Appl 42(24):9434\u20139440","journal-title":"Exper Syst Appl"},{"issue":"5","key":"3056_CR19","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.tre.2009.06.005","volume":"46","author":"AA Javid","year":"2010","unstructured":"Javid AA, Azad N (2010) Incorporating location, routing and inventory decisions in supply chain network design. Transp Res Part E Log Transp Rev 46(5):582\u2013597","journal-title":"Transp Res Part E Log Transp Rev"},{"issue":"2","key":"3056_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Prog 32(2):146\u2013164","journal-title":"Math Prog"},{"key":"3056_CR21","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.jnca.2015.06.010","volume":"57","author":"DD Jiang","year":"2015","unstructured":"Jiang DD, Xu ZZ, Wang WQ, Wang YT, Han Y (2015) A collaborative multi-hop routing algorithm for maximum achievable rate. J Netw Comput Appl 57:182\u2013191","journal-title":"J Netw Comput Appl"},{"key":"3056_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cie.2015.07.003","volume":"99","author":"RS Kumar","year":"2016","unstructured":"Kumar RS, Kondapaneni K, Dixit V, Goswami A, Thakur LS, Tiwari MK (2016) Multi-objective modeling of production and pollution routing problem with time window: a self-learning particle swarm optimization approach. Comput Ind Eng 99:29\u201340","journal-title":"Comput Ind Eng"},{"issue":"4","key":"3056_CR23","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/s12205-013-0087-5","volume":"17","author":"H Lee","year":"2013","unstructured":"Lee H, Zhang T, Boile M (2013) Designing an integrated logistics network in a supply chain system. KSCE J Civ Eng 17(4):806\u2013814","journal-title":"KSCE J Civ Eng"},{"key":"3056_CR24","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cor.2014.06.022","volume":"51","author":"AN Letchford","year":"2014","unstructured":"Letchford AN, Nasiri SD, Oukil A (2014) Pricing routines for vehicle routing with time windows on road networks. Comput Oper Res 51:331\u2013337","journal-title":"Comput Oper Res"},{"issue":"2","key":"3056_CR25","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.camwa.2009.10.022","volume":"59","author":"MQ Li","year":"2010","unstructured":"Li MQ, Lin D, Wang SY (2010) Solving a type of bi-objective bilevel programming problem using NSGA-II. Comput Math Appl 59(2):706\u2013715","journal-title":"Comput Math Appl"},{"key":"3056_CR26","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.trb.2016.05.013","volume":"91","author":"X Li","year":"2016","unstructured":"Li X, Zhou JD, Zhao XD (2016) Travel itinerary problem. Transp Res Part B 91:332\u2013343","journal-title":"Transp Res Part B"},{"issue":"6","key":"3056_CR27","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.jnca.2013.03.015","volume":"36","author":"TP Lu","year":"2013","unstructured":"Lu TP, Trappey AJC, Chen YK, Chang YD (2013) Collaborative design and analysis of supply chain network management key processes model. J Netw Comput Appl 36(6):1503\u20131511","journal-title":"J Netw Comput Appl"},{"key":"3056_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2014.11.007","volume":"56","author":"ME McNabb","year":"2015","unstructured":"McNabb ME, Weir JD, Hill RR, Hall SN (2015) Testing local search move operators on the vehicle routing problem with split deliveries and time windows. Comput Oper Res 56:93\u2013109","journal-title":"Comput Oper Res"},{"key":"3056_CR29","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.eswa.2016.07.022","volume":"64","author":"DM Miranda","year":"2014","unstructured":"Miranda DM, Concei\u00e7\u00e3o SV (2014) The vehicle routing problem with hard time windows and stochastic travel and service time. Exp Syst Appl 64:104\u2013116","journal-title":"Exp Syst Appl"},{"issue":"2","key":"3056_CR30","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2014.04.012","volume":"238","author":"A Nadizadeh","year":"2014","unstructured":"Nadizadeh A, Nasab H (2014) Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm. Eur J Oper Res 238(2):458\u2013470","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3056_CR31","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G Nagy","year":"2005","unstructured":"Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Oper Res 162(1):126\u2013141","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3056_CR32","doi-asserted-by":"publisher","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(2):649\u2013672","journal-title":"Eur J Oper Res"},{"key":"3056_CR33","first-page":"1","volume":"1285","author":"K Niwa","year":"2010","unstructured":"Niwa K, Hayashida T, Sakawa M (2010) Computational methods for decentralized two level 0\u20131 programming problems through distributed genetic algorithms. AIP Conf Proc 1285:1\u201313","journal-title":"AIP Conf Proc"},{"issue":"1","key":"3056_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"C Prodhon","year":"2014","unstructured":"Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238(1):1\u201317","journal-title":"Eur J Oper Res"},{"issue":"3","key":"3056_CR35","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":"3056_CR36","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2017.01.011","volume":"260","author":"M Schiffer","year":"2017","unstructured":"Schiffer M, Walther G (2017) The electric location routing problem with time windows and partial recharging. Eur J Oper Res 260:995\u20131013","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3056_CR37","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017) Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur J Oper Res 257(2):395\u2013411","journal-title":"Eur J Oper Res"},{"key":"3056_CR38","first-page":"1","volume":"4","author":"XF Xu","year":"2017","unstructured":"Xu XF, Chang WH, Liu J (2017) Resource allocation optimization model of collaborative logistics network based on bilevel programming. Sci Prog 4:1\u20138","journal-title":"Sci Prog"},{"issue":"4","key":"3056_CR39","first-page":"289","volume":"2","author":"F Yang","year":"2014","unstructured":"Yang F, Wang Y, Yuan W, Jian L (2014) A robust VRPHTW model with travel time uncertainty. J Syst Sci Inf 2(4):289\u2013300","journal-title":"J Syst Sci Inf"},{"issue":"4","key":"3056_CR40","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jmsy.2010.12.002","volume":"29","author":"JM Yao","year":"2010","unstructured":"Yao JM (2010) Decision optimization analysis on supply chain resource integration in fourth party logistics. J Manuf Syst 29(4):121\u2013129","journal-title":"J Manuf Syst"},{"issue":"2","key":"3056_CR41","first-page":"1","volume":"24","author":"VF Yu","year":"2016","unstructured":"Yu VF, Lin SY (2016) Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing. Int J Product Res 24(2):1\u201324","journal-title":"Int J Product Res"},{"issue":"2","key":"3056_CR42","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.cie.2013.02.003","volume":"65","author":"ZB Zhang","year":"2013","unstructured":"Zhang ZB, Zhang SH, Wang YH, Jiang YZ, Wang H (2013) Use of parallel deterministic dynamic programming and hierarchical adaptive genetic algorithm for reservoir operation optimization. Comput Ind Eng 65(2):310\u2013321","journal-title":"Comput Ind Eng"},{"issue":"5","key":"3056_CR43","first-page":"451","volume":"2","author":"J Zhu","year":"2014","unstructured":"Zhu J (2014) Non-linear integer programming model and algorithms for connected p-facility location problem. J Syst Sci Inf 2(5):451\u2013460","journal-title":"J Syst Sci Inf"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3056-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3056-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3056-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T02:05:45Z","timestamp":1603850745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3056-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,12]]},"references-count":43,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["3056"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3056-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,12]]},"assertion":[{"value":"12 February 2018","order":1,"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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animal performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}