A unified exact approach for clustered and generalized vehicle routing problems
From MaRDI portal
Publication:2108132
DOI10.1016/j.cor.2022.106040OpenAlexW4298148373MaRDI QIDQ2108132
Eduardo Uchoa, Matheus Freitas, João Marcos Pereira Silva
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106040
Related Items
Uses Software
Cites Work
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Hybrid metaheuristics for the clustered vehicle routing problem
- A branch and bound algorithm for the capacitated vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Limited memory rank-1 cuts for vehicle routing problems
- Large multiple neighborhood search for the clustered vehicle-routing problem
- An efficient transformation of the generalized vehicle routing problem
- A generic exact solver for vehicle routing and related problems
- A generic exact solver for Vehicle Routing and related problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- A unified solution framework for multi-attribute vehicle routing problems
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Some applications of the generalized vehicle routing problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- Shortest Path Problems with Resource Constraints
