Ant colony optimisation algorithm for location routing decisions in a supply chain
by Vinay V. Panicker; M. Vamshidhar Reddy; R. Sridharan
International Journal of Value Chain Management (IJVCM), Vol. 7, No. 4, 2016

Abstract: In this work, an ant colony optimisation-based heuristic is developed to solve the location-routing problem. The proposed heuristic solves the allocation problem and the routing problem simultaneously. This simultaneous approach is the novelty of the solution methodology. The proposed heuristic is tested on a set of well-known benchmark problem instances and the results obtained are compared with that using the other heuristics reported in the literature. For larger size problem instances, the proposed heuristic provides better solutions.

Online publication date: Tue, 22-Nov-2016

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 subs@inderscience.com