Journal of Theoretical and Applied Information Technology

31st May 2016. Vol.87. No.3

© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

DECOMPOSING AND SOLVING CAPACITATED VEHICLE

ROUTING PROBLEM (CVRP) USING TWO-STEP GENETIC
ALGORITHM (TSGA)
1
MUHAMMAD LUTHFI SHAHAB, 2DARYONO BUDI UTOMO, 3MOHAMMAD ISA IRAWAN
1,2
Department of Mathematics, Institut Teknologi Sepuluh Nopember
E-mail: [email protected], [email protected], [email protected]

ABSTRACT

Capacitated vehicle routing problem (CVRP) is one of the vehicle routing problem (VRP) that uses
capacity restriction on the vehicles used. There are many methods have been studied to solve CVRP. To
solve CVRP, it is possible to decompose CVRP into regions (sub problems) that can be solved
independently. A two-step genetic algorithm (TSGA) is formulated in this paper. TSGA is used to
decompose CVRP and then find the shortest route for each region using two different simple genetic
algorithms. TSGA is then compared with genetic algorithm (GA). To compare these two algorithms, four
instances is formed, those are P50, P75, P100, and P125. For each instance, fourteen different vehicle
capacities is used. The results show that TSGA is better than GA in terms of computational time and
distance except for some small vehicle capacities at P50 and P75.
Keywords: Capacitated Vehicle Routing Problem (CVRP), Genetic Algorithm (GA), Decomposition, Two-
Step Genetic Algorithm (TSGA)

1. INTRODUCTION CVRP consists in determining a set of a maximum

of routes of minimum total distance, such that
Vehicle routing problem (VRP) is a hard each route starts and ends at the depot, each
combinatorial optimization problem with numerous customers is visited exactly once by exactly one
industrial applications [1]. In the capacitated VRP vehicle, subject to the restriction that the total
(CVRP), all the customers correspond to deliveries demand of any route does not exceed [1].
and the demands are deterministic, known in Because it is found to be widely applicable to
advance, and may not be split. The vehicles are many real world situations, it has been studied
identical and based at a single central depot, and extensively [3][14]. While exact methods solve
only the capacity restrictions for the vehicle are small problems quite efficiently, issues still exist
imposed. The objective is to minimize the total cost for the larger problems. On the other hand,
(i.e., a weighted function of the number of routes metaheuristic methods can find good solutions in
and their length or travel time) to serve all the less time. There are several metaheuristic methods
customers [2]. CVRP is formally defined as an that can be used, those are variable neighborhood
undirected graph where search, stochastic local search, iterated local search,
is a vertex set and particle swarm optimization, simulated annealing,
is an edge set. The scatter search, differential evolution, simulated
depot is represented by vertex , which uses annealing, tabu search, and genetic algorithm [4].
independent vehicles, with identical delivery To solve CVRP, it is possible to decompose
capacity , to serve demands from customers, CVRP into regions (sub problems) that can be
, represented by set . A solved independently [12]. Based on that, two-step
non-negative distance matrix between genetic algorithm (TSGA) is formulated in this
paper. TSGA is used to decompose CVRP and then
customers and is defined on . A solution for
find the shortest route for each region using two
the CVRP would be a routes of different simple genetic algorithms. TSGA will be
represent the routes of the vehicles, each route formulated coherently and will be compared with
that is , where and GA to determine how well TSGA can be used to
, satisfying . The solve CVRP.

461
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

2. LITERATURE REVIEW 3. GENETIC ALGORITHM (GA) FOR

