Application of Discrete Mathematics in Urban Transportation System Analysis
View this Special IssueResearch Article  Open Access
Zhen Yaobao, Hu Ping, Yang Shu, "An Improved Particle Swarm Optimization for the Automobile Spare Part Warehouse Location Problem", Mathematical Problems in Engineering, vol. 2013, Article ID 726194, 6 pages, 2013. https://doi.org/10.1155/2013/726194
An Improved Particle Swarm Optimization for the Automobile Spare Part Warehouse Location Problem
Abstract
This paper deals with a reallife warehouse location problem, which is an automobile spare part warehouse location problem. Since the automobile spare part warehouse location problem is a very complex problem, particle swarm optimization is used and some improved strategies are proposed to improve the performance of this algorithm. At last, the computational results of the benchmark problems about warehouse location problems are used to examine the effectiveness of particle swarm optimization. Then the results of the reallife automobile spare part warehouse location problem also indicate that the improved particle swarm optimization is a feasible method to solve the warehouse location problem.
1. Introduction
The profitability of automobile spare part warehouse location for automobile spare part factories is important for several reasons. The last decade has witnessed greatly growth in the demand of automobile and commensurate with this growth is the large demand of automobile spare parts. The cost of the management and stock has been an excess burden for automobile spare part factories. Furthermore, the fixed cost of the vehicles involved in automobile spare part delivery is high enough. Automobile spare part warehouses are a part of an overall effort to gain place and time utility (a decision aid in warehouse site selection). It has some obvious advantages. For example, a warehouse can hold stocks to match the imbalance between supply and demand. And the travelling cost can be decreased by collecting from multiple sources into a single vehicle to the final destination. Therefore, these increasing pressures and the advantages of warehouse have caused these factories to look for an automobile spare part warehouse to minimize their management cost.
There have been many literatures on the location of warehouse. Michel and van Hentenryck [1] proposed a tabu search to solve the warehouse location problem which considered the fixed and the transportation costs from warehouse to stores. In the algorithm, a linear neighborhood was used to improve the performance of the tabu search. Khumawala [2] proposed an uncapacitated warehouse location problem which aimed to minimize the fixed cost of warehouse and the warehouse operating costs and transportation costs from the warehouse to customers. Then he attempted to solve the warehouse location problem by using of an efficient heuristic procedure which was derived from the branching decision rules. Baker [3] introduced a partial dual algorithm to solve the capacitated warehouse location problem which is based on the properties of transportation problems. Ozsen et al. [4] proposed a model of the capacitated warehouse location with risk pooling, in which the fixed facility location, transportation, and inventory carrying costs are considered simultaneously. Then, they tried to use a Lagrangian relaxation algorithm to solve this problem.
From the literatures, it can be attained that warehouse location problem has been recognized by academics and practitioners. Most of them paid attentions to the fixed cost of warehouse or transportation cost from warehouse to customers. However, in the reallife automobile spare part warehouse problem, the transportation cost from the factories to warehouse should also be considered. However, only few literature works attempted to incorporate routing from the suppliers to the warehouse and the warehouse to customers in location analysis. This paper attempted to solve a reallife automobile spare part warehouse location problem, in which there are some automobile spare part factories and their customers.
Therefore, the objective of the warehouse location problem is to minimize the sum of the transportation cost from the factories to the warehouse and from the warehouse to the customers and the fixed cost of warehouse. Based on the objective, it can be attained that the automobile spare part warehouse location problem is a generalization of wellknown and difficult location problems. It is therefore a large and complex problem. Many literature works suggested that heuristic algorithm was often a first choice to solve this kind of complicated problems [5–12]. Among heuristic algorithms, particle swarm optimization (PSO) is a heuristic which is a populationbased search method developed by Kennedy and Eberhart [13]. PSO simulates the social behaviors from bee swarm, fish school, or bird flock. Thus, in PSO, each solution of optimization problem is corresponding to the position of one particle in the searching space. PSO attains the search for optimum based on the mechanism which adapts to the global and local exploration. Most applications of PSO have indicated that PSO have concentrated on the optimization in continuous space. In recent years, PSO has been a very popular optimization method due to that PSO does not need the calculation of derivatives, but the information from each particle and the information between the whole particle population. Thus, PSO is less sensitive to the nature of the objective function. which can be suitable for stochastic objective functions and can easily escape from local minima. PSO has been successfully applied to solving the complex problem [14–16]. Therefore, PSO is used to solve the automobile spare part warehouse location problem in this paper.
The remainder of the paper is organized as follows. Section 2 introduces the automobile spare part warehouse location problem. In Section 3, PSO and some improvement strategies are presented. Some computational results are discussed in Section 4 and, lastly, the conclusions are provided in Section 5.
2. The Automobile Spare Part Warehouse Location Problem
The automobile spare part warehouse location problem can be described as follows. There are a set of potential warehouses and a set of customers (repair station). Each warehouse has a fixed cost and the transportation cost from production factories to warehouse and from warehouse to customers. The automobile spare part warehouse location problem is to find a subset of warehouses and an assignment of warehouses to the customers aiming to minimize the fixed and the transportation costs. Once the locations of the warehouses are determinate, these warehouses should be assigned to serve their closest warehouse. Figure 1 described the network about the automobile spare part delivery.
From Figure 1, there are depots for potential warehouse, that is, . it is assumed that is selected as the warehouse which should serve the customers. And it is possible for any set among to be the warehouse(s). Then, the automobile spare part warehouse location problem can be formulated as formulas (1a)–(1e):where is the maximum operative budget; is the number of potential warehouse; is the number of customers; is the number of factories; and in formulas (1a)–(1e) stand for the costs from point to and from point to , respectively;in this paper, it is the unit transportation cost of unit distance and unit quantity. is the demand of customer supplied from warehouse . is the demand of warehouse supplied from factory . is the fixed cost associated with warehouse , where formulas (1a)–(1e) represent the objective function, as described above. Constraint (1b) ensures that the fixed cost from selected warehouse cannot exceed the total planned budget. Constraint (1c) ensures the reliability of production of part factories. Constraints (1d)(1e) ensure that each customer can be visited at most once.
3. Improved Particle Swarm Optimization for the Automobile Spare Warehouse Location Problem
3.1. Particle Swarm Optimization
PSO is a populationbased search method, proposed by Kennedy and Eberhart [13], in which each individual is taken as a particle. Each particle has a position in the space of solutions and fly at a certain speed. The particles can dynamically adjust their position according to the fly experiences from themselves and their populations, that is, three possible directions that a particle can follow: one is its own path, the second is its best position, and the third is the best position of the population. In this way, the particle’s personal best position and the global best position can be always updated and kept. Thus, the principles of the algorithm can be described as follow.
In PSO, the position of each particle is a solution of the problem. The fitness of each particle is based on the objective function of the problem. The position () and the speed () of particle can be denoted as and , respectively. At the iteration , if the best fitness of particle is and the best fitness of the whole population is , then, the velocity and the position of the particle are updated using the following formula: where is the iteration counter; and are the acceleration coefficients which determine the effect the experiences from the particle and the population. is the inertia weight which is used to control the impact of previous histories of velocities on current velocity. The inertia weight is a parameter which affects the tradeoff between exploration and exploitation.
3.2. Random Inertia Weight
According to (3), it can be found that inertia weight is one of the most important parameters of PSO algorithm. In order to balance the global search ability and local search ability, the value of the inertia weight should be adjusted to achieve the goal. If the value of the inertia weight was larger, the particle would have stronger global searching ability. While the value of the inertia weight was smaller, the local searching ability of the particle would be enhanced. If the value of the inertia weight can obey a certain distribution of random number, it will randomize particle movement according to (3). Hence, two different particles may move to different position in the subsequent iteration even though they have similar position, personal best, and global best. It is common to have high inertia weight at the beginning of PSO iteration to lead to the particles exploring larger solution space, and low weight at the end allows the population following the cognitive and social term to exploit the personal best and global best in the final phase. Based on the above analysis, the proposed random inertia weight can be described as the following formula: where is the minimum value of the proposed random inertia weight ; is the minimum value of the proposed random inertia weight ; denotes the uniformly distributed random numbers between 0 and 1; is deviation, which is used to measure the deviation degree between the random inertia and its average value and can control the direction of the random inertia to expected value. is a random of normal distribution. is the number of the current iteration, and is the maximum number of the iterations.
3.3. Acceleration Coefficients
From the formula (3), the acceleration coefficients and can also be attained which are used to control the acceleration weight for each particle to the best fitness and the best fitness of the whole population, respectively. Thus, acceleration coefficient with low value allows particles to roam far from target regions before being tugged back, while high values for high value easily result in abrupt movement towards, or past, target regions [13]. If , the particles are directed where their velocity indicates, which will lead to the algorithm fail in finding the optimal solution. If and , all the particles follow the best particle. There is not social information exchange between particles and then the model becomes a cognitiononly model. Thus it is difficult for the model to find the optimal solution. In most literature works, is selected.
The functions of and are changed so that the influence of the two factors can vary during the iterations. Therefore, the value of acceleration coefficient is also optimized to improve the performance of the algorithm. The following formulas for and can be used in this paper [17]: where, , , , and denote the minimum and maximum values of and , respectively. is the number of the current iteration and is the maximum number of the iterations.
3.4. Crossover Operation
Crossover operation is a reproduction operation in GA, which is used to exchange genetic information between two parent chromosomes at a predefined probability [10, 18, 19]. In this paper, crossover operation is used to help PSO algorithm to reach further solution space. In the crossover operation, half of the particles with better fitness are selected to enter into the next generation in each iteration. Simultaneously, the positions and speeds of the former halfparticles with better fitness substitute the corresponding vectors of the latter halfparticles with worse fitness. However, during the crossover operation, the individual extrema of the latter is unchanged. In the crossover operation, any two of the latter halfparticles will perform the crossover operation like genetic algorithm to children. Then half of the latter with better fitness enter into the next generation again. The crossover operation can increase the particle diversity, jump out of the local optimum, and accelerate the convergence speed.
The positions and speed vectors of the children particles are shown as follows: Among them, is a dimensional position vector. and show the positions of the child particles and the parent particles, respectively. is a dimensional evendistributed random vector, that is, crossover probability which is between 0 and 1.
Crossover operation can help the PSO algorithm to search in a larger space; however, in the late iteration, frequent crossover operation will make the algorithm run with more computing time and hard to be converged. Therefore, an adaptive method to adjust the crossover probability is used in this paper. The adaptive method can be found as follow: where is the initial value of the crossover probability. and represent the best fitness and the average fitness of the population until now. is the current best fitness.
4. Case Studies
This paper attempts to use an improved PSO algorithm to solve the automobile spare part warehouse location problem. To examine the feasibility of the improved PSO algorithm (IPSO), some benchmarks for uncapacitated warehouse location from the standard OR library are selected in this paper. Then, the IPSO is used to solve a reallife automobile spare part warehouse location problem. The following will describe the two examples, respectively.
4.1. The WellKnown Uncapacitated Warehouse Location
In order to examine the performance of the proposed IPSO in this paper, the instances from the standard OR library [1] are selected. The information of the test problems can be shown in Table 1. VC++.NET 2003 is used to achieve the IPSO proposed in this paper, operating environment is the Pentium IV 2.93 GHz processor and 3 GB for the Windows platform. Large number of experiments to determine the parameters is set to the following: the number of particle is 50. The maximum number of the iterations is set to 1000. Also , , and . In order to test the performance of the algorithm, the results of the proposed IPSO algorithm are compared with those of tabu search [1]. Table 2 is the results from these algorithms for solving the warehouse location problems from the standard OR library.


