Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 714657, 7 pages
http://dx.doi.org/10.1155/2014/714657
Research Article

Multidistribution Center Location Based on Real-Parameter Quantum Evolutionary Clustering Algorithm

College of Field Engineering, PLA University of Science and Technology, Nanjing 210007, China

Received 16 July 2014; Accepted 22 October 2014; Published 26 November 2014

Academic Editor: Xu Zhang

Copyright © 2014 Huaixiao Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

To determine the multidistribution center location and the distribution scope of the distribution center with high efficiency, the real-parameter quantum-inspired evolutionary clustering algorithm (RQECA) is proposed. RQECA is applied to choose multidistribution center location on the basis of the conventional fuzzy C-means clustering algorithm (FCM). The combination of the real-parameter quantum-inspired evolutionary algorithm (RQIEA) and FCM can overcome the local search defect of FCM and make the optimization result independent of the choice of initial values. The comparison of FCM, clustering based on simulated annealing genetic algorithm (CSAGA), and RQECA indicates that RQECA has the same good convergence as CSAGA, but the search efficiency of RQECA is better than that of CSAGA. Therefore, RQECA is more efficient to solve the multidistribution center location problem.

1. Introduction

The logistics industry is developing rapidly with the development of economy [1]. The development of logistics industry has huge influence on the social production and management, life and employment of people, social system, and so on [2]. So the logistics industry is considered as the artery of economic development and basic industry [3]. In the operation of the logistics system, the task of the distribution center is to receive and deliver products according to the needs of customers in time, efficiently and economically. Distribution center is the key position between suppliers and customers. The distribution distance and distribution model are dependent on the location and distribution range of distribution center. So the distribution center affects the efficiency of the entire distribution system [4]. Logistics center location model is a NP-hard problem [5] which is nonconvex and nonsmooth nonlinear programming model with complex constraints.

FCM is utilized more among all kinds of clustering algorithms such as knowledge discovery [6], pattern recognition [7], and image processing [8]. FCM is the foundation of other fuzzy clustering analysis methods. However, because FCM is a local search algorithm and it is affected by the initial value, some methods are introduced to improve the performance of FCM to prevent the algorithm trapped into local minimum point. Zhang and Yu reviewed the fuzzy clustering algorithm based on partition, analyzed the advantages and disadvantages of the algorithm, pointed out that the standard FCM is robust for the different scaling of data, and proved the influence of parameters on the algorithm performance [9]. Rana and Jain proposed a dynamic recommender system based on evolutionary clustering algorithm which performs an optimization of conflicting parameters instead of using the traditional evolutionary algorithms. They also studied the evolutionary clustering algorithm based on time characteristics [10]. Kou et al. applied multiple criteria decision making method to evaluate economic risk based on clustering algorithm [11]. Maulik and Bandyopadhyay [12] proposed genetic algorithm-based clustering (GAC) technique and proved that the performance of GAC is better than k-means clustering algorithm. Xi et al. [13] introduced the idea of simulated annealing into genetic algorithm for document clustering. Though the accuracy of clustering algorithm can be improved through combination of several algorithms, the cost time is long which reduces the efficiency of the algorithm.

Quantum-inspired evolutionary algorithm (QIEA) is with good population diversity and can keep better balance between exploration and exploitation because of the introduction mechanism of uncertainty, coherence, interference, and parallelism [14]. Conventional QIEA is based on binary so conversion between decimalism and binary needs to be carried out. It is more suitable for combinatorial optimization problems. QIEA is slower to solve the numerical optimization problem. Therefore, the RQIEA is introduced to FCM to solve the problem of the multidistribution center location. Encoding according to the actual circumstances of the clustering problem in RQIEA makes the algorithm converge to the global optimal solution faster.

2. Multidistribution Center Location Model Based on Clustering Algorithm

It needs to determine the location of distribution center and the distribution range of each distribution center to solve the multidistribution center location problem. The most important object of the problem is to make the distribution distance shortest. Therefore, FCM model is suitable to address this issue.

