About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 726564, 17 pages
http://dx.doi.org/10.1155/2012/726564
Research Article

A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

Department of Information Management, Tatung University, 40 Chungshan N. Road, Sec. 3, Taipei 104, Taiwan

Received 24 February 2012; Revised 5 May 2012; Accepted 8 May 2012

Academic Editor: Jung-Fa Tsai

Copyright © 2012 Yucheng Kao 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

The vehicle routing problem (VRP) is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI) approaches, ant colony optimization (ACO) and particle swarm optimization (PSO), for solving capacitated vehicle routing problems (CVRPs). In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best-so-far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

1. Introduction

The vehicle routing problem (VRP) is a well-known combinatorial optimization problem in which the computational complexity is NP-hard. The capacitated vehicle routing problem is one of the variants of VRPs. The objective of CVRPs is to minimize the total traveling distance of vehicles which serve a set of customers. The following constraints are considered in a typical CVRP: each route is a tour which starts from a depot, visits a subset of the customers, and ends at the same depot; each customer must be assigned to exactly one of the vehicles; each customer has its own demand and the total demand of customers assigned to a vehicle must not exceed the vehicle capacity. In the past decades, researchers proposed different strategies to solve the CVRP. One of them is to cluster customers into different routes and then to arrange the visiting sequence for each route. The objective function value will be apparently influenced by the results of customer clustering and sequencing. For more detailed descriptions of vehicle routing problems, the reader may refer to the articles by Laporte [1], Osman [2], and Cordeau et al. [3].

Because the CVRP is an NP-hard problem [4], the optimal solution of a large-size instance cannot be found within a reasonable time. To overcome this difficulty, many classical heuristic methods and metaheuristic methods are proposed in the past five decades. Some metaheuristic algorithms can provide competitive solutions to the CVRP, such as Simulated Annealing (SA), Tabu Search (TS), and Genetic Algorithm (GA). Metaheuristic algorithms have some advantages, for example, the abilities to escape from local optima through stochastic search, to speed convergence using solution replacement, to guide the search direction with the elitist strategy, and so on. The following paragraph gives a brief review of some articles which use these metaheuristic algorithms to solve CVRPs.

Barbarosoglu and Ozgur [5] designed a TS-based algorithm using a new neighborhood generation procedure for the single-depot vehicle routing problems. The neighbors are defined by using two procedures: the first one ignores the scattering patterns of customer locations, and the second one considers the underlying clustering of customer locations. Baker and Ayechew [6] put forward a hybrid of GA algorithms with neighborhood search methods. The pure GA has three specific processes: initialization, reproduction, and replacement. The neighborhood search methods are used to accelerate the convergence of GA. Computational results showed that this approach is competitive with published results obtained using TS and SA. Lin et al. [7] proposed a hybrid algorithm which takes the advantages of SA and TS. In their paper, SA is used to adjust the probability of accepting worse solutions according to the extent of solution improvement and the annealing temperature, while TS is embedded in the framework of SA to avoid cycling to some extent while searching for neighborhood.

In the recent ten years, swarm intelligence, a new category of metaheuristics, has emerged and attracted researchers’ attention. Swarm intelligence mimics the social behavior of natural insects or animals to solve complex problems. Some commonly used swarm intelligence algorithms for the solution of the CVRP include ant colony optimization (ACO), particle swarm optimization (PSO) and artificial bee colony [8].

ACO is a population-based swarm intelligence algorithm and was proposed by Dorigo and Gambardella [9]. This algorithm has been inspired by the foraging behavior of real ant colonies and originally designed for the traveling salesman problem (TSP). The artificial ants use pheromone laid on trails as an indirect communication medium to guide them to construct complete solution routes step by step. More pheromone deposits on better routes attract more ants for later search. This effect is called dynamic positive feedback and helps speed convergence of ACO. Recently, some researchers have studied vehicle routing problems using ACO algorithms. Applying ACO to the CVRP is quite natural, since we can view ant nests as depots, artificial ants as vehicles, foods as customers, and trails as routes. Some of the relevant papers are briefly reviewed as follows.

Bell and McMullen [10] made modifications of the ACO algorithm in order to solve the vehicle routing problem. They used multiple ant colonies to search vehicle routes. Each vehicle route is marked with unique pheromone deposits by an ant colony, but the communication among ant colonies is limited. Later, Liu and Cai [11] proposed a new multiple ant colonies technique, which allows ant colonies to communicate with each other in order to escape from local optima. Chen and Ting [12] developed an improved ant colony system algorithm, in which pheromone trails will be reset to initial values for restarting the search if the solution is not improved after a given number of iterations. Zhang and Tang [13] hybridized the solution construction mechanism of ACO with scatter search (SS). The algorithm stores better solutions in a reference set. Some new solutions are generated by combining solutions selected from the reference set, and some are produced by using the conventional ACO method. Yu et al. [14] also developed an improved ant colony optimization for vehicle routing problems. Their algorithm uses the ant-weight strategy to update pheromone in terms of solution quality and the contribution of each edge to the solution. Lee et al. [15] proposed an enhanced ACO algorithm for the CVRP. Their algorithm adopts the concept of information gain to measure the variation of pheromone concentrations and hence to dynamically adjust the value of heuristic parameter (𝛽) which determines the importance of heuristic value (𝜂) at different iterations.

