Column generation based heuristic for tactical planning in multi-period vehicle routing
Publication:2643933
DOI10.1016/J.EJOR.2006.02.030zbMath1278.90048OpenAlexW2043341809MaRDI QIDQ2643933
François Vanderbeck, M. Mourgaya
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.030
heuristicsinteger programmingcombinatorial optimizationbranch and boundroutingOR in strategic planning
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (32)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The periodic vehicle routing problem with intermediate facilities
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- The Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Efficient Production-Distribution System Design
- The period routing problem
- The periodic Vehicle routing problem: classification and heuristic
- A multiphase approach to the period routing problem
- A Heuristic for the Periodic Vehicle Routing Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An improved heuristic for the period vehicle routing problem
- A Heuristic Method for the Set Covering Problem
- Column Generation
- Integer Programming and Combinatorial Optimization
This page was built for publication: Column generation based heuristic for tactical planning in multi-period vehicle routing