A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem

Tarantilis, Christos D.; Zachariadis, Emmanouil E.; Kiranoudis, Chris T.

doi:10.1109/tits.2009.2020187

Cited by 132 publications

(72 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is therefore necessary that all items demanded by a customer are shipped in the same vehicle. As a result, connectivity constraints are incorporated in most VRP models (e.g., Gendreau et al 2006;Tarantilis et al 2009;Fuellerer et al 2010;Ruan et al 2013). Secondly, separation constraints may be specified to prevent that certain types of products are shipped in the same container or vehicle.…”

Section: Allocation Constraintsmentioning

confidence: 99%

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: Allocation Constraintsmentioning

confidence: 99%

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

“…We have compared our algorithm with six popular and efficient algorithms, namely, simulated annealing with Tabu (OSA) [28], Tabu search for VRP (TS) by Toth and Vigo [31] adaptive memory programming method called (SEPAS) by Tarantilis [22], a savings ants (SA) [32], GRASP algorithm of Prins (GRELS) [33] and finally a GRASP algorithm based on Neighborhood Search (MPNS-GRASP) [26].…”

Section: Results and Discussion Of The Proposed Heuristicmentioning

confidence: 99%

“…However, they are slower than the constructive heuristics and depend on the initial solutions. In addition to the previous methods, several hybrid methods have emerged in recent years [21,22], which hybridize between exact methods, metaheuristics or constructive heuristics.…”

Section: Introductionmentioning

confidence: 99%

A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem

Layeb

Ammi

Chikhi

2013

CIT

View full text Add to dashboard Cite

This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem. This problem is characterized by a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic, and a simulated annealing procedure as an improvement phase. The new constructive heuristic uses four steps to generate feasible initial solutions, and the simulated annealing enhances these solutions found to reach the optimal one. We tested our algorithm on two sets of benchmark instances and the obtained results are very encouraging.

show abstract

“…Finally, a tabu search algorithm solves the corresponding routing problem. [17] propose a generalization of the three-dimensional for the bi-dimensional case. In [18], an Ant Colony Optimization (ACO) is presented for the 3L-CVRP.…”

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

A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem

Cited by 132 publications

References 13 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

A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem

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

Contact Info

Product

Resources

About