From Table 2, it can be found that most results of IPSO algorithm have been close to the ones of tabu search, which indicate that the proposed IPSO algorithm is suitable for solving a warehouse location problem.
4.2. The Automobile Spare Part Warehouse Location Problem
The PSO algorithm is examined by the warehouse location problems from the standard OR library, which indicates that IPSO algorithm is suitable for solving the warehouse location problem. Then a reallife automobile spare part warehouse location problem needs to be solved by the PSO algorithm. In the reallife warehouse location problem, there is one automobile company that wants to large its business. Thus, the company wants to build some warehouses in a chosen area. Then the automobile spare parts will be sent from the company to the warehouses and from the warehouses to customers (e.g., repair station). There is one warehouse in the chosen area and three alternative points for selection. In the chosen area, there are four potential points for selection and ten customers need to be served. If the horizontal and vertical coordinates of the factory are assumed as (0,0), then, the information of the problem is shown in Tables 3, 4, and 5.



Then, the improved PSO continues calculating the automobile spare par warehouse location problem ten times. However, in the reallife seafood product delivery routing problems, the distance between two points is based on the length of the routes. The results are shown in Figure 2. It can be found that the optimization results are stable and the difference between the optimum and the worst plan is less than 2.1%. Furthermore, the computing time is from 320 to 410 seconds, which is acceptable for the larger reallife problem. Therefore, the proposed PSO has an excellent convergence performance to solve the automobile spare part warehouse location problem. The optimized results of the problem can be seen in Table 6.

