A simulated annealing-based hybrid algorithm for solving UFL problems
by T.G. Pradeepmon; Brijesh Paul
International Journal of Applied Management Science (IJAMS), Vol. 4, No. 3, 2012

Abstract: Hybridisation of algorithms to develop efficient solution methods for solving various NP-hard problems has been a practice for the last few years. It can be seen that researchers have tried different permutations and combinations of various exact, heuristic and metaheuristic algorithms to develop better solution methods than the existing ones. In this study we present a hybrid algorithm for solving the uncapacitated facility location (UFL) problems and the results obtained are compared with some recent algorithms available in the literature. The proposed hybrid algorithm is based on the two popular metaheuristic algorithms, namely, simulated annealing (SA) and genetic algorithm (GA). Empirical evidences to prove the effectiveness of the algorithm is also presented in this paper.

Online publication date: Sat, 16-Aug-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 Management Science (IJAMS):
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