A branch-and-price approach for the parallel drone scheduling vehicle routing problem

2021 ◽  
Author(s):  
Ritwik Raj ◽  
Dowon Lee ◽  
Seunghan Lee ◽  
Jose Walteros ◽  
Chase Murray
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Approach

A branch-and-price approach for a multi-period vehicle routing problem

2015 ◽  
Vol 55 ◽  
pp. 167-184 ◽  
Author(s):  
Iman Dayarian ◽  
Teodor Gabriel Crainic ◽  
Michel Gendreau ◽  
Walter Rei
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Approach

scholarly journals Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures

2019 ◽  
Vol 53 (3) ◽  
pp. 850-866 ◽  
Author(s):  
Ann-Kathrin Rothenbächer
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Constraint Aggregation ◽  
Routing Problem ◽  
Shortest Path Problems ◽  
Acceleration Techniques ◽  
Periodic Vehicle Routing Problem ◽  
The Impact ◽  
Periodic Vehicle Routing

This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortest-path problems with resource constraints. They can be based on one of two new types of networks and solved with a labeling algorithm, which uses several known acceleration techniques, such as the [Formula: see text]-path relaxation and dynamic halfway points within bidirectional labeling. For instances in which schedule sets fulfill a certain symmetry condition, we present specialized improvements of the algorithm, such as constraint aggregation and symmetry breaking. Computational tests on benchmark instances for the PVRPTW show the effectiveness of our algorithm. Furthermore, we analyze the impact of different schedule structures on run times and objective function values. The online appendix is available at https://doi.org/10.1287/trsc.2018.0855 .

A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking

2011 ◽  
Vol 37 ◽  
pp. 249-254 ◽  
Author(s):  
Fernando Afonso Santos ◽  
Geraldo Robson Mateus ◽  
Alexandre Salles da Cunha
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Cross Docking ◽  
Price Algorithm

A branch‐and‐price algorithm for the vehicle routing problem with time windows on a road network

Networks ◽  
2018 ◽  
Vol 73 (4) ◽  
pp. 401-417 ◽  
Author(s):  
Hamza Ben Ticha ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Alain Quilliot ◽  
Tom Van Woensel
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Road Network ◽  
Time Windows ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Algorithm
Sign in / Sign up

Export Citation Format

Share Document