PSO is also a population-based swarm intelligence algorithm and was originally proposed by Kennedy and Eberhart [16]. PSO is inspired by social behavior of bird flocking. It has been shown that PSO can solve continuous optimization problems very well. In the PSO, solution particles try to move to better locations in the solution space. The movements of particles are guided by the individuals’ and the swarm’s best positions. PSO can converge very fast due to its two unique mechanisms: memorizing personal best experiences (𝑃best) and information sharing of global best experiences (𝐺best). Note that the 𝐺best solution of the particle swarm is equal to the 𝑃best solution of the best particle. In 1998, Shi and Eberhart [17] enhanced PSO by adding the concept of inertia weight, which becomes the standard version of PSO.

PSO being originally developed for continuous optimization problems, a special solution representation or solution conversion should be designed first in order to solve CVRPs. Chen et al. [18] first proposed a PSO-based algorithm to solve the CVRP. In their approach, each iteration has two main steps: customers are first clustered by using a discrete PSO algorithm (DSPO) and then sequenced by applying a SA algorithm. Due to its long solution strings, their approach takes much computational time in solving large scale problems. To improve Chen et al.’s work, Kao and Chen [19] addressed a new solution representation and solved the CVRP with a combinatorial PSO algorithm. Ai and Kachitvichyanukul [20] presented two solution representations for solving CVRPs. For example, in their second solution representation (SR-2), each vehicle is represented in three dimensions, with two for the reference point and one for the vehicle coverage radius. SR-2 employs these points and radius to construct vehicle routes. The particle solutions are adjusted by using a continuous PSO. Marinakis et al. [21] proposed a hybrid PSO algorithm to tackle large-scale vehicle routing problems. Their proposed algorithm combines a PSO algorithm with three heuristic methods, with the first for particle initialization, the second for solution replacement, and the third for local search.

This study proposes a new hybrid algorithm for the capacitated vehicle routing problem, which is based on the framework of ACO and is hybridized with the merits of PSO. The reasons why ACO and PSO, rather than SA, TS, and GA, are adopted in the proposed algorithm are given as follows. First, SA and TS perform the so-called single-starting-point search and thus their performance relies highly on a good initial solution. However, GA, ACO, and PSO are all population-based algorithms and can start the search from multiple points. Their initial solutions have little influence on their performance. Thus, we consider adopting the population-based algorithms to solve CVRPs. Second, ACO and PSO have memory that enables the algorithms to retain knowledge of good solutions, while the genetic operators of GA may destroy previously learned knowledge when producing the offspring. In view of these two considerations, we select ACO and PSO as the solution approach for this paper.

In the past, most relevant papers adopted either ACO [1015] or PSO [1821] alone without trying to use both in combination for solving CVRPs. In this paper, we try to integrate ACO with PSO to develop a new hybrid approach which can take advantage of both algorithms. That is, the proposed algorithm uses the solution construction approach of ACO to cluster customers and build routes at the same time and use the short-term memory inspired by PSO to speed convergence through laying pheromone on the routes of 𝐺best and 𝑃best solutions.

Like most ACO-based algorithms, the proposed hybrid algorithm also faces the limitation of pheromone stagnation, which results in premature convergence. To solve this problem, Shuang et al. [22] employed the mechanism of PSO to modify the pheromone updating rules of ACO. Their proposed algorithm is called PS-ACO and is used to solve traveling salesman problems (TSPs). PS-ACO can improve the performance of ACO to some extent, but it may still be trapped in local optima due to the overaccumulation of pheromone on some edges when solving more complicated problems like CVRPs. To attain a high degree of search accuracy, this paper proposes a pheromone disturbance approach to overcome the problem of pheromone stagnation. The remainder of this paper is organized as follows. Section 2 defines the mathematical formulation of the CVRP. The proposed methodology is described in Section 3. Section 4 presents computational results. Finally, conclusions are drawn in the last section.

2. Mathematical Model of CVRP

This section gives a typical mathematical formulation of the CVRP, including notations, objective function, and constraint equations.

Notations 2. 0:   index of depots;𝑁:   total number of customers;𝐾:   total number of vehicles;𝐶𝑖𝑗:   cost incurred when traveling from customer 𝑖 to customer 𝑗;𝑆𝑖:   service time needed for customer 𝑖, 𝑆0 = 0;𝑄:   maximum loading capacity of a vehicle;𝑇:   maximum traveling distance of a vehicle;𝑑𝑖:   demand of customer 𝑖, 𝑑0=0;𝑋𝑘𝑖𝑗:   0-1 variable, where 𝑋𝑘𝑖𝑗=1 if the edge from customer 𝑖 to customer 𝑗 is traveled by vehicle 𝑘; otherwise, 𝑋𝑘𝑖𝑗=0. Note that  𝑖𝑗;𝑝:   penalty coefficient;𝑅:   set of customers served by a vehicle, and |𝑅| is the cardinality of 𝑅.

