{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:19:40Z","timestamp":1778948380173,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,13]],"date-time":"2016-05-13T00:00:00Z","timestamp":1463097600000},"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 (CN)","doi-asserted-by":"publisher","award":["11071271"],"award-info":[{"award-number":["11071271"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11371004"],"award-info":[{"award-number":["11371004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Strategic Emerging Industries Program (CN)","award":["ZDSY20120613125016389"],"award-info":[{"award-number":["ZDSY20120613125016389"]}]},{"name":"Shenzhen Strategic Emerging Industries Program (CN)","award":["JCYJ20130329153215152"],"award-info":[{"award-number":["JCYJ20130329153215152"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0028-6","type":"journal-article","created":{"date-parts":[[2016,5,13]],"date-time":"2016-05-13T06:40:01Z","timestamp":1463121601000},"page":"1145-1167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A lower bound for the adaptive two-echelon capacitated vehicle routing problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Liang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Progr Ser A 120:347\u2013380","journal-title":"Math Progr Ser A"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofideds N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Progr Ser A 115:351\u2013385","journal-title":"Math Progr Ser A"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59:1269\u20131283","journal-title":"Oper Res"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/opre.1120.1153","volume":"61","author":"R Baldacci","year":"2013","unstructured":"Baldacci R, Mingozzi A, Roberti R, Calvo R (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper Res 61:298\u2013314","journal-title":"Oper Res"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N Christofideds","year":"1981","unstructured":"Christofideds N, Mingozzi A, Toth P (1981) State-space relaxation procedures for the computation of bounds to routing problems. Networks 11:145\u201316","journal-title":"Networks"},{"key":"28_CR6","unstructured":"CPLEX (2012) Cplex 12.5 callable library. IBM ILOG"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"28_CR8","unstructured":"Das A (2011) Approximation schemes for euclidean vehicle routing problems. PhD thesis, Dissertation, Brown University, Providence, RI"},{"key":"28_CR9","volume-title":"The two-echelon capacitated vehicle routing problem. Technical report DEIS ORINGCE 2007\/2(R)","author":"J Feliu","year":"2007","unstructured":"Feliu J, Perboli G, Tadei R, Vigo D (2007) The two-echelon capacitated vehicle routing problem. Technical report DEIS ORINGCE 2007\/2(R). Department of Electronics, Computer Science and Systems, University of Bologna, Bologna"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/s10878-012-9564-x","volume":"28","author":"S Ghannadpour","year":"2014","unstructured":"Ghannadpour S, Noori S, Tavakkoli-Moghaddam R (2014) A multi-objective vehicle routing and scheduling problem with uncertainty in customers\u2019 request and priority. J Comb Optim 28:414\u2013446","journal-title":"J Comb Optim"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","volume":"47","author":"M Jepsen","year":"2013","unstructured":"Jepsen M, Spoorendonk S, Ropke S (2013) A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transp Sci 47:23\u201337","journal-title":"Transp Sci"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Li J, Li Y, Pardalos P (2014) Multi-depot vehicle routing problem with time windows under shared depot resources. J Comb Optim. doi: 10.1007\/s10878-014-9767-4","DOI":"10.1007\/s10878-014-9767-4"},{"key":"28_CR13","volume-title":"The vehicle routing problem","author":"P Toth","year":"2001","unstructured":"Toth P, Vigo D (2001) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.2174\/1874243200802010008","volume":"2","author":"S W\u00f8hlk","year":"2008","unstructured":"W\u00f8hlk S (2008) An approximation algorithm for the capacitated arc routing problem. Open Oper Res J 2:8\u201312","journal-title":"Open Oper Res J"},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/s10878-014-9741-1","volume":"28","author":"T Zhang","year":"2014","unstructured":"Zhang T, Chaovalitwongse W, Zhang Y (2014) Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. J Comb Optim 28:288\u2013309","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0028-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0028-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:29Z","timestamp":1559262209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0028-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,13]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0028-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,13]]}}}