Using clustering analysis in a capacitated location-routing problem

Abstract The location routing problem (LRP) appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP). In this work, we consider a discrete LRP with two levels: a set of potential capacitated distribution centres (DC) and a set of ordered customers. In our problem we intend to determine the set of installed DCs as well as the distribution routes (starting and ending at the DC). The problem is also constrained with capacities on the vehicles. Moreover, there is a homogeneous fleet of vehicles, carrying a single product and each customer is visited just once. As an objective we intend to minimize the routing and location costs. Several authors have integrated cluster analysis procedures in heuristics for LRPs. As a contribution to this direction, in this work several hierarchical and non-hierarchical clustering techniques (with several proximity functions) are integrated in a sequential heuristic algorithm for the above mentioned LRP model. All the versions obtained using different grouping procedures were tested on a large number of instances (adapted from data in the literature) and the results were compared so as to obtain some guidelines concerning the choice of a suitable clustering technique.

[1]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[2]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[3]  Lawrence D. Bodin,et al.  A taxonomic structure for vehicle routing and scheduling problems , 1975 .

[4]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[5]  Oli B.G. Madsen,et al.  Methods for solving combined two level location-routing problems of realistic dimensions , 1983 .

[6]  J. D. Coelho,et al.  The hamiltonian p-median problem , 1990 .

[7]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[8]  J. Current,et al.  THE MULTIPLE DEPOT VEHICLE ROUTING PROBLEM WITH BACKHAULING. , 1992 .

[9]  Robert R. Golden,et al.  Detection Of Biological Sex: An Empirical Test Of Cluster Methods. , 1980, Multivariate behavioral research.

[10]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[11]  Rajesh Srivastava.  Algorithms for solving the location : routing problem , 1986 .

[12]  H. Charles Romesburg,et al.  Cluster analysis for researchers , 1984 .

[13]  John C. Gower,et al.  Measures of Similarity, Dissimilarity and Distance , 1985 .

[14]  Brian Everitt,et al.  Cluster analysis , 1974 .

[15]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[16]  Francesco E. Maranzana,et al.  On the Location of Supply Points to Minimize Transportation Costs , 1963, IBM Syst. J..

[17]  Hokey Min.  CONSOLIDATION TERMINAL LOCATION-ALLOCATION AND CONSOLIDATED ROUTING PROBLEMS / , 1996 .

[18]  C. Edelbrock,et al.  Hierarchical Cluster Analysis Using Intraclass Correlations: A Mixture Model Study. , 1980, Multivariate behavioral research.

[19]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[20]  Keinosuke Fukunaga,et al.  Generalized Clustering for Problem Localization , 1978, IEEE Transactions on Computers.

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

[22]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[23]  Jossef Perl,et al.  A unified warehouse location-routing analysis , 1983 .

[24]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[25]  W. C. Benton,et al.  The location-routing problem: Considerations in physical distribution system design , 1990, Comput. Oper. Res..

[26]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[27]  James E. Ward,et al.  Integrated Facility Location and Vehicle Routing Models: Recent Work and Future Prospects , 1987 .

[28]  Andreas Klose,et al.  Using Clustering Methods in Problems of Combined Location and Routing , 1996 .

[29]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[30]  Toru Nakamura.  WHITE PAPER, European transport policy for 2010 : time to decide , 2004 .

[31]  Charles K. Bayne,et al.  Monte Carlo comparisons of selected clustering procedures , 1980, Pattern Recognit..

[32]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[33]  R Srivastava.  Alternate solution procedures for the location-routing problem , 1993 .

[34]  G W Milligan,et al.  Asymptotic and Finite Sample Characteristics of Four External Criterion Measures. , 1985, Multivariate behavioral research.