Objective function
Minimize𝑁𝑁𝑖=0𝐾𝑗=0𝑘=1𝐶𝑖𝑗𝑋𝑘𝑖𝑗,(2.1)subjectto𝐾𝑁𝑘=1𝑖=0𝑋𝑘𝑖𝑗=1,𝑗=1,2,,𝑁,(2.2)𝐾𝑁𝑘=1𝑗=0𝑋𝑘𝑖𝑗=1,𝑖=1,2,,𝑁,(2.3)𝑁𝑖=0𝑋𝑘𝑖𝑢𝑁𝑗=0𝑋𝑘𝑢𝑗=0,𝑘=1,2,,𝐾;𝑢=1,2,,𝑁,(2.4)𝑁𝑁𝑖=0𝑗=0𝑋𝑘𝑖𝑗𝑑𝑖𝑄,𝑘=1,2,,𝐾,(2.5)𝑁𝑁𝑖=0𝑗=0𝑋𝑘𝑖𝑗𝐶𝑖𝑗+𝑆𝑖𝑇,𝑘=1,2,,𝐾,(2.6)𝑁𝑗=1𝑋𝑘𝑖𝑗=𝑁𝑗=1𝑋𝑘𝑗𝑖1,𝑖=0;𝑘=1,2,,𝐾,(2.7)𝑖,𝑗𝑅𝑋𝑘𝑖𝑗||𝑅||||𝑅||𝑋1,𝑅{1,,𝑁},2𝑁1;𝑘=1,2,,𝐾,(2.8)𝑘𝑖𝑗{0,1},𝑖,𝑗=0,1,,𝑁;𝑘=1,2,,𝐾.(2.9)

Equation (2.1) is the objective function of the CVRP. Equations (2.2) and (2.3) ensure that each customer can be served by only one vehicle. Equation (2.4) maintains the continuity at each node for every vehicle. Equation (2.5) ensures that the total customer demand of a vehicle cannot exceed its maximum capacity. Similarly, (2.6) ensures that the total route distance of a vehicle cannot exceed its route length limit. Equation (2.7) makes sure that every vehicle can be used at most once and must start and end at the depot. The subtour elimination constraints are given in (2.8). Equation (2.9) is the integrality constraint.

3. PACO Algorithm

This section describes the proposed solution algorithm to the capacitated vehicle routing problem. The algorithm, called PACO, hybridizes the solution construction mechanism of ACO and the short-term memory mechanism of PSO to find optimal or near optimal vehicle routes.

3.1. Basic Idea

The PACO algorithm incorporates the merits of PSO into the ACO algorithm. One of the advantages of applying ACO to the CVRP is that ACO can cluster customers and build routes at the same time. However, laying pheromone (long-term memory) on trails as ant communication medium is time consuming. The merit of PSO is that it can speed convergence through memorizing personal and global best solutions to guide the search direction. Inspired by the merit of PSO, the PACO algorithm allows artificial ants to memorize their own best solution so far and to share the information of swarm best solution. Hence PACO can speed convergence through intensifying pheromone on routes of 𝐺best and 𝑃best solutions.

To avoid falling into local optima, our approach employs elitist strategy, pheromone disturbance, and short-term memory resetting to resolve pheromone stagnation. After ants complete solution construction, the first 𝑟 iteration-best ants are allowed to perform local search to improve their current solutions. After that, all ants update their 𝑃best solutions and 𝐺best solution. The ants with better 𝑃best solutions are called elite ants. Pheromone updating is conducted by these elite ants only. Elite ants lay pheromone on their 𝑃best solution routes in a distributed way. The elitist strategy updates the pheromone in terms of solution quality and attracts ants searching for solutions around distributed 𝑃best solution paths.

When the 𝐺best solution is not improved within a given number of iterations, PACO will carry out pheromone disturbance to change pheromone trails randomly in order to find new solutions. Pheromone disturbance can prevent the paths of the 𝑃best solution of elite ants from becoming too dominant. After pheromone disturbance, the paths of the 𝑃best solution of elite ants may become dominant again because they can still evoke memories of current 𝑃best solutions which determine the way of laying pheromone. To avoid that, the algorithm should allow ants to reset their 𝑃best solutions. It means that the ants will discard their current 𝐺best and 𝑃best solutions and find new ones in the following iteration according to the disturbed pheromone trails. The algorithm allows any ant, not limited to elite ants, to change their 𝑃best solutions if and only if its 𝑃best solution is very similar to the 𝐺best solution.

3.2. Solution Representation

