# An Improved Ant Colony Algorithm and Its Application in Vehicle Routing Problem

Authors: Min Huang; Ping Ding
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

Optimal path planning is an important issue in vehicle routing problem. This paper proposes a new vehicle routing path planning method which adds path weight matrix and save matrix. The method uses a new transition probability function adding the angle factor function and visibility function, while setting penalty function in a new pheromone updating model to improve the accuracy of the route searching. Finally, after each cycle, we use 3-opt method to update the optimal solution to optimize the path length. The results of comparison also confirm that this method is better than the traditional ant colony algorithm for vehicle routing path planning method. The result of computer simulation confirms that the method can plan a more rational rescue path focused on the real traffic situation.


---

## Body

## 1. Introduction

Vehicle routing problem (VRP) is one of combinatorial optimization problems and VRP can be turned into other application problems; for example, Chen and Wang have turned VRP into tour planning problem [1]. A typical VRP can be described as follows: a warehouse that offers services to different positions of customers at the lowest cost path planning. It has real economic significance in many fields, such as transportation scheduling, routing, railway transportation, and other practical problems. Currently, heuristic algorithm is the main method for solving vehicle routing problem. Heuristic algorithm can be divided into simple heuristic algorithm, two-phase heuristic algorithm, and artificial intelligence methods.Vehicle routing problem has successfully applied in many areas, such as Li et al. [2] and Malekly et al. [3]. They solve the uncertain and ambiguous problem in vehicle routing problem using fuzzy set theories. Toth and Vigo [4] considered VRP as a significant part in logistic handing and grouped the methods that have been found to solve the problem of VRP. Kim et al. [5] divided the waste collection business into different areas and proposed methods to solve these problems in VRP. Many researchers have proposed heuristics or metaheuristics algorithm for efficiently solving the vehicle routing problem. Semet and Taillard [6] designed the taboo algorithm considering time window and different types of vehicles, which mainly used methods to generate the initial solution, then optimize the initial solution with taboo search algorithm. It is a local neighborhood search for an extension. Cordeau and Laporte [7] studied simulated annealing algorithm for the VRP, they proposed a simulated annealing method which is suitable for solving the vehicle routing problem and shows the advantage of accuracy and the speed of search convergence. Genetic algorithm is good for solving combinatorial optimization problems. Niazy and Badr [8] and Zulvia et al. [9] use genetic algorithm (GA) encoding to solve VRP problem. Niazy and Badr solved the complexity of CVRP with the goal of minimizing the total distances using the cellular genetic algorithm (CGA). Multiple ant colony algorithms are proposed by Gambardella et al. [10] and Bell and McMullen [11] to solve the time window of the multiobjective VRP problem. Ant colony optimization [12–14] (ACO) was successfully applied to emergency rescue [15, 16], which is an ideal heuristic algorithm and capable of intelligent search and global optimization.In this paper, we apply ant colony optimization algorithm to the path planning of emergency rescue vehicle. This paper will focus on the shortcomings of ant colony algorithm. Our proposed algorithm adds the angle factor, path weight matrix, and save matrix in the transfer rules and optimizes visibility function and penalty function; thus, it avoids falling into local optimum and speeds up the convergence of the algorithm. At the same time, pheromone update rules with local update and global update, update the global optimal solution only use the best ant to improve the algorithm's global search. Finally, after each cycle update the optimal solution in accordance with 3-opt method [17, 18] to shorten the length of the rescue path. Use benchmark test [19] to compare the results with the literature [20] in the algorithm to verify the effectiveness of the algorithm.


## 2. Problem Description and Mathematical Model

