The vehicle-routing problem with time windows and driver-specific times

DOI10.1016/J.EJOR.2015.09.015zbMath1346.90174OpenAlexW1640036710MaRDI QIDQ322409

Michael Schneider

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.015

zbMATH Keywords

metaheuristicsvehicle routingtime windowsdriver-specific timesrouting consistency

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Resilient route design for collection of material from suppliers with split deliveries and stochastic demands ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Designing granular solution methods for routing problems with time windows ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Models and algorithms for the delivery and installation routing problem ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the time travel approach for handling time windows in vehicle routing problems
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• 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
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• 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
• Future paths for integer programming and links to artificial intelligence
• Diversification strategies in tabu search algorithms for the maximum clique problem
• The efficacy of exclusive territory assignments to delivery vehicle drivers
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• Vehicle Routing
• 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
• The fleet size and mix vehicle routing problem with time windows
• Routing a Heterogeneous Fleet of Vehicles
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• The Vehicle Scheduling Problem with Multiple Vehicle Types
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Handbook of metaheuristics

This page was built for publication: The vehicle-routing problem with time windows and driver-specific times