For solving the CVRP, each artificial ant represents a candidate solution. A solution is represented with the route representation of all vehicle tours. Let 0 denote the depot and positive integers from 1 to 𝑁 represent the customers. Suppose that the total number of vehicles is 𝐾. The solution code is a permutation of 1 to 𝑁 and (𝐾 − 1) zeros. Zeros divide a solution code into 𝐾 segments, with each of them representing a vehicle route. For example, a solution code (1, 2, 3, 0, 4, 5, 6, 0, 7, 8, 9) means that customers 1, 2, 3 are serviced by vehicle 1; customer 4, 5, 6 by vehicle 2; customers 7, 8, 9 by vehicle 3. Thus, the length of a solution string is (𝑁+𝐾1). It is clear that this solution representation scheme can fully meet the constraints defined in (2.2)–(2.4).

The goodness of a solution is evaluated by using the objective function (2.1). Here, we modify the objective function in order to handle the infeasible solutions violating capacity and length constraints (see (2.5) and (2.6)). Two penalty functions are added to the original objective function, as defined in (3.1), one for excess vehicle capacity and the other for excess route length. These penalty functions increase the objective function value of infeasible solutions so as to prefer feasible solution to be selected as elite ants which are allowed to perform local search and to update pheromone on their routes (see Sections 3.5 and 3.6). Minimize𝑓=𝑁𝑁𝑖=0𝐾𝑗=0𝑘=1𝐶𝑖𝑗𝑋𝑘𝑖𝑗+𝑝𝐾𝑘=1max0,𝑁𝑁𝑖=0𝑗=0𝑋𝑘𝑖𝑗𝑑𝑖𝑄+max0,𝑁𝑁𝑖=0𝑗=0𝑋𝑘𝑖𝑗𝐶𝑖𝑗+𝑆𝑖.𝑇(3.1)

3.3. Main Steps

The main steps of PACO are solution construction, local search, 𝐺best and 𝑃best updating, pheromone updating, and pheromone disturbance. Suppose there are 𝑚 ants starting from the depot. Each ant selects customers to construct a solution route by applying the state transition rules of ACO. When all ants finish solution construction, the top 𝑟 best ants perform local search to improve their solutions. Then, ants update their short-term memory: 𝐺best solution and individual 𝑃best solutions. After that, PACO updates the pheromone trails according to the 𝐺best solution and the 𝑃best solutions of elite ants. When the 𝐺best is not improved over 𝑤 consecutive iterations, PACO performs pheromone disturbance to modify current pheromone trails. PACO also resets the 𝑃best solutions of some ants in order to prevent them from laying pheromone on the same routes again. The flowchart of the PACO algorithm is shown in Figure 1 and described briefly as follows.

726564.fig.001
Figure 1: Flowchart of PACO.

Step 1 (Initialization). Initialize all parameters.

Step 2 (Solution construction). Let 𝑚 ants construct solution routes.

Step 3 (Local search). The top 𝑟 best ants perform local search.

Step 4. Update the 𝐺best and 𝑃best solutions of ants and select 𝑟 elite ants.

Step 5. If 𝐺best is not improved within 𝑤 successive iterations, go to Step 6; otherwise, go to Step 7.

Step 6 (Pheromone disturbance). Randomly disturb the pheromone matrix, reset the 𝑃best solutions for some ants, and go to Step 8.

Step 7 (Pheromone updating). Update the pheromone matrix based on the 𝑃best solutions of elite ants.

Step 8. If iteration number reaches the maximum number of iterations (MaxIte), go to Step 9; otherwise, go to Step 2 for the next iteration.

Step 9. Output 𝐺best, the best solution ever found.

3.4. Solution Construction

PACO can cluster customers into 𝐾 vehicles and arrange vehicle visiting sequences at the same time. At each of the iterations, 𝑚 ants construct individual solutions independently. Each solution contains 𝐾 vehicle routes. Each ant starts from the depot, selects customers for the first vehicle, moves back to the depot before the capacity or distance limit is violated, then restarts from the depot and selects customers for the second vehicle. The procedure is repeated until all customers are selected and their sequences are arranged in used vehicles. It is possible that the last vehicle will serve all of the remaining customers even if it violates the capacity or distance limit. The procedure of ant solution construction ensures that the constraints defined in (2.7) and (2.8) can be satisfied.

