Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online

Vol. 22, No. 1, February 2021, pp. 1-17 1

An Improved Genetic Algorithm for Vehicle Routing Problem

Pick-up and Delivery with Time Windows
M. F. Ibrahim a*, M. M. Putri a, D. Faristaa, D. M. Utamab
a LogisticsEngineering Department, Universitas Internasional Semen Indonesia, Kompleks PT. Semen
Indonesia (Persero) Tbk Jl. Veteran Gresik, Indonesia
b Industrial Engineering Department, Universitas Muhammadiyah Malang, Jl. Raya Tlogomas No. 246,

Malang 65144, Indonesia

* Corresponding author: [email protected]

ARTICLE INFO ABSTRACT

Vehicle Routing Problems (VRP) have many applications in real

Article history
systems, especially in distribution and transportation. The
Received July16, 2020
Revised February 26, 2021
optimal determination of vehicle routes impacts increasing
Accepted February 28, 2021 economic interests. This research seeks to find the optimal
Available Online February 28, 2021 solution in Vehicle Routing Problem Pick-up and Delivery with
Time Windows (VRPPDTW). Targets in this problem including
reducing distance travel and penalties. Three penalties that
Keywords consider are a capacity penalty, opening time capacity, and
VRPPDTW
closing time capacity. An improved genetic algorithm is developed
Routing
Pick-up and Delivery
and used to determine the vehicle route. There are one main
Time Windows depot and 42 customers. This research raises the problem of a
Genetic Algorithm shipping and logistics company. Analysis of the results shows
that the proposed route obtained from improved genetic
algorithms (GA) is better than the existing route and previous
algorithm. Besides, this research carried out an analysis effect of
the number of iterations on distance traveled, the number of
penalties, and the fitness value. This algorithm can be applied in
VRPPDTW and produces an optimal solution.

This is an open access article under the CC–BY-SA license.

1. Introduction
Vehicle routing problems (VRP) attempt to find routes to deliver goods from a
central depot to various destinations. Many companies face these problems, which are
crucial in distribution and logistics. The right route can find cost-effective routes providing
high customer satisfaction [1]. Moreover, transportation plays a vital role in the success
of the distribution process [2]. In this case, it is necessary to determine the path of visits
to a set of customers by several vehicles [3]. The vehicles start and end at one depot. The
depot's capacity and transport capacity affect the route designed to serve all customer
requests [4]. Many more complex VRP problems have been developed from the classic
VRP combination problems [5] [6]. One of some problem is Vehicle Routing Problem Pick-
up and Delivery with Time Windows (VRPPDTW). VRPPDTW has the primary goal of
determining vehicles and routes' allocation to minimize costs by considering pick-up and
delivery, capacity, and time windows [7]. VRPPDTW is based on integrating vehicles that

https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17 http://ejournal.umm.ac.id/index.php/industri [email protected]

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
2 Vol. 22, No. 1, February 2021, pp. 1-17

deliver and pick-up goods in the transport network affected by the time [8]. Pick-up and
delivery systems refer to how the vehicle fulfills the destination node's demand. The time
window refers to when the fleet reaches the customer's node [9]. Two types of time
windows impose each vehicle delivers the goods to the customers within a specific time
interval [10]. The vehicle may not arrive at the customer's node closing time and before
node open time. The best route must be on time and disciplined capacity as well as
minimum distance and cost.
The first Genetic Algorithm (GA) was developed by Holland and his colleagues at
the University of Michigan in the 1960s. The main objective of developing GA is to design
algorithms that can explore natural adaptation mechanisms' phenomenon into computer
systems. GA adheres to biological evolution to transfer chromosome populations to other
chromosomes through genetic crossover and mutation. GA necessarily are search
algorithms based on selection and genetics mechanisms. The use of GA in solving
engineering and industrial problems reduces the amount and time of calculations,
simplifies the modeling of functions, and reduces modeling errors [11]. Genetic algorithm
applications have been widely used to support decision-making in routing problems [12].
VRP has numerous applications in real life, especially in transportation and
distribution. VRP effect of improving the economic interests and appropriateness of
logistics planning [13]. Mohammed, et al. [14], Ho, et al. [15], and de Oliveira da Costa, et
al. [16] have investigated VRP that was solved by an improved GA. The algorithm
succeeded in solving the problem quickly and found a shorter distance for some routes.
Good routing and scheduling can reduce delivery distance and travel that improve the
level of efficiency and decrease delivery cost. Minimization of travel time and distance is
essential to optimize costs. Several studies that utilize GA include Nazif and Lee [17],
Saxena, et al. [18], and Visutarrom and Chiang [19] that solve capacitated vehicle routing
problems. The proposed algorithm uses an optimized crossover operator. Computational
results showed that the proposed algorithm is competitive in terms of the quality of the
solutions found. Liu, et al. [20] and Escobar-Falcón, et al. [21] have utilized the GA to
solve fleet size and mix vehicle routing problems. Even, Marinakis and Marinaki [22]
combined GA and particle swarm optimization. Their research shows that combining GA
and particle swarm optimization can increase the algorithm's effectiveness in solving a
problem VRP.
Cheng and Wang [23] proposed solving the Vehicle Routing Problem With Time
Windows (VRPTW) by a decomposition technique and GA. The results explained that GA
provides a better solution if combined with the decomposition technique. Ghoseiri and
Ghannadpour [24] solved VRPTW by goal programming and GA. Two famous local
heuristics, namely one-interchange shortest path heuristic and elitism, are used to keep a
few right individuals. Vidal [25] developed an efficient hybrid GA for problem VRPTW.
The proposed algorithm outperforms all current state-of-the-art algorithms on classical
benchmark instances. Furthermore, Ursani [26] introduced the localized GA. The result
from this research is a proposed algorithm on VRPTW for can minimize the distance.
Results show that the new algorithm provides the superior performance of the previous
algorithm. The genetic algorithm is useful in solving challenging and complex issues for
more substantial problems. Although it is used to solve the many kinds of VRP, GA should
possibly solve the VRPPDTW. Almost all paper describes a GA developed for the VRP can
be competitive with other modern heuristic techniques in terms of solution time and
quality. Because of previous research, this paper solves VRPPDTW using Genetic
Algorithms under some of the facts that have been explained previously and considers that
GA has never been applied in the case of VRPPDTW. This paper improves the standard
genetic algorithm for solving VRPPDTW.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 3

This paper proposes an improved GA for solving VRPPDTW problems based.

Genetic algorithms through previous research have indeed been proven to solve various
VRP problems. VRPPDTW has a higher complexity level, and the GA must be improved
to solve the VRPPDTW problem effectively. The goal is to achieve the solution that most
closely approaches the optimal solution with several targets: (1) to reduce the total
distance and (2) to reduce the penalty. The improved GA for solving VRPPDTW was
adapted from the original genetic algorithm developed by Holland [27]. Nearest neighbors
heuristic algorithms are used in the initial population formation to create a better parent
than just random generation. Calculation of fitness value (value of how good the route)
based on distance traveled and several penalties related to VRPPDTW, including time
windows open/close penalties and capacity penalties.
This paper's organization is presented as follows: The notations, assumptions, and
descriptions of vrppdtw problems, improved genetic algorithm, and case studies are
presented in section 2. comparison improve ga and existing route and comparison improve
GA with the standart GA are presented in the results and discussion section 3. Section 4
presents conclusions and further work.

