DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
From MaRDI portal
Publication:604947
DOI10.1007/s10732-010-9126-2zbMath1198.90054OpenAlexW1977997977MaRDI QIDQ604947
Pablo Garrido, María-Cristina Riff
Publication date: 12 November 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9126-2
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ A RNN-based hyper-heuristic for combinatorial problems ⋮ Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- A stochastic and dynamic routing policy using branching processes with state dependent immigration
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A study on the use of ``self-generation in memetic algorithms
- An improved ant system algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A new heuristic for the fleet size and mix vehicle routing problem
- Dynamic vehicle routing using genetic algorithms
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Vehicle routing and scheduling with dynamic travel times
- Ant colony system for a dynamic vehicle routing problem
- Drive: Dynamic Routing of Independent Vehicles
- Diversion Issues in Real-Time Vehicle Dispatching
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- The period routing problem
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Parallel Savings Based Heuristics for the Delivery Problem
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Repeated Matching Heuristic for the Vehicle Routeing Problem
- Selection of Vehicle Routing Heuristic Using Neural Networks
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A unified tabu search heuristic for vehicle routing problems with time windows
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A Location Based Heuristic for General Routing Problems
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