From Table 6, it can be attained that the potential warehouse 3 is not suitable for warehouse and the potential warehouses 1, 2, and 4 are selected for warehouse location.
5. Conclusions
The automobile spare part warehouse location problem is the warehouse selection in potential depots in order to meet the demand of the customers and keep the automobile spare part factory competitiveness in a chosen area. Thus, the automobile spare part warehouse location problem is attempted to minimize the total cost which includes the transportation cost (from factories to warehouse and from warehouse to customers) and the fixed cost while meeting the constraints. Since the automobile spare part warehouse location problem is difficult to be solved. PSO is selected in this paper and some improved strategies are used to improve the performance of PSO. The computational results of some benchmark instances for uncapacitated warehouse location problem from the standard OR library suggest that the improved PSO is effective to solve the warehouse location problem. The results of the automobile spare part warehouse location problem can also indicate that the improved PSO is an effective method for the automobile spare part warehouse location problem.
The main contribution of this paper is to test the feasibility of PSO for the automobile spare part warehouse location problem. Our future research work will be on the models with stochastic demand, model and solve the model by other convenient methods, and possibly have added a capacity constraint on the multiple central warehouses.
Acknowledgments
This work was supported by the National Science Foundation for Postdoctoral Scientists of China 2013M530924 and the National Natural Science Foundation of China 51208079 and 11272075.
References
 L. Michel and P. van Hentenryck, “A simple tabu search for warehouse location,” European Journal of Operational Research, vol. 157, no. 3, pp. 576–591, 2004. View at: Publisher Site  Google Scholar
 B. M. Khumawala, “An efficient heuristic procedure for the capacitated warehouse location problem,” Naval Research Logistics Quarterly, vol. 21, no. 4, pp. 609–623, 1974. View at: Google Scholar
 B. M. Baker, “A partial dual algorithm for the capacitated warehouse location problem,” European Journal of Operational Research, vol. 23, no. 1, pp. 48–56, 1986. View at: Google Scholar
 L. Ozsen, C. R. Coullard, and M. S. Daskin, “Capacitated warehouse location model with risk pooling,” Naval Research Logistics, vol. 55, no. 4, pp. 295–312, 2008. View at: Publisher Site  Google Scholar
 G. Chen, K. Govindan, and Z. Yang, “Managing truck arrivals with time windows to alleviate gate congestion at container terminals,” International Journal of Production Economics, vol. 141, no. 1, pp. 179–188, 2012. View at: Publisher Site  Google Scholar
 G. Chen and Z. Yang, “Optimizing time windows for managing export container arrivals at Chinese container terminals,” Maritime Economics & Logistics, vol. 12, no. 1, pp. 111–126, 2010. View at: Publisher Site  Google Scholar
 B. Y. Chen, W. H. K. Lam, A. Sumalee, and H. Shao, “An efficient solution algorithm for solving multiclass reliabilitybased traffic assignment problem,” Mathematical and Computer Modelling, vol. 54, no. 56, pp. 1428–1439, 2011. View at: Publisher Site  Google Scholar
 B. Y. Chen, W. H. K. Lam, A. Sumalee, Q. Q. Li, H. Shao, and Z. X. Fang, “Finding reliable shortest paths in road networks under uncertainty,” Networks & Spatial Economics, vol. 13, no. 2, pp. 123–148, 2013. View at: Google Scholar
 B.Z. Yao, C.Y. Yang, J.B. Yao, and J. Sun, “Tunnel surrounding rock displacement prediction using support vector machine,” International Journal of Computational Intelligence Systems, vol. 3, no. 6, pp. 843–852, 2010. View at: Google Scholar
 B. Yu and Z. Z. Yang, “An ant colony optimization model: the period vehicle routing problem with time windows,” Transportation Research E, vol. 47, no. 2, pp. 166–181, 2011. View at: Publisher Site  Google Scholar
 B. Yu, Z.Z. Yang, and B. Yao, “An improved ant colony optimization for vehicle routing problem,” European Journal of Operational Research, vol. 196, no. 1, pp. 171–176, 2009. View at: Publisher Site  Google Scholar
 B. Yu, Z.Z. Yang, P.H. Jin, S.H. Wu, and B.Z. Yao, “Transit route network designmaximizing direct and transfer demand density,” Transportation Research C, vol. 22, pp. 58–75, 2012. View at: Publisher Site  Google Scholar
 J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Aystralia, December 1995. View at: Google Scholar
 A. W. Mohemmed, N. C. Sahoo, and T. K. Geok, “Solving shortest path problem using particle swarm optimization,” Applied Soft Computing Journal, vol. 8, no. 4, pp. 1643–1653, 2008. View at: Publisher Site  Google Scholar
 T.L. Lin, S.J. Horng, T.W. Kao et al., “An efficient jobshop scheduling algorithm based on particle swarm optimization,” Expert Systems with Applications, vol. 37, no. 3, pp. 2629–2636, 2010. View at: Publisher Site  Google Scholar
 T. J. Ai and V. Kachitvichyanukul, “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery,” Computers & Operations Research, vol. 36, no. 5, pp. 1693–1702, 2009. View at: Publisher Site  Google Scholar
 Y. Marinakis, G. R. Iordanidou, and M. Marinaki, “Particle swarm optimization for the vehicle routing problem with stochastic demands,” Applied Soft Computing, vol. 13, no. 4, pp. 1693–1704, 2013. View at: Publisher Site  Google Scholar
 B. Yu, Z. Yang, and C. Cheng, “Optimizing the distribution of shopping centers with parallel genetic algorithm,” Engineering Applications of Artificial Intelligence, vol. 20, no. 2, pp. 215–223, 2007. View at: Publisher Site  Google Scholar
 B. Yu, Z. Yang, and C. Cheng, “Optimizing the distribution of shopping centers with parallel genetic algorithm,” Engineering Applications of Artificial Intelligence, vol. 20, no. 2, pp. 215–223, 2007. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Zhen Yaobao 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.