2. Methods
2.1 The Notations, Assumptions, and Descriptions of VRPPDTW Problems
The notations used in this problem are presented as follows:
𝐺𝑚 : vehicle capacity
𝑑𝑖𝑗 : the distance between customer i to customer j
𝑑𝑖 : total demand on customers i
𝑝𝑖 : quantity of pick-ups to customers i
𝐾 : Set the number of vehicles
𝑘 : Set of a vehicle used for distribution
𝑁 : Set the number of customers
𝑖, 𝑗 : customer index
𝑛𝑘 : the number of vehicles
N : customer index (0 indicates the depot)
Ci : customer i, Co show depot
Vk : vehicle route k
qik : total demand for vehicle k to customer i
xijk : has a value of 1, meaning that vehicle k from customer i go straight to customer
j, and if it is worth 0, then vice versa.
Rk : total route time for vehicles k
tij : travel time between customer i and j (proportional to distance)
ti : time of arrival at the customer i
fi : customer service time i
wi : waiting time before customer service i
ei : earliest time to serve customers i
li : due date for customer service i
Li : lateness of service in customers i
𝑃𝑂𝑖 : opening penalty on customer i
𝑃𝐶𝑖 : closing penalty at customer i
𝑃𝐶𝑎𝑝𝑖 : capacity penalty for the ith customer
VRPPDTW is an extension of Capacitated Vehicle Routing Problem. Every
customer i (in this case, the branch office) is associated with demand and pick-up,
representing the demand for homogeneous commodities to be sent and taken at each

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
4 Vol. 22, No. 1, February 2021, pp. 1-17

customer [28]. Besides, each branch office 𝑖 is also associated with a time interval which
is called time windows.
The assumptions used in this problem are
(i) Vehicles must arrive and carry out loading and unloading at each customer 𝑖
within the available time windows span, and the vehicle stop at the customer 𝑖
during service time.
(ii) If the vehicle arrives earlier than the customer time windows 𝑖, vehicles can wait
until service can be started.
(iii) Each route visits the depot vertex
(iv) Each customer vertex is visited precisely on one route
(v) Current vehicle load along the route must not be negative and exceed the capacity
of the vehicle 𝐶.
(vi) Demand is deterministic
(vii) Time window (open and close) customer is fixed
(viii) Vehicle speed is considered constant

The mathematical model of the VRPPDTW problem is as follows:

Objective Function
𝑁 𝐾 𝑁 𝑁
(1)
𝑀𝑖𝑛 = ∑ (𝑃𝑂𝑖 + 𝑃𝐶𝑖 + 𝑃𝐶𝑎𝑝𝑖 ) + ∑ ∑ ∑ 𝑥𝑖𝑗𝑘 . 𝑑𝑖𝑗
𝑖=1 𝑘=1 𝑖=0 𝑗=0

Constraint

∑ ∑ 𝑥𝑖𝑗𝑘 = 1, ∀𝑗 ∈ 𝑉 (2)
𝑘∈𝐾 𝑖∈𝑉

∑ 𝑥𝑖𝑗𝑘 − ∑ 𝑥𝑗𝑖𝑘 = 0, ∀𝑗 ∈ 𝑉, ∀𝑘 ∈ 𝐾 (3)

𝑖∈𝑉 𝑖∈𝑉

∑ 𝑥𝑖𝑘 ≤ 1, 𝑘 ∈ 𝐾 (4)
𝑖∈𝑉

∑ 𝑞𝑖𝑗𝑘 = ∑ ∑ 𝑥𝑖𝑗𝑘 𝑑𝑖 , ∀𝑘 ∈ 𝐾 (5)

𝑖∈𝑉 𝑖∈𝑉 𝑗∈𝑉

∑ ∑ 𝑞𝑖𝑗𝑘 − 𝑑𝑗 = ∑ ∑ 𝑞𝑖𝑗𝑘− 𝑝𝑗 , ∀𝑗 ∈ 𝑉 (6)

𝑘∈𝐾 𝑖∈𝑉 𝑘∈𝐾 𝑖∈𝑉
∑ 𝑞𝑖𝑗𝑘 = ∑ ∑ 𝑥𝑖𝑗𝑘− 𝑝𝑗 , ∀𝑘 ∈ 𝐾 (7)
𝑖∈𝑉 𝑖∈𝑉 𝑗∈𝑉
𝑞𝑖𝑗𝑘 + 𝑝𝑗𝑘 − 𝑑𝑗𝑘 ≤ 𝐺𝑚
(8)
𝑁 𝑁
(9)
∑ ∑ 𝑥𝑖𝑘 (𝑡𝑖𝑗 +𝑓𝑖 +𝑤𝑖 ) ≤ 𝑅𝑘 , . 𝑘 = 1 … 𝐾

t j  ti + wi + f i + tij − M (1 − xijk )
𝑖=0 𝑖=0

; i, j = 1, …, N; k = 1, …, K (10)

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 5

