Covering problems in facility location: A review

被引：416

作者：

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 条

[1] Maximizing the number of obnoxious facilities to locate within a bounded region [J].

Abravaya, Shimon ;

Segal, Michael .

COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (01) :163-171

[2] A NEW EFFICIENT HEURISTIC FOR THE MINIMUM SET COVERING PROBLEM [J].

AFIF, M ;

HIFI, M ;

PASCHOS, VT ;

ZISSIMOPOULOS, V .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (10) :1260-1268

[3] A new model for maximal coverage exploiting GIS capabilities [J].

Alexandris, George ;

Giannikos, Ioannis .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (02) :328-338

[4] A genetic algorithm for the set covering problem [J].

AlSultan, KS ;

Hussain, MF ;

Nizami, JS .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) :702-709

[5] Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study [J].

Aytug, H ;

Saydam, C .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (03) :480-494

[6] A multi-objective model for locating fire stations [J].

Badri, MA ;

Mortagy, AK ;

Alsayed, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 110 (02) :243-260

[7] A dynamic subgradient-based branch-and-bound procedure for set covering [J].

Balas, E ;

Carrera, MC .

OPERATIONS RESEARCH, 1996, 44 (06) :875-890

[8] Using homogeneous weights for approximating the partial cover problem [J].

Bar-Yehuda, R .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 39 (02) :137-144

[9] Ensuring feasibility in location problems with stochastic demands and congestion [J].

Baron, Opher ;

Berman, Oded ;

Kim, Seokjin ;

Krass, Dmitry .

IIE TRANSACTIONS, 2009, 41 (05) :467-481

[10] A GRASP algorithm to solve the unicost set covering problem [J].

Bautista, Joaquin ;

Pereira, Jordi .

COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) :3162-3173

← 1 2 3 4 5 6 7 8 9 10 →