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

Amine Dhahri | Zendy; Anis Mjirda | Zendy; Kamel Zidi | Zendy; Khaled Ghédira | Zendy

Open Access

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

Author(s) -

Amine Dhahri,

Anis Mjirda,

Kamel Zidi,

Khaled Ghédira

Publication year - 2016

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2016.05.473

Subject(s) - vehicle routing problem , computer science , variable neighborhood search , heuristic , metaheuristic , mathematical optimization , routing (electronic design automation) , variable (mathematics) , algorithm , artificial intelligence , mathematics , computer network , mathematical analysis

We 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 we create a initial solution using Solomon heuristic then we 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research