Disasters such as earthquakes and floods are sudden and unpredictable, which cause serious sufferings for people. How to find an effective and short rescue path for the affected nodes in the limited time after the disasters become the focus thing? Before making vehicle routing problem path planning, we first establish reasonable free space model. Capacitated vehicle routing problem [21, 22] (CVRP) was defined as a transportation and a distribution problem with the constrained of vehicle load, travel time or distance. Research on this model is the longest, and the results are achieved the most. Meanwhile, there are a large number of heuristic algorithms for solving this problem. Thus, we established CVRP model for disaster emergency response.Vehicle routing problem can be modeled by describing as the following. There is a rescue centera0to deliver goods tokdisaster areas. We suppose that theith area sent by the rescue center’smvehicle, where each vehicle can carryWton relief supplies, demandsgi(i=1,2,…,k). The goods are sent to each disaster area and finally back to the rescue center. If we knowgi≤Wm, then we look for the shortest length that meet the demand of the affected node. It can be described as an undirected graphG=(V,E), whereGrepresents the layout of affected area after the occurrence of disasters,Vis the vertices set corresponding with affected spot and rescue center, andEstands for any edge of two nodes.In this paper we define several constraints as follows:(a)
the start and the end of each route are at the rescue centera0;(b)
the total amount of relief supplies loaded by vehicle must not exceed the maximum affected node of vehicle load;(c)
each affected node is visited once by only one vehicle in the limited time.Figure1 shows a work environment instance of the vehicle path planning. In this example, a rescue centera0, the number of vehicles is5(b=5, bmeans the number of vehicles); and the affected node is 15 (v=15). Table 1 shows the affected nodes’ coordinates and each area’s relief supplies demands of Figure 1, and the rescue center coordinates are(0,0). The units of axes are meters,xrepresents thex-coordinate, andyrepresents they-coordinate. The numbers0,1,2,…,15sign each area.Table 1
Distance map and delivery of CVRP example.
Number
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
x
0
3
-
2
-
2
0
-
3
3
-
4
3
-
3
2
1
-
1
-
2
2
4
y
0
2
1
-
2
3
-
3
-
1
-
1
4
0
1
3
-
1
3
-
2
3
Delivery
0
1.8
0.8
1.5
2.5
0.2
2.4
0.5
0.6
0.9
1.3
2
0.6
0.2
1.4
0.9Figure 1
A real example of CVRP.When choosing the right path, the more spacious, smooth road is more likely to be selected; thus, road grade, traffic congestion levels, traffic, and other factors make up how to try to meet various requirements to plan a trip with a more reasonable path problem. When disaster occurs, how timely and reasonable given the rescue path is essential. Then the vehicle path planning is necessary to consider the following aspects: path length, road conditions, traffic smoothness, single time constraint that means each area can withstand the maximum rescue time, and weather conditions. Pheromones substance such as more than one rescue center and total time and length constraints needs to be pointed out in the paper. According to the [16] proposed method to calculate weights matrix based on AHP, as is shown in Table 2, the number 0 node represents rescue center.Table 2
The path weight matrix.
W
i
j
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
0
0
14
9
15
20
10
5
13
16
12
13
7
8
2
10
5
1
14
0
8
12
9
7
15
4
11
15
8
10
12
3
5
12
2
9
8
0
7
19
14
5
17
12
16
1
2
13
10
11
6
3
15
12
7
0
9
15
12
10
7
14
9
8
14
11
16
2
4
20
9
19
9
0
8
11
14
17
8
17
13
21
4
5
8
5
10
7
14
15
8
0
9
13
10
6
10
11
12
21
7
14
6
5
15
5
12
11
9
0
7
18
21
5
7
9
3
16
23
7
13
4
17
10
14
13
7
0
15
10
9
12
15
21
9
9
8
16
11
12
7
17
10
18
15
0
8
3
4
12
19
21
10
9
12
15
16
14
8
6
21
10
8
0
7
23
16
10
9
13
10
13
8
1
9
17
10
5
9
3
7
0
11
12
21
7
3
11
7
10
2
8
13
11
7
12
4
23
11
0
9
3
16
2
12
8
12
13
14
21
12
9
15
12
16
12
9
0
21
9
17
13
2
3
10
11
4
21
3
21
19
10
21
3
21
0
21
8
14
10
5
11
16
5
7
16
9
21
9
7
16
9
21
0
16
15
5
12
6
2
8
14
23
9
10
13
3
2
17
8
16
0


## 3. Brief Introduction of Ant Colony Optimization Algorithm

### 3.1. Ant Colony Optimization Algorithm

Ant colony optimization algorithm and the traditional ant colony algorithm are different in these three aspects as follows. That traditional ant colony algorithm is of slow convergence and is easy to fall into local optimum and stagnation in the vehicle path planning applications, while improved ant colony algorithm solves these problems in the following aspects.(1)
State transition probability function: the transfer rules that ants select the next affected node are modified, which is calculated as follows:(1)pijk(t)={[τij(t)]a*Dβ*[wij(t)]γ*[Uij(t)]γ*ζij(j)∑k∈allowedk[τik(t)]a*Dβ*[wik(t)]γ*[Uik(t)]γ*ζik(k),ifj∈allowedk0,otherwise,whereτijrepresents pheromones substance on the path edge(i,j),Dstands for visibility,pijkis transition probabilities of thekth ant from the affected nodeito affected nodej, the user parametersαandβare adjustable parameters that determine the relative influence of the pheromone and the visibility in the transition probabilities,γmeans the relative importance of the path weights in the transition probability, andallowedkrepresents the neighbor affected node of affected nodeithatkth ant has not yet visited. Here introducing the path weight valuewijthat stands for the weight value between affected nodes and the rescue center,D=1/(dij+dj,a0) replaces the traditional visibility function; that is,ηij=1/dij, where the valuedijmeans the distance betweeniandjand the valuedj,a0is the distance between the affected nodejand the rescue centre node. To modify visibility function is to enhance the ant’s perception of rescue centre node in the current affected node, which will guide the ants to move and therefore avoid falling into local optimum search results and reduce the search time. WhereUijstands for the save distances between nodes, both the affected nodes and the rescue centre. The save matrix calculated by the formula:After adding this factor, it may avoid out the connection of a direct connection with the affected nodes, without through disaster rescue center node, meanwhile shortening the length of the path. Shown in Figure2,ζij(j)is an angle factor, which is the angle between the vector[Nodei1Nodei→,NodeiNodej→]; Nodei1stands for the previous node before visited affected nodei, the valueNodeithat the black point represents the current visiting affected nodei,Nodejrepresents the next visiting affected nodej, red arrow direction equals with the oppositeNodei1Nodei→, yellow arrow direction equals withNodeiNodej→, andζij(j)is calculated as (2). Whenθis between[0,π/2],ζij(j)is a constant 0.00001, which is for escape when an ant is faced with a dead-end street. Consider(2)ζij(j)={θπ,ifπ2≤θ≤π,0.00001,if0≤θ≤π2.(3)j={argmaxu∈JJik{τiu(t)α*Dβ*[wiu(t)]γ*[Uiu(t)]γ},ifq≤q0,JJ,ifq>q0.Figure 2
A view of added angle factor.Ants choose the next affected nodejin accordance with (3).WhereJJis determined by (1),qis a random variable number between 0 and 1,q0is an adjustable parameter which is between 0 and 1, and here we defineq0as 0.05. When (3) satisfied the conditionq>q0, it chooses the next access node in accordance with (1).There are two rules in global update. One is the local optimal iteration and the other is the global optimal iteration.(2)
Update the local pheromone substances in accordance with the following:(4)τij(t+1)=ρ·τij(t)+(1-ρ)τij(0).In the progress of searching paths, according to state transition rules, ants apply (4) to choose route whose pheromone should be updated. After all ants move a step, local pheromones update once. Whereτij(0)represents the initial value of pheromone of edge(i,j), usually a small positive number to prevent ant colony from falling into local optimal solution prematurely,ρis a user-defined coefficient, which stands for the degree of global pheromone evaporation.(3)
Update the Global pheromone substances with the following:(5)τij(t+n)=ρ·τij(t)+(1-ρ)Δτij.(6)Δτij={1L,ifedge(i,j)ispartofthebestant'srouteatthisiteration,0,otherwise,whereτij(t+n)represents pheromone of the best path(i,j)from timetto timet+nafter all of the ants complete a trip, which is unlike traditional ant colony algorithm. In (6),Lrepresents length of the best moving path corresponding to ants crawling at this iteration. After iteration, update the global pheromone by (5).Meanwhile, to take advantage of convergence of the algorithm, this paper adds incentive factorγin pheromone global updating. It is calculated by the following:
(7)γ=L+-LT.Tis a positive constant whose value can be up to the same order of magnitude as current working space. In this paper setT=1000. Thus, it reduced the complexity of the search, and improved the accuracy and convergence speed of the route search.L+is the shortest path length for moving till previous cycle. If the path length of optimal solution in this cycle is shorter than optimal solution having been found, thenγ>0, otherwiseγ<0, which avoids falling into local optimum.


### 3.2. The Steps of Path Optimization

Step 1.
Initialize phase.m: the number of ants, NC_max: the maximum number of iterations, the number of iterationsNC=0, best_len: the current optimum path length, and set concentration of pheromones on each node at initial time (0.001), all the ants at the rescue centrea0,Windicates the vehicle load, and weigh[]stands for the demand of affected nodes. Set each ant a tabu list array tabu[]to store the city that the ants have already visited; that is to say, the cities will not be visited in the next choice, the path length passed ant.[k].path_length, array ROUTES[k][n]stored thekth ant’s route where the path has already been visited in thenth iteration, and adda0to each ant’s tabu list (k=1,…,m, n=1,…,NC_max).Step 2.
Set variablei=1.Step 3.
Calculate the next affected node the ant can choose and exclude the affected node in tabu list or the obstacle affected node. Array to_visit[]and Len_to_visit recorded separately the affected node's mark the ants can visit and the number of the affected node, while Len_to_visit≥1andW≥weigh[]go to Step 4, otherwise go to Step 7.Step 4.
Use (3) and roulette method to select an affected node to_visit for each antk(k=1tom). And move antkto this node. Meanwhile, update the ant k’s length of path, route: ROUTES[k][n]= add[ROUTES[k][n], to_visit], the ant moves the next affected node to_visit, put to_visit in ant k’s tabu list array tabu[], andW=W-weigh[to_visit].Step 5.
Perform a local updating rule according to (4).Step 6.
Record the current iteration of the shortest route, update best_length with the best ant’s path and record the optimal pathG_best_route[], while update the optimal solution in accordance with 3-opt method.Step 7.
Antkcomes back to affected centre, update best_length and route, ROUTES[k][n]= add[ROUTES[k][n],a0]. Seti=i+1. Ifi≤d, switch to Step 4; otherwise, go to Step 8.Step 8.
Update global concentration of pheromones of each node by optimal ant in accordance with (5), (6), and (7).Step 9.
Set NC← NC + 1. If NC < NC_max and the entire ant colony has not converged to take the same path, then set all the ants at the rescue nodea0again and go to Step 3. If NC < NC_max and the entire ant colony has converged to take the same path, or NC = NC_max, then finish the cycle and output the best route.


## 3.1. Ant Colony Optimization Algorithm

Ant colony optimization algorithm and the traditional ant colony algorithm are different in these three aspects as follows. That traditional ant colony algorithm is of slow convergence and is easy to fall into local optimum and stagnation in the vehicle path planning applications, while improved ant colony algorithm solves these problems in the following aspects.(1)
State transition probability function: the transfer rules that ants select the next affected node are modified, which is calculated as follows:(1)pijk(t)={[τij(t)]a*Dβ*[wij(t)]γ*[Uij(t)]γ*ζij(j)∑k∈allowedk[τik(t)]a*Dβ*[wik(t)]γ*[Uik(t)]γ*ζik(k),ifj∈allowedk0,otherwise,whereτijrepresents pheromones substance on the path edge(i,j),Dstands for visibility,pijkis transition probabilities of thekth ant from the affected nodeito affected nodej, the user parametersαandβare adjustable parameters that determine the relative influence of the pheromone and the visibility in the transition probabilities,γmeans the relative importance of the path weights in the transition probability, andallowedkrepresents the neighbor affected node of affected nodeithatkth ant has not yet visited. Here introducing the path weight valuewijthat stands for the weight value between affected nodes and the rescue center,D=1/(dij+dj,a0) replaces the traditional visibility function; that is,ηij=1/dij, where the valuedijmeans the distance betweeniandjand the valuedj,a0is the distance between the affected nodejand the rescue centre node. To modify visibility function is to enhance the ant’s perception of rescue centre node in the current affected node, which will guide the ants to move and therefore avoid falling into local optimum search results and reduce the search time. WhereUijstands for the save distances between nodes, both the affected nodes and the rescue centre. The save matrix calculated by the formula:After adding this factor, it may avoid out the connection of a direct connection with the affected nodes, without through disaster rescue center node, meanwhile shortening the length of the path. Shown in Figure2,ζij(j)is an angle factor, which is the angle between the vector[Nodei1Nodei→,NodeiNodej→]; Nodei1stands for the previous node before visited affected nodei, the valueNodeithat the black point represents the current visiting affected nodei,Nodejrepresents the next visiting affected nodej, red arrow direction equals with the oppositeNodei1Nodei→, yellow arrow direction equals withNodeiNodej→, andζij(j)is calculated as (2). Whenθis between[0,π/2],ζij(j)is a constant 0.00001, which is for escape when an ant is faced with a dead-end street. Consider(2)ζij(j)={θπ,ifπ2≤θ≤π,0.00001,if0≤θ≤π2.(3)j={argmaxu∈JJik{τiu(t)α*Dβ*[wiu(t)]γ*[Uiu(t)]γ},ifq≤q0,JJ,ifq>q0.Figure 2
A view of added angle factor.Ants choose the next affected nodejin accordance with (3).WhereJJis determined by (1),qis a random variable number between 0 and 1,q0is an adjustable parameter which is between 0 and 1, and here we defineq0as 0.05. When (3) satisfied the conditionq>q0, it chooses the next access node in accordance with (1).There are two rules in global update. One is the local optimal iteration and the other is the global optimal iteration.(2)
Update the local pheromone substances in accordance with the following:(4)τij(t+1)=ρ·τij(t)+(1-ρ)τij(0).In the progress of searching paths, according to state transition rules, ants apply (4) to choose route whose pheromone should be updated. After all ants move a step, local pheromones update once. Whereτij(0)represents the initial value of pheromone of edge(i,j), usually a small positive number to prevent ant colony from falling into local optimal solution prematurely,ρis a user-defined coefficient, which stands for the degree of global pheromone evaporation.(3)
Update the Global pheromone substances with the following:(5)τij(t+n)=ρ·τij(t)+(1-ρ)Δτij.(6)Δτij={1L,ifedge(i,j)ispartofthebestant'srouteatthisiteration,0,otherwise,whereτij(t+n)represents pheromone of the best path(i,j)from timetto timet+nafter all of the ants complete a trip, which is unlike traditional ant colony algorithm. In (6),Lrepresents length of the best moving path corresponding to ants crawling at this iteration. After iteration, update the global pheromone by (5).Meanwhile, to take advantage of convergence of the algorithm, this paper adds incentive factorγin pheromone global updating. It is calculated by the following:
(7)γ=L+-LT.Tis a positive constant whose value can be up to the same order of magnitude as current working space. In this paper setT=1000. Thus, it reduced the complexity of the search, and improved the accuracy and convergence speed of the route search.L+is the shortest path length for moving till previous cycle. If the path length of optimal solution in this cycle is shorter than optimal solution having been found, thenγ>0, otherwiseγ<0, which avoids falling into local optimum.


## 3.2. The Steps of Path Optimization

Step 1.
Initialize phase.m: the number of ants, NC_max: the maximum number of iterations, the number of iterationsNC=0, best_len: the current optimum path length, and set concentration of pheromones on each node at initial time (0.001), all the ants at the rescue centrea0,Windicates the vehicle load, and weigh[]stands for the demand of affected nodes. Set each ant a tabu list array tabu[]to store the city that the ants have already visited; that is to say, the cities will not be visited in the next choice, the path length passed ant.[k].path_length, array ROUTES[k][n]stored thekth ant’s route where the path has already been visited in thenth iteration, and adda0to each ant’s tabu list (k=1,…,m, n=1,…,NC_max).Step 2.
Set variablei=1.Step 3.
Calculate the next affected node the ant can choose and exclude the affected node in tabu list or the obstacle affected node. Array to_visit[]and Len_to_visit recorded separately the affected node's mark the ants can visit and the number of the affected node, while Len_to_visit≥1andW≥weigh[]go to Step 4, otherwise go to Step 7.Step 4.
Use (3) and roulette method to select an affected node to_visit for each antk(k=1tom). And move antkto this node. Meanwhile, update the ant k’s length of path, route: ROUTES[k][n]= add[ROUTES[k][n], to_visit], the ant moves the next affected node to_visit, put to_visit in ant k’s tabu list array tabu[], andW=W-weigh[to_visit].Step 5.
Perform a local updating rule according to (4).Step 6.
Record the current iteration of the shortest route, update best_length with the best ant’s path and record the optimal pathG_best_route[], while update the optimal solution in accordance with 3-opt method.Step 7.
Antkcomes back to affected centre, update best_length and route, ROUTES[k][n]= add[ROUTES[k][n],a0]. Seti=i+1. Ifi≤d, switch to Step 4; otherwise, go to Step 8.Step 8.
Update global concentration of pheromones of each node by optimal ant in accordance with (5), (6), and (7).Step 9.
Set NC← NC + 1. If NC < NC_max and the entire ant colony has not converged to take the same path, then set all the ants at the rescue nodea0again and go to Step 3. If NC < NC_max and the entire ant colony has converged to take the same path, or NC = NC_max, then finish the cycle and output the best route.


## 4. Experiment of Computer Simulation and Analysis of Results

In this part, we use the established model shown in Part 2 to do the simulation experiment of the optimal algorithm. The experiment runs on Windows XP Professional SP3 (symmetric multiprocessor system) and the compiler environment is MATLAB R2009a. Each parameter is set to NC_max = 5,ρ=0.85,α=1.0,β=1.0,γ=17,Q=100.0, andm=20. All of the parameters are under the optimal experiment in the literature [15]. The results of the simulation are shown in Figures 3–8.Figure 3
A result of ant colony algorithm path planning.Figure 4
A result of the literature [15] path planning.Figure 5
A result of improved ant colony algorithm path planning in this paper.Figure 6
The convergence curve of ant colony algorithm path planning.Figure 7
The convergence curve of the literature [15] path planning.Figure 8
The convergence curve of improved ant colony algorithm path planning in this paper.In order to illustrate the superiority of the proposed method, we use the example above to compare the results of three methods, including traditional ant colony algorithm, the literature [15], and improved ant colony algorithm. Figures 3, 4, and 5 shows the results that each polygon means one route. From Figure 3, we can see the path planning of traditional ant colony algorithm, the best length is 58.52 m, the route is0→10→4→13→12→0;0→3→5→7→9→2→0;0→8→6→14→0; 0→1→15→11→0.When using the weight matrix, we define that if the two roads are not connected, the weight value is 0, then the higher the weight value the better the clearer road. The search result is shown as Figure4, the best length is 48.49 m and the optimal path is0→1→15→8→0;0→13→2→3→5→7→9→12→0;0→14→6→0; 0→11→4→0; 0→10→0This paper introduced angle factor in the transfer rule, because in an emergency we need to avoid obstacles to the road to gain more time. Thus, we choose the next node where the offset angle is small and closer to the direction of the transfer, which is more likely to avoid obstacles in the roads. The save matrix is to compensate for the optimal path length increasing brought by a perspective to factors. Meanwhile, after each cycle, update pheromone by reward function and use 3-opt algorithm to the optimal solution method to update the global optimal path length. Results shown in Figure5, the best length is 41.61 m and the optimal path is0→13→4→11→0; 0→6→14→0;0→8→15→1→10→0;0→12→3→5→7→9→2→0.In this instance, the literature [15] and this paper’s proposed algorithm’s optimal path length are best among the three methods. After adding the angle, the vehicle’s route is more concise and clear, while the new transfer rules and pheromone update rule, this algorithm only sent four rescue vehicles to meet relief needs which is more reasonable.Convergence property, where Figures6, 7, and 8 show their convergence property. Blue line shows the optimal solution of the traditional ant colony algorithm convergence process, the black line is the literature [15] in the convergence process, and the red line is this paper’s improved ant colony algorithm convergence process. As can be seen from the figure, in the same five iterations, the curve of traditional ant colony algorithm fluctuates, the optimal solution is 58.52 m, the literature [15] proposed optimization algorithm and the algorithm this paper proposed converges within 5 iterations. From the view of convergence, improved ant colony algorithm overcomes the shortcomings of slow convergence, and the optimal solution (41.61 m) that is superior to the literature [15] algorithm is the optimal solution (48.49 m).In this part, the simulation instances from benchmark [10] were tested by the above algorithms. We labeled the example of examples that data points were non-decreasing order as I1, I2,…,I14, where the conditions for instances I1–I5 are similar to the instances I9–I14, while instances I6–I10 and I11-I12 involve limited routing path length and service time. We conducted five experiments, the first group was the traditional GA, the second group was the traditional ACS, the third group was the literature [15], the fourth group was the literature [20], and the last group was for this paper proposed optimization algorithm. All parameters were under experimental environment of the optimum algorithm, shown in Table 3. Here parametersPcandPmare for Crossover probability and mutation probability in the GA algorithm respectively. Each experiment was performed 20 times, respectively, and compared with each optimal and average path length. The experimental results are shown in Figures 9, and 10. To illustrate our proposed algorithm drawing better performance, we record CPU processing time under the experiment above, and then compare their average time, shown as Figure 11.Table 3
Parameter settings.
α
β
γ
ρ
(or Pc)
q
0 (or Pm)
NC_max
Q
m
GA
~
~
~
0.8
0.08
50
100
5
ACS
l
2
~
0.7
0.8
50
100
5
Literature [15]
0.1
2
15
0.1
0.9
50
100
5
Literature [20]
1
1
~
0.2
0.9
50
100
5
This paper
1
1
17
0.15
0.05
50
100
5Figure 9
The simulation results of best length.Figure 10
The simulation results of average length.Figure 11
The simulation results of average time.Figure11 shows the average running time of the five algorithms in various numerical examples from I1 to I14. To compare against GA and ACS, our proposed algorithm has higher overhead time. However, it can still be able to obtain good solutions in a short time, and all the solving time is within 100 seconds. At the same time, our proposed algorithm performs better than [15] and [20]. From Figure 11, we can see that from I1 to I8, [15, 20] and our proposed algorithm have the almost same computation speed; however, from I9 to I14, our proposed algorithm takes less time than [15, 20] significantly.As is seen from the experimental results, the optimal and the average results of the paper proposed algorithm are superior to other four methods clearly, comparison in terms of simulation time, our proposed algorithm also has advantage of average running time, as the problem size increases, that is to say, from I1 to I14 the size of examples increase; this advantage has become increasingly apparent. Taken all together, our proposed algorithm draws the best performance and in the future it can be applied in much more complex environments as well.


## 5. Conclusions

In this paper, we established a new model of disaster emergency response, which adopts new transfer rules, adds the path weight matrix, save matrix, angle factor functions, and new visibility functions, at the same time, updates pheromone model with reward function, overcoming the shortcomings that are of slow convergence and are easy to fall into local optimum and stagnation of ant colony algorithm in the vehicle applications, thus reducing the complexity of the search process. We use 3-opt method to update the optimal solution to shorten the length of rescue route. Finally, the computer simulation experiments confirm the correctness and validity of this method, and due to considering the actual road conditions and other factors such as the angle, which is more reasonable when applies to solve real emergency rescue.



---

*Source: 785383-2013-11-28.xml*