A hybrid GRASP-tabu search metaheuristic for a Four-Layer Location-Routing Problem
by Mohsen Hamidi; Kambiz Farahmand; S. Reza Sajjadi; Kendall E. Nygard
International Journal of Logistics Systems and Management (IJLSM), Vol. 12, No. 3, 2012

Abstract: The location-routing problem simultaneously considers location, allocation, and vehicle routing decisions to design optimal distribution networks. In this paper, a hybrid GRASP-tabu search metaheuristic developed for a complex four-layer LRP is presented. The LRP integrates location, allocation, vehicle routing, and transshipment problems. The metaheuristic decomposes the problem into two sub-problems, a location-allocation-transshipment problem and a routing problem. Two metaheuristics of GRASP and tabu search are combined to solve the first sub-problem in which the routing cost is considered implicitly. The Clarke-Wright Savings algorithm and a node ejection chains algorithm are used to solve the second sub-problem.

Online publication date: Fri, 28-Nov-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 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