CVRP
The success of genetic algorithms to solve
problems such as traveling salesman problem (TSP) Before we formulate TSGA, first we resume
and vehicle routing problem with time windows good enough GA that can be used to solve CVRP.
(VRPTW), distribution of navy warship [5-6], The GA is formulated with the following
flowshop scheduling [7] and the growth of GA such characteristics:
as genetic algorithm with artificial chromosome [7], • Chromosome representation which is used is a
automatic genetic algorithm clustering [8], two permutation of the customers. Each
level genetic algorithm [9], parallel genetic chromosome is unique and can only represents
algorithm [10], multi stage interactive genetic one CVRP solution. For example, if CVRP
algorithm [11] shows that the use of genetic problem that is used consists of nine
algorithms will give a good enough solution for customers, one of the chromosomes that can be
CVRP if it is studied continously. used is . To change the
Genetic algorithm with artificial chromosome chromosome into the desired solution,
is proposed to solve flowshop scheduling problems. information about vehicle capacity and
An artificial chromosome generating mechanism is customers demand is used. Suppose that the
designed to reserve patterns of genes in elite capacity of the vehicle is 17 and demand from
chromosomes and to find possible better solutions. every customers is , , then the
The artificial chromosome generating mechanism is first route is , that is
embedded in genetic algorithm [7].
, second route is ,
A genetic algorithm based clustering method
that is , and
called automatic genetic clustering for unknown K
(AGCUK). In the AGCUK algorithm, noising third route is , that is .
selection and division-absorption mutation are • Population size which is used is 100.
designed to keep a balance between selection • Suppose that a chromosome represent routes
pressure and population diversity. The Davies- , , where is
Bouldin index is employed to measure the validity and
of clusters [8]. , then the fitness function
A two-level GA is proposed to solve an
that can be used is
integrated multi-item supplier selection model [9].
The lifting path planning problem for terrain cranes
in complex environments is studied in [10]. The (1)
crane lifting path planning is formulated as a multi-
objective nonlinear integer optimization problem
• Selection is done by selecting two random
with implicit constraints. To solve that problem, a
chromosomes.
Master-Slave Parallel Genetic Algorithm is used.
Interactive genetic algorithm (IGA) can • Crossover operator which is used is ordered
effectively solve the optimization problem. crossover (OX) [3] with the crossover
However, the challenge still remains for IGA to probability is 1. The example of how the OX
ameliorate user fatigue and reduce the noise in the works can be seen in Figure 1.
process of evolution. To address the issue, a multi-
Parents
stage interactive genetic algorithm (MS-IGA) is
1 2 3 4 5 6 7 8 9
proposed [11], which divides the large population
of the traditional interactive genetic algorithm 9 8 7 6 5 4 3 2 1
(TIGA) into several stages according to different
functional requirements. The proposed MS-IGA is Child
then applied to the car console conceptual design 6 7 8
system, to better capture the knowledge of users’
personalized requirements and accomplish the 9 5 4 3 2 6 7 8 1
product design. This is especially important Figure 1. Ordered Crossover (OX)
in the field of complex product configuration
design, such as in cars, personal computers, smart • Mutation operator which is used is exchange
phones and the like. and inversion [3] with each operator mutation
probability is 0.1. The example of how the

462
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

exchange and inversion works can be seen in demand. The second characteristic is taken so that
Figure 2 and Figure 3. CVRP solution that is formed will be good
enough. TSGA1 will try to meet this characteristic
Parents with consider the slope of the line connecting the
1 2 3 4 5 6 7 8 9 customer with the depot. In this case, the use of
slope of the line based on the fact that if the slope
Child between the two lines adjacent to each other, then
1 2 3 4 8 6 7 5 9
the points that exist in the line will also be close
Figure 2. Exchange enough.
Consider the example of a simple CVRP in
Parents
1 2 3 4 5 6 7 8 9
Figure 4 where a large circle represents the depot
and small circles represent the customers. From this
Child example, one of which could be generated
1 2 6 5 4 3 7 8 9 decomposition by TSGA1 can be seen in Figure 5.
Figure 3. Inversion

• Population replacement scheme which is used

