Integrated use of soft computing and clustering for capacitated clustering single-facility location problem with one-time delivery

How to setup the distribution centers (DC) is not only a general issue but also a quite profound knowledge in real world. This problem called capacitated clustering location problem (CCP), then the previous literature, the target of the CCP is to minimize the sum of distances from each DC to all customers in their cluster. However, some types of the company shipping are different from the above. The DC must ship goods to all customers in its cluster in a cycle time. This delivery way called “one-time delivery” and it can be modeled as Travelling Salesman Problem (TSP). In order to solve this practical problem, a hybrid algorithm, Simplified Swarm Optimization combining with K-harmonic means (SSOKHM) is proposed in this paper for the CCP and using greedy algorithm for the TSP to obtain the minimize shipping costs. Proposed method is applied to several facility location problems from OR library. Numerical results show that the SSOKHM performance is better than using other hybrid clustering algorithms in terms of shipping costs. Finally, we embed the exchange local search for each algorithm. The results are presented that this inspection mechanism can enhance the performance and demonstrate the usefulness in CCP.

[1]  Juan A. Subirana,et al.  Structure of the DNA Duplex d(ATTAAT)2 with Hoogsteen Hydrogen Bonds , 2015, PloS one.

[2]  Ingo Althöfer,et al.  On the convergence of “Threshold Accepting” , 1991 .

[3]  Zülal Güngör,et al.  K-harmonic means data clustering with simulated annealing heuristic , 2007, Appl. Math. Comput..

[4]  Rolf Wendolsky,et al.  A scatter search heuristic for the capacitated clustering problem , 2006, Eur. J. Oper. Res..

[5]  Umeshwar Dayal,et al.  K-Harmonic Means - A Data Clustering Algorithm , 1999 .

[6]  Wei-Chang Yeh,et al.  Accelerated Simplified Swarm Optimization with Exploitation Search Scheme for Data Clustering , 2015, PloS one.

[7]  Wei-Chang Yeh,et al.  A novel hybrid clustering approach based on K-harmonic means using robust design , 2016, Neurocomputing.

[8]  Graham K. Rand,et al.  Methodological Choices in Depot Location Studies , 1976 .

[9]  Stefan Hougardy,et al.  The approximation ratio of the greedy algorithm for the metric traveling salesman problem , 2014, Oper. Res. Lett..

[10]  Sakir Esnaf,et al.  A fuzzy clustering-based hybrid method for a multi-facility location problem , 2009, J. Intell. Manuf..

[11]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[12]  L. Cooper.  Location-Allocation Problems , 1963 .

[13]  Michael Randolph Garey,et al.  The complexity of the generalized Lloyd - Max problem , 1982, IEEE Trans. Inf. Theory.

[14]  Sakir Esnaf,et al.  Integrated use of fuzzy c-means and convex programming for capacitated multi-facility location problem , 2012, Expert Syst. Appl..

[15]  Wei-Chang Yeh,et al.  New Parameter-Free Simplified Swarm Optimization for Artificial Neural Network Training and its Application in the Prediction of Time Series , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[16]  Ching-Jung Ting,et al.  Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem , 2008 .

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

[18]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .