A note on the time travel approach for handling time windows in vehicle routing problems
From MaRDI portal
Publication:336572
DOI10.1016/j.cor.2013.02.002zbMath1348.90126OpenAlexW2079429664MaRDI QIDQ336572
Andreas Stenger, Bastian Sand, Michael Schneider
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.002
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ The electric fleet size and mix vehicle routing problem with time windows and recharging stations ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ Designing granular solution methods for routing problems with time windows ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
Uses Software
Cites Work
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Vehicle routing problem with time windows and a limited number of vehicles.
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A unified tabu search heuristic for vehicle routing problems with time windows
This page was built for publication: A note on the time travel approach for handling time windows in vehicle routing problems