is elitism replacement with filtration and works
as follows: both old population and new
population are combined into a single
population and sorted in a non-decreased order
of their associated fitness value. The filtration
strategy is used to identify identical individuals
from the population. Then we choose half of
the population. If the size of new population is
smaller than the size of old population, we
generate new individuals [1]. Figure 4. CVRP Example
• Stopping condition which is used is fitness
value is not improved after 2000 generations or
100000 generations is reached.

4. TWO-STEP GENETIC ALGORITHM

(TSGA) FOR CVRP

TSGA works by combining two simple genetic

algorithms that can be used to solve CVRP in a
different way from the usual GA. GA are trying to
solve CVRP directly, whereas TSGA will first
decompose CVRP into regions that can be solved
independently with TSGA1 (first genetic algorithm Figure 5. Decomposition Example by TSGA1
in TSGA) and then find the shortest route for each
region with TSGA2 (second genetic algorithm in By doing decomposition, a solution for every
the TSGA). The regions which are formed from the region that is formed will be the solution of CVRP.
decomposition performed by TSGA1 must meet the Solution for every region that is formed is the
following characteristics: shortest route which departs from the depot, and
• each region only requires one vehicle to serve then connect each customers in the area, and then
any customers in the region. In other words, back again to the depot. Note that as each region
the total demand for the customers in each formed from decomposition only needs one vehicle
region does not exceed the vehicle capacity, to serve all customers in the area, then information
• customer locations in the region should be about customers demand can be eliminated so that
located near each other. the problem at each region can be called as
The first characteristic is taken because each a traveling salesman problem (TSP). For CVRP
route in CVRP solution must be served by a single example in Figure 4 which has been decomposed as
vehicle. TSGA1 will try to meet this characteristic in Figure 5, the solution of which can be obtained
with consider vehicle capacity and customers by the TSGA2 can be seen in Figure 6.

463
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

(4)

(5)

(6)

Figure 6. CVRP Solution Example by TSGA

(7)
4.1. TSGA1 for TSGA

Before TSGA1 can be used, every slope of the where is number of digit 1 in the
line must be calculated. Then slopes is sorted from chromosome, is number of vehicle used.
the smallest to the largest. Once the slope is sorted, • Selection is done by selecting two random
each customers from small slope to large slope is chromosomes.
labeled by , where is number of • Crossover operator which is used is 1-point
customers in CVRP instances. TSGA1 is crossover with the crossover probability is 1.
formulated with the following characteristics: The example of how the OX works can be seen
• Chromosome representation which is used is a in Figure 7.
binary representation. For example, if CVRP
instance consist of 20 customers, one of the Parents
chromosomes that can be used is 1 1 1 1 1 1 1 1 1
00010000010010000000. That chromosome 0 0 0 0 0 0 0 0 0
shows that CVRP is decomposed into three
regions. Number of regions which is formed is Child
equal to the number of digit 1. The first area is 1 1 1 1
characterized by sub-chromosome 100000
which represents customers . 0 0 0 0 0 1 1 1 1
Second area is characterized by sub- Figure 7. 1-Point Crossover
chromosome 100 which represents customers
. Third area is characterized by • Mutation operator is done by selecting a
sub- chromosome 10000000 and 000 which random digit and then change the value. If
represents customers . selected value is 1, then changed to 0, and vice
• Population size which is used is 100. versa. Mutation probability is 0.5.
• Suppose that a chromosome represent routes • Population replacement scheme which is used
, , where is is elitism replacement with filtration.
and • Stopping condition which is used is fitness
value is not improved after 2000 generations or
, then the fitness function 100000 generations is reached.
that be used is (7) defined as follows:
4.2. TSGA2 for TSGA
(2)
TSGA2 is used to find shortest route of a
regions formed by TSGA1. These routes are then
combined to become CVRP solution. TSGA2 is
formulated with the following characteristics:
(3) • Chromosome representation which is used is a
permutation of the customers. As an example,

464
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

if customers in a region is , then P50 consists of a depot and 50 customers that

