An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
From MaRDI portal
Publication:6551141
DOI10.1016/j.cor.2024.106531MaRDI QIDQ6551141
Said Salhi, Niaz A. Wassan, Jeeu Fong Sze
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
diversificationcritical nodesdynamic vehicle routingre-optimisationroute diversionadaptive variable neighbourhood search
Cites Work
- Unnamed Item
- Unnamed Item
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Time-dependent routing problems: a review
- Online vehicle routing and scheduling with dynamic travel times
- The dynamic dispatch waves problem for same-day delivery
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Variable neighborhood search
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Dynamic vehicle routing: Status and prospects
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- 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
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- A review of dynamic vehicle routing problems
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Vehicle routing and scheduling with dynamic travel times
- Ant colony system for a dynamic vehicle routing problem
- The secure time-dependent vehicle routing problem with uncertain demands
- Diversion Issues in Real-Time Vehicle Dispatching
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Impact of vehicle tracking on a routing problem with dynamic travel times
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Computer Solutions of the Traveling Salesman Problem
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
- Variable neighborhood search: the power of change and simplicity
Related Items (1)
This page was built for publication: An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem