Journal
MATHEMATICAL METHODS OF OPERATIONS RESEARCH
Volume 68, Issue 2, Pages 361-382Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00186-008-0236-7
Keywords
Vehicle Routing; Hybrid Algorithm; Genetic Algorithm; Taboo Search
Ask authors/readers for more resources
This paper presents EVE-OPT, a Hybrid Algorithm based on Genetic Algorithms and Taboo Search for solving the Capacitated Vehicle Routing Problem. Several hybrid algorithms have been proposed in recent years for solving this problem. Despite good results, they usually make use of highly problem-dependent neighbourhoods and complex genetic operators. This makes their application to real instances difficult, as a number of additional constraints need to be considered. The algorithm described here hybridizes two very simple heuristics and introduces a new genetic operator, the Chain Mutation, as well as a new mutation scheme. We also apply a procedure, the k-chain-moves, able to increase the neighbourhood size, thereby improving the quality of the solution with negligible computational effort. Despite its simplicity, EVE-OPT is able to achieve the same results as very complex state-of-the art algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available