2.1. Description of the Problem

The distribution center location model in this paper satisfies the following assumptions:(1)the capacity of the distribution center can always meet the demand of all demand points;(2)a demand point can only be supplied by a distribution center;(3)complex situation such as river, road network, the customer request, and the transportation cost is not considered; the only measure is the distance between the distribution center and demand points.

Establish distribution center location model based on the above assumptions. This model is a location/distribution model in which demand distribution centers and corresponding demand points need to be found out.

2.2. FCM Model for Multidistribution Center Location

-means clustering is proposed in 1957 [15]; subsequently, many local classification algorithms based on gradient descent method are put forward. FCM utilizes the concept of geometric closeness degree of the determined data point in the Euclidean space to classify data and determine the distance of the clustering.

If there is a data sample which needs to be divided into distribution areas , the similar classification matrix is ; the distribution centers of each distribution area are ; the membership grade of the sample belonging to is ( for short). The expression of the objective function is where , is the Euclidean distance, which stands for the distance between the sample and the distribution center, is the characteristic number of sample, and is the weighted parameter. The object of FCM is to find the best classification to make the function value minimum. The sum of all the membership degrees of each clustering is 1; that is, , .

The calculation formula of membership degree is

The formula used to calculate distribution centers is

Set , for all the class , ; .

Apply formulas (2) and (3) to modify data clustering center, membership degree, and classification repeatedly. When the algorithm is convergent, the clustering center of all clusters and the membership degree of each sample belonging to each cluster are gotten. Though the search speed of FCM is fast, FCM is essentially a local search algorithm and is sensitive to the initial value of clustering center. If the selection of the initial value is undeserved, the algorithm will converge to a local minimal value.

3. Real-Parameter Quantum-Inspired Evolutionary Algorithm

Conventional QIEA is based on binary code; and are, respectively, the probability amplitude of 0 and 1. Conventional QIEA has a good performance in solving the optimization function with binary parameters or combinatorial problem. QIEA based on real parameters needs to be designed to make the optimization problem with real parameters better solved [16]. S.-Y. Li and P.-C. Li adopted real numbers to encode quantum bits to optimize the weights of neural network [17]. Chen et al. proposed real-coded chaotic quantum-inspired genetic algorithm (RCQGA) [18], which avoids the premature convergence of binary QGA. Sailesh Babu et al. proposed real-parameter quantum evolutionary algorithm and used it on economic load dispatch [16]. This algorithm is regarded as classical RQIEA. The new RQIEA is proposed based on the algorithm in literature [16].

The candidate solution string in RQIEA is generated as follows: a group of quantum bit strings, , is the qubit string in the iteration; correspondingly, the other group of bit strings of real numbers is ; is maintained. Each has qubits, which stands for the probability amplitude of . The probability of generating a real number on the higher (lower) side of present value is decided by (). Early in the search process, all the probabilities are equal; and of are all initialized with 0.707. Each element of is initialized to a random number in the range between the minimum and maximum in the domain. Each pair of and represents the family in the iteration. The solution strings , of the family are generated by , , and (the solution string with best fitness currently found). The fitness of is calculated after the constraint conditions are determined.

The flow chart of generation of is shown in Figure 1.

714657.fig.001
Figure 1: The flow chart of generation of .
3.1. Two Neighborhood Operators

Two neighborhood operators, neighborhood operator 1 (NO1) and neighborhood operator 2 (NO2), are used to generate neighborhood solution strings. The best out of these is determined for each family. If is better than , then replaces to be . The best value of all (if it is better than ) replaces to be .

In RQIEA, the evolution of the quantum bits represents the evolution of the coherence state of 0 and 1. The change of and is translated to the real-valued parameters in the problem space by two neighborhood operators, NO1 and NO2.

NO1. In the generation, quantum bits , there are elements in each . NO1 is used to generate solution strings , each of which has elements.

The array with elements is generated, whose elements are +1 or −1, randomly. is the element of ; then where is the alteration of angle, is the rotation angle, and . If , is a random number in the range ; if , is a random number in the range (Figure 2).

