Abstract
In this paper we address a vehicle routing problem with time windows (VRPTW) with preventive maintenance (VRPTW-PM) and we propose a mathematical formulation for this problematic situation as well as a variable neighborhood search (VNS) metaheuristic to be solved. First, we solve the standard VRPTW with 100 customer solomon benchmark to produce the original plan, then we introduce maintenance activity to the vehicle that made the longest distance based on the original plan. A scheduling model is presented based on the VNS metaheuristic for the vehicle routing problem with time windows when one or more vehicles require preventive maintenance activities after the supply of a set of customers. Computational results show the efficiency of the proposed approach.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
