Development of an ant colony optimisation-based heuristic for a location-routing problem in a two-stage supply chain
by Vinay V. Panicker; M. Vamshidhar Reddy; R. Sridharan
International Journal of Value Chain Management (IJVCM), Vol. 9, No. 1, 2018

Abstract: The location-routing problem (LRP) considers facility-location and vehicle-routing decisions. These decisions have to be tackled simultaneously since they are interdependent. In this work, a two-stage LRP is considered wherein customers are to be served from a number of plants through a number of depots. Since LRP is an NP-hard problem, heuristic approach becomes the only alternative to solve the problem as the problem size increases. An ant colony optimisation (ACO)-based heuristic is proposed to solve the problem. For the purpose of performance evaluation of the proposed heuristic, various problem sizes are generated and the computational results are analysed. The results of this study reveal that the proposed heuristic is efficient for solving location routing problem in a two stage supply chain.

Online publication date: Tue, 10-Apr-2018

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 Value Chain Management (IJVCM):
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