The customer selection follows the state transition rule defined in (3.2). Suppose ant 𝑠 is moving from customer 𝑖 to the next customer, 𝑣: 𝑣=argmax𝑗𝑈𝑠𝜏𝑖𝑗𝛼𝜂𝑖𝑗𝛽𝑞𝑞0,𝑉𝑞>𝑞0,(3.2)𝑉:𝑃𝑖𝑗=𝜏𝑖𝑗𝛼𝜂𝑖𝑗𝛽𝑗𝑈𝑠𝜏𝑖𝑗𝛼𝜂𝑖𝑗𝛽,(3.3) where 𝑈𝑠  is the set of customers that remain to be selected by ant 𝑠 positioned on customer 𝑖, 𝜏𝑖𝑗 is the pheromone trail on edge (𝑖,𝑗), 𝜂𝑖𝑗 is the inverse of the distance of edge (𝑖,𝑗), 𝛼 and 𝛽 are parameters which determine the relative importance of pheromone versus distance, 𝑞 is a random number uniformly distributed in the interval of 0 and 1, 𝑞0 is a parameter ranged between 0 and 1, and 𝑃𝑖𝑗 is the probability that ant 𝑠 moves from customer 𝑖 to customer 𝑗. If 𝑞𝑞0, then ant 𝑠 uses the greedy method (3.2) to select the next customer; otherwise, it uses the probabilistic rule (3.3) to determine the next customer. If vehicle 𝑘 is full or reaches its distance limit, ant 𝑠 has to go back to the depot and restarts from the depot to load the next vehicle. However, if vehicle 𝑘 is the last vehicle of ant 𝑠, then it has to serve all of the remaining customers, even if the capacity or distance limit is violated.

3.5. Local Search

After all ants complete route construction, only the first 𝑟 iteration-best ants can perform local search to improve their current solutions. PACO performs three types of neighborhood search: sequence inversion, insertion, and swap. These methods are often used in CVRP papers to improve iteration solutions, as is the case with [7, 8, 15]. Sequence inversion selects a vehicle at random from the current solution string, chooses two customers randomly, and then inverts the substring between these two customers. The swap operation selects two customers at random and then swaps these two customers in their positions. The insertion operation selects a customer at random and then inserts the customer in a random position. The swap operation may select two customers in different vehicles, and the insertion operation may assign the selected customer to a different vehicle. For such a case, the capacity and distance limits of the vehicles have to be checked. If the constraints are violated, the new solution becomes invalid and another one should be generated.

The whole procedure of local search for an ant solution is controlled by using a simulated annealing approach. SA performs neighborhood search 𝑅 times at each temperature 𝑇(𝑡). Each time one of the three local search methods is randomly selected with equal probability to implement neighborhood search. A worse solution may have a chance to be accepted according to the following equations: 𝑆Δ=𝑓𝑃𝑆𝑓(𝑆),Δ=exp,𝑇(𝑡)(3.4) where 𝑆 is the current solution, 𝑆is the new solution, 𝑓(𝑆) is the objective function value of 𝑆, 𝑓(𝑆) is the new objective function value, 𝑡 is the current temperature, and 𝑃(𝑆) is the probability that SA accepts new solution 𝑆. After carrying out neighborhood search  𝑅 times, SA reduces the temperature. New temperature (𝑇(𝑡+1)) is equal to 𝜆×𝑇(𝑡), where 0<𝜆<1. PACO adopts a best improvement strategy in its local search step. That is, the best-so-far solution will be recorded during the run of the SA algorithm. When the termination condition is met, the ant solution will be replaced with the best-so-far solution of SA if the latter is really better.

After solution construction and local search, all ants compare their 𝑃best solutions with their iteration solutions and perform 𝑃best replacement if the iteration solutions are better. Then, ants are ranked in terms of the goodness of their 𝑃best solutions, and the first 𝑟 ants are the elite ants. Of course, the 𝐺best solution of all ants is equal to the 𝑃best solution of the best elite ant.

3.6. Pheromone Updating

Pheromone trails play the role of long-term memory in the PACO algorithm. Global updating is used to enhance the search in the neighborhood of better solutions. The paths of better solutions have higher levels of pheromone so as to attract more ants for later search. The pheromone on other paths evaporates over time and becomes less attractive to ants. Therefore, convergence of PACO can be accelerated by intensifying pheromone on the paths of elite solutions. The pheromone updating rule is defined as follows: 𝜏𝑖𝑗=(1𝜌)𝜏𝑖𝑗+𝑟𝑠=2Δ𝜏𝑃best𝑠𝑖𝑗+Δ𝜏𝐺best𝑖𝑗,Δ𝜏𝑃best𝑠𝑖𝑗=1𝑓𝑠𝑃best,Δ𝜏𝐺best𝑖𝑗=1𝑓𝐺best,(3.5) where 𝜌 is the pheromone evaporation rate and ranges between 0 and 1, 𝑟 is the total number of elite ants, Δ𝜏𝑃best𝑠𝑖𝑗andΔ𝜏𝐺best𝑖𝑗,  are the pheromone added by elite ant 𝑠 and the best ant, respectively, and 𝑓𝑠𝑃best and 𝑓𝐺best are the objective function values of elite ant 𝑠 and the best ant, respectively.

3.7. Pheromone Disturbance

Since only elite ants lay pheromone on the routes of their 𝑃best solutions, the pheromone on the paths of elite solutions will accumulate very fast. It leads to the state of pheromone stagnation, and the search may be trapped by local optima. To overcome this problem, PACO adopts pheromone disturbance to escape from local optima and to explore different areas of the search space. Pheromone disturbance is performed when the 𝐺best solution of ants is not updated (improved) up to 𝑤 successive iterations. 𝑤 is called the disturbance period. Large 𝑤 makes PACO easy to raise the chances of settling for a false optimum, while small 𝑤 retards the search convergence and takes more computational time. It is suggested that 𝑤 be equal to the number of customers.

