A VNS-based Heuristic for Solving the Vehicle Routing Problem with Time Windows and Vehicle Preventive Maintenance Constraints

The authors address a vehicle routing problem with time windows (VRPTW) that also contains vehicle with preventive maintenance constraints (VRPTW-PM) and propose a MIP mathematical formulation as well as a general variable neighborhood search metaheuristic (VNS) to solve with large instance the problematic situation. First the authors create a initial solution using Solomon heuristic then they minimize the number of used routes, and then the total travelled distance by all vehicles is minimized. Computational results show the efficiency of the proposed approach.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01605458
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 6 2016 10:02AM