# The Optimization of Transportation Costs in Logistics Enterprises with Time-Window Constraints

Authors: Qingyou Yan; Qian Zhang
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

This paper presents a model for solving a multiobjective vehicle routing problem with soft time-window constraints that specify the earliest and latest arrival times of customers. If a customer is serviced before the earliest specified arrival time, extra inventory costs are incurred. If the customer is serviced after the latest arrival time, penalty costs must be paid. Both the total transportation cost and the required fleet size are minimized in this model, which also accounts for the given capacity limitations of each vehicle. The total transportation cost consists of direct transportation costs, extra inventory costs, and penalty costs. This multiobjective optimization is solved by using a modified genetic algorithm approach. The output of the algorithm is a set of optimal solutions that represent the trade-off between total transportation cost and the fleet size required to service customers. The influential impact of these two factors is analyzed through the use of a case study.


---

## Body

## 1. Introduction

In a competitive environment, obtaining the maximum profit plays a key role in the success of an enterprise. Logistics costs make up a large portion of the total costs of enterprises but can be reduced through supply chain optimization. Analysis of the logistics costs of enterprises reveals that transportation costs are an important part of the costs of logistics enterprises. Therefore, it is very important to study how transportation costs can be optimized in logistics enterprises.The transportation costs of logistics enterprises are influenced by the fixed costs and variable costs involved in the transportation process. However, transportation costs are more closely related to time-window constraints, which are governed by customers’ arrival times. Logistics enterprises must pay penalties when time-window constraints are violated, and this causes increases in transportation costs.Many past studies have been dedicated to determining how to achieve the lowest possible transportation cost. For example, McCann [1] addressed two interrelated questions: the optimum size of a vehicle or vessel and the structure of transportation costs with respect to haulage distance. C. Pilot and S. Pilot [2] focused on minimizing the total costs involved in a transportation problem. Jha et al. [3] considered a joint-location inventory problem and minimized the transportation cost involved in a joint inventory location model by using a modified adaptive different evolution algorithm. Chanas and Kuchta [4] proposed what they see as an optimal solution to the transportation problem, which makes use of fuzzy cost coefficients and an algorithm determining the nature of the solution.As exploration of transportation problems has developed, multiobjective transportation cost problems have emerged. For instance, Prakash et al. [5] drew attention to a cost-time trade-off bulk transportation problem, which they solve by using Pareto optimal solutions. Ojha et al. [6] formulated a multiobjective transportation solution, with fuzzy relations under fuzzy logic. The objectives of their model are the minimization of the total transportation cost and total time for transportation required for the system.The conditions that force each vehicle to start with each customer at a period specified by that customer are called time-window constraints. Existing literature on transportation problems with time-window constraints has mainly concentrated on vehicle routing problems. Vehicle routing problems, with different variations and generalizations, have been studied for several decades, since the pioneering work of Dantzig and Ramser [7] on a truck dispatching problem.Alvarenga et al. [8] proposed a robust heuristic approach to vehicle routing problems with time windows (VRPTW), using travel distance as the main objective through an efficient genetic algorithm and a set partitioning formulation.Ghoseiri and Ghannadpour [9] presented a new model and solution for multiobjective VRPTW using goal programming and genetic algorithm, in which decision makers specify optimistic aspiration levels to objectives and deviations from those aspirations are minimized. They used a direct interpretation of VRPTW as a multiobjective problem, in which both total required fleet size and total traveling distance were minimized, while capacity and time-window constraints were secured.Al-Khayyal and Hwang [10] formulated a model for finding the minimum-cost route in a network for a heterogeneous fleet of ships engaged in the pickup and delivery of several liquid bulk products. They showed that the model can be reformulated as an equivalent mixed-integer linear program with a special structure.Yu et al. [11] proposed a hybrid approach, which consists of ant colony optimization (ACO) and Tabu search, to solve VRPTW.Chiang and Hsu [12] proposed their own approach to solve a multiobjective vehicle routing problem with time windows. The objectives were to simultaneously minimize the number of vehicles and the total distance. Their approach was based on an evolutionary algorithm and it aims to find a set of Pareto optimal solutions.Because of the many applications of different vehicle routing problems, a wide variety of researchers have focused on developing solutions to them. Useful techniques for solving general vehicle routing problems can be found in [13–15].Our analysis of the works described above has shown that existing literature based on accurate algorithms and heuristic algorithms aims to achieve the lowest transportation cost possible. To our knowledge, no study has considered the time-window constraints in the transportation cost model. Time-window constraints increase transportation costs in logistics enterprises, and so it is necessary for logistics enterprises to take the time-window constraints into consideration when making decisions.This paper presents a biobjective transportation cost model with time-window constraints, which is modeled through modified genetic algorithm. In our study, the simultaneous minimization of fleet size and total transportation cost are considered objective functions.The model is formulated under the following assumptions:(1)
Time-window constraints are soft, and the time windows specified by customers are elastic.
(2)
The service time for a vehicle at its destination is equal to zero.
(3)
A route is defined as starting from a depot, going through a number of customers, and ending at the depot. Every customer on the route must be visited only once by one of the vehicles.


