A branch-and-price approach for a multi-period vehicle routing problem
From MaRDI portal
Publication:337422
DOI10.1016/j.cor.2014.06.004zbMath1348.90079OpenAlexW2093148484MaRDI QIDQ337422
Teodor Gabriel Crainic, Iman Dayarian, Michel Gendreau, Walter Rei
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.004
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
Accelerating the branch-and-price algorithm using machine learning, Vehicle routing for milk collection with gradual blending: a case arising in Chile, The multi-period multi-trip container drayage problem with release and due dates, Branch-and-price algorithm for fuzzy integer programming problems with block angular structure, An exact solution approach for the inventory routing problem with time windows, A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Dynamic multi-period vehicle routing with touting, A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient elementary and restricted non-elementary route pricing
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Stochastic vehicle routing with modified savings algorithm
- The dynamic multi-period vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- A column generation approach for a multi-attribute vehicle routing problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Stochastic Vehicle Routing Problem with Restocking
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Period Vehicle Routing Problem and its Extensions
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Shortest Path Problems with Resource Constraints
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Priori Optimization