A note on the time travel approach for handling time windows in vehicle routing problems

DOI10.1016/J.COR.2013.02.002MaRDI QIDQ336572zbMATH OpenOpenAlexFDO

Authors Michael Schneider, Bastian Sand, Andreas Stenger

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

zbMATH Keywords

time windowsvehicle routingefficient constraint handling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• A unified tabu search algorithm for vehicle routing problems with soft time windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
• Tabu search heuristics for the vehicle routing problem with time windows.
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

Cites work

• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The granular tabu search and its application to the vehicle-routing problem
• Vehicle routing problem with time windows and a limited number of vehicles.

Cited in

(8)

• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
• Comparison of anticipatory algorithms for a dial-a-ride problem
• 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
• Designing granular solution methods for routing problems with time windows
• Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A note on the time travel approach for handling time windows in vehicle routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336572)