A powerful route minimization heuristic for the vehicle routing problem with time windows

DOI10.1016/j.orl.2009.04.006zbMath1173.90358OpenAlexW1981040114WikidataQ110084972 ScholiaQ110084972MaRDI QIDQ1038101

Olli Bräysy, Yuichi Nagata

Publication date: 17 November 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.04.006

zbMATH Keywords

heuristicsvehicle routingtime windowsguided local search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

On service consistency in multi-period vehicle routing, The pickup and delivery problem with alternative locations and overlapping time windows, The vehicle-routing problem with time windows and driver-specific times, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, A tabu search algorithm for the multi-period inspector scheduling problem, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, A case study of consistent vehicle routing problem with time windows, Vehicle routing with arrival time diversification, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows

Cites Work

• Unnamed Item
• Unnamed Item
• A general heuristic for vehicle routing problems
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• Guided Local Search
• An Exchange Heuristic for Routeing Problems with Time Windows