A robust optimisation approach for the milk run problem with time windows with inventory uncertainty: an auto industry supply chain case study
by M. Jafari-Eskandari, A.R. Aliahmadi, G.H.H. Khaleghi
International Journal of Rapid Manufacturing (IJRAPIDM), Vol. 1, No. 3, 2010

Abstract: In this paper, we introduce a robust optimisation approach to solve the milk run system with time window with inventory uncertainty. This approach yields routes that minimise transportation costs while satisfying all inventory in a given bounded uncertainty set. The idea of the milk run problem has been used in the context of logistic and supply chain problems in order to manage the transportation of materials. Since the resulted problem formulation is NP-hard, and in order to solve the underlying problem, a novel algorithm entitled robust optimisation has been proposed. We apply the model to solve some numerical examples to show robust solution efficiency versus deterministic. Since the resulted problem illustrates that grows up time in this method is progressive, and in order to solve the large-scale problems, particle swarm optimisation has been proposed. We also observe that the robust solution amounts to a clever management of the remaining vehicle capacity compared to uniformly and non-uniformly distributing this slack over the vehicles.

Online publication date: Fri, 30-Jul-2010

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 Rapid Manufacturing (IJRAPIDM):
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