A simulated annealing-based hybrid algorithm for solving UFL problems

T.G. Pradeepmon and Brijesh Paul

International Journal of Applied Management Science, 2012, vol. 4, issue 3, 274-283

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.

Keywords: facility location problem; hybrid algorithms; genetic algorithms; GAs; simulated annealing; uncapacitated facility location; UFL; metaheuristics. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47677 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injams:v:4:y:2012:i:3:p:274-283

Access Statistics for this article

More articles in International Journal of Applied Management Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().