abstract
- © 2016 Copyright held by the owner/author(s).The vehicle routing problem is a classic optimization problem with many variants. One of the variants is given by the inclusion of the time windows constraint which requires the clients to be served within a delimited time frame. Because of its complexity, vehicle routing problems are usually solved by using heuristics without optimality guarantee. This paper describes two hyper-heuristics capable of producing results comparable to the ones obtained by the best-performing heuristics on different sets of benchmark instances.