## 2. Model Formulation

This paper assumes that a logistics enterprise is the single supplier in a transportation process. The logistics enterprise distributes goods to customers according to the number of orders. The customer number for a route is uncertain, and the vehicle route must be determined in order to optimize transportation cost.The system of logistics enterprise transportation can be regarded as a simple network. In this network, the start node and end node are both the central depot of the logistics enterprise. Each arc of the network represents the transportation relationship between customers. The number of the arc represents the travel time between the two customers. Let us assume there areN
+
1 customers, C
=
0,1
,
2
,
…
,
N, and for simplicity denote the depot as customer 0. Figure 1 presents a network representation of the transportation process.Figure 1
A network representation of the transportation process.The transportation cost model in this paper takes time-window constraints into consideration. Any customeri must be serviced within a predefined time interval ES
i
,
LF
i, limited by an earliest arrival time ES
i, and a latest arrival time LF
i. Vehicles arriving later than the latest arrival time are penalized, while those arriving earlier than the earliest arrival time have to pay for the inventory cost involved.In order to formulate the model, the notations in it are defined as follows:K: the maximum possible size of the fleet,
C
k: the transportation cost per unit mass or volume of vehicle k,
C
=
0,1
,
2
,
…
,
N: the customer set,
i
,
j: the transportation process from customer i to customer j,
t
i
j: the travel time between customer i and customer j,
m
i: the demand of customer i,
Q
k: the limited capacity of vehicle k,
x
i
j
k: 
1
,
vehicle
k
drives
from
customer
i
to
customer
j

0
,
otherwise
,
r
k: the maximum route time allowed for vehicle k,
ES
i
,
LF
i: the predefined time interval that customer i must be serviced within, with ES
i being the earliest arrival time of customer i, and LF
i being the latest arrival time of customer i,
d
1: the inventory cost that the logistics enterprise has to pay if a vehicle arrives one day earlier than the earliest arrival time,
d
2: the penalty cost that the logistics enterprise has to pay if a vehicle arrives one day later than the latest arrival time,
e
i
k: the arrival time in advance for vehicle k at node i,
f
i
k: the delayed arrival time for vehicle k at node i,
T
i
k: the real arrival time for vehicle k at node i.There are two objectives in the transportation cost model. One is to minimize the transportation cost, and the other is to minimize the fleet size used to serve the customers. The model has four constraints. This paper observes vehicle capacity constraints and time-window constraints. In it, each customer is served exactly once and each vehicle starts its journey from a depot and ends at the depot.The transportation cost model in this paper can be written as(1)
Min
⁡
∑
i
=
1
N
m
i
∑
j
=
0
,
i
≠
j
N
∑
k
=
1
K
x
i
j
k
×
C
k
+
∑
i
=
1
N
∑
k
=
1
K
e
i
k
×
d
1
+
∑
i
=
1
N
∑
k
=
1
K
f
i
k
×
d
2
,
Min
⁡
∑
k
=
1
K
∑
j
=
1
N
x
0
j
k
,subject to(2)
∑
j
=
1
,
j
≠
i
N
x
i
j
k
=
∑
j
=
1
,
j
≠
i
N
x
j
i
k
≤
1
for
i
=
0,1
,
…
,
N
,
k
=
1,2
,
…
,
K
,
(3)
∑
k
=
1
K
∑
j
=
0
,
j
≠
i
N
x
i
j
k
=
1
for
i
=
1,2
,
…
,
N
,
(4)
∑
k
=
1
K
∑
i
=
0
,
i
≠
j
N
x
i
j
k
=
1
for
j
=
1,2
,
…
,
N
,
(5)
∑
i
=
1
N
m
i
∑
j
=
0
,
j
≠
i
N
x
i
j
k
≤
Q
k
for
k
=
1,2
,
…
,
K
,
(6)
∑
i
=
0
N
∑
j
=
0
,
j
≠
i
N
x
i
j
k
t
i
j
≤
r
k
for
k
=
1,2
,
…
,
k
,
(7)
ES
0
=
LF
0
=
0
,
(8)
∑
k
=
1
K
∑
i
=
0
,
i
≠
j
N
x
i
j
k
T
i
k
+
t
i
j
=
T
j
k
for
j
=
i
,
…
,
N
,
(9)
ES
i
≤
∑
k
=
1
K
T
i
k
+
e
i
-
f
i
≤
LF
i
,
(10)
e
i
×
f
i
=
0
.Constraint (2) specifies that every route starts and ends at the central depot. Constraints (3) and (4) define that every customer node is visited only once by one vehicle. Constraint (5) is the capacity constraint. Constraint (6) is the maximum travel time constraint. Constraints (7)–(10) define the time windows.


