Artículo
A computational study of a nonlinear minsum facility location problem
Autor/es | Carrizosa Priego, Emilio José
Ushakov, Anton Vasilyev, Igor |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2012-01-31 |
Fecha de depósito | 2021-04-20 |
Publicado en |
|
Resumen | 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 ... 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 acore heuristic. Computational results are given, showing that nearly optimal solutions are obtained in short running times. |
Cita | Carrizosa Priego, E.J., Ushakov, A. y Vasilyev, I. (2012). A computational study of a nonlinear minsum facility location problem. Computers & Operations Research, 39 (11), 2625-2633. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A computational study of a ... | 344.5Kb | [PDF] | Ver/ | |