Minimax optimisation approach for the Robust Vehicle Routing Problem with Time Windows and uncertain travel times
by Tharinee Manisri; Anan Mungwattana; Gerrit K. Janssens
International Journal of Logistics Systems and Management (IJLSM), Vol. 10, No. 4, 2011

Abstract: 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.

Online publication date: Sat, 09-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com