## 3. Modified Genetic Algorithm

As mentioned before, Ghoseiri and Ghannadpour [9] studied a vehicle routing problem with time windows and presented a genetic algorithm (GA) to solve it. In this section, we modify the presented GA to be used in the multiobjective optimization model above, by further considering the total transportation cost and time-window constraints. The specific content is described below.A GA starts with a set of chromosomes referred to as the initial population. Each chromosome represents a solution to the problem, and the initial population is randomly generated. A selection mechanism is then used to select prospective parents based on their fitness, computed by the evaluation function. The selected parent chromosomes are then recombined via the crossover operator to create a potential new population. The next step is to mutate a small number of newly obtained chromosomes, in order to introduce a level of randomness that prevents the GA from converging to a local optimum.


### 3.1. Chromosome Representation and the Initial Population

To solve a transportation cost model, each individual is usually represented by just one chromosome, which is a chain of integers (as discussed by Ghoseiri and Ghannadpour [9]). In this representation, each vehicle identifier is represented by 0 and is also a separator between two different routes. There are K
-
1 vehicle identifiers in the chromosome, which can divide the chromosome into K routes. The customer identifiers are represented by i
i
=
1,2
,
…
,
N, and a string of customer identifiers represents the sequence of deliveries that a vehicle must cover during its route. Figure 2 shows a representation of a possible solution with 10 customers and 6 vehicles. The route of vehicle 1 is 3
→
1, the second route is 2
→
4
→
6
→
8, and the third is 5
→
7
→
10
→
9. There are no travel tasks for vehicles 4, 5, and 6.Figure 2
Representation of the individual integer code.An initial population is built such that each individual must at least be a feasible candidate solution (i.e., every route in the initial population must be feasible). In this paper, an individual is feasible when the limited capacity of the vehicle and the maximum route time allowed are satisfied. Based on this, the population initialization algorithm can be written as follows.Step 1.
Determine the set of all unscheduled customersα
=
1,2
,
…
,
N and the maximal size of fleets K. Denote Z
k and R
k as the rest capacity and travel time of vehicle k (k
=
1,2
,
…
,
K), respectively. Let β
k be the set consisting of all customers served by vehicle k. Initialize Z
k
=
Q
k, R
k
=
r
k, and β
k
=
⌀ for all k
=
1,2
,
…
,
K.Step 2.
Randomly select an unscheduled customeri who has higher demand than others (i.e., i
∈
r
∣
m
r
=
max
⁡
r
∈
α
⁡
m
r). Let c
k (k
=
1,2
,
…
,
K) be the last customer in the set β
k (if β
k
=
⌀, then c
k represents the central depot). Then, determine the set χ, which consists of all vehicles whose rest capacities and rest route times are sufficient to serve customer i (i.e., χ
=
k
|
m
i
≤
Z
k
,
t
i
k
i
≤
R
k
,
k
=
1,2
,
…
,
K). Finally, randomly choose a vehicle k
- from the set χ to serve customer i and update β
k
¯
=
{
β
k
¯
,
i
}, α
=
α
∖
i, Z
k
-
=
Z
k
-
-
m
i, and R
k
-
=
R
k
-
-
t
c
k
¯
i.Step 3.
Ifα
=
⌀, go to the next step; otherwise, go to Step 2.Step 4.
Rearrange the sequence of customers in setβ
k and randomly generate a feasible travel route for vehicle k, denoted by FR
k, for all k
=
1,2
,
…
,
K. Finally, a complete individual can be represented as {
FR
1
,
0
,
FR
2
,
0
,
…
,
FR
K
}.Using the above presentation method, the individual shown in Figure2 is coded as {
{
3,1
}
,
0
,
{
2,4
,
6,8
}
,
0
,
{
5,7
,
10,9
}
,
0,0
,
0
}.


### 3.2. Selection

