Packing first, routing second—a heuristic for the vehicle routing and loading problem

Bortfeldt, Andreas; Homberger, Jörg

doi:10.1016/j.cor.2012.09.005

Cited by 59 publications

(56 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are some exceptions to this method of incorporating loading constraints in VRP models, such as the sequential approach of Moura and Oliveira (2009) in which the container loading and the vehicle routes are planned at the same time. Another example is the packing first-routing second heuristic of Bortfeldt and Homberger (2013), in which first a feasible packing scheme for each particular customer is computed after which the routes are constructed, followed by an optimization of the overall packing plan of all customers belonging to a single route.…”

Section: Discussion and Future Researchmentioning

confidence: 99%

“…Sequence-based loading is incorporated in most models as shown in Table 1. Most papers assume a homogeneous fleet, while only three papers consider time windows (Moura 2008;Moura and Oliveira 2009;Bortfeldt and Homberger 2013). An exact solution method and a formulation of the 3L-CVRP is provided by Junqueira et al (2013).…”

Section: Three-dimensional Loading Cvrpmentioning

confidence: 99%

“…constraint, referring to items that are marked with a "thisway-up!" label (Bortfeldt and Homberger 2013). The horizontal orientation of the items can be fixed as well (e.g.…”

Section: Orientation Constraintsmentioning

confidence: 99%

See 2 more Smart Citations

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional packing constraints, unloading sequence constraints, stability constraints and axle weight limits. Ignoring these constraints impairs planning and induces last-minute changes resulting in additional costs. Developing vehicle routing models incorporating loading constraints is critical to more efficient route planning. The last couple of years has seen a huge increase of contributions to this field of research with almost 60 % of these being published after 2009. Our contribution is twofold. First, we overview the recent developments in the literature on all vehicle types in which loading constraints play a key role (trucks, airplanes, ships, and automated guided vehicles), using a state-of-the-art classification scheme to identify the loading constraints considered in each article. Second, we identify research gaps and opportunities for future research.

show abstract

Section: Discussion and Future Researchmentioning

confidence: 99%

Section: Three-dimensional Loading Cvrpmentioning

confidence: 99%

See 1 more Smart Citation

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Besides the non-overlap of the three-dimensional boxes, the constraints that have been usually considered are the vertical stability of the cargo and the multi-drop situations (also known as LIFO constraints), although other constraints may also appear, such as the load bearing strength of the boxes, time windows and pickups and deliveries. The approaches used to solve the problem have been mainly heuristic (Bortfeldt, 2012;Bortfeldt & Homberger, 2013;Ceschia, Schaerf, & Stützle 2013;Fuellerer, Doerner, Hartl, & Iori, 2010;Gendreau, Iori, Laporte, & Martello, 2006;Lacomme, Toussaint, & Duhamel, 2013;Moura & Oliveira, 2009;Ruan, Zhang, Miao, & Shen, 2013;Tao & Wang, 2013;Tarantilis, Zachariadis, & Kiranoudis, 2009;Zachariadis, Tarantilis, & Kiranoudis, 2012Zhu, Qin, Lim, & Wang, 2012). The integrated problem is usually hierarchically decomposed, where the vehicle routing is solved at the higher level and the container loading at the lower level.…”

Section: Introductionmentioning

confidence: 99%

Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier

Junqueira

Morábito

2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…Two heuristic approaches to solve this variant of the original problem are proposed and compared. A two-stage heuristic for solving the problem considered in [13] is presented in [23]. The first stage optimizes the packing problem, while the second deals with the aspect of the corresponding routing problem.…”

Section: Problem Definitionmentioning

confidence: 99%

A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP)

Escobar-Falcón

Álvarez‐Martínez

Echeverri

et al. 2015

Rev. Fac. Ing. Antioquia

View full text Add to dashboard Cite

This paper presents a hybrid algorithm for solving the Capacitated VehicleRouting Problem with practical three-dimensional loading constraint. This problem is known as 3L-CVRP (Three-dimensional Loading Capacitated Vehicle Routing Problem). The proposed methodology consists of two phases. The first phase uses an optimization procedure based on cuts to obtain solutions for the well-known Capacitated Vehicle Routing Problem (CVRP). The second phase validates the results of the first phase of a GRASP algorithm (Greedy Randomized Adaptive Search Procedure). In particular, the GRASP approach evaluates the packing constraints for each performed route of the CVRP. The proposed hybrid algorithm uses a relaxation of the classical model of two sub-indices for the vehicle routing problem. Specifically different types of cuts are added: subtour elimination, capacity-cut constraints, and packing-cut constrains. The proposed algorithm is compared with the most efficient approaches for the 3L-CVRP on the set of benchmark instances considered in the literature. The computational results indicate that the proposed approach is able to obtain good solutions, improving some of the best-known solutions from the literature. RESUMEN:En este artículo se presenta un algoritmo híbrido para resolver el problema de ruteo de vehículos con restricciones de capacidad y restricciones prácticas de empaquetamiento tridimensional, este problema en la literatura es conocido como 3L-CVRP (Capacitated Vehicle Routing Problem and Container Loading Problem). La metodología de solución propuesta en este trabajo consiste de dos fases. La primera utiliza un procedimiento de optimización basado en cortes para el Problema de Rutas de Vehículos Capacitados (CVRP). La segunda valida las soluciones de la fase anterior a través de un algoritmo GRASP (Greedy Randomized Adaptive Search Procedure), el cual evalúa las restricciones de empaquetamiento de cada una de las rutas. Para el algoritmo híbrido se utiliza la relajación del modelo clásico de dos subíndices para el problema de ruteo de vehículos. En particular diferentes tipos de cortes son adicionados: eliminación de subtours, cortes debido a las restricciones de capacidad y cortes para restricciones de empaquetamiento. El algoritmo propuesto ha sido comparado con los algoritmos más eficaces para el 3L-CVRP en el conjunto clásico de instancias presentadas en la literatura. Los resultados computacionales muestran que el método propuesto es capaz de obtener buenos resultados perfeccionando algunas de las mejores soluciones conocidas propuestas en la literatura.

show abstract

Packing first, routing second—a heuristic for the vehicle routing and loading problem

Cited by 59 publications

References 48 publications

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier

A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP)

Contact Info

Product

Resources

About