Efficient optimization of maximal covering location problems using extreme value estimation
Authors: 
Li Xia, Wenjun Yin, Weida Xu, Ming Xie, Jinyan ShaoAuthors Info & Claims
Li Xia, Wenjun Yin, Weida Xu, Ming Xie, Jinyan ShaoAuthors Info & ClaimsPages 2395 - 2404
Abstract
Facility location decision is a critical element in strategic planning for a wide range of public sectors and business world. Maximal Covering Location Problem is one of the well-known models for facility location problems. Considering its NP-hard nature, numerous efforts have been devoted to the development of intelligent algorithms for this problem. In order to evaluate the quality of a given solution, we integrate k-interchange heuristic and extreme value theory to statistically estimate the upper bound of the global optimal objective value. Based on this statistical bound, a new simulated annealing algorithm is proposed to solve the maximal covering location problems. Computational results show that the proposed algorithm can obtain better near optimal solutions than the existing algorithms.
References
[1]
Al - Sultan, K. S., and M. A. Al - Fawzan. 1999. A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research 86 (0):91--103.
[2]
Castillo, E. 1988. Extreme value theory in engineering. New York: Academic Press.
[3]
Church, R., and C. R. Velle. 1974. The maximal covering location problem. Papers in Regional Science 32 (1): 101--118.
[4]
Cicirello, V. A., and S. F. Smith. 2004. Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. In Principles and practice of constraint programming -- cp 2004, ed. M. Wallace, 197--211. Berlin: Springer.
[5]
Coles, S. 2001. An introduction to statistical modeling of extreme values. London: Springer-Verlag.
[6]
Croes, G. A. 1958. A method for solving traveling salesman problems. Operations Research 6 (6):791.
[7]
Dalgaard, P. 2002. Introductory statistics with r. New York: Springer-Verlag.
[8]
Derigs, U. 1985. Using confidence limits for the global optimum in combinatorial optimization. Operations Research 33 (5):1024--1049.
[9]
Drezner, Z., and H. W. Hamacher. 2002. Facility location applications and theory. Berlin Heidelberg: Springer-Verlag.
[10]
Fisher, R. A., and L. H. C. Tippett. 1928. Limiting forms of the frequency distribution of the largest or smallest member of a sample. Proceedings of the Cambridge Phiosophical Society 24:285--307.
[11]
Hüsler, J., P. Cruz, A. Hall, and C. M. Fonseca. 2003. On optimization and extreme value theory. Methodology and Computing in Applied Probability 5 (2):183--195.
[12]
Jaramillo, J. H., J. Bhadury, and R. Batta. 2002. On the use of genetic algorithms to solve location problems. Computers & Operations Research 29 (6):761--779.
[13]
Jenkinson, A. F. 1955. The frequency distribution of the annual maximum (or minimum) values of meteorological events. Quarterly Journal of the Royal Meteorological Society 81:158--172.
[14]
Kirkpatrick, S., C. Gelatt, and P. Vicchi. 1983. Optimization by simulated annealing. Scicence 220:671--679.
[15]
Kotz, S., and S. Nadarajah. 2000. Extreme value distributions: Theory and applications. London: Imperial College Press.
[16]
Kuehn, A. A., and M. J. Hamburger. 1963. A heuristic program for locating warehouses. Management Science 9 (4):643--666.
[17]
Lorena, L. A. N. 2008. L. A. N. Lorena-instancias. Available via <http://www.lac.inpe.br/~lorena/instancias.html> {cited August 1, 2008}.
[18]
Los, M., and C. Lardinois. 1982. Combinatorial programming, statistical optimization and the optimal transportation network problem. Transportation Research Part B: Methodological 16 (2):89--124.
[19]
Melo, M. T., S. Nickel, and F. Saldanha-da-Gama. 2009. Facility location and supply chain management - a review. European Journal of Operational Research 196 (2):401--412.
[20]
Murray, A. T., and R. L. Church. 1996. Applying simulated annealing to location-planning models. Journal of Heuristics 2 (l):31--53.
[21]
Owen, S. H., and M. S. Daskin 1998. Strategic facility location: A review. European Journal of Operational Research 111 (3):423--447.
[22]
ReVelle, C. S., and H. A. Eiselt. 2005. Location analysis: A synthesis and survey. European Journal of Operational Research 165 (1): 1--19.
[23]
Sridharan, R. 1995. The capacitated plant location problem. European Journal of Operational Research 87 (2):203--213.
[24]
Stephenson, A. 2008. Evd: Functions for extreme value distributions. Available via <http://cran.r-project.org/web/packages/evd/index.html> {cited March 1, 2009}.
[25]
Sun, M. 2006. Solving the uncapacitated facility location problem using tabu search. Computers & Operations Research 33 (9):2563--2589.
[26]
Teitz, M. B., and P. Ban. 1968. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16 (5):955--961.
[27]
Xia, L., M. Xie, W. Xu, W. Yin, and J. Shao. 2009. An empirical comparison of five efficient heuristics for maximal covering location problems. Proceedings of The Fifth IEEE International Conference on Service Operations, Logistics and Informatics (SOLI 2009), Chicago.
Index Terms
- Efficient optimization of maximal covering location problems using extreme value estimation
Recommendations
Using a facility location algorithm to solve large set covering problems
Erlenkotter has developed an efficient exact (guarantees optimality) algorithm to solve the uncapacitated facility location problem (UFLP). In this paper, we use his algorithm to solve large instances of an important subset of the UFLP; the set covering ...
A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents variables that can be partitioned ...
Iterated greedy algorithms for the maximal covering location problem
EvoCOP'12: Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial OptimizationThe problem of allocating a set of facilities in order to maximise the sum of the demands of the covered clients is known as the maximal covering location problem. In this work we tackle this problem by means of iterated greedy algorithms. These ...
Comments
Information & Contributors
Information
Published In
Sponsors
- IIE: Institute of Industrial Engineers
- INFORMS-SIM: Institute for Operations Research and the Management Sciences: Simulation Society
- SIGSIM: ACM Special Interest Group on Simulation and Modeling
- SCS: Society for Modeling and Simulation International
Publisher
Winter Simulation Conference
Publication History
Published: 13 December 2009
Check for updates
Qualifiers
- Research-article
Conference
WSC09
Sponsor:
- IIE
- INFORMS-SIM
- SIGSIM
- SCS
Acceptance Rates
WSC '09 Paper Acceptance Rate 137 of 256 submissions, 54%;
Overall Acceptance Rate 3,413 of 5,075 submissions, 67%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 113Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in