A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Publication:339607
DOI10.1016/j.cor.2012.07.018zbMath1349.90137OpenAlexW2035874923WikidataQ115188503 ScholiaQ115188503MaRDI QIDQ339607
Teodor Gabriel Crainic, Michel Gendreau, Thibaut Vidal, Christian Prins
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.018
decompositiontime windowshybrid genetic algorithmvehicle routing problemsdiversity managementneighbourhood search
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (88)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The case for strategic oscillation
- Recyclable waste collection planning -- a case study
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- Special issue on: Rich vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A scatter search for the periodic capacitated arc routing problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Solving a vehicle-routing problem arising in soft-drink distribution
- The Period Vehicle Routing Problem and its Extensions
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- A memetic algorithm for the vehicle routing problem with time windows
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Parallel iterative search methods 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
- A unified tabu search heuristic for vehicle routing problems with time windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
This page was built for publication: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows