DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
From MaRDI portal
Publication:604947
Recommendations
- A survey of hyper-heuristics for dynamic optimization problems
- Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Metaheuristics for dynamic combinatorial optimization problems
- scientific article; zbMATH DE number 1996477
- Evolutionary methods for solving dynamic resource allocation problems
- Differential evolution for a constrained combinatorial optimisation problem
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
- A hybrid evolution strategy for the open vehicle routing problem
- Dynamic and random differential evolution solving constrained optimisation problems
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Location Based Heuristic for General Routing Problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new heuristic for the fleet size and mix vehicle routing problem
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A Repeated Matching Heuristic for the Vehicle Routeing Problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- 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
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- A study on the use of ``self-generation in memetic algorithms
- A subpath ejection method for the vehicle routing problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An improved ant system algorithm for the vehicle routing problem
- Ant colony system for a dynamic vehicle routing problem
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Diversion issues in real-time vehicle dispatching
- DRIVE: Dynamic routing of independent vehicles
- Dynamic vehicle routing using genetic algorithms
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- scientific article; zbMATH DE number 1947428 (Why is no real title available?)
- scientific article; zbMATH DE number 2040652 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- New heuristics for the vehicle routing problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel iterative search methods for vehicle routing problems
- Parallel Savings Based Heuristics for the Delivery Problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Probabilistic diversification and intensification in local search for vehicle routing
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Selection of Vehicle Routing Heuristic Using Neural Networks
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- The granular tabu search and its application to the vehicle-routing problem
- The period routing problem
- Vehicle routing and scheduling with dynamic travel times
Cited in
(4)- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A RNN-based hyper-heuristic for combinatorial problems
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
This page was built for publication: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604947)
