Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2012, Article ID 576392, 7 pages
Research Article

Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem

1School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
2Business Administration College, Zhejiang University of Finance & Economics, Hangzhou 310018, China

Received 21 May 2012; Accepted 28 June 2012

Academic Editors: C. W. Ahn, B. Alatas, P. Bala, P.-A. Hsiung, and Y. Jiang

Copyright © 2012 Jin Qin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The combined simulated annealing (CSA) algorithm was developed for the discrete facility location problem (DFLP) in the paper. The method is a two-layer algorithm, in which the external subalgorithm optimizes the decision of the facility location decision while the internal subalgorithm optimizes the decision of the allocation of customer's demand under the determined location decision. The performance of the CSA is tested by 30 instances with different sizes. The computational results show that CSA works much better than the previous algorithm on DFLP and offers a new reasonable alternative solution method to it.