The vehicle-routing problem with time windows and driver-specific times
From MaRDI portal
(Redirected from Publication:322409)
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
Cites work
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- 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
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A note on the time travel approach for handling time windows in vehicle routing problems
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A two-stage heuristic with ejection pools and generalized ejection chains 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
- An Exchange Heuristic for Routeing Problems with Time Windows
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Future paths for integer programming and links to artificial intelligence
- Handbook of metaheuristics
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Routing a heterogeneous fleet of vehicles
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The Vehicle Scheduling Problem with Multiple Vehicle Types
- The efficacy of exclusive territory assignments to delivery vehicle drivers
- The fleet size and mix vehicle routing problem with time windows
- The granular tabu search and its application to the vehicle-routing problem
- Vehicle Routing
Cited in
(11)- Designing granular solution methods for routing problems with time windows
- Models and algorithms for the delivery and installation routing problem
- scientific article; zbMATH DE number 7295670 (Why is no real title available?)
- The time-dependent vehicle routing problem with time windows and road-network information
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
- Binary driver-customer familiarity in service routing
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Open vehicle routing problem with driver nodes and time deadlines
- Driving time and rest periods in vehicle routing
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands
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)
