- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 104279, 11 pages
Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO
College of Management, Shenzhen University, Shenzhen 518060, China
Received 19 April 2012; Accepted 6 June 2012
Academic Editor: Yuping Wang
Copyright © 2012 Xiaobing Gan 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.
This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW). The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO) algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, the MCPSO algorithm performs best for solving this problem.
Vehicle routing problem with time windows (VRPTW) is an important issue in logistics system which has been researched widely in recent years. The problem can be described as choosing routes for limited number of vehicles to serve a group of customers in the time windows. Each vehicle has a limited capacity. It starts from the depot and terminates at the depot. Each customer should be served exactly once. The objective of the VRPTW is to minimize the total transport costs. Many researchers have contribute to the problem. In 1981, Schrage  proposed vehicle routing and scheduling problem with time window constraints as an important area for progress in handling realistic complications and generalizations of the basic routing model. Feng  divide the VRPTW with delivery and pickup into five categories. Wang and Lang  proposes multiperiod vehicle routing problem with recurring dynamic time windows.
However, in reality, two factors need to be considered, the uncertain number of vehicles and simultaneous delivery and pick-up. This situation is very common in transport activity, because reduction of the number of the vehicles can save costs, while simultaneous delivery and pick-up can improve transport efficient. VRPTW with simultaneous delivery and pick-up service (VRPTW-SDP) is an extension of VRPTW, where customers require simultaneous delivery and pick-up.
Many researchers have made great effort in solving the VRPTW in recent years. Fisher  proposed -trees to solve the VRP and VRPTW. Kolen et al.  described a branch-and-bound method. However, those classical approaches less efficient in solving complex problems. Thus evolutionary algorithm (EA) is proposed to deal with optimization problems. Among those algorithms, particle swarm optimization (PSO) has turned out to be an efficient algorithm in dealing with many complex optimization problems. While PSO also has some disadvantages. It sometimes immerses the local optimal value, thus the accuracy is limited. Then the multiswarm cooperative particle swarm optimization (MCPSO) was proposed as an improved PSO in . It takes a multi-swarm cooperative evolutionary strategy where the master swarms change their particles based on their own knowledge and the knowledge of the particles in the slave swarms, while the slave swarms carry out PSO independently.
In this paper, we study a case of the VRPTW both with uncertain number of vehicles and simultaneous delivery and pickup service. The objective of the proposed VRPTW-SDP is minimizing the transport costs. In order to solve the VRPTW-SDP, we set the objective of VRPTW-SDP as the fitness function of MCPSO. In MCPSO, each particle should contain two aspects of the customers, the order of served by which vehicle. Thus two dimensions encoding methods in MCPSO are proposed and used for the VRPTW-SDP.
The rest of this paper is arranged as follows. Section 2 describes the VRPTW-SDP, Section 3 describes the MCPSO for the proposed problem, Section 4 presents experiment study, and Section 5 of the paper contains the conclusion.
2. Description of VRPTW-SDP
Vehicle routing problem with time windows (VRPTW) can be defined as choosing routes for limited number of vehicles to serve a group of customers in the time windows. Each vehicle has a limited capacity. It starts from the depot and terminates at the depot. Each customer should be served exactly once. If vehicles arrive before the time window “opens” or after the time window “closes,” there will be waiting cost and late cost. Assume that there are vehicles in depot 0. customers are waiting to be served and each of the customers has a demands of () units. The distance between customer and is . Each vehicle has a capacity of units. That is, the total demands of customers served by each vehicle cannot exceed units. Therefore, the vehicle has to periodically returned to the depot for reloading or a new vehicle needed to be arranged for delivery. Besides, each customer must be visited once and only once by exactly one vehicle. represents service time needed by customer . Therefore, the vehicle has to stay at the location of customer for a time interval at least ( is associated with the depot 0) for service. A time window  is considered. Therefore, if a vehicle arrives at customer before , it has to wait until the beginning of the time window to serve the customer. Thus there is a cost for waiting. On the other hand, if a vehicle cannot arrive at before , there will be a cost for late. The velocity of each vehicle is . represents the moment when the vehicle arrives from the depot. And the unit freight of each vehicle is . This paper considers the condition that vehicles of the depot are the same, that is, the vehicles have the same velocity , the same capacity and the same unit freight .
The goal of VRPTW is where
In the model, formula defines the time window constraint, where is the time when the vehicle arrives at customer , is the waiting time of a vehicle at the customer . From formula (2.3), is the service time, and is the traveling time of vehicle between customer and . When , the vehicle is at the depot, .
Constraint (2.4) represents the number of the vehicles which start from the depot and go back to depot is . Constraint (2.5) and constraint (2.6) stand for each customer can only be served by one vehicle. Constraint (2.7) means all the vehicles which start from the depot go back to the depot. Constraint (2.8) denotes the quantity of goods that each vehicle carries could not exceed the capacity .
However, two extra aspects are involved. Firstly, what if the number of the vehicles is uncertain? Zhang et al.  proposed that the number of the vehicles can be calculate by , where is the demands of the customer , is the vehicle’s capacity. This is quite simple, but it may not meet the requirement of the time window. When the number of the vehicles is uncertain, it is not necessary to use all of the vehicles. The reduction of the vehicles may contribute to reducing the total costs. Consider the constraint (2.4), where can be replaced by . Secondly, simultaneous delivery and pickup is involved to the vehicles. Under this condition, two variables are related to the customer, demands (delivery) and supplies (pickup) .
Define parameters: is unit freight of the vehicle, is the total number of the vehicles, is the total number of the customer, represents the distance between customer and , is the velocity of each vehicle, is the demands of customer , is the supplies of customer , is the service time of customer , represents the time window, is the cost for waiting, is the cost for late, is the specified capacity of the vehicle, is the time when the vehicle arrives customer , represents the capacity of the vehicle when it travels from customer to , represents the pick-ups of the vehicle from customer when it travels from customer to ,
When the vehicle starts from the depot, its total cargo quantity should be equal to the sum of all the customers’ demands, who are on the route of the vehicle travels along, so While, when the vehicle returns to the depot, the total pick-ups quantities are the sum of each customer’s supplies. That is Then the model is as follows:
In the model, formula (2.12) is the goal of the problem, that is minimum the cost. Formula (2.13) calculates the time when the vehicle travels from customer to . Constrain (2.14) means that all the vehicles start from the depot and terminate at the depot. Constrain (2.15) and (2.16) represent that each customer can only be served by one vehicle. Constrain (2.17) and (2.19) stand for the capacity of each vehicle cannot exceed the specified capacity. Constrain (2.18) and (2.20) stand for the sum pickups of each vehicle cannot exceed the specified capacity. Constrain (2.21) represents the capacity of the vehicle after it has serviced the customer , but before it services customer . Constrain (2.22) means the number of the vehicles arranged should not exceed . Constrain (2.23) represents that no matter where the vehicle is, the capacity cannot exceed the vehicle’s specified capacity. Constrain (2.24) and (2.25) mean that the capacity and pickups should not lower .
3. MCPSO Algorithm for VRPTW-SDP
3.1. Description of MCPSO Algorithm
The particle swarm optimization (PSO) was proposed by Kennedy and Eberhart in 1995. It was inspired by the social behavior of animals, such as bird flocking and fish schooling. The mechanism of PSO is as follows. Each member of PSO is seen as a particle, and each particle is a potential solution to the problem. The particle keeps memory of its previous locations, and evolves from one generation to another. The experiences of all the particles are transmitted to the global best particle. By using the communication mechanism, PSO optimum search is speeded up.
However, PSO also has disadvantages. It sometimes converges to undesired local solution, thus the accuracy of the algorithm can achieve is limited. MultiSwarm Cooperative Particle Swarm Optimizer (MCPSO) proposed in  is a variant of PSO. It takes a multiswarm cooperative evolutionary strategy where the master swarms change their particles based on their own knowledge and the knowledge of the particles in the slave swarms, while the slave swarms carry out PSO independently to get the diversity of particles. The mechanism of information transfer for MCPSO is showed in Figure 1 (the arrows stand for information transfer).
Suppose that there are swarms, among which there are main swarms, the remains are slave swarms (). Each slave swarm evolves according to the PSO. When all the slave swarms are ready with the next new generation, each slave swarm then sends the best local individual to one of the master swarms. The master swarm chooses the best of all received individuals and other main swarms’ experiences and evolves according to the following equations: where represents one of the master swarm, represents the other master swarms, and are accelerating constant, is inertial weight, is migration coefficient, while , , and are uniform random sequences in the range . Note that the particle’s velocity update in the master swarm is associated with three factors : previous best position of the master swarm in dth; : best global of the master swarm in dth; : best global of the other master swarms in dth.
In what follows we briefly sketch out the multiswarm cooperative particle swarm optimizer (MCPSO) step by step. See Algorithm 1.
3.2. Particle Encoding Scheme
For our proposed vehicle route problem with time windows, the appropriate expression of particles in MCPSO algorithm is a key issue. After all, the essence of VRPTW is to determine the best route of vehicle from a series of potential solutions. The object is to minimize the sum of all costs. Based on the uncertain number of vehicles in this paper, for the VRPTW with demand points, dimensions encoding scheme is applied. For each demand point, two dimensions are involved. The first is the serial number of the vehicle that serviced the demand point. The second is the serial of the demand point that was serviced by . Conveniently, each particle corresponds to a matrix of . The first dimension represents the serial number of vehicles, and the second dimension represents the serial number of customers.
3.3. Design of Fitness Function
In this paper, the capacity of vehicles is calculated by Both sides of the equation have unknown quantities. It is complicated to convert the constraint by penalty function method. Hence the constraint is dealt with when we program for the VRPTW-SDP. Thus the objective function corresponds to the fitness function:
4. Experimental Study
We consider the following situatoion. 8 customers need served by one depot. The depot has 5 vehicles. Each of the vehicles has a capacity of 3 units and velocity of 10 units. The distance between each customer and the demands supplies of each customer is shown in Table 1. The distance between depot and each customer is shown in Table 2. The service time for each customer is 0.
Base on Matlab 7.0, we apply MCPSO algorithm to solve this VRPTW-SDP. In MCPSO algorithm, the number of swarms is . The 4 swarms conclude 3 slave swarms and 1 master swarm. The migration coefficient of the master swarm is . The migration coefficient of the slave swarm is . To validate its performance, the MCPSO algorithm is also compared with GA and PSO.
For fair comparison, in all cases the population size of GA/PSO and MCPSO was set at 100 (all the swarms of MCPSO include the same particles) and a fixed number of maximum iterations 100 is set in GA/PSO and MCPSO. In the fitness function, we set four parameters as follows: . The results are shown in Tables 3 and 4. To serve the 8 customers, 3 vehicles are arranged. The first vehicle serves customer 2, 8 and 4 in sequence. The second vehicle serves customer 3 and 6 in turn. The last one serves customer 1, 5, and 7 successively. The total fees are 549 units. From Table 4, we can see that the time points when vehicles arrive at customers are within the time windows. Figure 2 shows MCPSO algorithm, which converge on the minimum point quickly.
The ten fitness values are obtained in ten runtimes in GA algorithm, PSO algorithm and MCPSO algorithm. The final result including maximum, minimum, mean, and variance is shown in Table 5. It is apparently that the maximum, minimum and mean of MCPSO are smaller than PSO, whose are smaller than GA. Although the difference on maximum, minimum, and mean between PSO and MCPSO are small, the gap on variances is big. This means that the MCPSO is more stability. The convergence graph for MCPSO, PSO and GA can be seen in Figure 3. MCPSO achieves a minimal solution 549, which is lower than 570 (PSO) and 675 (GA). It is obvious that MCPSO is more suitable at least for our proposed vehicle route problem with time windows.
The VRPTW-SDP studied in this paper is an extension of VRPTW, where the number of vehicles with simultaneous delivery and pickup is uncertain. The proposed problem is meaningful for transport companies in real world. To solve the proposed problem, we used MCPSO algorithm. A new encoding method is proposed, which may be somewhat benefit to deal with other problems. Furthermore, with comparison to PSO algorithm and GA algorithm, the results show that the simple and robust MCPSO algorithm is more effective for the proposed VRPTW-SDP.
This work is supported by the National Natural Science Foundation of China (Grant no. 71001072, 60905039), the China Postdoctoral Science Foundation (Grant no. 20100480705), Science and Technology Project of Shenzhen (Grant no. JC201005280492A), the Natural Science Foundation of Guangdong Province (Grant no. 9451806001002294).
- L. Schrage, “Formulation and structure of more complex/realistic routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 229–232, 1981.
- Z. Feng, “Multi-period vehicle routing problem with recurring dynamic time windows,” in Proceedings of the 8th International Conference on Digtial Object Identifier, pp. 1–6, 2011.
- Y. Wang and M. Lang, “Study on the model and tabu search algorithm for delivery and pickup vehicle routing problem with time windows,” in Proceedings of the IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI '08), pp. 1464–1469, October 2008.
- M. L. Fisher, “Optimal solution of vehicle routing problems using minimum -trees,” Operations Research, vol. 42, no. 4, pp. 626–642, 1994.
- A. W. J. Kolen, A. H. G. R. Kan, and H. W. J. M. Trienekens, “Vehicle routing with time windows,” Operations Research, vol. 35, no. 2, pp. 266–273, 1987.
- B. Niu, Y. Zhu, X. He, and H. Wu, “MCPSO: a multi-swarm cooperative particle swarm optimizer,” Applied Mathematics and Computation, vol. 185, no. 2, pp. 1050–1062, 2007.
- T. Zhang, Y. J. Zhang, and M. G. Wang, “Model and hybrid algorithm for vehicle routing problem with uncertain vehicle number,” System Engineering—Theory Methodology Applications, vol. 11, no. 2, pp. 121–130, 2010.