Title: A simulated annealing heuristic for the facility location problem

Authors: Hasan Hosseini Nasab; Fatemeh Mobasheri

Addresses: Department of Industrial Engineering, Yazd University, P.O.B. 89195-741, Pajhohesh Street, Yazd, Iran ' Department of Industrial Engineering, Yazd University, P.O.B. 89195-741, Pajhohesh Street, Yazd, Iran

Abstract: In this article, a facility location problem (FLP) is considered by the possibility of duplications for each machine type in the presence of alternative processing routes for each product. The objective of this study is to minimise the total distance that is travelled by the products. According to the NP-hardness of the problem, a simulated annealing (SA) is proposed to solve the FLP. Considering two kinds of mutation operator in generating neighbourhood solution makes the SA as an efficient approach to solve large size FLP problems.

Keywords: facility location problem; FLP; simulated annealing; duplication; alternative processing routes; mathematical modelling; numerical optimisation.

DOI: 10.1504/IJMMNO.2013.056532

International Journal of Mathematical Modelling and Numerical Optimisation, 2013 Vol.4 No.3, pp.210 - 224

Received: 13 Aug 2012
Accepted: 12 May 2013

Published online: 25 Sep 2013 *

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