A matheuristic for the truck and trailer routing problem |
| |
Authors: | Juan G. Villegas,Christian Prins,Caroline Prodhon,André s L. Medaglia,Nubia Velasco |
| |
Affiliation: | 1. Departamento de Ingeniería Industrial, Universidad de Antioquia, A.A. 1226, Medellin, Colombia;2. Laboratoire d’Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay, Université de Technologie de Troyes, BP 2060, 10010 Troyes Cedex, France;3. Centro para la Optimización y Probabilidad Aplicada (COPA), Departamento de Ingeniería Industrial, Universidad de los Andes, A.A. 4976, Bogotá, DC, Colombia;4. Grupo de Investigación en Producción y Logística (PYLO), Departamento de Ingeniería Industrial, Universidad de los Andes, A.A. 4976, Bogotá, DC, Colombia |
| |
Abstract: | In the truck and trailer routing problems (TTRPs) a fleet of trucks and trailers serves a set of customers. Some customers with accessibility constraints must be served just by truck, while others can be served either by truck or by a complete vehicle (a truck pulling a trailer). We propose a simple, yet effective, two-phase matheuristic that uses the routes of the local optima of a hybrid GRASP × ILS as columns in a set-partitioning formulation of the TTRP. Using this matheuristic we solved both the classical TTRP with fixed fleet and the new variant with unlimited fleet. This matheuristic outperforms state-of-the-art methods both in terms of solution quality and computing time. While the best variant of the matheuristic found new best-known solutions for several test instances from the literature, the fastest variant of the matheuristic achieved results of comparable quality to those of all previous method from the literature with an average speed-up of at least 2.5. |
| |
Keywords: | Vehicle routing problem Truck and trailer routing problem (TTRP) Matheuristic Greedy randomized adaptive search procedure (GRASP) Iterated local search (ILS) Set-partitioning problem |
本文献已被 ScienceDirect 等数据库收录! |
|