{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:40:29Z","timestamp":1760708429968},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T00:00:00Z","timestamp":1341446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10288-012-0207-y","type":"journal-article","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T16:23:43Z","timestamp":1341851023000},"page":"245-265","source":"Crossref","is-referenced-by-count":3,"title":["An adapted heuristic approach for a clustered traveling salesman problem with loading constraints"],"prefix":"10.1007","volume":"10","author":[{"given":"Angel","family":"Felipe","sequence":"first","affiliation":[]},{"given":"M. Teresa","family":"Ortu\u00f1o","sequence":"additional","affiliation":[]},{"given":"Gregorio","family":"Tirado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,5]]},"reference":[{"key":"207_CR1","unstructured":"Alba M, Cordeau J-F, Dell\u2019Amico M, Iori MA (2011) Branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J Comput (to appear)"},{"issue":"4","key":"207_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3138\/infor.45.4.223","volume":"45","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cerulli R, Cordeau J-F (2007) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR Inf Syst Oper Res 45(4): 223\u2013238","journal-title":"INFOR Inf Syst Oper Res"},{"key":"207_CR3","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19: 618\u2013632","journal-title":"INFORMS J Comput"},{"key":"207_CR4","unstructured":"Carrabs F, Cerulli R, Speranza MG (2010) A branch-and-bound algorithm for the double TSP with two stacks. Technical Report 4, DMI, University of Salerno, Italy (available on line)"},{"key":"207_CR5","unstructured":"Cassani L, Righini G (2004) Heuristic algorithms for the TSP with rear-loading. In: 35th annual conference of the Italian operational research society, AIRO XXXV, Lecce, Italy"},{"key":"207_CR6","unstructured":"Cassaza M, Ceselli A, Nunkesser M (2009) Efficient algorithms for the double traveling salesman problem with multiple stacks. In: Proceedings of Cologne twente workshop, Paris, France"},{"issue":"1","key":"207_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/net.20312","volume":"55","author":"J-F Cordeau","year":"2010","unstructured":"Cordeau J-F, Iori M, Laporte G, Salazar-Gonz\u00e1lez J (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1): 46\u201359","journal-title":"Networks"},{"key":"207_CR8","doi-asserted-by":"crossref","unstructured":"Cot\u00e8 JF, Gendreau M, Potvin JY (2012) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks. doi: 10.1002\/net.20448","DOI":"10.1002\/net.20448"},{"issue":"4","key":"207_CR9","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/net.20179","volume":"49","author":"DF Doerner","year":"2007","unstructured":"Doerner DF, Fuellerer G, Hartl RF, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4): 294\u2013307","journal-title":"Networks"},{"key":"207_CR10","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1016\/j.cor.2009.01.015","volume":"36","author":"A Felipe","year":"2009","unstructured":"Felipe A, Ortu\u00f1o MT, Tirado G (2009) The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput Oper Res 36: 2983\u20132993","journal-title":"Comput Oper Res"},{"key":"207_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2010.11.011","volume":"211","author":"A Felipe","year":"2011","unstructured":"Felipe A, Ortu\u00f1o MT, Tirado G (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. Eur J Oper Res 211: 66\u201375","journal-title":"Eur J Oper Res"},{"key":"207_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M Gendreau","year":"2006","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2006) A heuristic algorithm for a routing and container loading problem. Transp Sci 40: 342\u2013350","journal-title":"Transp Sci"},{"issue":"1","key":"207_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M Gendreau","year":"2008","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4\u201318","journal-title":"Networks"},{"issue":"2","key":"207_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori M, Salazar-Gonz\u00e1lez J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2): 253\u2013264","journal-title":"Transp Sci"},{"key":"207_CR15","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/j.1475-3995.2009.00748.x","volume":"17","author":"R Lusby","year":"2010","unstructured":"Lusby R, Larsen J, Ehrgott M, Ryan D (2010) An exact method for the double TSP with multiple stacks. Int Trans Oper Res 17: 637\u2013652","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"207_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.20375","volume":"56","author":"HL Petersen","year":"2010","unstructured":"Petersen HL, Archetti C, Speranza MG (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4): 229\u2013243","journal-title":"Networks"},{"issue":"1","key":"207_CR17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen HL, Madsen OBG (2009) The double travelling salesman problem with multiple stacks\u2014formulation and heuristic solution approaches. Eur J Oper Res 198(1): 139\u2013147","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0207-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0207-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:58Z","timestamp":1559117578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0207-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0207-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,5]]}}}