A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
From MaRDI portal
Publication:2339816
DOI10.1016/j.disopt.2014.03.001zbMath1308.90144OpenAlexW1992769367MaRDI QIDQ2339816
Claudio Contardo, Rafael Martinelli
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: http://www.archipel.uqam.ca/5078/2/mdvrp-cvrp-exact.pdf
column generationexact algorithmmulti-depot vehicle routing problemcapacitated vehicle routing problem
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (46)
An optimization algorithm for a capacitated vehicle routing problem with time windows ⋮ Efficient elementary and restricted non-elementary route pricing ⋮ Exact Algorithms for the Chance-Constrained Vehicle Routing Problem ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ The vehicle routing problem with service level constraints ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ Estimating the marginal cost to deliver to individual customers ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Delivery route optimization with automated vehicle in smart urban environment ⋮ Decision Support System for the Multi-depot Vehicle Routing Problem ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Exact solution of network flow models with strong relaxations ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ Limited memory rank-1 cuts for vehicle routing problems ⋮ Branch-and-price for a multi-attribute technician routing and scheduling problem ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Probabilistic time-dependent vehicle routing problem ⋮ Solving bin packing problems using VRPSolver models ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ Exact algorithms for the chance-constrained vehicle routing problem ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ Using VRPSolver to efficiently solve the \textsc{differential harvest problem} ⋮ A unified exact approach for clustered and generalized vehicle routing problems
Uses Software
Cites Work
- Unnamed Item
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An exact solution framework for a broad class of vehicle routing problems
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- A computational comparison of flow formulations for the capacitated location-routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Exact Method for the Capacitated Location-Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- An Exact Algorithm for the Period Routing Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- The complexity of theorem-proving procedures
This page was built for publication: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