The basic idea of pheromone disturbance is similar to arithmetic crossover in GA, but it is used to produce new pheromone trails, rather than to generate new solutions. Pheromone disturbance has three steps. The first step is to select edges for disturbance. The disturbance rate (𝜇) determines the probability that an edge is selected for disturbance. If 𝜇 is set too high, it will be difficult to retain previous search experiences; on the other hand, if it is set too low, the effect of disturbance will not be evident. The second step is to cluster selected edges into groups, each of which has two edges with the same customer node. The groups with single edges will be abandoned. The third step is to use a random number 𝑞[0,1] to determine a disturbance type for each of the paired edges. There are three types of pheromone disturbance: unchanging, replacement, and weighted average. As defined in (3.6), paired edges (𝑖,𝑗) and (𝑖,𝑢) have three possible results. That is, the pheromone on edge (𝑖,𝑗) may remain the same, be replaced by the pheromone level of edge (𝑖,𝑢), or be replaced with the weighted average of the pheromone levels of these two edges. 𝜏𝑡+1𝑖𝑗=𝜏𝑡𝑖𝑗𝜏𝑞<0.2,𝑡𝑖𝑢0.2𝑞<0.4𝛿𝜏𝑡𝑖𝑗+(1𝛿)𝜏𝑡𝑖𝑢,𝑗𝑢,𝑞0.4,,(3.6) where 𝛿 is a uniform random number in the range [0,1] and determines the ratios of pheromone on the two edges.

After pheromone disturbance, ant 𝑠 positioned on customer node 𝑖  has a chance to explore different edges rather than to keep selecting the same next customer node to move to. Hence, pheromone disturbance increases the probability of finding optimal solutions. Note that we deal with symmetric CVRPs in this paper, where the distances between customer nodes are independent of the direction of traversing the edges. The same situation applies to pheromone trails. Accordingly, 𝑑𝑖𝑗=𝑑𝑗𝑖 and 𝜏𝑖𝑗=𝜏𝑗𝑖 for each pair of nodes.

We use an example to illustrate the idea of pheromone disturbance. Suppose we have five customers, then there are 20 edges with pheromone deposits. The original pheromone matrix is shown in Table 1. Since 𝜏𝑖𝑗=𝜏𝑗𝑖 for each pair of nodes, the algorithm considers only half the edges to be disturbed.

tab1
Table 1: Original pheromone matrix.

The first step is to select edges for disturbance. Each edge is selected with a probability of 𝜇=0.3. For each edge, we generate a random number from uniform distribution in the range between 0 and 1. The generated random numbers are shown in Table 2. A edge is selected if its random number is less than 𝜇. Table 2 tells us that four edges are selected and marked in bold type. The second step is to pair two edges that have the same customer node. Scanning the matrix in Table 2 row by row, we obtain the pairing results: {edge (1, 3), edge (1, 5)} and {edge (2, 3), edge (2, 4)}. The third step uses (3.6) to determine new pheromone trails for paired edges. Random number 𝑞 is first generated to determine a disturbance type for each selected edge. The disturbance results are shown in Table 3. For example, for the first paired edges, option 1 (unchanging) applies to edge (1, 3) and option 3 (weighted average) applies to edge (1, 5). Note that here 𝛿 is a random number in the range of [0,1]. In our example of edge (1, 5), 𝛿 is equal to 0.5. The new pheromone matrix is presented in Table 4.

tab2
Table 2: Edges selected for disturbance.
tab3
Table 3: Disturbance results.
tab4
Table 4: New pheromone matrix.
3.8. 𝑃best  Solution Resetting

Since pheromone updating is based on the 𝑃best solutions of elite ants, it may diminish the effect of pheromone disturbance very fast in the following iterations. To avoid that situation, PACO resets the 𝑃best solutions of some better ants. That is, the 𝑃best solutions of the ants are removed from their memory and find new ones in the next iteration. Note that not all of the ants need to reset their 𝑃best solutions. The resetting is determined by the difference in objective function value between 𝑃best and 𝐺best solutions. For ant 𝑠, if the difference is less than or equal to a threshold, Δ𝑓, (i.e., Δ𝑓𝑓𝑠𝑃best𝑓𝐺best), then ant 𝑠 has to reset its 𝑃best solution.

4. Computational Results

The PACO algorithm described in Section 3 was coded in Java, and all experiments were performed on a personal computer with Intel Core 2 CPU T7500 running at 2.20 GHz. Two sets of benchmark problems were selected to evaluate the effectiveness of our proposed algorithm for the capacitated vehicle routing problem.