A feasible solution (i.e., individual solution) for the models is said to dominate another solution if it is not worse with regard to any of the objectives and clearly better with regard to at least one. In the current problem, a feasible solution (C, N) is said to dominate another solution (C
′, N
′) if both C and N are smaller than or equal to C
′ and N
′, where C and C
′ denote the total transportation costs and N and N
′ denote the total number of vehicles. The feasible solution (C, N) is said to be a nondominated solution (or a Pareto solution), if there is no other solution that can dominate it. Based on this nondomination criterion, this paper evaluates and selects the individuals through the following procedure.Step 1.
Calculate the objective function values for all individuals, where the total transportation costs are determined by (11), and total numbers of vehicles are determined directly by decoding the chromosome.Step 2.
Assign a rank value to each individual, depending on its position within the population. The smaller the number of solutions that dominate an individual, the smaller the rank of the individual. If we suppose that, for a given generationt, an individual k is dominated by the number of d
k of individuals in the considered population, its rank will be determined as follows:(11)
rank
k
,
t
=
1
+
d
t
.
It is easy to determine that all nondominated solutions will have a rank equal to 1. Note also that, for a given individual, this metric may vary across generations because of the population distribution changes.Step 3.
Compute the fitness value of an individualk in a population at a generation t by calculating the following (as discussed by Elloumi and Fortemps [16]): (12)
f
k
,
t
=
1
rank
(
k
,
t
)
.Step 4.
Randomly select POP/2 pairs of individuals, by roulette selection, to undergo forthcoming evolutionary operations, where POP denotes the number of individuals within a population. The selection probability of individualk in generation t is given by the following:(13)
p
k
,
t
=
f
k
,
t
∑
l
=
1
POP
f
l
,
t
.


### 3.3. Crossover

This paper employs a problem-specific best cost-route crossover (as discussed by Ombuki et al. [13]), with the probability of crossover p
cross. This aims to simultaneously minimize the fleet size and the total transportation cost, while also assessing the feasibility of constraints. For any pair of individuals randomly selected through the selection operation above, one is called the “father” and is denoted by I
F
=
β
1
F
,
0
,
β
2
F
,
0
,
…
,
β
K
F. Another is termed the “mother” and is denoted by I
M
=
β
1
M
,
0
,
β
2
M
,
0
,
…
,
β
K
M.First, a random route from the father is selected. Second, all of the genes in the selected route are removed from the mother, and the remaining chromosome is directly passed on to the son,I
S. Third, each of the removed genes is reinserted into the son’s line, based on the minimum cost principle, and the whole offspring I
S is then obtained by the end of this step. We proceed similarly for the daughter, I
D, but replace the father with the mother and vice versa.The pseudocode for generating the sonI
S can be described as shown in Procedure 1.Procedure 1
BEGIN:
(1) Randomly generate a numberq
cross, such that 1
≤
q
cross
≤
K and β
cross
F
≠
⌀;
(2) LetI
D
=
I
M
∖
β
cross
F;
(3) Randomly select a geneg
F in β
cross
F;
(4)FOR  i
=
1 TO length(I
D);
(5)   Generate the partial scheduleP
i
=
I
1
→
i
-
1
D
,
g
F
,
I
i
→
end
D;
(6)   Compute the total transportation cost C
i of P
i. If P
i is infeasible, let C
i = a sufficiently large number;
(7)   Let i
∗
=
min
i
⁡
r
∣
C
r and reinsert gene g
F in the position i
∗ of I
D;
(8)   Update I
D
=
I
1
→
i
∗
-
1
D
,
g
F
,
I
i
∗
→
end
D and β
cross
F
=
β
cross
F
∖
g
F; ENDFOR
(9)   If β
cross
F
≠
⌀, return to Step (3); otherwise, terminate the procedure.
ENDIn Procedure1, length (I
D) is the number of genes of I
D. I
i
→
j
D is the chromosome of I
D between position i and position j.


### 3.4. Mutation

The mutation operator is applied to newly generated individuals with a probability of mutationp
mut. First, we randomly choose two positions, q
mut
1 and q
mut
2, such that 1
≤
q
mut
1
<
q
mut
2
≤
N
+
K
-
1, q
mut
1
≠
0, and q
mut
2
≠
0 (recall that N and K are the numbers of customers and vehicles, resp.). Then, we check whether customers in positions q
mut
1 and q
mut
2 can be permuted. In other words, if the change does not result in infeasibility, we can permute the customers. Otherwise, we choose another position, q
mut
2
′. We repeat the procedure until two customers are permuted or until a certain number of unsuccessful attempts are made.Finally, the main process of proposed GA can be described as shown in Procedure2.Procedure 2
BEGIN
Input: all necessary data related to customers and vehicles
GA parameters:POP
,
p
cross
,
p
mut
Generate a new population of individuals
While maximal iteration number is not met DO
Evaluate the individuals
Select the better individuals
Generate the offspring population using evolutionary operators
Output: a set of non-dominated solutions
END


## 3.1. Chromosome Representation and the Initial Population

