Applying GRASP meta-heuristic to solve the single-item two-echelon uncapacitated facility location problem
by Jairo R. Montoya-Torres, Andres Aponte, Paula Rosas, Juan Pablo Caballero-Villalobos
International Journal of Applied Decision Sciences (IJADS), Vol. 3, No. 4, 2010

Abstract: This paper considers the two-echelon uncapacitated facility location problem (TUFLP), which consists on defining the flow of produced products from manufacturing plants to clients (markets) via a set of warehouses. The problem also consists on defining the location of such warehouses. The objective function is to minimise the total cost of warehouse location and production and distribution of products. This problem is known to be NP-hard since it is a combination of two problems: the uncapacitated facility location problem (UFLP) and the multi-item facility location problem (MFLP). In this paper, we propose a greedy randomised adaptive search procedure (GRASP) to solve the single-item case of the TUFLP. Computational experiments are conducted on random data generated using known instances from the literature. Solutions obtained using GRASP are compared against the optimal solutions obtained using mathematical programming. Results show that proposed algorithm performs well, obtaining good solutions (and even the optimal values) in less computational time than the mixed-integer linear programming model.

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