A linear MmTSP formulation of robust location-routing problem: a dairy products supply chain case study
by Javid Jouzdani; Mohammad Fathian
International Journal of Applied Decision Sciences (IJADS), Vol. 7, No. 3, 2014

Abstract: The location-routing problem (LRP), which integrates location and routing decisions, has been an attraction to both researchers and practitioners. LRP as an important business problem has its own inherent uncertainty; especially, considering phenomena such as traffic congestion and weather conditions and their impact on transportation costs, routing in LRP is subject to uncertainty. In this paper, we propose a multi-depot multi-travelling salesman problem (MmTSP) formulation of robust LRP (RLRP) considering uncertainty in transportation costs. In addition, an appropriate technique is utilised to linearise the RLRP model. In order to justify the applicability of the proposed model, a dairy products supply chain case study is provided. Furthermore, comprehensive numerical examples are presented to characterise the performance of the proposed model.

Online publication date: Mon, 07-Jul-2014

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 Applied Decision Sciences (IJADS):
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