To solve a transportation cost model, each individual is usually represented by just one chromosome, which is a chain of integers (as discussed by Ghoseiri and Ghannadpour [9]). In this representation, each vehicle identifier is represented by 0 and is also a separator between two different routes. There are K
-
1 vehicle identifiers in the chromosome, which can divide the chromosome into K routes. The customer identifiers are represented by i
i
=
1,2
,
…
,
N, and a string of customer identifiers represents the sequence of deliveries that a vehicle must cover during its route. Figure 2 shows a representation of a possible solution with 10 customers and 6 vehicles. The route of vehicle 1 is 3
→
1, the second route is 2
→
4
→
6
→
8, and the third is 5
→
7
→
10
→
9. There are no travel tasks for vehicles 4, 5, and 6.Figure 2
Representation of the individual integer code.An initial population is built such that each individual must at least be a feasible candidate solution (i.e., every route in the initial population must be feasible). In this paper, an individual is feasible when the limited capacity of the vehicle and the maximum route time allowed are satisfied. Based on this, the population initialization algorithm can be written as follows.Step 1.
Determine the set of all unscheduled customersα
=
1,2
,
…
,
N and the maximal size of fleets K. Denote Z
k and R
k as the rest capacity and travel time of vehicle k (k
=
1,2
,
…
,
K), respectively. Let β
k be the set consisting of all customers served by vehicle k. Initialize Z
k
=
Q
k, R
k
=
r
k, and β
k
=
⌀ for all k
=
1,2
,
…
,
K.Step 2.
Randomly select an unscheduled customeri who has higher demand than others (i.e., i
∈
r
∣
m
r
=
max
⁡
r
∈
α
⁡
m
r). Let c
k (k
=
1,2
,
…
,
K) be the last customer in the set β
k (if β
k
=
⌀, then c
k represents the central depot). Then, determine the set χ, which consists of all vehicles whose rest capacities and rest route times are sufficient to serve customer i (i.e., χ
=
k
|
m
i
≤
Z
k
,
t
i
k
i
≤
R
k
,
k
=
1,2
,
…
,
K). Finally, randomly choose a vehicle k
- from the set χ to serve customer i and update β
k
¯
=
{
β
k
¯
,
i
}, α
=
α
∖
i, Z
k
-
=
Z
k
-
-
m
i, and R
k
-
=
R
k
-
-
t
c
k
¯
i.Step 3.
Ifα
=
⌀, go to the next step; otherwise, go to Step 2.Step 4.
Rearrange the sequence of customers in setβ
k and randomly generate a feasible travel route for vehicle k, denoted by FR
k, for all k
=
1,2
,
…
,
K. Finally, a complete individual can be represented as {
FR
1
,
0
,
FR
2
,
0
,
…
,
FR
K
}.Using the above presentation method, the individual shown in Figure2 is coded as {
{
3,1
}
,
0
,
{
2,4
,
6,8
}
,
0
,
{
5,7
,
10,9
}
,
0,0
,
0
}.


## 3.2. Selection

A feasible solution (i.e., individual solution) for the models is said to dominate another solution if it is not worse with regard to any of the objectives and clearly better with regard to at least one. In the current problem, a feasible solution (C, N) is said to dominate another solution (C
′, N
′) if both C and N are smaller than or equal to C
′ and N
′, where C and C
′ denote the total transportation costs and N and N
′ denote the total number of vehicles. The feasible solution (C, N) is said to be a nondominated solution (or a Pareto solution), if there is no other solution that can dominate it. Based on this nondomination criterion, this paper evaluates and selects the individuals through the following procedure.Step 1.
Calculate the objective function values for all individuals, where the total transportation costs are determined by (11), and total numbers of vehicles are determined directly by decoding the chromosome.Step 2.
Assign a rank value to each individual, depending on its position within the population. The smaller the number of solutions that dominate an individual, the smaller the rank of the individual. If we suppose that, for a given generationt, an individual k is dominated by the number of d
k of individuals in the considered population, its rank will be determined as follows:(11)
rank
k
,
t
=
1
+
d
t
.
It is easy to determine that all nondominated solutions will have a rank equal to 1. Note also that, for a given individual, this metric may vary across generations because of the population distribution changes.Step 3.
Compute the fitness value of an individualk in a population at a generation t by calculating the following (as discussed by Elloumi and Fortemps [16]): (12)
f
k
,
t
=
1
rank
(
k
,
t
)
.Step 4.
Randomly select POP/2 pairs of individuals, by roulette selection, to undergo forthcoming evolutionary operations, where POP denotes the number of individuals within a population. The selection probability of individualk in generation t is given by the following:(13)
p
k
,
t
=
f
k
,
t
∑
l
=
1
POP
f
l
,
t
.


## 3.3. Crossover

