| Article ID: | iaor20031422 |
| Country: | Netherlands |
| Volume: | 115 |
| Issue: | 1 |
| Start Page Number: | 227 |
| End Page Number: | 241 |
| Publication Date: | Sep 2002 |
| Journal: | Annals of Operations Research |
| Authors: | Kiranoudis C.T., Tarantilis C.D. |
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.