Title: A simulated annealing-based hybrid algorithm for solving UFL problems

Authors: T.G. Pradeepmon; Brijesh Paul

Addresses: Department of Mechanical Engineering, S.N.G. College of Engineering, Kolencherry – 682311, Kerala, India ' Department of Mechanical Engineering, M.A. College of Engineering Kothamangalam – 686666, Kerala, India

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.

DOI: 10.1504/IJAMS.2012.047677

International Journal of Applied Management Science, 2012 Vol.4 No.3, pp.274 - 283

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 06 Jul 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article