one of the chromosomes that can be used is must be served. In this instance, the abscissa and
. ordinate of depot is 50, while the abscissa and
• Population size which is used is 100. ordinate of customers is between 0 and 100. Each
• Suppose that we have a chromosome customer has a demand, that is between 10 to 30.
, then the fitness function that can be Abscissa, ordinate, and demand of each customer
used is can be seen in Table 1.

Table 2. Abscissa, Ordinate, and Demand of P75

(8)
1 19 24 38 57 22 65 55 16 99 41 19
• Selection operator which is used is tournament 2 2 11 38 145 12 67 35 14 103 33 13
selection and the size is 5. 4 120 29 39 82 29 68 122 30 110 73 13
• Crossover operator which is used is sequential 4 141 29 39 49 24 72 82 13 114 33 21
constructive crossover (SCX) [13] with the 7 117 13 39 144 20 74 30 24 115 85 18
crossover probability is 1. 8 138 16 42 128 27 74 64 16 117 85 11
• Mutation operator which is used is exchange 10 133 14 44 73 29 74 113 10 118 37 15
11 65 17 48 21 24 77 103 21 120 61 30
with mutation probability is 0.2.
12 92 17 50 76 27 78 85 14 126 1 23
• Population replacement scheme which is used 22 87 25 50 108 12 79 28 27 127 63 11
is elitism replacement with filtration. 24 17 25 50 129 24 79 65 26 128 31 13
Stopping condition which is used is fitness 24 149 28 50 64 10 82 59 14 134 2 16
value is not improved after generations 25 122 11 51 79 17 83 102 10 134 84 10
25 101 11 52 17 18 86 77 18 138 53 14
( is number of customers in the region and
29 7 11 56 91 17 88 63 29 142 115 24
is number of regions) or 1000 generations is
30 140 10 56 18 25 90 18 14 149 11 26
reached.
33 87 15 58 40 24 93 20 24 149 143 18
35 108 18 63 91 27 94 101 12 149 28 19
5. RESULTS AND DISCUSSIONS 37 138 14 65 112 27 94 77 14

5.1. CVRP Instances Table 3. Abscissa, Ordinate, and Demand of P100

CVRP instances is created so that TSGA can 0 30 14 52 14 17 101 15 15 158 0 10

be implemented to solve the instances. To be able to 2 31 19 53 147 21 103 83 25 159 199 30
get well conclusion, four CVRP instances is 2 165 23 53 111 20 103 74 25 162 93 29
created, those are P50, P75, P100, and 3 46 11 58 139 25 105 74 13 166 148 15
P125. Abscissa, ordinate, and demand for each 5 155 22 62 36 13 105 200 23 167 193 26
customer at the instances are selected randomly 6 102 22 62 60 11 106 181 12 168 27 23
from a certain range. 8 163 24 65 173 30 108 97 12 168 37 17
8 101 27 68 26 30 109 2 20 171 62 26
Table 1. Abscissa, Ordinate, and Demand of P50 15 119 29 68 48 15 117 6 11 171 33 27
21 121 28 70 32 25 117 58 25 171 85 27
1 50 19 32 5 27 53 82 19 73 86 10 22 103 18 70 182 13 117 73 28 173 129 16
3 81 11 34 27 17 54 36 12 74 17 27 24 187 27 72 130 24 119 120 19 173 55 16
3 4 16 35 91 15 54 45 24 75 88 25 28 172 22 75 130 17 125 167 10 175 45 19
9 3 25 35 67 28 57 99 27 76 27 27 29 7 28 76 130 24 125 37 24 176 23 25
9 32 29 37 80 29 59 72 30 77 51 17 30 194 15 79 7 10 128 128 25 177 9 26
13 99 13 37 87 13 60 21 18 80 44 19 32 2 27 79 11 12 131 190 15 179 123 25
14 21 26 38 49 13 60 14 18 89 87 13 32 61 16 83 11 16 135 178 11 184 46 26
24 9 14 39 42 22 62 95 16 94 86 17 34 57 13 85 122 25 147 107 26 186 66 14
25 82 16 40 11 27 62 31 28 97 81 26 36 73 18 86 35 18 148 167 21 187 11 17
29 10 12 45 47 19 63 20 29 97 59 25 38 179 23 87 161 25 150 162 24 193 123 20
30 33 29 47 36 20 65 11 17 100 52 24 42 141 17 90 103 11 150 77 30 194 171 30
30 50 26 50 83 10 70 2 28 44 127 30 92 31 11 151 0 12 195 16 25
32 52 18 51 94 24 70 30 26 49 24 15 92 13 24 151 151 23 195 60 17
50 124 11 93 96 29 152 21 25 197 51 28
51 106 16 101 150 25 153 100 12 199 122 18

