{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T08:54:46Z","timestamp":1720947286267},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305357\/2021-2"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["CEX - PPM-00164\/17","RED-00119-21"],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1016\/j.cie.2023.109238","type":"journal-article","created":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T06:17:16Z","timestamp":1681193836000},"page":"109238","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms"],"prefix":"10.1016","volume":"180","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9651-8685","authenticated-orcid":false,"given":"Henrique Favarini Alves","family":"da Cruz","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9955-5721","authenticated-orcid":false,"given":"Alexandre","family":"Salles da Cunha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2023.109238_b1","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","article-title":"Solving the asymmetric travelling salesman problem with time windows by branch-and-cut","volume":"90","author":"Ascheuer","year":"2001","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cie.2023.109238_b2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","article-title":"The prize collecting traveling salesman problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/j.cie.2023.109238_b3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.dam.2018.07.033","article-title":"A two-commodity flow formulation for the capacitated truck-and-trailer routing problem","volume":"275","author":"Bartolini","year":"2020","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.cie.2023.109238_b4","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/trsc.2014.0571","article-title":"A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots","volume":"50","author":"Belenguer","year":"2016","journal-title":"Transportation Science"},{"key":"10.1016\/j.cie.2023.109238_b5","series-title":"Arc routing: Theory, solutions and applications","first-page":"419","article-title":"Scheduling of local delivery carrier routes for the United States postal service","author":"Bodin","year":"2000"},{"key":"10.1016\/j.cie.2023.109238_b6","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1057\/jors.2009.59","article-title":"A heuristic approach for the truck and trailer routing problem","volume":"61","author":"Caramia","year":"2010","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2023.109238_b7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0305-0548(00)00056-3","article-title":"A tabu search method for the truck and trailer routing problem","volume":"29","author":"Chao","year":"2002","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b8","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","article-title":"Solving the steiner tree problem on a graph using branch and cut","volume":"4","author":"Chopra","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/j.cie.2023.109238_b9","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","article-title":"Combinatorial benders\u2019 cuts for mixed-integer linear programming","volume":"54","author":"Codato","year":"2006","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"key":"10.1016\/j.cie.2023.109238_b11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/j.cie.2023.109238_b12","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.cor.2012.08.007","article-title":"Truck and trailer routing - problems, heuristics and computational experience","volume":"40","author":"Derigs","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b13","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic","year":"1970","journal-title":"Soviet Mathematics: Doklady"},{"key":"10.1016\/j.cie.2023.109238_b14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cie.2023.109238_b15","first-page":"5","article-title":"Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem","volume":"12","author":"Drexl","year":"2011","journal-title":"Revista de Metodos Cuantitativos Para la Economia y la Empresa"},{"key":"10.1016\/j.cie.2023.109238_b16","first-page":"63","article-title":"Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments","author":"Drexl","year":"2014","journal-title":"Networks"},{"issue":"125","key":"10.1016\/j.cie.2023.109238_b17","article-title":"Maximum matching and a polyhedron with 0,1-vertices","author":"Edmonds","year":"1965","journal-title":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics"},{"key":"10.1016\/j.cie.2023.109238_b18","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Traveling salesman problems with profits","volume":"39","author":"Feillet","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.cie.2023.109238_b19","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1057\/jors.1988.97","article-title":"The vehicle scheduling problem with multiple vehicle types","volume":"39","author":"Ferland","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2023.109238_b20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0377-2217(95)00175-1","article-title":"Vehicle routing problem with trailers","volume":"93","author":"Gerdessen","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109238_b21","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02239975","article-title":"A cutting plane algorithm for minimum perfect 2-matchings","volume":"39","author":"Gr\u00f6tschel","year":"1988","journal-title":"Computing"},{"key":"10.1016\/j.cie.2023.109238_b22","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","article-title":"The selective travelling salesman problem","volume":"26","author":"Laporte","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.cie.2023.109238_b24","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1016\/j.cor.2008.04.005","article-title":"Solving the truck and trailer routing problem based on a simulated annealing heuristic","volume":"36","author":"Lin","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b25","doi-asserted-by":"crossref","first-page":"15244","DOI":"10.1016\/j.eswa.2011.05.075","article-title":"A simulated annealing heuristic for the truck and trailer routing problem with time windows","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2023.109238_b26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/j.cie.2023.109238_b27","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.cor.2017.01.020","article-title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","volume":"83","author":"Parragh","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b28","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/trsc.2017.0765","article-title":"Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows","volume":"52","author":"Rothenb\u00e4cher","year":"2018","journal-title":"Transportation Science"},{"key":"10.1016\/j.cie.2023.109238_b29","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1016\/j.cor.2004.08.002","article-title":"A tabu search heuristic for the truck and trailer routing problem","volume":"33","author":"Scheuerer","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b30","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF02023006","article-title":"Solving real-life vehicle routing problems efficiently using tabu search","volume":"41","author":"Semet","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b31","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2023.109238_b32","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ejor.2004.11.019","article-title":"A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems","volume":"172","author":"Tan","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109238_b33","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.engappai.2010.01.013","article-title":"GRASP\/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots","volume":"23","author":"Villegas","year":"2010","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.cie.2023.109238_b34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.ejor.2013.04.026","article-title":"A matheuristic for the truck and trailer routing problem","volume":"230","author":"Villegas","year":"2013","journal-title":"European Journal of Operational Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835223002620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835223002620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T06:56:44Z","timestamp":1694674604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835223002620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":34,"alternative-id":["S0360835223002620"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2023.109238","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2023.109238","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"109238"}}