The first set has 16 test problems and can be downloaded from the website http://www.branchandcut.org/VRP/data/. The problems in this benchmark set are subject to capacity constraints only. The total number of customers varies from 29 to 134, and the total number of vehicles ranges from 3 to 10. The locations of customers appear in clusters in the problems with their names initiated with B and M, while in the remaining problems customers are randomly scattered or semiclustered. The first benchmark set was used by Chen et al. [18] and Ai and Kachitvichyanukul [20] to test their PSO-based algorithms.

The second benchmark set can be downloaded from the website http://people.brunel.ac.uk/~mastjjb/jeb/orlib/vrpinfo.html. It has been widely used in previous studies and contains 14 classical test problems selected from Christofides et al. [23]. Problems 1, 2, 3, 4, 5, 11, and 12 consider the constraint of capacity only, while the remaining problems are subject to the capacity and distance limits. The total number of customers varies from 50 to 199, and the total number of vehicles ranges from 5 to 18. Besides, customers are randomly distributed in the first ten problems whereas customers are clustered in the last four problems.

The PACO parameters set as follows were found to be robust for most of the test problems according to our pilot tests. PACO parameters are maximum iteration number MaxIte = 1000, population size 𝑝𝑜𝑝=𝑁/2, number of elite ants 𝑟=3, penalty coefficient 𝑝=100, 𝑞0=0.8, 𝜌=0.5,  𝛼=2, 𝛽=1, and𝜏0=1/(𝑁×𝐿𝑛𝑛), where  𝐿𝑛𝑛 is the tour length found by the nearest neighbor heuristic. Local search parameters are initial temperature   𝑡0=2, final temperature𝑡𝑓=0.01, 𝑅=max{𝑁×𝐾/2,250}, 𝜆=0.9. Pheromone disturbance parameters are: 𝜇 = 0.3, 𝑤=𝑁, Δ𝑓=5.

Table 5 lists the computational results of PACO on two sets of test problems. The best solution, average solution, worst solution, and standard deviation (Std.) computed over 20 independent runs on each problem are summarized, along with their average computational time (in seconds) required to reach the final best solutions. The best solutions equal to the best-known solutions of benchmark problems are asterisked and typed in bold. Table 5 reveals that PACO is able to generate reasonable good solutions for most of CVRPs in terms of solution quality. Twelve out of sixteen test problems can be solved successfully by the proposed algorithm in the first benchmark set. For the second set, seven out of fourteen test problems can be solved successfully by PACO.

tab5
Table 5: Computational results of PACO over 20 runs on two benchmark sets.

To evaluate the pheromone disturbance strategy and 𝑃best-resetting operation, the proposed algorithm is compared with standard ACO [9] and PS-ACO [22] in terms of their convergence trends. Standard ACO and PS-ACO were originally proposed for solving traveling salesman problems (TSP), not CVRPs. We implemented these two algorithms in Java and tried to apply them to solve CVRPs with the same local search method and parameter settings used in PACO.

Benchmark problem C1 was selected to test three ACO-based algorithms. Three data sets of iteration-best solutions are plotted in Figure 2, The curves reveal that both PACO and PS-ACO can converge faster than standard ACO but only PACO can find the optimal solution. It demonstrates that, with pheromone disturbance and 𝑃best solution resetting, PACO can effectively escape from local optima and find better solutions. In Figure 2, a couple of peaks on the PACO curve indicate the effects of pheromone disturbance and 𝑃best-resetting. The disadvantage of PS-ACO is that all of the local best solutions are considered in the pheromone updating procedure. When most ants have similar 𝑃best solutions, the total amount of pheromone increment on edges will become very large. It results in the state of pheromone stagnation and the search is trapped by a local optimum.

726564.fig.002
Figure 2: Convergence trends of three ACO-based algorithms tested on problem C1.

We conducted a comparative study to compare PACO with a couple of swarm intelligence methods available for the CVRP. The comparative study contains two parts. In the first part, the PACO algorithm is compared with three different PSO-based algorithms, which were all tested on the 16 problems from the first benchmark set. The smaller the objective function value, the better the solution. Table 6 displays the computational results of PACO and the best results found in the papers of Chen et al. [18], Ai and Kachitvichyanukul [20], and Kao and Chen [19], denoted as DPSO-SA, SR-2, CPSO-SA, respectively. Experimental results show that PACO is able to obtain the same or better results compared with three PSO-based algorithms.

tab6
Table 6: Comparison of PACO with three PSO-based algorithms.

In the second part of the comparative study, the computational results of PACO are compared with three ACO-based algorithms, which were all tested on the 14 problems from the second benchmark set. Table 7 reports the best results obtained by these various ACO algorithms. The best results of IACS, SS_ACO, and EACO are found in [12, 13, 15], respectively. Table 7 indicates that PACO generates very good solutions for seven problems, which are equal to the best solutions published so far. For three compared algorithms, only EACO is better than PACO because it can find best-known solutions for eight problems. It can be noticed that both PACO and EACO can obtain optimum solutions for six problems in common. For problem C11, PACO can reach the best-known solution but EACO cannot, while, for problems C3 and C8, EACO can outperform PACO. However, the best solutions produced by PACO and EACO are nearly equal for these three problems.

