A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
DOI10.1007/BF02098280zbMATH Open0839.90031OpenAlexW2076862344MaRDI QIDQ1908292FDOQ1908292
Eleni Hadjiconstantinou, Aristide Mingozzi, Nicos Christofides
Publication date: 18 March 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02098280
Recommendations
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- Publication:4955264
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A new subtour elimination constraint for the vehicle routing problem
Dynamic programming (90C39) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Validation of subgradient optimization
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Title not available (Why is that?)
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Optimal Routing under Capacity and Distance Restrictions
- An efficient algorithm for K shortest simple paths
Cited In (20)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Implicit depot assignments and rotations in vehicle routing heuristics
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- A metaheuristic for stochastic service network design
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- An algorithm for the capacitated vehicle routing problem with route balancing
- A new method for solving capacitated location problems based on a set partitioning approach
- A dual ascent procedure for the set partitioning problem
- Title not available (Why is that?)
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Lower bounds from state space relaxations for concave cost network flow problems
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
Uses Software
This page was built for publication: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908292)
