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

DOI10.1016/J.EJOR.2015.09.015zbMATH Open1346.90174OpenAlexW1640036710MaRDI QIDQ322409FDOQ322409

Authors: 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

Recommendations

• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Tabu search heuristics for the vehicle routing problem with time windows.
• Vehicle routing problem with time windows and a limited number of vehicles.
• `T' for tabu and time dependent travel time
• Open vehicle routing problem with driver nodes and time deadlines

zbMATH Keywords

metaheuristicstime windowsvehicle routingdriver-specific timesrouting consistency

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A reactive variable neighborhood search for the vehicle-routing problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• 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
• An Exchange Heuristic for Routeing Problems with Time Windows
• A general heuristic for vehicle routing problems
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Handbook of metaheuristics
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Routing a heterogeneous fleet of vehicles
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A general vehicle routing problem
• A powerful route minimization heuristic 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
• Title not available (Why is that?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• 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 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
• A note on the time travel approach for handling time windows in vehicle routing problems
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• The Vehicle Scheduling Problem with Multiple Vehicle Types
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Cited In (10)

• The time-dependent vehicle routing problem with time windows and road-network information
• Models and algorithms for the delivery and installation routing problem
• Driving time and rest periods in vehicle routing
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
• Open vehicle routing problem with driver nodes and time deadlines
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands
• Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
• Designing granular solution methods for routing problems with time windows
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
• Title not available (Why is that?)

Uses Software

• VRP

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

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