A generic exact solver for vehicle routing and related problems
From MaRDI portal
Publication:2196312
DOI10.1007/s10107-020-01523-zzbMath1450.90017OpenAlexW3037819751MaRDI QIDQ2196312
François Vanderbeck, Ruslan Sadykov, Artur Alves Pessoa, Eduardo Uchoa
Publication date: 28 August 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02178171v2/file/manuscript-clear.pdf
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (33)
The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ Guidelines for the computational testing of machine learning approaches to vehicle routing problems ⋮ Multi-shuttle crane scheduling in automated storage and retrieval systems ⋮ Adjusting the order crossover operator for capacitated vehicle routing problems ⋮ Approximating the chance-constrained capacitated vehicle routing problem with robust optimization ⋮ Column elimination for capacitated vehicle routing problems ⋮ Neural networks for local search and crossover in vehicle routing: a possible overkill? ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Estimating the marginal cost to deliver to individual customers ⋮ Research trends in combinatorial optimization ⋮ Bin Packing Problem with Time Lags ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ The transportation problem with packing constraints ⋮ Budget-balanced and strategy-proof auctions for ridesharing ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem ⋮ Exact solution of network flow models with strong relaxations ⋮ Learning to repeatedly solve routing problems ⋮ Mixed-integer linear optimization for full truckload pickup and delivery ⋮ New exact techniques applied to a class of network flow formulations ⋮ Two-echelon vehicle routing problems: a literature review ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ Using VRPSolver to efficiently solve the \textsc{differential harvest problem} ⋮ Generalized relax-and-fix heuristic ⋮ A unified exact approach for clustered and generalized vehicle routing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Solving the team orienteering problem with cutting planes
- A branch and bound algorithm for the capacitated vehicle routing problem
- An exact method with variable fixing for solving the generalized assignment problem
- Stabilized branch-and-price algorithms for vector packing problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A computational study of exact knapsack separation for the generalized assignment problem
- The team orienteering problem
- The capacitated arc routing problem: Valid inequalities and facets
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- The vehicle routing problem with service level constraints
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- An abstract model for branching and its application to mixed integer programming
- Limited memory rank-1 cuts for vehicle routing problems
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- New benchmark instances for the capacitated vehicle routing problem
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new branching strategy for time constrained routing problems with application to backhauling
- Optimal solutions for routing problems with profits
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A generic exact solver for Vehicle Routing and related problems
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A unified exact method for solving different classes of vehicle routing problems
- Improved branch-cut-and-price for capacitated vehicle routing
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
- Algorithms for non-linear and stochastic resource constrained shortest path
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Lagrangian duality applied to the vehicle routing problem with time windows
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Solving capacitated arc routing problems using a transformation to the CVRP
- The Truck Dispatching Problem
- A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- The capacitated team orienteering and profitable tour problems
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
- Reformulation and Decomposition of Integer Programs
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- A branch‐and‐cut algorithm for the Team Orienteering Problem
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
- JuMP: A Modeling Language for Mathematical Optimization
- Lower bounds and algorithms for the 2-dimensional vector packing problem
This page was built for publication: A generic exact solver for vehicle routing and related problems
