{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:23:22Z","timestamp":1773523402658,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12351-016-0278-1","type":"journal-article","created":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T16:26:07Z","timestamp":1479486367000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking"],"prefix":"10.1007","volume":"19","author":[{"given":"Amalia I.","family":"Nikolopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis P.","family":"Repoussis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos D.","family":"Tarantilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouil E.","family":"Zachariadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,18]]},"reference":[{"issue":"2","key":"278_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/trsc.1030.0077","volume":"38","author":"JJ Bartholdi III","year":"2004","unstructured":"Bartholdi JJ III, Gue KR (2004) The best shape for a cross-dock. Transp Sci 38(2):235\u2013244","journal-title":"Transp Sci"},{"issue":"8","key":"278_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.trb.2013.11.010","volume":"60","author":"Y Cardona-Vald\u00e9s","year":"2014","unstructured":"Cardona-Vald\u00e9s Y, \u00c1lvarez A, Pacheco J (2014) Metaheuristic procedure for a bi-objective supply chain design problem with uncertainty. Transp Res Part B Methodol 60(8):66\u201384","journal-title":"Transp Res Part B Methodol"},{"key":"278_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.2307\/1931034","volume":"35","author":"PJ Clark","year":"1954","unstructured":"Clark PJ, Evans FC (1954) Distance to nearest neighbor as a measure of spatial relationships in populations. Ecology 35:445\u2013453","journal-title":"Ecology"},{"issue":"5","key":"278_CR4","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1504\/IJLSM.2009.024253","volume":"5","author":"Y Cohen","year":"2009","unstructured":"Cohen Y, Keren B (2009) Trailer to door assignment in a synchronous cross-dock operation. Int J Logist Syst Manag 5(5):574\u2013590","journal-title":"Int J Logist Syst Manag"},{"issue":"12","key":"278_CR5","doi-asserted-by":"publisher","first-page":"3002","DOI":"10.1016\/j.compchemeng.2011.03.028","volume":"35","author":"R Dondo","year":"2011","unstructured":"Dondo R, M\u00e8ndez CA, Cerd\u00e1 J (2011) The multi-echelon vehicle routing problem with cross-docking in supply chain management. Comput Chem Eng 35(12):3002\u20133024","journal-title":"Comput Chem Eng"},{"key":"278_CR6","unstructured":"Enderer F (2014) Integrating dock-door assignment and vehicle routing in cross-docking. MSc Thesis, Concordia University"},{"key":"278_CR7","first-page":"1","volume-title":"Interfaces in computer science and operation research: advances in metaheuristics","author":"F Glover","year":"1997","unstructured":"Glover F (1997) Tabu search and adaptive memory programming\u2014advances, applications and challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operation research: advances in metaheuristics. Kluwer, Boston, pp 1\u201375"},{"key":"278_CR8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0559","author":"CE Gounaris","year":"2014","unstructured":"Gounaris CE, Repoussis PP, Tarantilis CD, Wiesemann W, Floudas C (2014) An Adaptive memory programming framework for the robust capacitated vehicle routing problem. Transp Sci. doi:\n                    10.1287\/trsc.2014.0559","journal-title":"Transp Sci"},{"key":"278_CR9","unstructured":"Grangier P (2016) R\u00e9solution de probl\u00e8mes de tourn\u00e9es avec synchronisation: applications au cas multi-\u00e9chelons et au cross-docking. Dissertation, \u00c9cole nationale sup\u00e9rieure des Mines de Nantes"},{"issue":"3","key":"278_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/trsc.2015.0631","volume":"50","author":"G Guastaroba","year":"2016","unstructured":"Guastaroba G, Speranza MG, Vigo D (2016) Intermediate facilities in freight transportation planning: a survey. Transp Sci 50(3):763\u2013789","journal-title":"Transp Sci"},{"issue":"2","key":"278_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cie.2006.02.006","volume":"51","author":"YH Lee","year":"2006","unstructured":"Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in the supply chain. Comput Ind Eng 51(2):247\u2013256","journal-title":"Comput Ind Eng"},{"key":"278_CR12","doi-asserted-by":"crossref","unstructured":"Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: IEEE proceedings of the international conference on tools with artificial intelligence. pp 160\u2013167","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"278_CR13","doi-asserted-by":"publisher","first-page":"6868","DOI":"10.1016\/j.eswa.2010.03.035","volume":"37","author":"ChJ Liao","year":"2010","unstructured":"Liao ChJ, Lin Y, Shih SC (2010) Vehicle routing with cross-docking in the supply chain. Expert Syst Appl 37:6868\u20136873","journal-title":"Expert Syst Appl"},{"key":"278_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.omega.2010.03.001","volume":"39","author":"H Ma","year":"2011","unstructured":"Ma H, Miao Z, Lim A, Rodriguez B (2011) Cross-docking distribution networks with setup cost and time window constraint. Omega 39:64\u201372","journal-title":"Omega"},{"issue":"16","key":"278_CR15","doi-asserted-by":"publisher","first-page":"7495","DOI":"10.1016\/j.eswa.2014.06.010","volume":"41","author":"VWC Morais","year":"2014","unstructured":"Morais VWC, Mateus GR, Noronha TF (2014) Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst Appl 41(16):7495\u20137506","journal-title":"Expert Syst Appl"},{"issue":"1","key":"278_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.cie.2010.03.002","volume":"59","author":"R Musa","year":"2010","unstructured":"Musa R, Arnaout JP, Jung H (2010) Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Comput Ind Eng 59(1):85\u201392","journal-title":"Comput Ind Eng"},{"key":"278_CR005","doi-asserted-by":"crossref","unstructured":"Nikolopoulou AI, Repoussis PP, Tarantilis CD, Zachariadis EE (2017) Moving products between location pairs: cross-docking versus direct-shipping. Eur J Oper Res 256(3):803\u2013819","DOI":"10.1016\/j.ejor.2016.06.053"},{"issue":"16","key":"278_CR18","doi-asserted-by":"publisher","first-page":"3938","DOI":"10.1080\/00207543.2016.1145814","volume":"54","author":"DC Paraskevopoulos","year":"2016","unstructured":"Paraskevopoulos DC, Tarantilis CD, Ioannou G (2016) An adaptive memory programming framework for the resource-constrained project scheduling problem. Int J Prod Res 54(16):3938\u20134956","journal-title":"Int J Prod Res"},{"key":"278_CR19","unstructured":"Petersen HL, Ropke S (2011) The pickup and delivery problem with cross-docking opportunity. In: Proceedings of international conference on computational logistics, Hamburg, Germany. pp 101\u2013113"},{"key":"278_CR20","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.trc.2009.08.004","volume":"18","author":"PP Repoussis","year":"2010","unstructured":"Repoussis PP, Tarantilis CD (2010) Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transp Res Part C 18:695\u2013712","journal-title":"Transp Res Part C"},{"key":"278_CR21","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.cor.2012.11.021","volume":"40","author":"FA Santos","year":"2013","unstructured":"Santos FA, Mateus GR, da Cunha AS (2013) The pickup and delivery problem with cross-docking. Comput Oper Res 40:1085\u20131093","journal-title":"Comput Oper Res"},{"issue":"12","key":"278_CR22","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1057\/palgrave.jors.2601645","volume":"54","author":"CS Sung","year":"2003","unstructured":"Sung CS, Song SH (2003) Integrated service network design for a cross-docking supply chain network. J Oper Res Soc 54(12):1283\u20131295","journal-title":"J Oper Res Soc"},{"issue":"1","key":"278_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"ED Taillard","year":"2001","unstructured":"Taillard ED, Gambardella LM, Gendreau M, Potvin JY (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"9","key":"278_CR24","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","volume":"32","author":"CD Tarantilis","year":"2005","unstructured":"Tarantilis CD (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper Res 32(9):2309\u20132327","journal-title":"Comput Oper Res"},{"issue":"7","key":"278_CR25","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1007\/s11590-012-0558-5","volume":"7","author":"CD Tarantilis","year":"2013","unstructured":"Tarantilis CD (2013) Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim Lett 7(7):1583\u20131596","journal-title":"Optim Lett"},{"issue":"4","key":"278_CR26","doi-asserted-by":"publisher","first-page":"4233","DOI":"10.1016\/j.eswa.2011.09.111","volume":"39","author":"CD Tarantilis","year":"2011","unstructured":"Tarantilis CD, Stauropoulou F, Repoussis PP (2011) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Syst Appl 39(4):4233\u20134239","journal-title":"Expert Syst Appl"},{"key":"278_CR27","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/trsc.1120.0439","volume":"47","author":"CD Tarantilis","year":"2013","unstructured":"Tarantilis CD, Anagnostopoulou A, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp Sci 47:356\u2013379","journal-title":"Transp Sci"},{"issue":"1\u20134","key":"278_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0360-8352(92)90117-3","volume":"23","author":"LY Tsui","year":"1992","unstructured":"Tsui LY, Chang CH (1992) An optimal solution to a dock door assignment problem. Comput Ind Eng 23(1\u20134):283\u2013286","journal-title":"Comput Ind Eng"},{"issue":"3","key":"278_CR29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.cie.2007.10.004","volume":"54","author":"IF Vis","year":"2008","unstructured":"Vis IF, Roodbergen KJ (2008) Positioning of goods in a cross-docking environment. Comput Ind Eng 54(3):677\u2013689","journal-title":"Comput Ind Eng"},{"issue":"12","key":"278_CR31","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1057\/jors.2008.108","volume":"60","author":"M Wen","year":"2009","unstructured":"Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G (2009) Vehicle routing with cross-docking. J Oper Res Soc 60(12):1708\u20131718","journal-title":"J Oper Res Soc"},{"issue":"2","key":"278_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:JMMA.0000036583.17284.02","volume":"3","author":"IM Whittley","year":"2004","unstructured":"Whittley IM, Smith GD (2004) The attribute based hill climber. J Math Model Algorithms 3(2):167\u2013178","journal-title":"J Math Model Algorithms"},{"issue":"12","key":"278_CR33","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1016\/j.cor.2010.02.009","volume":"37","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis EE, Kiranoudis CT (2010) A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput Oper Res 37(12):2089\u20132105","journal-title":"Comput Oper Res"},{"key":"278_CR34","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.trb.2014.11.004","volume":"71","author":"EE Zachariadis","year":"2015","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2015) The load-dependent vehicle routing problem and its pick-up and delivery extension. Transp Res Part B Methodol 71:158\u2013181","journal-title":"Transp Res Part B Methodol"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-016-0278-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0278-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0278-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:15:28Z","timestamp":1556223328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-016-0278-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,18]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s12351-016-0278-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,18]]},"assertion":[{"value":"7 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}