This paper employs a problem-specific best cost-route crossover (as discussed by Ombuki et al. [13]), with the probability of crossover p
cross. This aims to simultaneously minimize the fleet size and the total transportation cost, while also assessing the feasibility of constraints. For any pair of individuals randomly selected through the selection operation above, one is called the “father” and is denoted by I
F
=
β
1
F
,
0
,
β
2
F
,
0
,
…
,
β
K
F. Another is termed the “mother” and is denoted by I
M
=
β
1
M
,
0
,
β
2
M
,
0
,
…
,
β
K
M.First, a random route from the father is selected. Second, all of the genes in the selected route are removed from the mother, and the remaining chromosome is directly passed on to the son,I
S. Third, each of the removed genes is reinserted into the son’s line, based on the minimum cost principle, and the whole offspring I
S is then obtained by the end of this step. We proceed similarly for the daughter, I
D, but replace the father with the mother and vice versa.The pseudocode for generating the sonI
S can be described as shown in Procedure 1.Procedure 1
BEGIN:
(1) Randomly generate a numberq
cross, such that 1
≤
q
cross
≤
K and β
cross
F
≠
⌀;
(2) LetI
D
=
I
M
∖
β
cross
F;
(3) Randomly select a geneg
F in β
cross
F;
(4)FOR  i
=
1 TO length(I
D);
(5)   Generate the partial scheduleP
i
=
I
1
→
i
-
1
D
,
g
F
,
I
i
→
end
D;
(6)   Compute the total transportation cost C
i of P
i. If P
i is infeasible, let C
i = a sufficiently large number;
(7)   Let i
∗
=
min
i
⁡
r
∣
C
r and reinsert gene g
F in the position i
∗ of I
D;
(8)   Update I
D
=
I
1
→
i
∗
-
1
D
,
g
F
,
I
i
∗
→
end
D and β
cross
F
=
β
cross
F
∖
g
F; ENDFOR
(9)   If β
cross
F
≠
⌀, return to Step (3); otherwise, terminate the procedure.
ENDIn Procedure1, length (I
D) is the number of genes of I
D. I
i
→
j
D is the chromosome of I
D between position i and position j.


## 3.4. Mutation

The mutation operator is applied to newly generated individuals with a probability of mutationp
mut. First, we randomly choose two positions, q
mut
1 and q
mut
2, such that 1
≤
q
mut
1
<
q
mut
2
≤
N
+
K
-
1, q
mut
1
≠
0, and q
mut
2
≠
0 (recall that N and K are the numbers of customers and vehicles, resp.). Then, we check whether customers in positions q
mut
1 and q
mut
2 can be permuted. In other words, if the change does not result in infeasibility, we can permute the customers. Otherwise, we choose another position, q
mut
2
′. We repeat the procedure until two customers are permuted or until a certain number of unsuccessful attempts are made.Finally, the main process of proposed GA can be described as shown in Procedure2.Procedure 2
BEGIN
Input: all necessary data related to customers and vehicles
GA parameters:POP
,
p
cross
,
p
mut
Generate a new population of individuals
While maximal iteration number is not met DO
Evaluate the individuals
Select the better individuals
Generate the offspring population using evolutionary operators
Output: a set of non-dominated solutions
END


## 4. Experimental Results and Comparisons

