A new method for solving capacitated location problems based on a set partitioning approach

Abstract We consider the capacitated p-median problem (CPMP) in which a set of n customers must be partitioned into p disjoint clusters so that the total dissimilarity within each cluster is minimized and constraints on maximum cluster capacities are met. The dissimilarity of a cluster is computed as the sum of the dissimilarities existing between each entity of the cluster and the median associated to such cluster. In this paper we present an exact algorithm for solving the CPMP based on a set partitioning formulation of the problem. A valid lower bound to the optimal solution cost is obtained by combining two different heuristic methods for solving the dual of the LP-relaxation of the exact formulation. Computational tests on problems proposed in the literature and on new sets of test problems show the effectiveness of the proposed algorithm. Scope and purpose A basic location problem consists of locating a number of facilities or depots to supply a set of customers. The objective is to minimize the cost of locating the facilities and assigning the customers to them. This problem has been extensively studied in the literature and is commonly referred to as the plant location problem, or facility location problem. When each potential facility has a constraint on the maximum demand that it can supply and the number of facilities to locate is specified, the problem is known as the Capacitated p-median problem (CPMP). The purpose of this paper is to present a new exact algorithm for the CPMP and evaluate its computational performance on a set of test problems taken from the literature and on a new set of test problems.

[1]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[2]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[3]  Roberto Baldacci,et al.  An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..

[4]  I. Douglas Moon,et al.  Facility location on a tree with maximum distance constraints , 1995, Comput. Oper. Res..

[5]  Sohail S. Chaudhry,et al.  THE P-MEDIAN PROBLEM WITH MAXIMUM DISTANCE CONSTRAINTS: A DIRECT APPROACH. , 1993 .

[6]  Moutaz Khouja,et al.  Balancing the assignment of customer groups among employees , 1995 .

[7]  J. Mulvey,et al.  Solving capacitated clustering problems , 1984 .

[8]  David K. Smith,et al.  Facility location with and without maximum distance constraints through the p‐median problem , 1995 .

[9]  M. R. Rao,et al.  An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .

[10]  J. Beasley.  An algorithm for solving large capacitated warehouse location problems , 1988 .

[11]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[12]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[13]  I. Moon,et al.  An Analysis of Network Location Problems with Distance Constraints , 1984 .

[14]  Nicos Christofides,et al.  Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

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

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  L. Bianco,et al.  A set partitioning approach to the multiple depot vehicle scheduling problem , 1994 .

[18]  Marco A. Boschetti,et al.  A Set Partitioning Approach to the Crew Scheduling Problem , 1999, Oper. Res..

[19]  Roberto Baldacci,et al.  A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.

[20]  Thomas L. Magnanti,et al.  Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..

[21]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[22]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..