Article ID: | iaor201110187 |
Volume: | 10 |
Issue: | 4 |
Start Page Number: | 461 |
End Page Number: | 477 |
Publication Date: | Oct 2011 |
Journal: | International Journal of Logistics Systems and Management |
Authors: | Mungwattana Anan, Janssens Gerrit K, Manisri Tharinee |
Keywords: | combinatorial optimization, heuristics: local search, heuristics: tabu search |
This paper focuses on the Robust Vehicle Routing Problem with Time Windows (RVRPTW). The objective is to find a robust solution that has the best worst‐case performance. This paper proposes a two‐phase algorithm to solve a minimax optimisation problem with uncertain travel times. The algorithm includes the Modified Push‐Forward Insertion Heuristic (MPFIH), a ?‐interchange local search descent method and Tabu Search (TS). The experiments are based on a modified version of the Vehicle Routing Problem (VRP) with time windows benchmarking problem of Solomon. The results show that the two‐phase algorithm can find robust solutions in all conditions.