A logistics enterprise named S has 10 vehicles, the situation of which is shown in Table1. S needs to deliver goods to 10 customers. Table 2 shows the travel time for S’s logistics enterprise. The positions and demands of the customers can be seen in Figure 3 and Table 3. Table 4 presents the time-windows constraints for each customer. When a vehicle’s arrival time is one day earlier than the earliest permitted arrival time, the inventory cost is equal to 0.44 yuan/(ton × day). The penalty cost, when the vehicle’s arrival time is one day later than the latest permitted arrival time, is 4,000 yuan/weekday. The maximum travel time for each route is 30 weekdays.Table 1
The situation of vehicles in the logistics enterprise S.
Vehicle model
Q
k
C
k
Quantity
a
15 ton/59 m3
0.2 yuan/kg
2
b
2 ton/15 m3
0.3 yuan/kg
1
c
25 ton/77 m3
0.15 yuan/kg
2
d
40 ton/100 m3
0.1 yuan/kg
2Table 2
The travel time of S logistics enterprise (day).
Travel time
0
1
2
3
4
5
6
7
8
9
10
Depot 0
0
2
3
2
3
3
3
4
4
5
3
Customer 1
—
0
3
3
2
2
3
3
5
5
3
Customer 2
—
—
0
4
3
2
1
2
4
3
2
Customer 3
—
—
—
0
4
4
5
5
6
6
4
Customer 4
—
—
—
—
0
2
2
3
5
5
2
Customer 5
—
—
—
—
—
0
2
2
5
5
1
Customer 6
—
—
—
—
—
—
0
1
4
4
1
Customer 7
—
—
—
—
—
—
—
0
5
3
1
Customer 8
—
—
—
—
—
—
—
—
0
5
5
Customer 9
—
—
—
—
—
—
—
—
—
0
4
Customer 10
—
—
—
—
—
—
—
—
—
—
0Table 3
The demand of customers.
Customer
Demand
Customer 1
3000 kg
Customer 2
10000 kg
Customer 3
5000 kg
Customer 4
2000 kg
Customer 5
2000 kg
Customer 6
10000 kg
Customer 7
8000 kg
Customer 8
5000 kg
Customer 9
7000 kg
Customer 10
20000 kgTable 4
The time windows constraints of each customer.
Customer
Time windows
Customer 1
[1, 2]
Customer 2
[2, 4]
Customer 3
[3, 5]
Customer 4
[4, 8]
Customer 5
[3, 10]
Customer 6
[11, 15]
Customer 7
[3, 6]
Customer 8
[7, 12]
Customer 9
[4, 10]
Customer 10
[2, 7]Figure 3
The position relationship of the customers.In real life, it is important to confirm the trade-off between fleet sizes and total transportation costs of logistics enterprises. These two aspects may positively correlate with each other. In other words, a higher transportation cost may be incurred if more vehicles are involved. At the same time, these two values may conflict with each other. Such situations are difficult to determine when using the classical approach but are easily analyzed with our suggested approach.In this paper, the proposed GA is run under the MATLAB development environment and performed on a computer with a 2 GHz Intel dual-core processor with 2 GB RAM, running Windows 7. We tuned the algorithm parameters, including population size, max iteration, mutation rate, and crossover rate, by using crossover values of{
0.6
,
0.7
,
0.8
,
0.9
} and mutation rates of {
0.1,0.2,0.3,0.4
}. After many trials, the population size, crossover rate, mutation rate, and max iteration were set to 50, 0.8, 0.4, and 500, respectively. The example case was solved and repeated 30 times, and the average CPU time was 102 seconds. The best results for the GA are listed in Tables 5 and 6.Table 5
The results with time-window constraints.
Fleet size
Limited capacity
The vehicle route
Total transportation cost
2
[40, 40]
0
→
1
→
5
→
10
→
7
→
9
→
0;
0
→
3
→
2
→
6
→
4
→
8
→
0
65320
3
[40, 40, 25]
0
→
10
→
7
→
9
→
8
→
0;
0
→
2
→
6
→
4
→
5
→
0;
0
→
1
→
3
→
0
34581
4
[40, 40, 25, 25]
0
→
2
→
6
→
8
→
0;
0
→
10
→
7
→
9
→
0;
0
→
1
→
5
→
4
→
0;
0
→
3
→
0
30533
5
[40, 40, 25, 25, 15]
0
→
10
→
7
→
9
→
0;
0
→
2
→
6
→
5
→
0;
0
→
1
→
4
→
0;
0
→
8
→
0;
0
→
3
→
0
29440
6
[40, 40, 15, 15, 25, 25]
0
→
10
→
7
→
9
→
0;
0
→
2
→
6
→
4
→
0;
0
→
8
→
0;
0
→
3
→
0;
0
→
1
→
0;
0
→
5
→
0
29240
7
[40, 40, 25, 25, 15, 15, 2]
0
→
10
→
7
→
9
→
0;
0
→
2
→
6
→
4
→
0;
0
→
8
→
0;
0
→
3
→
0;
0
→
1
→
0;
0
→
5
→
0
29240Table 6
The results without time-window constraints.
Fleet size
Limited capacity
The vehicle route
Total transportation cost
2
[40, 40]
0
→
2
→
6
→
7
→
9
→
8
→
0;
0
→
10
→
5
→
1
→
3
→
4
→
0
38800
3
[40, 40, 25]
0
→
10
→
7
→
9
→
4
→
0;
0
→
2
→
6
→
8
→
0;
0
→
3
→
1
→
5
→
0
33350
4
[40, 40, 25, 25]
0
→
6
→
2
→
8
→
0;
0
→
10
→
7
→
9
→
0;
0
→
1
→
5
→
4
→
0;
0
→
3
→
0
31000
5
[40, 40, 25, 25, 15]
0
→
10
→
7
→
9
→
0;
0
→
6
→
2
→
5
→
0;
0
→
8
→
0;
0
→
1
→
4
→
0;
0
→
3
→
0
29400
6
[40, 40, 15, 15, 25, 25]
0
→
2
→
6
→
4
→
0;
0
→
10
→
7
→
9
→
0;
0
→
3
→
0;
0
→
8
→
0;
0
→
5
→
0;
0
→
1
→
0
29200
7
[40, 40, 25, 25, 15, 15, 2]
0
→
10
→
7
→
5
→
0;
0
→
6
→
2
→
9
→
0;
0
→
8
→
0;
0
→
3
→
0;
0
→
1
→
0;
0
→
4
→
0
29200The results with time-window constraints are shown in Table5, and the results without time-window constraints are shown in Table 6. Table 5 shows that the transportation cost of a solution is reduced as the number of vehicles is increased. For example, when the fleet size is 2, the total transportation cost is 65,320 yuan, while when the fleet size is 3, the total transportation cost is 34,581 yuan. When the fleet size is increased by 1, the total transportation cost is thus reduced by 47.06% (from 65,320 to 34,581).Comparing the results of Tables5 and 6, we can find that the total transportation cost with time-window constraints is higher than the transportation cost without them. In particular, when the fleet size is equal to 2, the gap between the two costs can be as high as 26,520 yuan. Tables 5 and 6 present the different vehicle routes for the two results. This situation can be explained by the real transportation process. In reality, in daily life, some customers determine the goods arrival time interval according to their demand, and this arrival time interval is called a time window. If a customer is serviced before the earliest arrival time, extra inventory costs are incurred. If the customer is serviced after the latest arrival time, penalty costs have to be paid. Therefore, time-window constraints may influence transportation costs and vehicle routes. It must be mentioned that decision-makers may make the wrong decisions when they ignore the effects of time-window constraints, which results in resource wasting and customer dissatisfaction.The vehicle routes with time-window constraints of different fleet sizes are shown in Figure4. When the fleet size is equal to 2, there are two routes, when the fleet size is equal to 3, there are three routes, and so on. When the fleet size is increased by 1, the vehicle routes also increase by 1. Note that the results in Table 5 and Figure 4 are clearly comparable, and the decision-maker of S can decide which vehicle route is more preferable, based on specific preferences. For instance, if the decision-maker wants fewer transfers to occur, in order to use vehicle space efficiently, the two-vehicle route may be more reasonable. If the decision maker wants to lower cost, the six-vehicle route may be more reasonable.Figure 4
The vehicle routes with time-window constraints of different fleet sizes.The results of this example case allow us to obtain information on the trade-off relationship between fleet size and total transportation cost, as shown in Figure5. It can be found that these two objectives conflict with each other, and the total transportation cost is reduced as the fleet size is increased. The reason for this is that the transportation weight is a dominant part of transportation cost. However, transportation cost reduction decreases gradually with the increase of fleet size. When the fleet size is six, the transportation cost is at a minimum and will not change further if the fleet size keeps increasing. This situation may be due to fuel consumption, driver salaries, or vehicle maintenance costs, which increase transportation cost.Figure 5
The trade-off relationship between fleet size and total transportation cost.Based on these findings, this paper emphasizes that the number of vehicles involves separate objectives, beyond the total cost of traveling. This is because there is a cost associated with having more vehicles, and considering this in different cases is important. In some cases when a vehicle and its associated costs (namely, manpower costs, fuel consumptions cost, etc.) are negligible, the routing plan will be irrational. This model represents a range of possible answers, with different numbers of vehicles and costs, with which a decision-maker can decide which kind of solution is preferable.


