A computational study of a nonlinear minsum facility location problem

详细信息    查看全文

• 作者：Emilio Carrizosa^a ; ¹ ; ^{ecarrizosa@us.es} ; Anton Ushakov^b ; ^{aushakov@icc.ru} ; Igor Vasilyev^b ; ^vil@icc.ru
• 关键词：p-median problem ; Lagrangean relaxation ; Core heuristic ; Nonlinear integer programming
• 刊名：Computers and Operations Research
• 出版年：2012
• 出版时间：November, 2012
• 年：2012
• 卷：39
• 期：11
• 页码：2625-2633
• 全文大小：344 K

文摘

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.