Abstract

The Cumulative Capacitated Vehicle Routing Problem (or CCVRP) models transportation problems where the objective is to minimize the sum of arrival times at customers, taking into account capacity limitations. It generalizes the traveling repairman problem (or TRP), by adding capacity constraints and an homogeneous vehicle fleet. This paper presents the first metaheuristic designed for the CCVRP, taking into account specific properties to improve its speed and efficiency. The algorithm obtained also becomes the best metaheuristic for the TRP.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.