## 5. Conclusion

In this paper, we have considered a transportation cost problem with time-window constraints as a biobjective problem in which the size of a fleet of vehicles and total transportation costs are minimized, while capacity and time-window constraints are not violated. This paper uses a modified algorithm approach to solve this transportation cost problem. The proposed GA employs a string of customer identifiers, which represent the sequence of deliveries that must cover a vehicle during its route. Each vehicle identifier represents a separator between two different routes in the chromosome. A selection mechanism is then used to select prospective parents based on their fitness, as computed by an evaluation function. In this paper, the selected parent chromosomes are then recombined via a crossover operator to create a potential new population. A special mutation is applied to introduce a level of randomness that will preserve the GA from converging to a local optimum.Finally, the algorithm is applied to solve an enterprise transportation problem for S logistics. In the last part of this paper, we compare two results (results with time-window constraints and results without time-window constraints). Based on the gap between these two situations, we find that the total transportation cost with time-window constraints is higher than the transportation cost without time-window constraints. In addition, time-window constraints also change vehicle routes during transportation.Through an analysis of the case, we also find that total transportation cost and fleet size conflict with one another and that the total transportation cost is reduced as fleet size is increased. The results with time-window constraints are clearly comparable, and the decision-maker for S can decide which vehicle route is more preferable based on specific preferences. Thus, it is important for logistics enterprises’ decision-makers to ensure that the sizes of their fleets of vehicles are appropriate.



---

*Source: 365367-2015-08-03.xml*