A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand

2017 ◽  
pp. 921-934 ◽  
Author(s):  
Jonatas B. C. Chagas ◽  
André G. Santos
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Heterogeneous Demand ◽  
Price Algorithm

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

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

2010 ◽  
Vol 206 (2) ◽  
pp. 341-349 ◽  
Author(s):  
Gabriel Gutiérrez-Jarpa ◽  
Guy Desaulniers ◽  
Gilbert Laporte ◽  
Vladimir Marianov
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Algorithm

A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes

2014 ◽  
Vol 48 (3) ◽  
pp. 425-441 ◽  
Author(s):  
Ibrahim Muter ◽  
Jean-François Cordeau ◽  
Gilbert Laporte
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Algorithm

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

2020 ◽  
Author(s):  
Alexandre M. Florio ◽  
Richard F. Hartl ◽  
Stefan Minner ◽  
Juan-José Salazar-González
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Negative Binomial ◽  
Probability Distributions ◽  
Sensitivity Analyses ◽  
Branch And Price ◽  
Expected Cost ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Price Algorithm

In many routing applications, it is necessary to place limits on the duration of the individual routes. When demands are stochastic and restocking during route execution is allowed, the durations of the resulting routes are also stochastic. In this paper, we consider the vehicle routing problem with stochastic demands and probabilistic duration constraints (VRPSD-PDC). We assume optimal restocking, which means that, during the route execution, replenishment trips to the depot are performed in an optimal way. The resulting optimization problem calls for a set of routes with minimal total expected cost for visiting all customers, such that the duration of each route, with a given probability, does not exceed a prescribed limit. We solve the VRPSD-PDC with a novel branch-and-price algorithm. An orienteering-based completion bound is proposed to control the growth of labels in the pricing algorithm. Feasibility of a priori routes is verified by applying Chebyshev’s bounds, by Monte Carlo simulation and statistical inference, or by analytically deriving the distribution of the route duration. Consistency checks are incorporated into the branch-and-price framework to detect statistical errors. Computational experiments are performed with demands following binomial, Poisson, or negative binomial probability distributions and with duration constraints enforced at the levels of 90%, 95%, and 98%. Optimal solutions to the VRPSD-PDC may contain routes that serve an expected demand that is larger than the capacity of the vehicle. These solutions actively employ optimal restocking to reduce traveling costs and the number of required vehicles. Sensitivity analyses indicate that high demand variability negatively impacts the solution, both in terms of total expected cost and the number of routes employed.

scholarly journals A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations

2017 ◽  
Vol 100 ◽  
pp. 115-137 ◽  
Author(s):  
Gizem Ozbaygin ◽  
Oya Ekin Karasan ◽  
Martin Savelsbergh ◽  
Hande Yaman
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Price ◽  
Routing Problem ◽  
Price Algorithm
Sign in / Sign up

Export Citation Format

Share Document