ei  t i  l i (11)
; i = 1, …, N
ti  0 (12)
; 𝑖 = 1, 𝑁
𝑤𝑖 = 𝑚𝑎𝑥{0 , (𝑒𝑖 − 𝑡𝑖 )}
(13)
1, 𝑤𝑖 > 0
𝑃𝑂𝑖 = {
0, 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 (14)

𝐿𝑖 = 𝑚𝑎𝑥{0 , (𝑡𝑖 − 𝑙𝑖 )}
(15)
1, 𝐿𝑖 > 0
𝑃𝐶𝑖 = {
0, 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 (16)

0, 𝑞𝑖𝑗𝑘 + 𝑝𝑗𝑘 − 𝑑𝑗𝑘 ≤ 𝐺𝑚

𝑃𝐶𝑎𝑝𝑖 = { (17)
1, 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
1, 𝑉𝑒ℎ𝑖𝑐𝑙𝑒 𝑎𝑐𝑐𝑒𝑠𝑠 𝑡𝑜 𝑗 𝑎𝑓𝑡𝑒𝑟 𝑎𝑐𝑐𝑒𝑠𝑠 𝑖
𝑥𝑖𝑗𝑘 = { (18)
0, 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

The optimization model in equation (1) indicates the minimization of the opening
penalty, closing penalty, capacity penalty, and vehicle distance. Equation (2) to ensure
that each customer must be visited by 1 vehicle. Equation (3) is used to guarantee that the
same vehicle comes and goes from every customer who visits it. Equation (4) is used to
define that each vehicle only serves once. Equation (5) is a formula to ensure that the
depot load is equal to the demand of all customers to be served. Equation (6) is a formula
that indicates the change in load after the vehicle serves customer i before going to
customer j.
Meanwhile, equation (7) ensures that the vehicle's load is equal to the quantity of
pick-up from all that is served by the vehicle k. Equation (8) ensure that the load carried
by each vehicle does not exceed the maximum load capacity. Constraint (9) states that
each vehicle serves all customers scheduled for that vehicle without exceeding the vehicle's
travel time. Constraint (10) is used to ensure that the two consumers' arrival times are
compatible, where M is a huge real number. Constraint (11) ensures that the vehicle
arrives at each consumer during the consumer's time window. Constraint (12) ensures
that the arrival time of the vehicle to each customer is always positive. Equation (13)
shows the waiting time for the vehicle to the customer i. Equation (14) 𝑃𝑂𝑖 has a value of
1 when the vehicle experiences waiting time for the i-th customer. Constraint (15) shows
the time of delay in service in the ith customer. Equation (16) has a value of 1 when the
vehicle is delayed, and vice versa is 0. Equation (17) is 0 when the transported capacity
does not exceed the delay load capacity. Equation (18) represents the characteristics and
decision variables.

2.2 Improved Genetic Algorithm

This section is outlining the proposed improved GA. The GA is one of the most
powerful metaheuristic methods in solving very complex problems. According to
Mohammed, et al. [14], GA is an adaptive heuristic search system based on natural and
genetic selection's evolutionary ideas. The basic concept of GA is following the natural
evolutionary system. Natural selection occurs, which makes the best individuals survive.
In this paper, the GA utilized solving the VRPPDTW problem. The main problem
is delivering and picking up goods at each customer with different time windows. The use

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
6 Vol. 22, No. 1, February 2021, pp. 1-17

of genetic algorithms aims to explore the solution space. With GA, it is expected that this
complex problem can be solved with near-optimal results.
GA was developed initially by Holland [27]. So far, GA has developed as a method
of solving complex problems. GA is starting to be used to find suitable solutions to complex
problems like in Whitley, et al. [29], Sponsler [30], and Marin, et al. [31], Liu and Jiang
[32], and Sethanan and Jamrus [33], especially when the optimal solution fails to be found
with other searches. GA can be a complex problem-solving solution that requires big-time
in achieving optimal solutions. GA is efficient for solving problems with high complexity,
such as VRP.
An improved genetic algorithm is proposed in solving the problem of determining
the vehicle route in the VRPPDTW problem. The flow chart improved genetic algorithm
used can be seen in Fig. 1.

Start

Generate initial chromosome

population

Evaluate fitness

Set the best population as the initial

route

yes
Termination

no
Select pair of chromosomes for
crossover

Select offspring for mutation

Evaluate fitness

no
Better fitness

yes
Replace population with new
population after process

no yes
Exceed iteration end

Fig. 1. The flow chart improved GA

The implementation of an improved genetic algorithm in VRPTW problems can be

seen in Algorithm 1. The proposed GA improves stages such as establishing initial
population, fitness calculations, selection, crossover, mutation, updating new population,

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 7

repetition number of iterations, and determining the best solution. Several stages of
improved GA are presented as follows:

1. Establishment of Initial Population

The initial population formed using two methods, namely random and heuristic.
One heuristic method that can use is the Nearest Neighbor. Each point is represented by
one number, and then it can be called a gene. A valid single route is represented by each
chromosome that contains a collection of numbers or genes. The use of heuristic methods
in genetic algorithms to form initial populations is expected to minimize the time to find
the best solution.

2. Fitness
In VRPPDTW, Route optimization is influenced by the suitability of arrival time
with the customer time windows and the vehicle load discipline with its capacity. This
research adopts the VRPPDTW conceptual model and represents it in the form of a
penalty. In this study, the fitness value considers the penalties that occur. The penalty is
worth one every time a violation occurs and can be accumulated with other abuses. Thus,
the three components must consider in determining the fitness value. Fitness values
formulated in equation (19).

1 1
fitness = + (19)
1 + total penalty lengthof route
3. Selection
In this stage, the selection process is carried out to select genes in the chromosomes
formed before. One of the most commonly used selection methods is the Roulette Wheel
Selection (RWS). In this method, the parents obtained the chromosome's fitness value
proportion, meaning that the chromosome with the best fitness value has elected a higher
likelihood than other chromosomes. Chromosome parents elected at the next selection
process enter the crossover process to produce offspring chromosomes.

4. Crossover
In the crossover stage, not all chromosomes from parents are chosen for crossover.
The crossover method used in this study is the heuristic crossover. The crossover step
detail is explained in Algorithm 1. The distance between genes considered in the crossover
stage to create a better new population.

5. Mutation
Like a crossover, whether or not a mutation process depends on the probability of
mutation. In detail, the mutation process is explained in Algorithm 1. In this study's
mutation process, the distance between genes is considered to create a better new
population.

6. Establishment of a New Population

In this stage, a new population formed to replace the old population. Population
replacement means that all chromosomes beginning in a generation replaced by
chromosome results obtained after the crossover and mutation stages. The population
becomes a new population and is repeated before selecting, crossover, and mutation back
at the new population.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
8 Vol. 22, No. 1, February 2021, pp. 1-17

Algorithm 1: Proposed Improve GA for CVRPPDTW problem

1. start;
2. population (a set of the route) initialization, use randomized method and nearest
neighbor algorithm to form chromosomes (routes) structure;
3. evaluate total length, total penalty, and fitness value of the initial population,
fitness = (1/(1 + total penalty)) + (1/ length of route);
4. choose the population with the best fitness value as the initial route;
5. loop the following steps for the specified number of iterations (the more iterations,
the better):
5.1. copy chromosome structure of the best population to new population (route);
5.2. generate random numbers (𝑅𝑐 ) in the range 0.00 to 1.00, be compared to
crossover probability (𝑃𝑐 );
5.3. if 𝑅𝑐 > 𝑃𝑐 proceed to stage 5.4; if 𝑅𝑐 ≤ 𝑃𝑐 do chromosome crossover; loop the
following steps as much as the number of chromosomes:
5.5.1. specify a random crossover point 𝐶𝑝 by generating random numbers in
range 1 to the value of the number of genes (node) in a chromosome;
5.5.2. find the distance between the crossover point node from the previous node
𝐶𝑑 = 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑔𝑒𝑛 𝐶𝑝 − 1 to 𝑔𝑒𝑛 𝐶𝑝
5.5.3. determine the chromosomes that be crossover by generating random
numbers in the range of 1 to the value of the number of chromosomes
except for the previously chosen chromosome;
5.5.4. Find the distance between the crossover point node to all nodes on the
chromosome selected for a crossover;
5.5.5. Crossover the 𝐶𝑝 genes with genes that have the closest distance;
5.4. generate random numbers (𝑅𝑚 ) in the range 0.00 to 1.00, compared to mutation
probability (𝑃𝑚 );
5.5. if 𝑅𝑚 > 𝑃𝑚 proceed to stage 5.6; if 𝑅𝑚 ≤ 𝑃𝑚 do chromosome mutation; loop the
following steps as much as the number of chromosomes:
5.5.1. specify a random mutation point 𝑀𝑝 by generating random numbers in
range 1 to the value of the number of genes (node) in a chromosome;
5.5.2. find the distance between the mutation point node from the previous node
𝑀𝑑 = 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑔𝑒𝑛 𝑀𝑝 − 1 to 𝑔𝑒𝑛 𝑀𝑝
5.5.3. Find the distance between the node 𝑀𝑝 − 1 to all other nodes on the same
chromosome;
5.5.4. Mutation the 𝑀𝑝 genes with genes that have the closest distance;
5.6. evaluate the fitness value of the result population;
5.6.1 If the fitness value is better than the initial population;
5.6.2.1 Replace population with population after the crossover and
mutation process
5.6.2 If the fitness value is not better than the initial population;
5.6.2.2 Do not replace the population / Keep using the initial population
6. end of the loop;
7. write out the surviving population (best route);
End.

7. Repetition Number of Iterations

At this stage, the selection process, evaluation of fitness, crossover, mutation, and
new population formation repeated under the number of iterations determined with the

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 9

aim of achieving optimal results. That way, the chromosomes that survive are the
chromosomes with the best fitness value, among other chromosomes. This process follows
the principle of natural selection, "who is strong (has a better fitness value), it survives.

8. Determining the Best Solution

By comparing the fitness values obtained for each iteration, the best solution is the
chromosome with the best fitness value that survives at the end of the iteration.

2.3 Case Study

A case study in shipping and logistics company serve shipping services throughout
Surabaya, East Java, Indonesia. One main depot and 42 branch offices (customer) are
scattered to help certain areas as a transit point for all packages before being sent to their
destination. Each vehicle has a carrying capacity. Therefore, in the route's preparation,
one must consider the load amount when loading and unloading. In this case, the branch
office has various loading and unloading service time windows. The vehicle must wait if it
arrives earlier than the branch office open time windows. If the vehicle comes more than
close time windows, it disrupts the branch office's package delivery schedule. Couriers at
the branch depart for the last mile delivery at specified times. Packages brought by
vehicles arriving at times exceeding close time windows cannot be carried by the courier
at that time and sent on the next shipment. Packages that are delivered late reduce
customer satisfaction and buildup in the branch office warehouse, which is harmful. The
case study data used are data on one day of delivery.
The company has four transport vehicles with a maximum capacity of 700
kilograms. Vehicles depart from the depot at eight in the morning to several branch offices.
Each transport vehicle is assumed to have an average fuel consumption of eleven
kilometers per liter of fuel. Data for each branch office related to the quantity of pick-up
and delivery and time windows can be seen in Table 1. The distance matrix data, which
then be converted into the travel time matrix, can be seen in Appendix A.
This study's experiments use the GA parameters as follows: crossover probability:
0.8, mutation probability: 0.8, chromosome: 4 (according to the number of vehicles), and
10,000 iterations. This experiment was performed using Matlab 14 running on an Intel
(R) Core (TM) i5-3210M CPU @ 2.50GHz 8Gb RAM. This parameter is also used as a
parameter for the comparison of the previous GA algorithm. This study also compares the
Total cost comparison Actual Route. The total mileage of the problem is multiplied by the
cost per kilometer. The cost per kilometer of this problem is IDR. 595.45.

3. Results and Discussion

3.1 Comparison Improve GA and Existing Route
The primary purpose of VRPPDTW is to minimize total penalty and distance. In
VRPPDTW, the valid route is when it has a minimum distance and if the capacity and
time windows constraints can be met. The VRPPDTW problem is very close to real system
conditions where time windows and capacity also affect a distribution route's success. The
improved genetic algorithm is proven to produce the best route with consideration of pick-
up and delivery and time windows. This paper compares the actual route and the route
that results from the improved genetic algorithm. The analysis has seen each route's
advantages and disadvantages, especially the results of the developed algorithm. The total
distance of each vehicle is obtained from the total distance between the nodes traversed.
Each vehicle's total journey is added to get the total distance traveled by all vehicles on

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
10 Vol. 22, No. 1, February 2021, pp. 1-17

that day. A penalty value of 1 is given every time there is excess capacity. The vehicle
arrives before the time windows, and the vehicle arrives after the windows.

Table 1. Quantity of pick-up, quantity of delivery and time windows data

Time Time
Quantity Quantity
Windows Windows
No. No.
Pick- Pick-
Open Close Delivery Open Close Delivery
up up
0 00:00 23:59 0 0 22 08:00 10:30 38.5 17.5
1 08:00 10:30 21 52.5 23 08:00 10:30 17.5 49
2 08:00 10:30 14 52.5 24 08:00 10:30 14 52.5
3 08:00 10:30 14 56 25 08:00 10:30 31.5 35
4 08:00 10:30 17.5 63 26 08:00 10:30 38.5 45.5
5 08:00 10:30 10.5 56 27 08:00 10:30 10.5 49
6 08:00 10:30 35 171.5 28 08:00 10:30 42 52.5
7 08:00 10:30 24.5 73.5 29 08:00 10:30 35 38.5
8 08:00 10:30 17.5 59.5 30 08:00 10:30 3.5 7
9 08:00 10:30 3.5 31.5 31 08:00 10:30 17.5 14
10 08:00 10:30 7 56 32 08:00 10:30 31.5 17.5
11 08:00 10:30 31.5 52.5 33 08:00 10:30 14 21
12 08:00 10:30 17.5 0 34 08:00 10:30 3.5 28
13 08:00 10:30 28 24.5 35 08:00 10:30 7 35
14 08:00 10:30 14 17.5 36 08:00 10:30 17.5 24.5
15 08:00 10:30 3.5 42 37 08:00 10:30 38.5 17.5
16 08:00 10:30 24.5 28 38 08:00 10:30 24.5 10.5
17 08:00 10:30 24.5 21 39 08:00 10:30 21 17.5
18 08:00 10:30 21 42 40 08:00 10:30 7 3.5
19 08:00 10:30 7 0 41 08:00 10:30 10.5 3.5
20 08:00 10:30 28 49 42 08:00 10:30 7 3.5
21 08:00 10:30 14 56

Table 2. Distance comparison of the existing route and improved GA

Existing Route Improved GA Route
Vehicle Driving time Distance Travelled Driving time Distance Travelled
(h:mm) (km) (h:mm) (km)
1 1:53 94.1 1:32 76.90
2 1:57 97.1 1:49 90.90
3 2:13 111.1 1:52 93.40
4 2:16 113.6 1:22 69.00
Total 8:19 415.9 6:35 330.20

Table 2 describes distance comparison of the existing route and improved GA. From
the total mileage value of all vehicles, it appears that the route from the improved GA
results in shorter mileage compared to the company's existing routes. These results
support the earlier research statement by Ibrahim, et al. [13] that genetic algorithms can

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 11

produce effective solutions to reduce total mileage in the case of VRP. On the proposed
route, it appears that all vehicles have less mileage than the existing route. The proposed
route resulted in a 20.6% cut in the distance. It can be concluded that the route resulting
from the improved genetic algorithm succeeded in minimizing total mileage.
This research also compares the total cost of existing routes and proposed routes
obtained with an improved genetic algorithm. Total cost comparison actual route and
improved GA (In IDR.) can be seen in Table 3. Results found that the costs of the improved
GA are more minimum, which is IDR. 196,619.09 compared to the company's existing
routes with a total cost of IDR. 247,649.55. Therefore, the route formed by an improved
GA is better than the company's existing route. The calculation of costs does not consider
costs incurred due to vehicles arriving before or after the destination's time windows. The
total cost is also not considered if there is excess capacity.

Table 3. Total cost comparison actual route and improved GA (In IDR.)
Vehicle Existing Route Improved Genetic Algorithm Route
1 56,032.27 45,790.45
2 57,818.64 54,126.82
3 66,155.00 55,615.45
4 67,643.64 41,086.36
Total 247,649.55 196,619.09

Table 4 shows the total penalty value comparison of the actual route and improved
GA. The VRPPDTW problem in this paper uses the type of soft time windows. Penalties
apply if the vehicle arrives outside the available time window (penalty time windows).
Likewise, the capacity penalty applies if vehicles carry more than their capacity. The more
penalties given on a route illustrate, the worse the route. We continue to analyze in-depth
the penalties that occur on the proposed and existing routes.

Table 4. Penalty value comparison of actual route and Improved GA

Item Existing Route Improved GA Route
Penalty capacity 2 0
Penalty time windows (opening) 0 0
Penalty time windows (closing) 4 0
Total Penalty 6 0

The penalty capacity is worth two from the computational results, which means
there are twice the vehicle's excess capacity events. Because the VRP problem in this paper
is considering pick-up and delivery, routes that are not optimal can cause a vehicle's
overcapacity. For example, a vehicle departs at full capacity and visits branch office A.
Goods delivered are significantly less than those picked up from branch office A. There
overcapacity in the vehicle. Therefore, the route formed must also consider the number of
pick-ups and deliveries, not just the delivery order with the minimum distance. There
have been four-time windows (closing) penalties, which means four vehicles are coming
after the time windows limit. In this company's case, the vehicle must arrive before the
time windows limit because the goods delivered immediately taken by the courier to be
delivered to the customer's home. Delay in the vehicle's arrival will cause the package to
be delivered late to the customer's home because they have to follow the next delivery
time. Not only that, but the buildup of packages at the branch office also cause various
new problems. On the route produced by an improved genetic algorithm, there are no

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
12 Vol. 22, No. 1, February 2021, pp. 1-17

penalties or violations committed. That way, it can be concluded that all vehicles always
arrived at the branch office time windows and all vehicles were never overcapacities.
3.2 Comparison improve GA with the standart GA
This article also analyzes the effect of the number of iterations on the value of
fitness. GA is closely related to the concept of natural selection. Thus, the best generation
survives while the weak be defeated and discarded. In this case, the intended generation
is a set of routes. The higher the fitness value, the better the route (minimizing mileage
and penalty). Logically the value of fitness increase with the increasing number of
iterations. Thus, the more the number of iterations, the better the resulting route.
Based on Fig. 2, the experiment results show that the initial fitness value is 0.11
when the number of iterations increases to 1 when the number of iterations is 7700. The
fitness value continues to grow when the iteration number is increased in proportion to
the reduction in the value of the penalty and traveled distance but stops at a certain
number of iterations. Even though the end of growing fitness value, even though the
number of iterations continues added, illustrates no better solution. As seen in the results,
the number of penalties during the iteration of 7700 has a value of 0. It means that no
restrictions are violated.

600 10
Distance Travelled

500 8
Total Penalty

400
6
300
4
200
100 2
00 0

Iteration Number Iteration Number

Improved GA GA Improved GA GA

(a) (b)
1.00
0.80
Fitness Value

0.60
0.40
0.20
0.00
100 200 300 600 700 800 1600 1700 1800 3600 3700 3800 7600 7700 7800 10000
Iteration Number

Improved GA GA

(c)

Fig. 2. (a) Affect iterations toward the distance, (b) Effect iterations toward Total
Penalty, and (c) Effect iterations toward Fitness value

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 13

The cessation and insignificant increasing fitness value are among the stopping
criteria in the Improved GA besides the specified number of iterations. Hence, if the
research set the number of iterations to 20,000 iterations, but there has been no significant
increase in fitness value when the number of iterations is 10,000, then the computation
can be stopped. This study compared the performance of the Improved GA developed with
the standard GA. From Fig. 2, it can be seen that the improved GA has succeeded in
getting the best solution with a smaller number of iterations which certainly affects the
computation time.

4. Conclusion
This study discussed the VRPPDTW model to optimize the route of a shipping and
logistics company's vehicle. An Improved GA was developed and applied to solve the
VRPPDTW problem. From the case study, it can be concluded that the improved GA that
developed can be applied in determining the route. The resulting route is better than the
existing company route, both in costs and customer service satisfaction. Improved GA
results compared with the company's existing routes and routes generated by standard
GA. The analysis is carried out in various aspects, including vehicle distance, total
penalty, and total transportation costs. The total distance traveled on the proposed route
is shorter than the existing route, affecting transportation's total cost. There are six
violations related to time windows and capacity on the actual route. In contrast, on the
proposed route, there are no violations at all. The best solution resulted in an improved
GA with a shorter computation time than standard GA. Therefore, it can be concluded
that the Improved GA developed successfully produces a better route in all aspects and
resolves the VRPPDTW problems faced with relatively short computing time.
In future work, the exploration of various crossover and mutation methods can be
done to provide recommendations for the most suitable crossover and mutation methods.

Acknowledgments
This research is supported and financed by the Ministry of Research, Technology,
and Higher Education of the Republic of Indonesia under the PDP scheme.

References
[1] V. N. Coelho, A. Grasas, H. Ramalhinho, I. M. Coelho, M. J. F. Souza, and R. C.
Cruz, "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP
with multi-trips and docking constraints," European Journal of Operational
Research, vol. 250, pp. 367-376, 2016/04/16/ 2016.
https://doi.org/10.1016/j.ejor.2015.09.047.
[2] D. M. Utama, D. S. Widodo, M. F. Ibrahim, and S. K. Dewi, "A New Hybrid
Butterfly Optimization Algorithm for Green Vehicle Routing Problem," Journal of
Advanced Transportation, vol. 2020, p. 8834502, 2020/12/22 2020.
https://doi.org/10.1155/2020/8834502.
[3] D. M. Utama, S. K. Dewi, A. Wahid, and I. Santoso, "The vehicle routing problem
for perishable goods: A systematic review," Cogent Engineering, vol. 7, p. 1816148,
2020/01/01 2020. https://doi.org/10.1080/23311916.2020.1816148.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
14 Vol. 22, No. 1, February 2021, pp. 1-17

[4] F. Arnold and K. Sörensen, "What makes a VRP solution good? The generation of
problem-specific knowledge for heuristics," Computers & Operations Research, vol.
106, pp. 280-288, 2019/06/01/ 2019. https://doi.org/10.1016/j.cor.2018.02.007.
[5] P. Sitek, J. Wikarek, K. Rutczyńska-Wdowiak, G. Bocewicz, and Z. Banaszak,
"Optimization of capacitated vehicle routing problem with alternative delivery,
pick-up and time windows: A modified hybrid approach," Neurocomputing, vol. 423,
pp. 670-678, 2021/01/29/ 2021. https://doi.org/10.1016/j.neucom.2020.02.126.
[6] S. K. Dewi and D. M. Utama, "A New Hybrid Whale Optimization Algorithm for
Green Vehicle Routing Problem," Systems Science & Control Engineering, vol. 9,
pp. 61-72, 2021/01/01 2021. https://doi.org/10.1080/21642583.2020.1863276.
[7] C. K. Y. Lin, "A cooperative strategy for a vehicle routing problem with pick-up and
delivery time windows," Computers & Industrial Engineering, vol. 55, pp. 766-782,
2008/11/01/ 2008. https://doi.org/10.1016/j.cie.2008.03.001.
[8] M. Mahmoudi and X. Zhou, "Finding optimal solutions for vehicle routing problem
with pick-up and delivery services with time windows: A dynamic programming
approach based on state–space–time network representations," Transportation
Research Part B: Methodological, vol. 89, pp. 19-42, 2016/07/01/ 2016.
https://doi.org/10.1016/j.trb.2016.03.009.
[9] M. F. Ibrahim, F. R. Nurhakiki, D. M. Utama, and A. A. Rizaki, "Optimised Genetic
Algorithm Crossover and Mutation Stage for Vehicle Routing Problem Pick-Up and
Delivery with Time Windows," IOP Conference Series: Materials Science and
Engineering, vol. 1071, p. 012025, 2021/02/01 2021. https://doi.org/10.1088/1757-
899x/1071/1/012025.
[10] R. Elshaer and H. Awad, "A taxonomic review of metaheuristic algorithms for
solving the vehicle routing problem and its variants," Computers & Industrial
Engineering, vol. 140, p. 106242, 2020/02/01/ 2020.
https://doi.org/10.1016/j.cie.2019.106242.
[11] J. Protopopova and S. Kulik, "Educational Intelligent System Using Genetic
Algorithm," Procedia Computer Science, vol. 169, pp. 168-172, 2020/01/01/ 2020.
https://doi.org/10.1016/j.procs.2020.02.130.
[12] S. Karakatič, "Optimizing nonlinear charging times of electric vehicle routing with
genetic algorithm," Expert Systems with Applications, vol. 164, p. 114039,
2021/02/01/ 2021. https://doi.org/10.1016/j.eswa.2020.114039.
[13] M. F. Ibrahim, I. Masudin, and T. Saputro, "A Hybrid Genetic Algorithm
Implementation For Vehicle Routing Problem With Time Windows," Jurnal Ilmiah
Teknik Industri, vol. 14, pp. 196-204, 01/01 2015.
https://doi.org/10.23917/jiti.v14i2.985.
[14] M. A. Mohammed, M. K. Abd Ghani, R. I. Hamed, S. A. Mostafa, M. S. Ahmad, and
D. A. Ibrahim, "Solving vehicle routing problem by using improved genetic
algorithm for optimal solution," Journal of Computational Science, vol. 21, pp. 255-
262, 2017/07/01/ 2017. https://doi.org/10.1016/j.jocs.2017.04.003.
[15] W. Ho, G. T. S. Ho, P. Ji, and H. C. W. Lau, "A hybrid genetic algorithm for the
multi-depot vehicle routing problem," Engineering Applications of Artificial
Intelligence, vol. 21, pp. 548-557, 2008/06/01/ 2008.
https://doi.org/10.1016/j.engappai.2007.06.001.
[16] P. R. de Oliveira da Costa, S. Mauceri, P. Carroll, and F. Pallonetto, "A Genetic
Algorithm for a Green Vehicle Routing Problem," Electronic Notes in Discrete
Mathematics, vol. 64, pp. 65-74, 2018/02/01/ 2018.
https://doi.org/10.1016/j.endm.2018.01.008.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 Jurnal Teknik Industri ISSN : 1978-1431 print | 2527-4112 online
Vol. 22, No. 1, February 2021, pp. 1-17 15

[17] H. Nazif and L. S. Lee, "Optimised crossover genetic algorithm for capacitated
vehicle routing problem," Applied Mathematical Modelling, vol. 36, pp. 2110-2117,
2012/05/01/ 2012. https://doi.org/10.1016/j.apm.2011.08.010.
[18] R. Saxena, M. Jain, K. Malhotra, and K. D. Vasa, "An Optimized OpenMP-Based
Genetic Algorithm Solution to Vehicle Routing Problem," in Smart Computing
Paradigms: New Progresses and Challenges, Singapore, 2020, pp. 237-245.
https://doi.org/10.1007/978-981-13-9680-9_20.
[19] T. Visutarrom and T. Chiang, "An Evolutionary Algorithm with Heuristic Longest
Cycle Crossover for Solving the Capacitated Vehicle Routing Problem," in 2019
IEEE Congress on Evolutionary Computation (CEC), 2019, pp. 673-680.
https://doi.org/10.1109/CEC.2019.8789946.
[20] S. Liu, W. Huang, and H. Ma, "An effective genetic algorithm for the fleet size and
mix vehicle routing problems," Transportation Research Part E: Logistics and
Transportation Review, vol. 45, pp. 434-445, 2009/05/01/ 2009.
https://doi.org/10.1016/j.tre.2008.10.003.
[21] L. Escobar-Falcón, D. Álvarez-Martínez, J. Wilmer-Escobar, and M. Granada-
Echeverri, "A specialized genetic algorithm for the fuel consumption heterogeneous
fleet vehicle routing problem with bidimensional packing constraints,"
International Journal of Industrial Engineering Computations, vol. 12, pp. 191-
204, 2021. https://doi.org/10.5267/j.ijiec.2020.11.003.
[22] Y. Marinakis and M. Marinaki, "A hybrid genetic – Particle Swarm Optimization
Algorithm for the vehicle routing problem," Expert Systems with Applications, vol.
37, pp. 1446-1455, 2010/03/01/ 2010. https://doi.org/10.1016/j.eswa.2009.06.085.
[23] C.-B. Cheng and K.-P. Wang, "Solving a vehicle routing problem with time windows
by a decomposition technique and a genetic algorithm," Expert Systems with
Applications, vol. 36, pp. 7758-7763, 2009/05/01/ 2009.
https://doi.org/10.1016/j.eswa.2008.09.001.
[24] K. Ghoseiri and S. F. Ghannadpour, "Multi-objective vehicle routing problem with
time windows using goal programming and genetic algorithm," Applied Soft
Computing, vol. 10, pp. 1096-1107, 2010/09/01/ 2010.
https://doi.org/10.1016/j.asoc.2010.04.001.
[25] T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, "A hybrid genetic algorithm
with adaptive diversity management for a large class of vehicle routing problems
with time-windows," Computers & Operations Research, vol. 40, pp. 475-489,
2013/01/01/ 2013. https://doi.org/10.1016/j.cor.2012.07.018.
[26] Z. Ursani, D. Essam, D. Cornforth, and R. Stocker, "Localized genetic algorithm for
vehicle routing problem with time windows," Applied Soft Computing, vol. 11, pp.
5375-5390, 2011/12/01/ 2011. https://doi.org/10.1016/j.asoc.2011.05.021.
[27] J. H. Holland, Adaptation in natural and artificial systems: an introductory
analysis with applications to biology, control, and artificial intelligence: University
of Michigan Press, 1975.
[28] P. Toth and D. Vigo, The vehicle routing problem: SIAM, 2002.
[29] D. Whitley, T. Starkweather, and C. Bogart, "Genetic algorithms and neural
networks: optimizing connections and connectivity," Parallel Computing, vol. 14,
pp. 347-361, 1990/08/01/ 1990. https://doi.org/10.1016/0167-8191(90)90086-O.
[30] J. L. Sponsler, "Genetic algorithms applied to the scheduling of the hubble space
telescope," Telematics and Informatics, vol. 6, pp. 181-190, 1989/01/01/ 1989.
https://doi.org/10.1016/S0736-5853(89)80015-2.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 ISSN : 1978-1431 print | 2527-4112 online Jurnal Teknik Industri
16 Vol. 22, No. 1, February 2021, pp. 1-17

[31] F. J. Marin, F. J. Gonzalez, and F. Sandoval, "The Routing Problem in Traffic

Control Using Genetic Algorithms," IFAC Proceedings Volumes, vol. 27, pp. 187-
191, 1994/06/01/ 1994. https://doi.org/10.1016/S1474-6670(17)46107-6.
[32] R. Liu and Z. Jiang, "A hybrid large-neighborhood search algorithm for the
cumulative capacitated vehicle routing problem with time-window constraints,"
Applied Soft Computing, vol. 80, pp. 18-30, 2019/07/01/ 2019.
https://doi.org/10.1016/j.asoc.2019.03.008.
[33] K. Sethanan and T. Jamrus, "Hybrid differential evolution algorithm and genetic
operator for multi-trip vehicle routing problem with backhauls and heterogeneous
fleet in the beverage logistics industry," Computers & Industrial Engineering, vol.
146, p. 106571, 2020/08/01/ 2020. https://doi.org/10.1016/j.cie.2020.106571.

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
and Delivery with Time Windows. Jurnal Teknik Industri, 22(1), 1-17.
doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
 17
ISSN : 1978-1431 print | 2527-4112 online

Appendix A

Please cite this article as: Ibrahim, et al. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up
1-17.
Depot 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
Depot 0 7.8 11 11 17 14 20 20 23 31 25 23 24 13 18 16 16 17 11 9.4 7.5 9.6 17 16 11 24 19 19 25 25 39 38 20 9.4 17 19 8.9 8.4 22 17 5.3 4.7 13

22(1),
1 7.8 0 6.4 3.6 11 10 13 11 15 21 18 15 16 9.2 16 12 12 13 7.3 4.5 7.9 7.3 14 14 11 20 16 15 18 17 25 26 26 16 23 20 8.2 15 23 22 3.6 11 13
2 11 6.4 0 9.3 11 13 13 11 15 22 21 16 20 14 16 15 17 17 13 9.8 14 13 19 19 17 17 22 18 23 21 30 31 31 16 27 24 14 19 29 28 6 15 8.5
3 11 3.6 9.3 0 11 9.8 13 12 15 19 27 15 16 9.7 14 12 13 13 7.7 5 8.3 7.8 14 13 12 20 15 15 19 27 41 39 32 16 23 20 8.6 16 24 23 6 11 17
4 17 11 11 11 0 10 9.6 5.4 9.5 17 18 9.5 16 11 12 12 14 14 14 14 18 17 17 20 21 23 23 16 20 19 36 34 41 25 33 29 18 25 33 32 13 21 20
5 14 10 13 9.8 10 0 5.4 7.2 11 10 9.8 11 7.6 2.2 4.5 2.5 5.7 5.2 6.5 9 12 7.6 8.6 11 12 15 14 7.2 11 13 27 25 35 19 27 24 12 19 27 26 11 15 21

Industri,
6 20 13 13 13 9.6 5.4 0 5.4 5 9 9.6 5 8.2 6.8 3.5 4 8.6 6.5 11 14 16 12 13 15 17 18 19 12 16 14 28 26 40 24 31 28 17 24 32 31 14 19 22
7 20 11 11 12 5.4 7.2 5.4 0 4.8 13 13 4.8 13 8.2 7.1 7.6 11 11 13 14 17 17 15 17 18 21 20 13 18 17 32 31 41 25 32 29 18 25 33 32 12 20 20
8 23 15 15 15 9.5 11 5 4.8 0 13 14 0.7 13 12 7.5 9.3 14 11 16 18 21 18 18 22 23 23 24 17 21 18 32 30 45 29 36 33 22 29 37 36 17 25 24
9 31 21 22 19 17 10 9 13 13 0 7.8 12 7.2 11 6.2 8.3 11 8.3 15 18 25 17 19 23 24 20 24 15 19 16 30 28 47 28 43 36 25 31 40 44 31 23 41
10 25 18 21 27 18 9.8 9.6 13 14 7.8 0 12 3.2 9.8 5.7 8 7.5 6.2 13 17 20 15 14 19 20 16 20 11 15 12 26 24 43 31 39 31 21 27 36 40 26 26 37
11 23 15 16 15 9.5 11 5 4.8 0.7 12 12 0 13 12 7.2 9 14 11 16 18 21 17 18 20 22 22 24 17 21 18 32 31 45 25 42 34 22 28 43 36 16 24 24

Teknik
12 24 16 20 16 16 7.6 8.2 13 13 7.2 3.2 13 0 8.2 4.1 6.4 4.8 4.5 17 15 20 17 14 18 20 16 19 10 14 11 23 21 42 31 38 31 20 27 35 39 26 26 36
13 13 9.2 14 9.7 11 2.2 6.8 8.2 12 11 9.8 12 8.2 0 6.4 4 3.6 4.4 5.1 7.9 8.2 6.1 6.7 9.1 11 13 12 5.6 9.8 8.8 17 24 37 19 33 25 14 21 25 34 13 14 21
14 18 16 16 14 12 4.5 3.5 7.1 7.5 6.2 5.7 7.2 4.1 6.4 0 3 7 4.6 10 13 15 12 13 15 17 15 23 13 14 12 25 24 46 24 42 34 23 23 38 43 17 19 25
15 16 12 15 12 12 2.5 4 7.6 9.3 8.3 8 9 6.4 4 3 0 5.5 3.6 8 11 12 9.4 10 12 14 15 16 9.3 14 12 26 24 40 21 36 29 14 21 29 37 12 16 23
16 16 12 17 13 14 5.7 8.6 11 14 11 7.5 14 4.8 3.6 7 5.5 0 2.3 8 11 16 9 7.7 12 14 9.8 12 4 8.3 7.3 23 21 39 27 35 27 16 23 32 36 22 16 33
17 17 13 17 13 14 5.2 6.5 11 11 8.3 6.2 11 4.5 4.4 4.6 3.6 2.3 0 8.6 11 17 9.5 11 13 15 13 17 7.6 11 8.5 23 21 40 22 36 28 18 24 33 37 23 17 34

Jurnal
18 11 7.3 13 7.7 14 6.5 11 13 16 15 13 16 17 5.1 10 8 8 8.6 0 6.9 4.9 3.5 9.4 6.8 8.3 16 9.6 8.5 12 17 31 30 32 17 35 21 10 17 23 22 16 12 26
19 9.4 4.5 9.8 5 14 9 14 14 18 18 17 18 15 7.9 13 11 11 11 6.9 0 7.7 7.2 18 12 11 25 15 19 18 26 40 38 31 15 23 20 8.1 15 23 22 10 11 18
20 7.5 7.9 14 8.3 18 12 16 17 21 25 20 21 20 8.2 15 12 16 17 4.9 7.7 0 2.2 12 9 5.6 18 12 9.7 21 19 34 32 29 15 21 18 6.8 13 19 18 10 8.8 21
21 9.6 7.3 13 7.8 17 7.6 12 17 18 17 15 17 17 6.1 12 9.4 9 9.5 3.5 7.2 2.2 0 8.8 6.2 7.7 15 9 7.9 19 17 31 29 32 16 28 20 8 15 23 24 10 11 18
22 17 14 19 14 17 8.6 13 15 18 19 14 18 14 6.7 13 10 7.7 11 9.4 18 12 8.8 0 4.5 9.9 7.3 5.8 6.3 8.1 10 17 17 33 21 29 22 11 17 32 30 17 17 27
Vol. 22, No. 1, February 2021, pp. 1-17

Windows.
23 16 14 19 13 20 11 15 17 22 23 19 20 18 9.1 15 12 12 13 6.8 12 9 6.2 4.5 0 8 9.7 3.9 8.2 10 18 18 18 34 22 30 22 12 17 22 21 17 17 28

doi:https://doi.org/10.22219/JTIUMM.Vol22.No1.1-17
24 11 11 17 12 21 12 17 18 23 24 20 22 20 11 17 14 14 15 8.3 11 5.6 7.7 9.9 8 0 17 11 12 22 19 33 31 29 16 25 17 8 10 16 15 11 11 22
25 24 20 17 20 23 15 18 21 23 20 16 22 16 13 15 15 9.8 13 16 25 18 15 7.3 9.7 17 0 6.3 6.5 2.2 5.7 10 10 40 34 36 28 18 25 24 29 23 29 40
26 19 16 22 15 23 14 19 20 24 24 20 24 19 12 23 16 12 17 9.6 15 12 9 5.8 3.9 11 6.3 0 8.1 7.4 12 15 15 36 24 32 24 13 18 21 26 19 19 29
27 19 15 18 15 16 7.2 12 13 17 15 11 17 10 5.6 13 9.3 4 7.6 8.5 19 9.7 7.9 6.3 8.2 12 6.5 8.1 0 5 4.9 13 20 35 23 31 23 12 19 34 32 18 18 29
28 25 18 23 19 20 11 16 18 21 19 15 21 14 9.8 14 14 8.3 11 12 18 21 19 8.1 10 22 2.2 7.4 5 0 4.2 9.7 10 42 30 38 30 20 26 26 39 25 26 36
29 25 17 21 27 19 13 14 17 18 16 12 18 11 8.8 12 12 7.3 8.5 17 26 19 17 10 18 19 5.7 12 4.9 4.2 0 17 15 42 30 38 30 20 26 41 39 25 25 36

Time
30 39 25 30 41 36 27 28 32 32 30 26 32 23 17 25 26 23 23 31 40 34 31 17 18 33 10 15 13 9.7 17 0 2.2 49 48 45 38 27 38 25 30 44 44 54
Jurnal Teknik Industri

31 38 26 31 39 34 25 26 31 30 28 24 31 21 24 24 24 21 21 30 38 32 29 17 18 31 10 15 20 10 15 2.2 0 58 49 54 47 36 38 25 31 44 44 55
32 20 26 31 32 41 35 40 41 45 47 43 45 42 37 46 40 39 40 32 31 29 32 33 34 29 40 36 35 42 42 49 58 0 16 5.8 12 30 20 27 21 36 18 23
33 9.4 16 16 16 25 19 24 25 29 28 31 25 31 19 24 21 27 22 17 15 15 16 21 22 16 34 24 23 30 30 48 49 16 0 10 10 13 8.9 21 16 9.9 5.7 7.7

with
34 17 23 27 23 33 27 31 32 36 43 39 42 38 33 42 36 35 36 35 23 21 28 29 30 25 36 32 31 38 38 45 54 5.8 10 0 8.3 23 16 23 17 22 13 19
35 19 20 24 20 29 24 28 29 33 36 31 34 31 25 34 29 27 28 21 20 18 20 22 22 17 28 24 23 30 30 38 47 12 10 8.3 0 16 9 15 8.9 22 11 19
36 8.9 8.2 14 8.6 18 12 17 18 22 25 21 22 20 14 23 14 16 18 10 8.1 6.8 8 11 12 8 18 13 12 20 20 27 36 30 13 23 16 0 6.5 15 14 9.5 9.5 20
37 8.4 15 19 16 25 19 24 25 29 31 27 28 27 21 23 21 23 24 17 15 13 15 17 17 10 25 18 19 26 26 38 38 20 8.9 16 9 6.5 0 12 8.5 15 5.6 13
38 22 23 29 24 33 27 32 33 37 40 36 43 35 25 38 29 32 33 23 23 19 23 32 22 16 24 21 34 26 41 25 25 27 21 23 15 15 12 0 6.5 23 17 25

Delivery
39 17 22 28 23 32 26 31 32 36 44 40 36 39 34 43 37 36 37 22 22 18 24 30 21 15 29 26 32 39 39 30 31 21 16 17 8.9 14 8.5 6.5 0 24 14 22
40 5.3 3.6 6 6 13 11 14 12 17 31 26 16 26 13 17 12 22 23 16 10 10 10 17 17 11 23 19 18 25 25 44 44 36 9.9 22 22 9.5 15 23 24 0 9.5 13
41 4.7 11 15 11 21 15 19 20 25 23 26 24 26 14 19 16 16 17 12 11 8.8 11 17 17 11 29 19 18 26 25 44 44 18 5.7 13 11 9.5 5.6 17 14 9.5 0 8.1
42 13 13 8.5 17 20 21 22 20 24 41 37 24 36 21 25 23 33 34 26 18 21 18 27 28 22 40 29 29 36 36 54 55 23 7.7 19 19 20 13 25 22 13 8.1 0

and