{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:35:09Z","timestamp":1781109309539,"version":"3.54.1"},"reference-count":36,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>This paper is a survey about of the Truck and Trailer Routing Problem. The Truck and Trailer Routing Problem is an extension of the well-known Vehicle Routing Problem. Defined recently, this problem consists in designing the optimal set of routes for fleet of vehicles (trucks and trailers) in order to serve a given set of geographically dispersed customers. Since TTRP itself is a very difficult combinatorial optimization problem are usually tackled by metaheuristics. The interest in Truck and Trailer Routing Problem is motivated by its practical relevance as well as by its considerable difficulty. The goal of this paper is to show a study on the TTRP and the metaheuristics used for to solve it.<\/p>","DOI":"10.4018\/jamc.2013040103","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T08:55:27Z","timestamp":1379321727000},"page":"31-43","source":"Crossref","is-referenced-by-count":3,"title":["Models and Solutions for Truck and Trailer Routing Problems"],"prefix":"10.4018","volume":"4","author":[{"given":"Isis Torres","family":"P\u00e9rez","sequence":"first","affiliation":[{"name":"Department of Software Engineering, Polytechnic University Jos\u00e9 Antonio Echeverr\u00eda (ISPJAE), Havana, Cuba"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 Luis","family":"Verdegay","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Artificial Intelligence (DECSAI), University of Granada (UGR), Granada, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos Cruz","family":"Corona","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Artificial Intelligence (DECSAI), University of Granada (UGR), Granada, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejandro Rosete","family":"Su\u00e1rez","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence and Computer Systems (DIAISI), Polytechnic University Jos\u00e9 Antonio Echeverr\u00eda (ISPJAE), Havana, Cuba"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2013040103-0","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90033-6"},{"key":"jamc.2013040103-1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90030-8"},{"key":"jamc.2013040103-2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.59"},{"key":"jamc.2013040103-3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/03155986.1999.11732387","article-title":"A computacional study of a new heuristic for the site-dependent vehicle routing problem.","volume":"37","author":"GoldenChao","year":"1999","journal-title":"Information Systems and Operational Research"},{"key":"jamc.2013040103-4","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00056-3"},{"key":"jamc.2013040103-5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"jamc.2013040103-6","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601319"},{"key":"jamc.2013040103-7","doi-asserted-by":"crossref","unstructured":"Cordeau, & Laporte. (2001). A tabu search algorithm for the site dependent vehicle routing problem. Information Systems and Operational Research, 39, 292-298.","DOI":"10.1080\/03155986.2001.11732443"},{"key":"jamc.2013040103-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.08.007"},{"key":"jamc.2013040103-9","unstructured":"Drexl, M. (2007). On some generalized routing problems. Unpublished PhD thesis, RWTH, Aachen, Germany."},{"key":"jamc.2013040103-10","first-page":"5","article-title":"Branch and price and heuristic column generation for the generalized truck and trailer routing problem.","volume":"12","author":"M.Drexl","year":"2011","journal-title":"Revista de M\u00e9todos Cuantitativos para la Econom\u00eda y la Empresa"},{"key":"jamc.2013040103-11","author":"M. A.Drexl","year":"2007","journal-title":"A branch and price algorithm for the truck and trailer routing problem"},{"key":"jamc.2013040103-12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110205"},{"key":"jamc.2013040103-13","author":"M. R.Garey","year":"1979","journal-title":"Computers and intractability: A guide to the theory of NP-completeness"},{"key":"jamc.2013040103-14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"jamc.2013040103-15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00175-1"},{"key":"jamc.2013040103-16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"jamc.2013040103-17","author":"A.Hoff","year":"2007","journal-title":"A tabu search approach for milk collection in Western Norway using trucks and trailers"},{"key":"jamc.2013040103-18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"jamc.2013040103-19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2000.tb00200.x"},{"key":"jamc.2013040103-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.04.005"},{"key":"jamc.2013040103-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.077"},{"key":"jamc.2013040103-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.05.075"},{"key":"jamc.2013040103-23","author":"A.Olivera","year":"2004","journal-title":"Heur\u00edsticas para probleas de ruteo de veh\u00edculos"},{"key":"jamc.2013040103-24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00237-5"},{"key":"jamc.2013040103-25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1057\/jors.1993.54","article-title":"Extensions of the petal method for vehicle routing.","volume":"44","author":"D.Ryan","year":"1993","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2013040103-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.08.002"},{"key":"jamc.2013040103-27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098281"},{"key":"jamc.2013040103-28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023006"},{"key":"jamc.2013040103-29","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume":"Vol. 74","author":"E.-G.Talbi","year":"2009","journal-title":"Metaheuristics from design to implementation"},{"key":"jamc.2013040103-30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515"},{"key":"jamc.2013040103-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2010.01.013"},{"key":"jamc.2013040103-32","unstructured":"Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velazco, N. (2011, May 25-27). Heuristic column generation for the truck and trailer routing problem. In Proceedings of the International Conference on Industrial Engineering and Systems Managemnet, Metz, France."},{"key":"jamc.2013040103-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.11.011"},{"key":"jamc.2013040103-34","author":"U.Vogel","year":"2011","journal-title":"A flexible metaheuristic framework for solving rich vehicle routing problems. PhDthesis"},{"key":"jamc.2013040103-35","article-title":"Algorithms for the truck and trailer routing problem","author":"R.Zitz","year":"2010","journal-title":"Syddansk Universitet"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=77637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T18:24:02Z","timestamp":1715970242000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2013040103"}},"subtitle":["An Overview"],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2013040103","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}