An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
From MaRDI portal
Publication:6551141
Cites work
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A review of dynamic vehicle routing problems
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Ant colony system for a dynamic vehicle routing problem
- Computer Solutions of the Traveling Salesman Problem
- Diversion issues in real-time vehicle dispatching
- Dynamic vehicle routing: Status and prospects
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- Impact of vehicle tracking on a routing problem with dynamic travel times
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Online vehicle routing and scheduling with dynamic travel times
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- The dynamic dispatch waves problem for same-day delivery
- The secure time-dependent vehicle routing problem with uncertain demands
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time-dependent routing problems: a review
- Variable neighborhood search
- Variable neighborhood search: the power of change and simplicity
- Vehicle routing and scheduling with dynamic travel times
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
Cited in
(8)- General VNS for asymmetric vehicle routing problem with time and capacity constraints
- Measuring and evaluating the multi-compartment vehicle routing problem in dynamic environment using two hybrid meta-heuristics approaches
- A new adaptation mechanism of the ALNS algorithm using reinforcement learning
- Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem
- A pharmaceutical distribution network considering supply cycles, waste, and inequity
- A literature review on hub location-routing models and their solution techniques
- A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows
- A novel multi-compartment vehicle routing problem with time windows: reconfigurable vehicles and dynamic compartments
This page was built for publication: An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551141)