465
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

P75 consists of a depot and 75 customers that 5.2. Comparison of TSGA and GA
must be d. In this instance, the abscissa and ordinate
of depot is 75, while the abscissa and ordinate of Comparison of TSGA and GA can be done by
customers is between 0 and 150. Each customer has using TSGA and GA to solve P50, P75, P100, and
a demand, that is between 10 to 30. Abscissa, P125 which is created. For each instance, fourteen
ordinate, and demand of each customer can be seen different vehicle capacities is used. Comparison
in Table 2. between TSGA and GA will be seen in terms of
P100 consists of a depot and 100 customers distance and computational time needed to solve
that must be d. In this instance, the abscissa and CVRP.
ordinate of depot is 100, while the abscissa and In term of distance, used
ordinate of customers is between 0 and 200. Each where is
customer has a demand, that is between 10 to 30.
distance obtained by GA and is distance
Abscissa, ordinate, and demand of each customer
obtained by TSGA. This value show how well
can be seen in Table 3.
solution obtained by TSGA when is compared to
P125 consists of a depot and 125 customers
solution obtained by GA. The results are computed
that must be d. In this instance, the abscissa and
after making 3 independent runs, and get the best
ordinate of depot is 125, while the abscissa and
distance from those runs. The comparison between
ordinate of customers is between 0 and 250. Each
TSGA and GA is showed in Table 5, Table 6, Table
customer has a demand, that is between 10 to 30.
7, and Table 8. The bold values in the table shows
Abscissa, ordinate, and demand of each customer
better value between TSGA and GA.
can be seen in Table 4.
Table 5. Comparison of GA and TSGA for P50
Table 4. Abscissa, Ordinate, and Demand of P125
Vehicle GA TSGA
4 152 15 52 81 16 112 136 12 197 187 28 Capacity Distance Time Distance Time
4 12 20 52 60 21 112 19 23 199 47 30 77 1459.428 25 1591.732 10 -9.06
5 179 24 52 149 17 115 236 17 200 148 22 83 1411.733 31 1533.234 10 -8.60
8 225 18 56 102 29 117 35 25 204 179 13
90 1319.670 38 1429.179 10 -8.29
9 6 10 61 71 29 124 195 19 205 6 19
10 246 15 63 77 15 129 7 19 211 124 21
99 1234.570 24 1287.732 7 -4.30
10 135 28 65 32 11 132 48 19 215 138 11 109 1205.129 13 1247.899 5 -3.54
14 78 22 67 246 15 135 83 18 216 77 24 122 1083.415 29 1166.375 6 -7.65
14 119 11 67 238 28 136 153 23 217 66 29 139 1015.836 64 1059.293 5 -4.27
15 103 22 72 140 14 143 139 13 217 28 20 160 985.226 28 915.086 4 7.11
16 34 13 73 177 11 144 126 16 218 237 13
189 899.162 18 863.571 3 3.95
17 119 11 76 74 23 147 112 11 219 140 29
19 139 25 77 19 10 152 44 30 221 116 22 231 801.136 22 801.507 3 -0.04
20 192 11 83 184 20 154 237 14 221 212 28 297 788.582 44 710.183 3 9.94
22 85 29 86 124 16 155 212 18 221 120 28
27 7 30 86 96 29 159 19 30 228 209 10 Table 6. Comparison of GA and TSGA for P75
30 142 17 87 233 25 159 111 26 228 181 19 Vehicle GA TSGA
31 240 10 87 97 25 161 220 22 229 25 21 Capacity Distance Time Distance Time
32 240 15 87 127 27 162 24 16 231 52 20
105 2386.744 85 2404.516 9 -0.74
32 246 14 88 153 13 164 108 22 234 142 12
33 217 10 89 1 15 167 180 24 235 197 16 113 2309.077 104 2401.982 6 -4.02
38 226 16 93 174 15 170 150 29 235 132 14 123 2170.193 65 2203.066 9 -1.51
41 165 16 93 182 16 174 0 16 241 237 25 135 2053.659 115 2068.197 7 -0.70
43 108 30 94 233 13 175 198 13 241 177 30 149 1961.569 55 1885.894 5 3.85
43 106 22 94 145 29 178 18 24 243 166 24
166 1811.217 136 1835.419 6 -1.33
43 165 18 95 30 17 178 114 14 244 77 22
188 1719.833 85 1630.429 4 5.19
45 194 19 96 14 28 183 4 16 244 83 11
47 112 26 99 147 15 190 132 13 247 155 23 217 1698.279 81 1501.133 5 11.6
48 74 29 102 108 26 190 167 22 247 242 30 257 1598.278 98 1377.450 5 13.8
49 230 15 103 15 21 194 38 21 314 1574.126 95 1359.159 5 13.6
49 116 10 103 43 13 195 123 25 404 1514.616 116 1215.419 6 19.7
51 201 23 107 132 28 197 33 24