tab7
Table 7: Comparison of PACO with three ACO-based algorithms.

Tables 6 and 7 also list the shortest computational times required to reach the final best solution over 20 independent runs. From the data, it can be observed that the computation time taken by PACO is reasonable in practice in comparison with existing PSO- and ACO-based algorithms. It shows that pheromone disturbance can improve solutions but does not increase much computational time. Note that the computation time has not been reported in [15]. Instead, the authors of [15] used the maximum execution time as the termination condition. They stopped the EACO algorithm after one hour of running for 14 benchmark problems. The overall result of comparative study shows that the proposed algorithm is competitive with recent swarm intelligence approaches in terms of solution quality and CPU time.

5. Conclusion

This paper proposes a hybrid algorithm, PACO, which takes advantage of ant colony optimization and particle swarm optimization for capacitated vehicle problems. During the searching process, artificial ants construct solution routes, memorize the best solution ever found, and lay pheromone on the routes of swarm and personal best solutions. To prevent being trapped in local optima and to increase the probability of obtaining better solutions, PACO performs pheromone disturbance and short-term memory resetting operations to adjust stagnated pheromone trails. Disturbed pheromone trails guide ants to find new 𝑃best and 𝐺best solutions. The merits of PSO adopted in PACO can speed convergence during a run, even after pheromone disturbance operations. Computational results show that the performance of PACO is competitive in terms of solution quality when compared with existing ACO- and PSO-based approaches. For future research, PACO can be modified to extend its application to vehicle routing problems with time windows or multiple depots, among others.

Acknowledgments

The authors would like to thank the referees for their valuable comments and suggestions that have greatly improved the quality of this paper. The authors are also grateful to National Science Council, Taiwan (Grant no. NSC 99-2410-H-036-003-MY2) for the financial support.

References

  1. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. I. H. Osman, “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of Operations Research, vol. 41, no. 4, pp. 421–451, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. J. F. Cordeau, G. Laporte, M. W. P. Savelsbergh, and D. Vigo, “Vehicle routing,” in Handbook in Operations Research and Management Science, C. Barnhart and G. Laporte, Eds., vol. 14, pp. 367–428, 2007.
  4. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–228, 1981. View at Publisher · View at Google Scholar · View at Scopus
  5. G. Barbarosoglu and D. Ozgur, “A tabu search algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 26, no. 3, pp. 255–270, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. B. M. Baker and M. A. Ayechew, “A genetic algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 30, no. 5, pp. 787–800, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. S. W. Lin, Z. J. Lee, K. C. Ying, and C. Y. Lee, “Applying hybrid meta-heuristics for capacitated vehicle routing problem,” Expert Systems with Applications, vol. 36, no. 2, pp. 1505–1512, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. W. Y. Szeto, Y. Wu, and S. C. Ho, “An artificial bee colony algorithm for the capacitated vehicle routing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 126–135, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar · View at Scopus
  10. J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41–48, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. Z. Liu and Y. Cai, “Sweep based multiple ant colonies algorithm for capacitated vehicle routing problem,” in Proceedings of the IEEE International Conference on e-Business Engineering (ICEBE '05), pp. 387–394, October 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. C. H. Chen and C. J. Ting, “An improved ant colony system algorithm for the vehicle routing problem,” Journal of the Chinese Institute of Industrial Engineers, vol. 23, no. 2, pp. 115–126, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. X. Zhang and L. Tang, “A new hybrid ant colony optimization algorithm for the vehicle routing problem,” Pattern Recognition Letters, vol. 30, no. 9, pp. 848–855, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. 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 · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. C. Y. Lee, Z. J. Lee, S. W. Lin, and K. C. Ying, “An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem,” Applied Intelligence, vol. 32, no. 1, pp. 88–95, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at Scopus
  17. Y. Shi and R. Eberhart, “Modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'98), pp. 69–73, May 1998. View at Scopus
  18. A. L. Chen, G. K. Yang, and Z. M. Wu, “Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem,” Journal of Zhejiang University: Science, vol. 7, no. 4, pp. 607–614, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. Y. Kao and M. Chen, “A hybrid PSO algorithm for the CVRP problem,” in Proceedings of the International Conference on Evolutionary Computation Theory and Applications (ECTA '11), pp. 539–543, Paris, France, October 2011. View at Publisher · View at Google Scholar
  20. T. J. Ai and V. Kachitvichyanukul, “Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem,” Computers and Industrial Engineering, vol. 56, no. 1, pp. 380–387, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Marinakis, M. Marinaki, and G. Dounias, “A hybrid particle swarm optimization algorithm for the vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 23, no. 4, pp. 463–472, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. B. Shuang, J. Chen, and Z. Li, “Study on hybrid PS-ACO algorithm,” Applied Intelligence, vol. 34, no. 1, pp. 64–73, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem,” in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, Eds., Wiley, Chichester, UK, 1979.