Covering problems in facility location: A review

被引：425
作者：
Farahani, Reza Zanjirani [1 ]
Asgari, Nasrin [2 ]
Heidari, Nooshin [3 ]
Hosseininia, Mahtab [3 ]
Goh, Mark [4 ,5 ]
机构：
[1] Kingston Univ, Kingston Business Sch, Dept Informat & Operat Management, Kingston Upon Thames KT2 7LB, Surrey, England
[2] Natl Univ Singapore, Ctr Maritime Studies, Singapore 118411, Singapore
[3] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran
[4] Natl Univ Singapore, Sch Business, Singapore 119245, Singapore
[5] Univ S Australia, Sch Management, Adelaide, SA 5001, Australia
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2012年 / 62卷 / 01期
关键词：
Facility location; Covering problem; Mathematical formulation; Survey; APPROXIMATION ALGORITHMS; GENETIC ALGORITHM; COVERAGE MODELS; LOCAL-SEARCH; SET; SERVICE; NETWORK; FORMULATION; BACKUP; INFRASTRUCTURE;
D O I：
10.1016/j.cie.2011.08.020
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this study, we review the covering problems in facility location. Here, besides a number of reviews on covering problems, a comprehensive review of models, solutions and applications related to the covering problem is presented after Schilling, Jayaraman, and Barkhi (1993). This survey tries to review all aspects of the covering problems by stressing the works after Schilling, Jayaraman, and Barkhi (1993). We first present the covering problems and then investigate solutions and applications. A summary and future works conclude the paper. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码：368 / 407
页数：40
相关论文
共 183 条
[31]   Locating service facilities to reduce lost demand [J].
Berman, Oded ;
Krass, Dmitry ;
Wang, Jiamin .
IIE TRANSACTIONS, 2006, 38 (11) :933-946
[32]   The minmax regret gradual covering location problem on a network with incomplete information of demand weights [J].
Berman, Oded ;
Wang, Jiamin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 208 (03) :233-238
[33]   Generalized coverage: New developments in covering location models [J].
Berman, Oded ;
Drezner, Zvi ;
Krass, Dmitry .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) :1675-1687
[34]   Cooperative cover location problems: The planar case [J].
Berman, Oded ;
Drezner, Zvi ;
Krass, Dmitry .
IIE TRANSACTIONS, 2010, 42 (03) :232-246
[35]   The Ordered Gradual Covering Location Problem on a Network [J].
Berman, Oded ;
Kalcsics, Joerg ;
Krass, Dmitry ;
Nickel, Stefan .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (18) :3689-3707
[36]   The variable radius covering problem [J].
Berman, Oded ;
Drezner, Zvi ;
Krass, Dmitry ;
Wesolowsky, George O. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (02) :516-525
[37]   The Maximal Covering Problem with Some Negative Weights [J].
Berman, Oded ;
Drezner, Zvi ;
Wesolowsky, George O. .
GEOGRAPHICAL ANALYSIS, 2009, 41 (01) :30-42
[38]   Computing small partial coverings [J].
Bläser, M .
INFORMATION PROCESSING LETTERS, 2003, 85 (06) :327-331
[39]   Models for multi-path covering-routing problems [J].
Boffey, B ;
Narula, SC .
ANNALS OF OPERATIONS RESEARCH, 1998, 82 (0) :331-342
[40]   A nearly optimal algorithm for covering the interior of an Art Gallery [J].
Bottino, Andrea ;
Laurentini, Aldo .
PATTERN RECOGNITION, 2011, 44 (05) :1048-1056
12345678910