Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem

被引：24

作者：

Alcaraz, Javier ^{[1
]}

Landete, Mercedes ^{[1
]}

Monge, Juan F. ^{[1
]}

机构：

[1] Univ Miguel Hernandez, Inst Ctr Operat Res, Elche, Alicante, Spain

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2012年 / 222卷 / 01期

关键词：

p-Median problem; Metaheuristics; Genetic algorithms; Scatter search; VARIABLE NEIGHBORHOOD SEARCH; LOCATION-PROBLEMS; SCATTER SEARCH; SCHEDULING PROBLEM; HEURISTIC METHODS; ALGORITHMS;

D O I：

10.1016/j.ejor.2012.04.016

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In the p-Median Problem, it is assumed that, once the facilities are opened, they may not fail. In practice some of the facilities may become unavailable due to several factors. In the Reliability p-Median Problem some of the facilities may not be operative during certain periods. The objective now is to find facility locations that are both inexpensive and also reliable. We present different configurations of two hybrid metaheuristics to solve the problem, a genetic algorithm and a scatter search approach. We have carried out an extensive computational experiment to study the performance of the algorithms and compare its efficiency solving well-known benchmark instances. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：54 / 64

页数：11

共 45 条

[1] Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms
Alcaraz, J
Maroto, C
Ruiz, R
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 614 - 626
[2] An efficient genetic algorithm for the p-median problem
Alp, O
Erkut, E
Drezner, Z
[J]. ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 21 - 42
[3] [Anonymous], 1975, ADAPTATION NATURAL A
[4] A NOTE ON SOLVING LARGE P-MEDIAN PROBLEMS
BEASLEY, JE
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 270 - 273
[5] Soft-computing based heuristics for location on networks: The p-median problem
Cadenas, J. M.
Canos, M. J.
Garrido, M. C.
Ivorra, C.
Liern, V.
[J]. APPLIED SOFT COMPUTING, 2011, 11 (02) : 1540 - 1547
[6] Solving a class of facility location problems using genetic algorithms
Chaudhry, SS
He, SW
Chaudhry, PE
[J]. EXPERT SYSTEMS, 2003, 20 (02) : 86 - 91
[7] A CANONICAL REPRESENTATION OF SIMPLE PLANT LOCATION-PROBLEMS AND ITS APPLICATIONS
CORNUEJOLS, G
NEMHAUSER, GL
WOLSEY, LA
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03): : 261 - 272
[8] A genetic algorithm for solving a capacitated p-median problem
Correa, ES
Steiner, MTA
Freitas, AA
Carnieri, C
[J]. NUMERICAL ALGORITHMS, 2004, 35 (2-4) : 373 - 388
[9] Densham PaulJ., 1992, PAP REG SCI, V71, P307, DOI DOI 10.1007/BF01434270
[10] Hybrid Scatter Search and Path Relinking for the capacitated p-median problem
Díaz, JA
Fernández, E
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (02) : 570 - 585

← 1 2 3 4 5 →