Jaromír Mlejnek
ABSTRACT
In this paper a novel constructive hyperheuristic for CVRP is proposed. This hyperheuristic, called HyperPOEMS, is based on an evolutionary-based iterative local search algorithm. Its inherent characteristics make it capable of autonomously searching a structured space of low-level domain specific heuristics for their suitable combinations that produce good solutions to particular problem instance. HyperPOEMS was tested on standard benchmarks and compared to two existing constructive hyperheuristic, HHC-VRP and EHH-VRP. The results show that HyperPOEMS outperforms both compared hyperheuristics and produces solutions competitive to solutions obtained by specialized metaheuristics designed for CVRP.
- Garrido, P. and Castro, C.: Stable solving of CVRPs using hyperheuristics. In Proceedings of the 11th Genetic and Evolutionary Computation Conference, New York: ACM, 2009, ISBN 978-1-60558-325-9, pp. 255--262, 2009. Google Scholar
Digital Library
- Garrido, P., Castro, C., Monfroy, E.: Towards a Flexible and Adaptable Hyperheuristic Approach for VRPs. In Proceedings of the International Conference on Artificial Intelligence, ICAI 2009, ISBN 1-60132-109-0, pp. 311--317, 2009.Google Scholar
- Kubalik, J. and Faigl, J.: Iterative Prototype Optimisation with Evolved Improvement Steps. In: P. Collet et al. (Eds.): Genetic Programming. Proceedings of the 9th European Conference, EuroGP 2006. Heidelberg: Springer, pp. 154--165, 2006. Google ScholarDigital Library
- Kubalik, J.: Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm. In Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization, pp. 148--159, 2012. Google ScholarDigital Library
- Ralphs, T. K., Kopman, L., Pulleyblank, W. R., Trotter, L. E.: On the capacitated vehicle routing problem. Mathematical Programming 94, pp. 343--359, 2003.Google ScholarCross Ref
Index Terms
- Evolutionary hyperheuristic for capacitated vehicle routing problem
Recommendations
Stable solving of CVRPs using hyperheuristics
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationIn this paper we present a hill-climbing based hyperheuristic which is able to solve instances of the capacitated vehicle routing problem. The hyperheuristic manages a sequence of constructive-perturbative pairs of low-level heuristics which are applied ...
An improved fireworks algorithm for the capacitated vehicle routing problem
The capacitated vehicle routing problem (CVRP), which aims at minimizing travel costs, is a well-known NP-hard combinatorial optimization. Owing to its hardness, many heuristic search algorithms have been proposed to tackle this problem. This paper ...
Heuristic Procedures for the Capacitated Vehicle Routing Problem
In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original ...
Comments