Dominant, an algorithm for the p-center problem

被引：21

作者：

Caruso, C

Colorni, A

Aloi, L

机构：

[1] CESI, Environm Business Unit, Milan, Italy

[2] Politecn Milan, DEI, I-20133 Milan, Italy

[3] Object Way spa, Ispra, VA, Italy

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2003年 / 149卷 / 01期

关键词：

location; p-center; set covering; heuristics;

D O I：

10.1016/S0377-2217(02)00464-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we present Dominant, an algorithm for the p-center problem, that is the problem of locating p facilities on a network so as to minimise the maximum distance from each customer to his nearest facility. The algorithm Dominant solves a series of set covering problems, according to a predefined maximum distance: it has four versions, two of which can solve optimally problems with up to 900 demand points. A set of 45 test problems taken from literature is solved, and results are reported. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：53 / 64

页数：12

共 20 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2] OR-LIBRARY - DISTRIBUTING TEST PROBLEMS BY ELECTRONIC MAIL [J].