466
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

For P50, we use 77, 83, 90, 99, 109, 122, 139, computational time, TSGA is better than GA. In
160, 189, 231, 297 as a vehicle capacity. If we use terms of distance, TSGA is better than AG except
77 as vehicle capacity, minimum number of vehicle for some small vehicle capacities at instances P50
that can be used is (where and P75. Larger vehicle capacity will gives larger
value that means TSGA will be better if larger
1040 is total demand of all customers in P50). And
vehicle capacity is used.
if we use 297 as vehicle capacity, minimum number
of vehicle that can be used is . REFERENCES:
Similar reasons are used to choose the vehicle
capacities for P75, P100, and P125. [1] Nazif, H. and Lee, L.S.. 2012. “Optimized
Crossover Genetic Algorithm for Capacitated
Table 7. Comparison of GA and TSGA for P100 Vehicle Routing Problem”. Applied
Vehicle GA TSGA Mathematical Modelling 36, 2110-2117.
Capacity Distance Time Distance Time [2] Yucenur, G.N. and Demirel, N.C.. 2011. “A
151 3951.525 123 3664.148 10 7,27 New Geometric Shape-Based Genetic
164 3622.753 153 3428.708 11 5,35 Clustering Algorithm for The Multi-Depot
178 3588.194 125 3119.468 9 13,0 Vehicle Routing Problem”. Expert System with
195 3454.294 166 2958.256 5 14,3 Applications 38, 11859-11865.
215 3287.016 293 2726.513 6 17,0 [3] Karakatic, S. and Podgorelec, V.. 2015. “A
240 3060.496 231 2604.126 5 14,9 Suvey of Genetic Algorithms for Solving Multi
273 2717.931 171 2463.602 6 9,35 Depot Vehicle Routing Problem”. Applied Soft
314 2829.297 256 2216.962 7 21,6 Computing 27, 519-532.
372 2742.865 164 2094.614 8 23,6 [4] Toth, P. and Vigo, D.. 2002. The Vehicle
454 2638.619 148 1939.120 13 26,5 Routing Problem. Philadelpia: University City
26,1 Science Center.
584 2458.270 232 1814.500 17
[5] Hozairi, Buda, K., Masroeri, and Irawan, M.I..
Table 8. Comparison of GA and TSGA for P125 2014. “Implementation of Non-dominated
GA TSGA Sorting Genetic Algorithm-II (NSGA-II) for
Vehicle
Capacity Distance Time Distance Time Multiobjective Optimization Problems on
15,0
Distribution of Indonesian Navy Warship”.
183 5269.657 364 4476.805 24
Journal of Theoretical and Applied Information
198 5100.448 435 4352.449 10 14,6
Technology 64, 274-281.
215 4996.808 298 4141.080 14 17,1
[6] Santoso, P., Buda, K., Masroeri, Irawan, M.I.,
235 4706.922 444 3806.193 7 19,1
and Dinariyana. 2014. “The Implementation of
260 4597.851 507 3594.609 7 21,8
Binary Genetic Algorithm (BGA) for
291 4505.065 372 3280.790 8 27,1
Optimizing the Task of Indonesian Navy Ship
330 4440.228 643 3165.287 12 28,7
Patrols Related to The Security of Indonesia
380 4275.217 499 3003.622 12 29,7 Seas”. Journal of Theoretical and Applied
449 4164.521 407 2817.172 17 32,3 Information Technology 67, 247-253.
549 3928.582 514 2603.215 20 33,7 [7] Chang, P. C., Chen, S.H., Fan, C.Y., and Chan,
706 3502.791 522 2525.264 47 27,9 C.L.. 2008. “Genetic Algorithm Integrated with
Artificial Chromosomes for Multi-Objective
Average computation time of TSGA for P50, Flowshop Scheduling Problems”. Applied
P75, P100, and P125 does not exceed 20 seconds Mathematics and Computation 205, 550-561.
while the GA is in the range from 30 seconds to [8] Liu, Y., Wu, X., and Shen, Y.. 2011.
400 seconds. So in terms of computational time, “Automatic Clustering Using Genetic
TSGA is better than AG. Algorithms”. Applied Mathematics and
Computation 218, 1267-1279.
6. CONCLUSIONS
[9] Aliabadi, D. E., Kaazemi, A., and
Pourghannad, B.. 2013. “A Two-Level GA to
Based on the results that has been presented, it
can be concluded that TSGA can be used to solve Solve an Integrated Multi-Item Supplier
CVRP in a different way from the AG. In terms of

