A Subpath Ejection Method for the Vehicle Routing Problem
Management Science
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Notes on dynamic vehicle routing - the state of the art -
Notes on dynamic vehicle routing - the state of the art -
Ant Colony Optimization
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Case-based heuristic selection for timetabling problems
Journal of Scheduling
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
Dynamic vehicle routing using genetic algorithms
Applied Intelligence
Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Stable solving of CVRPs using hyperheuristics
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A greedy hyper-heuristic in dynamic environments
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Vehicle routing and scheduling with dynamic travel times
Computers and Operations Research
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Generating SAT local-search heuristics using a GP hyper-heuristic framework
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Hi-index | 0.00 |
We present a self-adaptive hyper-heuristic capable of solving static and dynamic instances of the capacitated vehicle routing problem. The hyper-heuristic manages a generic sequence of constructive and perturbative low-level heuristics, which are gradually applied to construct or improve partial routes. We present some design considerations to allow the collaboration among heuristics, and to find the most promising sequence. The search process is carried out by applying a set of operators which constructs new sequences of heuristics, i.e., solving strategies. We have used a general and low-computational cost parameter control strategy, based on simple reinforcement learning ideas, to assign non-arbitrary reward/penalty values and guide the selection of operators. Our approach has been tested using some standard state-of-the-art benchmarks, which present different topologies and dynamic properties, and we have compared it with previous hyper-heuristics and several well-known methods proposed in the literature. The experimental results have shown that our approach is able to attain quite stable and good quality solutions after solving various problems, and to adapt to dynamic scenarios more naturally than other methods. Particularly, in the dynamic case we have obtained high-quality solutions when compared with other algorithms in the literature. Thus, we conclude that our self-adaptive hyper-heuristic is an interesting approach for solving vehicle routing problems as it has been able (1) to guide the search for appropriate operators, and (2) to adapt itself to particular states of the problem by choosing a suitable combination of heuristics.