714657.fig.002
Figure 2: The flow chart of applying NO1 to calculate the element of the individual of the population in the generation.

The formula of calculating the probability amplitude is

Then, the formula to calculate the individual elements is where and are the maximum and minimum values in the allowable range.

NO2. Most mechanisms of NO2 are the same with NO1, except for the fact that the value point generated by NO2 is between and . NO2 utilizes formula (6) to determine , where, , , and is the best individual of the population in the generation.

NO1 is better in exploration and NO2 is better in exploitation. Due to the different characteristics of NO1 and NO2, NO1 and NO2 are used in different frequencies during the different process of the algorithm. The frequencies are decided by formula (7). Consider where is the present evolution generation and is the total evolution generation.

The basic principle of the two neighborhood operators is as follows: NO1 is better in exploration performance, for the solutions generated by given strings are different with the given strings in a great tendency; NO2 is better in exploitation performance, for will converge to with the process of the algorithm. This algorithm avoids the shortcoming of binary representation and keeps a good balance between exploration and exploitation.

3.2. Update Quantum Bit Sting

All the individual states of quantum bit in are changed in the process of updating, so that the probability of generating the solution which is similar to the current optimal solution increases in each of the subsequent iterations. The change of the probability is determined by the learning rate . The value of under different conditions of objective function values and element of and in the iteration is shown in Table 1.

tab1
Table 1: Determine method of in th iteration.

determines the rate of qubits from 0.707 to the final value 0 or 1. The value of is very important for exploration in the early evolution and exploitation in the late evolution.

Where is the size of rotation angle in iteration, , is the maximal rotation angle, is the minimal rotation angle, is the present evolution generation, and is the total evolution generation. This determined method of is helpful for exploration in the early evolution and exploitation in the late evolution.

3.3. The Migration

Global migration and local migration take effect in common. Random selected is used to update some in the local migration; is used to update in the global migration.

The flow chart of RQIEA is shown in Figure 3.

714657.fig.003
Figure 3: The flow chart of RQIEA.

4. Clustering Algorithm Based on RQIEA

The essence of local optimization of clustering algorithm greatly limits the quality of distribution center location. There is no coding and decoding process in RQIEA, and the precision of solution is not affected by coding bits so RQIEA can quickly converge to the global optimal solution. RQIEA uses the probability characteristics of qubit to realize evolution to guarantee the directionality of the evolution and the diversity of population. Combination of RQIEA and FCM can effectively overcome the shortcoming of local optimum of FCM; thereby the quality of distribution center location can be improved [11].

4.1. Coding and the Initialization of Population

The coding of algorithm consists of two parts: the real number coding of clustering center and the corresponding quantum bit encoding. Coding is carried out after the size of the number of distribution centers , the scale of the population , and scope of the distribution center location are determined.

The real number coding of the clustering center of the population is initialized as where is the cluster center of the individual.

The corresponding quantum bit coding of clustering center of the population is where and are initialized to 0.707.

4.2. The Iterative Process

Preset the exponent for the partition matrix , maximum number of iterations, and minimum amount of improvement. The process of iteration is as follows.(1)Initialize the control parameters such as population size and the maximum evolutionary iteration .(2)Randomly initialize clustering centers, and generate the initial population. Apply formula (2) to calculate the membership degree and the corresponding individual fitness value () for every clustering center.(3)Set the loop counter variable .(4)Carry out the quantum evolutionary operation. Apply formulas (2) and (3) to calculate the membership degree of the sample and the fitness value of the cluster centers of the new generated individual. If , accept the new individual or give up the new individual.(5)If , then ; go to step (4) or end the algorithm.

The flow chart of the clustering algorithm based on RQIEA is shown in Figure 4.

714657.fig.004
Figure 4: Flow chart of the clustering algorithm based on RQIEA.

Introducing RQIEA into clustering analysis and design of the encoding and fitness function according to the actual situation of clustering problem makes the algorithm more quickly and effectively converge to the global optimal solution [19].