467
 Journal of Theoretical and Applied Information Technology
31st May 2016. Vol.87. No.3
© 2005 - 2016 JATIT & LLS. All rights reserved.

ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195

Selection Model”. Applied Mathematics and

Computation 219, 7600-7615.
[10] Cai, P., Cai, Y., Chandrasekaran, I., and Zheng,
J.. 2016. “Parallel Genetic Algorithm Based
Automatic Path Planning for Crane Lifting in
Complex Environments”. Automation in
Constructioin 62, 133-147.
[11] Dou, R., Zong, C., and Nan G.. 2016. “Multi-
Stage Interactive Genetic Algorithm for
Collaborative Product Customization”.
Knowledge-Based Systems 2016, 43-54.
[12] Taillard, E. .1993.. “Parallel Iterative Search
Methods for Vehicle Routing Problem”.
Network 23, 661-673.
[13] Ahmed, Z.H.. 2005. “Genetic Algorithm for
Travelling Salesman Problem using Sequential
Constructive Crossover Operator”.
International Journal of Biometrics &
Bioinformatics 3, 96-105.
[14] Daryono B.U., Irawan M. Isa, dan M.L.
Shahab. 2015. “Algoritma Genetika Ganda
(AGG) untuk Capacitated Vehicle Routing
Problem (CVRP)”. Seminar Nasional
Matematika dan Pendidikan Matematika UNY
2015

468
Reproduced with permission of the copyright owner. Further reproduction prohibited without
permission.