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

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

Show other versions (1)

This paper presents a hybrid algorithm for solving the Capacitated Vehicle Routing 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 firs...

Full description

Bibliographic Details
Main Authors: Luis Miguel Escobar-Falcón, David Álvarez-Martínez, Mauricio Granada-Echeverri, John Willmer-Escobar, Rubén Augusto Romero-Lázaro
Format: Article
Language:English
Published: Universidad de Antioquia 2016-03-01
Series:Revista Facultad de Ingeniería Universidad de Antioquia
Subjects:
vehicle routing problem
matheuristics
branch-and-cut
packing
Online Access:https://revistas.udea.edu.co/index.php/ingenieria/article/view/21180

Internet

https://revistas.udea.edu.co/index.php/ingenieria/article/view/21180

Similar Items