On the capacitated vehicle routing problem

DOI10.1007/s10107-002-0323-0zbMath1030.90131OpenAlexW2097685766MaRDI QIDQ1411621

Leslie E. jun. Trotter, L. Kopman, William R. Pulleyblank, Ted K. Ralphs

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0323-0

zbMATH Keywords

branch and cutdecomposition algorithmseparation algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (54)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Branch-and-cut algorithms for the split delivery vehicle routing problem ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Lifted and local reachability cuts for the vehicle routing problem with time windows ⋮ Multi-period vehicle routing problem with due dates ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows ⋮ A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem ⋮ A two-phase solution algorithm for the flexible periodic vehicle routing problem ⋮ Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ Deterministic optimizational problems of transportation logistics ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ Real-time passenger bus routing problems with preferences and tradeoffs ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ A decision support system for a real vehicle routing problem. ⋮ A branch-and-price algorithm for the robust graph coloring problem ⋮ Recent advances in vehicle routing exact algorithms ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ An optimization algorithm for the inventory routing problem with continuous moves ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ The separation problem of rounded capacity inequalities: some polynomial cases ⋮ On the complexity of the separation problem for rounded capacity inequalities ⋮ A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ The demand weighted vehicle routing problem ⋮ A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Genetic algorithm for combinatorial path planning: the subtour problem ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Minimum makespan vehicle routing problem with compatibility constraints ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ Creating very large scale neighborhoods out of smaller ones by compounding moves ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ A library of local search heuristics for the vehicle routing problem ⋮ Encoding binary arithmetic operations in integer programming formulations ⋮ The pyramidal capacitated vehicle routing problem ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Three algorithms for graph locally harmonious colouring ⋮ Formulations for an inventory routing problem ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants ⋮ A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ A compact transformation of arc routing problems into node routing problems ⋮ Solving capacitated arc routing problems using a transformation to the CVRP

This page was built for publication: On the capacitated vehicle routing problem