A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

2022 ◽  
Author(s):  
Xiangyi Zhang ◽  
Lu Chen ◽  
Michel Gendreau ◽  
André Langevin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Cut ◽  
Two Dimensional ◽  
Routing Problem ◽  
Loading Constraints

A branch-and-cut approach for the vehicle routing problem with loading constraints

2016 ◽  
Vol 47 ◽  
pp. 1-13 ◽  
Author(s):  
Pedro Hokama ◽  
Flávio K. Miyazawa ◽  
Eduardo C. Xavier
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Cut ◽  
Routing Problem ◽  
Loading Constraints

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

2007 ◽  
Vol 41 (2) ◽  
pp. 253-264 ◽  
Author(s):  
Manuel Iori ◽  
Juan-José Salazar-González ◽  
Daniele Vigo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Two Dimensional ◽  
Routing Problem ◽  
Exact Approach ◽  
Loading Constraints

scholarly journals A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints

2021 ◽  
Author(s):  
Leandro Pinto Fava ◽  
João Carlos Furtado ◽  
Gilson Augusto Helfer ◽  
Marko Beko ◽  
Sérgio Duarte Correia ◽  
...  
Keyword(s):  
Graph Theory ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Neighborhood Search ◽  
Two Dimensional ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Graph Modeling ◽  
Loading Constraints ◽  
Capacitated Vehicle

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

scholarly journals Uma revisão sistemática da literatura sobre o Problema de Roteirização de Veículos Capacitados com Restrições de Carregamento Bidimensional (2L-CVRP)

TRANSPORTES ◽  
2017 ◽  
Vol 25 (1) ◽  
pp. 61
Author(s):  
Bianca Passos Arpini ◽  
Rodrigo Alvarenga Rosa
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Two Dimensional ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Loading Constraints ◽  
Capacitated Vehicle

Roteirização e carregamento são dois aspectos centrais na gestão de distribuição logística. Recentemente, o pro-blema integrado de roteirização e carregamento tem atraído a atenção da comunidade de pesquisa operacional. Esse interesse se deve não só a seu enorme potencial de aplicação em situações reais, mas também aos desafios metodológicos para sua solução, pois se trata da combinação de dois problemas de elevada complexidade computacional. Este artigo tem por objetivo realizar uma revisão sistemática das principais publicações relacionadas ao Problema de Roteirização de Veículos Capacita-dos com Restrições de Carregamento Bidimensional (Capacitated Vehicle Routing Problem with Two-dimensional Loading Constraints – 2L-CVRP). O intuito é analisar o que foi publicado até o momento e identificar abordagens de solução, carac-terísticas incorporadas ao problema e lacunas de pesquisa que ainda não foram tratadas.

Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks ◽  
2008 ◽  
Vol 51 (2) ◽  
pp. 153-153 ◽  
Author(s):  
Michel Gendreau ◽  
Manuel Iori ◽  
Gilbert Laporte ◽  
Silvano Martello
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Two Dimensional ◽  
Routing Problem ◽  
Search Heuristic ◽  
Loading Constraints

The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints

2016 ◽  
Vol 251 (2) ◽  
pp. 369-386 ◽  
Author(s):  
Emmanouil E. Zachariadis ◽  
Christos D. Tarantilis ◽  
Chris T. Kiranoudis
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Two Dimensional ◽  
Routing Problem ◽  
Loading Constraints

Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints

2021 ◽  
Author(s):  
Xiangyi Zhang ◽  
Lu Chen ◽  
Michel Gendreau ◽  
André Langevin
Keyword(s):  
Vehicle Routing ◽  
Operations Research ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Learning Model ◽  
Exact Algorithms ◽  
Two Dimensional ◽  
Branch And Price ◽  
Routing Problem ◽  
Loading Constraints

A capacitated vehicle routing problem with two-dimensional loading constraints is addressed. Associated with each customer are a set of rectangular items, the total weight of the items, and a time window. Designing exact algorithms for the problem is very challenging because the problem is a combination of two NP-hard problems. An exact branch-and-price algorithm and an approximate counterpart are proposed to solve the problem. We introduce an exact dominance rule and an approximate dominance rule. To cope with the difficulty brought by the loading constraints, a new column generation mechanism boosted by a supervised learning model is proposed. Extensive experiments demonstrate the superiority of integrating the learning model in terms of CPU time and calls of the feasibility checker. Moreover, the branch-and-price algorithms are able to significantly improve the solutions of the existing instances from literature and solve instances with up to 50 customers and 103 items. Summary of Contribution: We wish to submit an original research article entitled “Learning-based branch-and-price algorithms for a vehicle routing problem with time windows and two-dimensional loading constraints” for consideration by IJOC. We confirm that this work is original and has not been published elsewhere, nor is it currently under for publication elsewhere. In this paper, we report a study in which we develop two branch-and-price algorithms with a machine learning model injected to solve a vehicle routing problem integrated the two-dimensional packing. Due to the complexity brought by the integration, studies on exact algorithms in this field are very limited. Our study is important to the field, because we develop an effective method to significantly mitigate computational burden brought by the packing problem so that exactness turns to be achievable within reasonable time budget. The approach can be generalized to the three-dimensional case by simply replacing the packing algorithm. It can also be adapted for other VRPs when high-dimensional loading constraints are concerned. Broadly speaking, the study is a typical example of adopting supervised learning to achieve acceleration for operations research algorithms, which expands the envelop of computing and operations research. Hence, we believe this manuscript is appropriate for publication by IJOC.

Sign in / Sign up

Export Citation Format

Share Document