5. Simulation Analyses

FCM, CSAGA, and RQECA are tested on random data to do comparative analysis. Produce 400 two-dimensional plane points which is shown in Figure 5. The number of distribution center is 4, the initial temperature of the CSAGA is 100, the cooling factor is 0.8, terminal temperature is 1, exponent for the partition matrix is 3, maximum number of iterations is 20, minimum amount of improvement is , the number of individuals is 5, the maximal genetic generation is 10, and the size of the binary bits is 4.

714657.fig.005
Figure 5: 400 random data of the sample.

Use the random initial cluster centers for the FCM clustering. Ten rounds of experiments are presented in this paper. We performed the experiments in each round for 10 tests, taking the average of the results as the final simulation results. The results of the FCM are shown in Table 2.

tab2
Table 2: Simulation result of FCM.

The clustering figure of FCM when is shown in Figure 6. Where the triangles are the clustering centers of each cluster, the points are divided into 4 clusters, and the different color represents the points in different clusters.

714657.fig.006
Figure 6: Clustering figure of FCM.

The results of the CSAGA are shown in Table 3. Compare the results in Tables 2 and 3; the values of in Table 3 are all the optimal value 3.3035. But the run time in Table 3 is greatly longer than the run time in Table 2.

tab3
Table 3: Simulation result of CSAGA.

The results of the RQECA are shown in Table 4. Compare the results in Tables 2, 3, and 4. The values of in Tables 3 and 4 are all the optimal value, and the run time of RQECA is shorter than CSAGA.

tab4
Table 4: Simulation result of RQECA.

Contrast the data in Tables 2, 3, and 4; it can be obtained that the convergence of FCM is the poorest; the convergence of CSAGA is as good as RQECA, but the evolution time of CSAGA is longer. The values of in Table 2 do not converge to the minimum value 3.3035, but all the values of in Tables 3 and 4 are 3.3035. So, the convergence of CSAGA and RQECA is obviously improved. Apply the test method of mean difference of two normal populations ( test) to analyze the running time of CSAGA and RQECA.

The data of running time of the two methods can be considered to be samples from normal population . The means of the sample of the two methods are and , respectively, and the variances are and . The -statistic is introduced to be the test statistic: where and , .

The form of rejection region is .

