DocumentCode :
2959777
Title :
An empirical comparison of five efficient heuristics for Maximal Covering Location Problems
Author :
Xia, Li ; Xie, Ming ; Xu, Weida ; Shao, Jinyan ; Yin, Wenjun ; Dong, Jin
Author_Institution :
Res. Lab., IBM China, Beijing, China
fYear :
2009
fDate :
22-24 July 2009
Firstpage :
747
Lastpage :
753
Abstract :
Facility location decision is a critical element in strategic planning for a wide range of public sector and business world. Maximal Covering Location Problem (MCLP) is one of the well-known models for facility location problems. Algorithms to optimally solve this kind of practical operational management problem often suffer from the combinatorial explosion when the system size increases. In these cases, heuristic methods are the only viable alternative. A lot of work has been devoted to the study of heuristics for MCLP. But there lacks a complete comparison of different methods. In this paper, we compare the relative performance of five efficient heuristic methods: Greed-Add, Interchange, Efficient Genetic Algorithm (GA), Efficient Tabu Search (TS), and Efficient Simulated Annealing (SA). The results indicate: Greedy-Add can achieve relatively good solutions in a very short time; GA-based algorithm performs not as successfully as it used to do in most combinatorial problems; and Efficient SA always gets the best solution among all the five algorithms. Thus, in general we may conclude that Efficient SA should often be tried first for this kind of problems.
Keywords :
facility location; genetic algorithms; search problems; simulated annealing; strategic planning; Greedy-Add; business world; combinatorial problems; facility location decision; facility location problems; genetic algorithm; maximal covering location problems; operational management problem; public sector; simulated annealing; strategic planning; tabu search; Automation; Business; Educational institutions; Explosions; Genetic algorithms; Laboratories; Operations research; Profitability; Simulated annealing; Strategic planning; Tabu search; genetic algorithm; maximal covering location problem; simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Service Operations, Logistics and Informatics, 2009. SOLI '09. IEEE/INFORMS International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4244-3540-1
Electronic_ISBN :
978-1-4244-3541-8
Type :
conf
DOI :
10.1109/SOLI.2009.5204032
Filename :
5204032
Link To Document :
بازگشت