A VNS-based Heuristic for Solving the Vehicle Routing Problem with Time Windows and Vehicle Preventive Maintenance Constraints
| Autor: | Anis Mjirda, Khaled Ghedira, Amine Dhahri, Kamel Zidi |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Heuristic Heuristic (computer science) Computer science 05 social sciences 0211 other engineering and technologies 02 engineering and technology Preventive maintenance Time windows 0502 economics and business Vehicle routing problem General Earth and Planetary Sciences Routing (electronic design automation) Metaheuristic Variable neighborhood search Simulation General Environmental Science |
| Zdroj: | ICCS |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2016.05.473 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|