If {Reject when is true, then .

So the rejection region is .

The hypotheses , , and , , need to be tested.

The mean and variance of running time of CSAGA and RQECA are as follows: , , and ; , , and . Then, and . So reject ; that is, the running time of CSAGA is longer with probability of more than 99.5% than the RQECA.

The clustering figure of is shown in Figure 7, where the triangles are the clustering centers of each cluster. The different point between the clustering figure after optimized and clustering figure of FCM is marked with “□.”

714657.fig.007
Figure 7: The clustering figure after optimization.

The evolutionary figure of three kinds of algorithms is shown in Figure 8. Where the blue curve is the evolutionary curve of FCM; the red curve is the evolutionary curve of CSAGA; and the black curve is the evolutionary curve of RQECA. -axis represents the evolutionary time and -axis represents the value of . Through the comparison of the three algorithms, it can be concluded that the evolutionary speed of RQECA is fastest and the efficiency of RQECA is best.

714657.fig.008
Figure 8: Evolutionary figure of three kinds of algorithms.

6. Conclusions

RQECA is the combination of RQIEA and FCM. It can be used to effectively solve the problem of multidistribution center location. The global search ability of RQECA is powerful. RQECA avoids the defect that FCM easily falls into local minimum and reduces the sensitivity to the initial value. The superiority of RQECA will be more obvious when the size of the data is more. The only objective of multidistribution center location in this paper is to minimize the distance without regarding complex constraints. The distribution center location problem with complex constraint conditions can be studied in the future.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. M. Muhammad, H. Hasan, A. F. Mohd Fiah, and A. Mohd Nor, “Effective communication systems for Malaysian logistics industry,” Procedia—Social and Behavioral Sciences, vol. 130, no. 15, pp. 204–215, 2014. View at Google Scholar
  2. H. A. von der Gracht and I.-L. Darkow, “Scenarios for the logistics services industry: a Delphi-based analysis for 2025,” International Journal of Production Economics, vol. 127, no. 1, pp. 46–59, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. C. Liu and J. Yan, “The comparative analysis of economic forecasting model on China's logistics engineering industry,” Systems Engineering Procedia, vol. 5, pp. 366–371, 2012. View at Publisher · View at Google Scholar
  4. H. Said and K. El-Rayes, “Automated multi-objective construction logistics optimization system,” Automation in Construction, vol. 43, pp. 110–122, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. F. A. Garcia, M. G. Marchetta, M. Camargo, L. Morel, and R. Q. Forradellas, “A framework for measuring logistics performance in the wine industry,” International Journal of Production Economics, vol. 135, no. 1, pp. 284–298, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Kim, K. Shim, M. S. Kim, and J. Sup Lee, “DBCURE-MR: an efficient density-based clustering algorithm for large data using MapReduce,” Information Systems, vol. 42, pp. 15–35, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. Y.-C. Wu, “A top-down information theoretic word clustering algorithm for phrase recognition,” Information Sciences, vol. 275, pp. 213–225, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. F. Zhao, J. Fan, and H. Liu, “Optimal-selection-based suppressed fuzzy c-means clustering algorithm with self-tuning non local spatial information for image segmentation,” Expert Systems with Applications, vol. 41, no. 9, pp. 4083–4093, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Zhang and J. Yu, “Fuzzy partitional clustering aIgorithms,” Journal of Software, vol. 15, no. 6, pp. 858–869, 2004. View at Google Scholar
  10. C. Rana and S. K. Jain, “An evolutionary clustering algorithm based on temporal features for dynamic recommender systems,” Swarm and Evolutionary Computation, vol. 14, pp. 21–30, 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Kou, Y. Peng, and G. Wang, “Evaluation of clustering algorithms for financial risk analysis using MCDM methods,” Information Sciences, vol. 275, pp. 1–12, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. U. Maulik and S. Bandyopadhyay, “Genetic algorithm-based clustering technique,” Pattern Recognition, vol. 33, no. 9, pp. 1455–1465, 2000. View at Publisher · View at Google Scholar · View at Scopus
  13. B. Xi, L. Xiaofeng, and S. Jigui, “Application of genetic algorithm fusing simulated annealing in document clustering,” Computer Engineering and Application, vol. 23, pp. 144–147, 2006 (Chinese). View at Google Scholar
  14. Y. Li, S. Feng, X. Zhang, and L. Jiao, “SAR image segmentation based on quantum-inspired multiobjective evolutionary clustering algorithm,” Information Processing Letters, vol. 114, no. 6, pp. 287–293, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. S. J. Nanda and G. Panda, “A survey on nature inspired metaheuristic algorithms for partitional clustering,” Swarm and Evolutionary Computation, vol. 16, pp. 1–18, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. G. S. Sailesh Babu, D. Bhagwan Das, and C. Patvardhan, “Real-parameter quantum evolutionary algorithm for economic load dispatch,” IET Generation, Transmission and Distribution, vol. 2, no. 1, pp. 22–31, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. S.-Y. Li and P.-C. Li, “Quantum genetic algorithm based on real encoding and gradient information of object function,” Journal of Harbin Institute of Technology, vol. 38, no. 8, pp. 1716–1723, 2006. View at Google Scholar · View at Scopus
  18. H. Chen, J. S. Zhang, and C. Zhang, “Real-coded chaotic quantum-inspired genetic algorithm,” Control and Decision, vol. 20, no. 11, pp. 1300–1303, 2005 (Chinese). View at Google Scholar · View at Scopus
  19. T.-D. Nguyen, B. Schmidt, and C.-K. Kwoh, “SparseHC: a memory-efficient online hierarchical clustering algorithm,” Procedia Computer Science, vol. 29, pp. 8–19, 2014. View at Publisher · View at Google Scholar