A computational study of a nonlinear minsum facility location problem

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.

[1]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[2]  Igor Vasil'ev,et al.  An effective heuristic for large-scale capacitated facility location problems , 2009, J. Heuristics.

[3]  Igor Vasil'ev,et al.  An aggregation heuristic for large scale p-median problem , 2012, Comput. Oper. Res..

[4]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[5]  Walter Murray,et al.  A Local Relaxation Method for Nonlinear Facility Location Problems , 2006 .

[6]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[7]  Pitu B. Mirchandani,et al.  Discrete facility location with nonlinear diseconomies in fixed costs , 1990 .

[8]  Ju-Liang Zhang,et al.  Capacitated facility location problem with general setup cost , 2006, Comput. Oper. Res..

[9]  Olivier Briant,et al.  The Optimal Diversity Management Problem , 2004, Oper. Res..

[10]  Charles S. Revelle,et al.  Facility location with increasing production costs , 2003, Eur. J. Oper. Res..

[11]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[12]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[13]  Catherine A. Sugar,et al.  Finding the Number of Clusters in a Dataset , 2003 .

[14]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[15]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[16]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[17]  Carmine Di Martino,et al.  A decomposition approach for a very large scale optimal diversity management problem , 2005, 4OR.

[18]  T. Klastorin.  The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach , 1985 .

[19]  Pierre Hansen,et al.  Solving large p-median clustering problems by primal–dual variable neighborhood search , 2009, Data Mining and Knowledge Discovery.

[20]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[21]  Tian Zhang,et al.  BIRCH: A New Data Clustering Algorithm and Its Applications , 1997, Data Mining and Knowledge Discovery.

[22]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[23]  M. Brusco,et al.  Optimal Partitioning of a Data Set Based on the p-Median Model , 2008 .

[24]  Igor Vasil'ev,et al.  Computational study of large-scale p-Median problems , 2007, Math. Program..

[25]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[26]  K. Berman.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[27]  Manfred Körkel,et al.  Discrete facility location with nonlinear facility costs , 1991 .

[28]  Vladimir Marianov,et al.  Location Problems in the Public Sector , 2002 .

[29]  Richard M. Soland,et al.  Optimal Facility Location with Concave Costs , 1974, Oper. Res..

[30]  Vahab S. Mirrokni,et al.  The facility location problem with general cost functions , 2003, Networks.

[31]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[32]  Eduardo Conde,et al.  A fractional model for locating semi-desirable facilities on networks , 2002, Eur. J. Oper. Res..