An adaptation of SH heuristic to the location set covering problem

被引：13

作者：

Alminana, M ^{[1
]}

Pastor, JT ^{[1
]}

机构：

[1] UNIV ALICANTE,DEPT ESTADISTICA & INVEST OPERAT,ALICANTE 03071,SPAIN

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1997年 / 100卷 / 03期

关键词：

D O I：

10.1016/S0377-2217(96)00181-6

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate than the pair CMA/FMC. Its power is experimentally tested over a set of 65 randomly generated problems. (C) 1997 Elsevier Science B.V.

引用

页码：586 / 593

页数：8

共 25 条

[1]

ALMINANA M, 1994, THESIS U VALENCIA

[2]

[Anonymous], 1988, DISCRETE OPTIMIZATIO

[3]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

[4]

BEASLEY JE, 1990, NAV RES LOG, V37, P151, DOI 10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO

[5]

2-2

[6] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS [J].

BEASLEY, JE ;

JORNSTEN, K .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) :293-300

[7] AN ALGORITHM FOR SET COVERING PROBLEM [J].

BEASLEY, JE .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (01) :85-93

[8]

CAPRARA A, 1995, HEURISTIC ALGORITHM

[9]

CERIA S, 1995, LAGRANGIAN BASED HEU

[10]

CHRISTOFIDES N, 1984, ALGORITHMS LARGE SCA

← 1 2 3 →