DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
type: Item
instance of: scholarly article
title: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
zbMATH Open document ID: 1198.90054
author: Pablo Garrido
author: M.-C. Riff
published in: Journal of Heuristics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5815648
zbMATH Keywords: hyper-heuristics
zbMATH Keywords: dynamic vehicle routing problem
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: heuristic search
describes a project that uses: VRP
describes a project that uses: Learn++
describes a project that uses: MACS-VRPTW
describes a project that uses: Hyperheuristics
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: s10732-010-9126-2
OpenAlex ID: W1977997977
cites work: Parallel Savings Based Heuristics for the Delivery Problem
cites work: Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
cites work: A new hybrid genetic algorithm for the capacitated vehicle routing problem
cites work: A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
cites work: Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
cites work: A Location Based Heuristic for General Routing Problems
cites work: An improved ant system algorithm for the vehicle routing problem
cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology
cites work: The period routing problem
cites work: Q3048611
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Q5431823
cites work: A new heuristic for the fleet size and mix vehicle routing problem
cites work: Creating very large scale neighborhoods out of smaller ones by compounding moves
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
cites work: Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
cites work: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Dynamic vehicle routing using genetic algorithms
cites work: Diversion issues in real-time vehicle dispatching
cites work: Q4365135
cites work: A study on the use of ``self-generation'' in memetic algorithms
cites work: Q4411397
cites work: Q4532227
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: Ant colony system for a dynamic vehicle routing problem
cites work: A stochastic and dynamic routing policy using branching processes with state dependent immigration
cites work: Vehicle routing and scheduling with dynamic travel times
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: A subpath ejection method for the vehicle routing problem
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Q4449707
cites work: DRIVE: Dynamic routing of independent vehicles
cites work: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: Selection of Vehicle Routing Heuristic Using Neural Networks
cites work: A Repeated Matching Heuristic for the Vehicle Routeing Problem
DOI: 10.1007/S10732-010-9126-2
Recommended article: A survey of hyper-heuristics for dynamic optimization problems
Recommended article: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
Recommended article: Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
Recommended article: Metaheuristics for dynamic combinatorial optimization problems
Recommended article: Q4432440
Recommended article: Evolutionary methods for solving dynamic resource allocation problems
Recommended article: Differential evolution for a constrained combinatorial optimisation problem
Recommended article: Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
Recommended article: A hybrid evolution strategy for the open vehicle routing problem
Recommended article: Dynamic and random differential evolution solving constrained optimisation problems