New benchmark instances for the capacitated vehicle routing problem
From MaRDI portal
Publication:1752871
DOI10.1016/J.EJOR.2016.08.012zbMATH Open1394.90130OpenAlexW2509755532MaRDI QIDQ1752871FDOQ1752871
Authors: Eduardo Uchoa, Diego Pecin, Artur Alves Pessoa, Marcus Poggi, T. Vidal, A. Subramanian 
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- The truck dispatching problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- On the capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- New route relaxation and pricing strategies for the vehicle routing problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- Title not available (Why is that?)
- A hybrid algorithm for a class of vehicle routing problems
- 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
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Probabilistic diversification and intensification in local search for vehicle routing
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Title not available (Why is that?)
- Multicommodity flow models for spanning trees with hop constraints
- An exact rational mixed-integer programming solver
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- A branch-and-cut algorithm for vehicle routing problems
Cited In (64)
- New benchmark instances for the inventory routing problem
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
- Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
- Learning to repeatedly solve routing problems
- An improved model for estimating optimal VRP solution values
- On the exact solution of the multi-depot open vehicle routing problem
- Preprocessing to reduce vehicle capacity for routing problems
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut
- An improved hybrid genetic search with data mining for the CVRP
- Systematic review of the latest scientific publications on the vehicle routing problem
- Routing one million customers in a handful of minutes
- Internalizing negative externalities in vehicle routing problems through green taxes and green tolls
- Heuristics for vehicle routing problems: sequence or set optimization?
- Knowledge-guided local search for the vehicle routing problem
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Efficiently solving very large-scale routing problems
- Workload equity in vehicle routing: the impact of alternative workload resources
- 2DPackLib: a two-dimensional cutting and packing library
- The min-cost parallel drone scheduling vehicle routing problem
- A generic exact solver for vehicle routing and related problems
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- A branch-and-cut embedded matheuristic for the inventory routing problem
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- Visual attractiveness in routing problems: a review
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
- An open-source desktop application for generating arc-routing benchmark instances
- Neural networks for local search and crossover in vehicle routing: a possible overkill?
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- Column elimination for capacitated vehicle routing problems
- 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
- An efficient implementation of a static move descriptor-based local search heuristic
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
- Solution strategies for the vehicle routing problem with backhauls
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- A progressive filtering heuristic for the location-routing problem and variants
- A multiperiod drayage problem with customer-dependent service periods
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Estimating the marginal cost to deliver to individual customers
- Exact approaches for the minimum subgraph diameter problem
- Adjusting the order crossover operator for capacitated vehicle routing problems
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- On the exact solution of vehicle routing problems with backhauls
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Iterated local search for the vehicle routing problem with a private fleet and a common carrier
- Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm
- Deep policy dynamic programming for vehicle routing problems
- Neural large neighborhood search for routing problems
- BPPLIB: a library for bin packing and cutting stock problems
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- In-depth analysis of granular local search for capacitated vehicle routing
Uses Software
This page was built for publication: New benchmark instances for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752871)
