New benchmark instances for the capacitated vehicle routing problem

DOI10.1016/j.ejor.2016.08.012zbMath1394.90130OpenAlexW2509755532MaRDI QIDQ1752871

Artur Alves Pessoa, Diego Pecin, Eduardo Uchoa, Thibaut Vidal, Anand Subramanian, Marcus Poggi

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.012

zbMATH Keywords

routingbenchmark instancesexperimental analysis of algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times, Internalizing negative externalities in vehicle routing problems through green taxes and green tolls, Visual attractiveness in routing problems: a review, Iterated local search for the vehicle routing problem with a private fleet and a common carrier, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, Stochastic local search with learning automaton for the swap-body vehicle routing problem, An efficient implementation of a static move descriptor-based local search heuristic, Deep policy dynamic programming for vehicle routing problems, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, A study on the pickup and delivery problem with time windows: matheuristics and new instances, A progressive filtering heuristic for the location-routing problem and variants, A multiperiod drayage problem with customer-dependent service periods, A POPMUSIC matheuristic for the capacitated vehicle routing problem, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood, Guidelines for the computational testing of machine learning approaches to vehicle routing problems, The min-cost parallel drone scheduling vehicle routing problem, An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach, A concise guide to existing and emerging vehicle routing problem variants, Adjusting the order crossover operator for capacitated vehicle routing problems, A branch-and-cut embedded matheuristic for the inventory routing problem, Approximating the chance-constrained capacitated vehicle routing problem with robust optimization, Safe and secure vehicle routing: a survey on minimization of risk exposure, Column elimination for capacitated vehicle routing problems, Neural networks for local search and crossover in vehicle routing: a possible overkill?, On the exact solution of vehicle routing problems with backhauls, Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem, Estimating the marginal cost to deliver to individual customers, Preprocessing to reduce vehicle capacity for routing problems, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, A generic exact solver for vehicle routing and related problems, In-depth analysis of granular local search for capacitated vehicle routing, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, Learning to repeatedly solve routing problems, An improved model for estimating optimal VRP solution values, Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm, Knowledge-guided local search for the vehicle routing problem, Heuristics for vehicle routing problems: sequence or set optimization?, Solution strategies for the vehicle routing problem with backhauls, Efficiently solving very large-scale routing problems, Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, BPPLIB: a library for bin packing and cutting stock problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Workload equity in vehicle routing: the impact of alternative workload resources, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, Neural large neighborhood search for routing problems, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Exact approaches for the minimum subgraph diameter problem, 2DPackLib: a two-dimensional cutting and packing library

Uses Software

• TSPLIB
• QSopt_ex
• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hard benchmark for flowshop scheduling problems minimising makespan
• A hybrid algorithm for a class of vehicle routing problems
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Multicommodity flow models for spanning trees with hop constraints
• A branch-and-cut algorithm for vehicle routing problems
• On the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• The Truck Dispatching Problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Exact Rational Mixed-Integer Programming Solver
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• TSPLIB—A Traveling Salesman Problem Library
• Parallel iterative search methods for vehicle routing problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Improved Branch-Cut-and-Price for Capacitated Vehicle Routing