A computational study of a nonlinear minsum facility location problem

被引：12

作者：

Carrizosa, Emilio ^{[2
]}

Ushakov, Anton ^{[1
]}

Vasilyev, Igor ^{[1
]}

机构：

[1] Russian Acad Sci, Siberian Branch, Inst Syst Dynam & Control Theory, Irkutsk 664033, Russia

[2] Univ Seville, Inst Matemat, E-41012 Seville, Spain

来源：

COMPUTERS & OPERATIONS RESEARCH | 2012年 / 39卷 / 11期

关键词：

p-median problem; Lagrangean relaxation; Core heuristic; Nonlinear integer programming; P-MEDIAN PROBLEM; CLUSTER-ANALYSIS; MODEL; COSTS;

D O I：

10.1016/j.cor.2012.01.009

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A discrete location problem with nonlinear objective is addressed. A set of p plants is to be open to serve a given set of clients. Together with the locations, the number p of facilities is also a decision variable. The objective is to minimize the total cost, represented as the transportation cost between clients and plants, plus an increasing nonlinear function of p. Two Lagrangean relaxations are considered to derive lower bounds. Dual information is also used to design a core heuristic. Computational results are given, showing that nearly optimal solutions are obtained in short running times. (C) 2012 Elsevier Ltd. All rights reserved.

引用

页码：2625 / 2633

页数：9

共 30 条

[1]

Avella P., 2005, 4OR, V3, P23

[2] Computational study of large-scale p-Median problems [J].

Avella, Pasquale ;

Sassano, Antonio ;

Vasil'ev, Igor .

MATHEMATICAL PROGRAMMING, 2007, 109 (01) :89-114

[3] An aggregation heuristic for large scale p-median problem [J].

Avella, Pasquale ;

Boccia, Maurizio ;

Salerno, Saverio ;

Vasilyev, Igor .

COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) :1625-1632

[4] An effective heuristic for large-scale capacitated facility location problems [J].

Avella, Pasquale ;

Boccia, Maurizio ;

Sforza, Antonio ;

Vasil'ev, Igor .

JOURNAL OF HEURISTICS, 2009, 15 (06) :597-615

[5] LAGRANGEAN HEURISTICS FOR LOCATION-PROBLEMS [J].

BEASLEY, JE .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 65 (03) :383-399

[6] The optimal diversity management problem [J].

Briant, O ;

Naddef, D .

OPERATIONS RESEARCH, 2004, 52 (04) :515-526

[7] Optimal partitioning of a data set based on the p-median model [J].

Brusco, Michael J. ;

Koehn, Hans-Friedrich .

PSYCHOMETRIKA, 2008, 73 (01) :89-105

[8] A heuristic method for the set covering problem [J].

Caprara, A ;

Fischetti, M ;

Toth, P .

OPERATIONS RESEARCH, 1999, 47 (05) :730-743

[9] A fractional model for locating semi-desirable facilities on networks [J].

Carrizosa, E ;

Conde, E .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (01) :67-80

[10]

Daskin M.S., 1995, NETWORK DISCRETE LOC

← 1 2 3 →