Implicit depot assignments and rotations in vehicle routing heuristics
From MaRDI portal
Publication:2514807
DOI10.1016/j.ejor.2013.12.044zbMath1304.90046OpenAlexW1993778899MaRDI QIDQ2514807
Michel Gendreau, Thibaut Vidal, Teodor Gabriel Crainic, Christian Prins
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.044
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items
Hybrid metaheuristics for the clustered vehicle routing problem, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, A general VNS for the multi-depot open vehicle routing problem with time windows, The r‐interdiction selective multi‐depot vehicle routing problem, Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Fresh seafood delivery routing problem using an improved ant colony optimization, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, A unified solution framework for multi-attribute vehicle routing problems, Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles, A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- New upper bounds for the multi-depot capacitated arc routing problem
- The case for strategic oscillation
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- A general vehicle routing problem
- The vehicle routing problem. Latest advances and new challenges.
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- A unified solution framework for multi-attribute vehicle routing problems
- The Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Parallel Algorithm for the Vehicle Routing Problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Tour splitting algorithms for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
