Available online at www.sciencedirect.

com
Available online at www.sciencedirect.com

ScienceDirect
ScienceDirect
Available online at www.sciencedirect.com
Procedia Computer Science 00 (2023) 000–000
www.elsevier.com/locate/procedia
ScienceDirect
Procedia Computer Science 00 (2023) 000–000
www.elsevier.com/locate/procedia
Procedia Computer Science 221 (2023) 1343–1350

10th International Conference on Information Technology and Quantitative Management

10th International Conference on Information Technology and Quantitative Management
Research on Cold Chain Routing Optimization of Multi-distribution
Research on Cold Chain Routing Optimization of Multi-distribution
Center Considering Traffic Performance Index
Center Considering Traffic Performance Index
Shuo Cuiaa, Xiaoyan Gua,* , Wanlin Xieaa, Dengsheng Wubb
a
Shuo Cui , Xiaoyan Gu , Wanlin Xie , Dengsheng Wu
a,*
School of Information Management, Bei Jing Information Science & Technology University, Beijing, 100192, China
b
a Institutes ofManagement,
School of Information Science and Development, ChineseScience
Bei Jing Information Academy of Sciences, University,
& Technology Beijing, 100190, China
Beijing, 100192, China
b
Institutes of Science and Development, Chinese Academy of Sciences, Beijing, 100190, China

Abstract
Abstract
In response to the practical situation where traffic congestion factors reduce the distribution efficiency and increase the cost of cold
chain logistics
In response in the
to the actual situation
practical transportation
whereprocess, a mathematical
traffic congestion model
factors forthe
reduce optimizing the cold
distribution chain and
efficiency pathincrease
of multiple
the distribution
cost of cold
chain logistics
centers in the actual
is established, withtransportation process, a mathematical
the goal of minimizing model for
the comprehensive optimizing
cost the cold chain
and incorporating path ofcongestion
a traffic multiple distribution
index. By
centers
analyzingis routine
established,
factorswith
suchthe goal of minimizing
as customer requested timethe windows,
comprehensive
loadingcost
andand incorporating
unloading time, anda road
traffic congestion
congestion, anindex.
improvedBy
analyzing
particle routine
swarm factors such
algorithm that as customer exchange
introduces requested offspring
time windows, loading The
is proposed. and unloading time, andisroad
proposed method congestion,
tested an improved
through experimental
particle swarm
simulations andalgorithm
the resultsthat
are introduces exchange
compared with offspring
traditional is proposed.
methods. Theshow
The results proposed method is tested
that considering through
the traffic experimental
congestion index
simulations
saves 7.12%andof thethecomprehensive
results are compared with traditional
cost compared methods. The
to not considering resultscongestion
the traffic show thatindex,
considering the traffic
and completes thecongestion index
delivery service
with
savesa7.12%
shorterofpath length.
the comprehensive cost compared to not considering the traffic congestion index, and completes the delivery service
with
© a shorter
2023 path length.
The Authors. Published by ELSEVIER B.V.
© 2023
©
This2023 The
is anThe Authors.
openAuthors.
access Published
article by
Published Elsevier
by
under B.V.BY-NC-ND
ELSEVIER
the CC B.V. license (https://creativecommons.org/licenses/by-nc-nd/4.0)
This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0)
Peer-review
This is an open under responsibility
access of the
article under thescientific
CC BY-NC-NDcommittee
licenseof (https://creativecommons.org/licenses/by-nc-nd/4.0)
the 10th International Conference on Information
Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information Technology and
Technology
Peer-review and
under
Quantitative ManagementQuantitative
responsibilityManagement
of the scientific committee of the 10th International Conference on Information
Technology and Quantitative
Keywords: Congestion Management
index, Cold chain logistics, Route optimization, Particle Swarm Optimization
Keywords: Congestion index, Cold chain logistics, Route optimization, Particle Swarm Optimization

1. Introduction
1. Introduction
The special characteristics of cold chain products lead to the need to consider many influencing factors in the
The specialprocess.
transportation characteristics
With theofincrease
cold chain products
of cold lead todemand,
chain market the needhowto consider many
to guarantee theinfluencing factors in
quality of products in the
transportation
cold process. With
chain transportation the increase
process, of cold chain
save distribution market
costs demand, distribution
and optimize how to guarantee the quality
efficiency are theofurgent
products in the
problems
cold
in chain
cold transportation
chain process,
logistics[1]. Cold save
chain distribution
logistics costsobjects
transport and optimize
have thedistribution efficiency
characteristics of easyare the urgent problems
perishability and short
in coldlife,
shelf chain
andlogistics
compared[1]
. Cold
with chain logistics
traditional transport objects
transportation havecold
methods, the characteristics
chain logisticsofrequires
easy perishability and short
higher timeliness of
shelf life, and
transported compared
goods. with traditional
In the environment transportation
of increasingly methods,
severe trafficcold chain logistics
congestion, requirescondition
the congestion higher timeliness of
leads to the
transported goods.
prolongation of theIn the environment
transit of increasingly
time of logistics distributionsevere traffic
vehicles, andcongestion,
at the samethe congestion
time increases condition leads
the loss cost of to the
cargo
prolongation of the transit time of logistics distribution vehicles, and at the same time increases the loss cost of cargo

1877-0509 © 2023 The Authors. Published by ELSEVIER B.V.

This is an open
1877-0509 access
© 2023 The article
Authors.under the CCby
Published BY-NC-ND
ELSEVIERlicense
B.V. (https://creativecommons.org/licenses/by-nc-nd/4.0)
Peer-review under
This is an open responsibility
access of the
article under thescientific committee
CC BY-NC-ND of (https://creativecommons.org/licenses/by-nc-nd/4.0)
license the 10th International Conference on Information Technology and
Quantitative Management
Peer-review under responsibility of the scientific committee of the 10th International Conference on Information Technology and
Quantitative Management
1877-0509 © 2023 The Authors. Published by Elsevier B.V.
This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0)
Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information
Technology and Quantitative Management
10.1016/j.procs.2023.08.124
1344 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350
2 Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000

transportation, the energy cost of distribution vehicles and the corresponding refrigeration cost, which reduces the
distribution efficiency of cold chain logistics and the quality of distribution services.
At present, scholars at home and abroad have conducted a lot of research on the logistics distribution path planning
problem. Traffic congestion is increasing and has an impact on the distribution efficiency of fresh products, so some
scholars have included traffic congestion into the consideration of path optimization. Huang[2] designed a method to
calculate the vehicle distribution time under time-varying road networks by considering the relationship between time-
varying vehicle speed and travel time in each time period. Ehmke[3] and Wen[4] developed a path optimization model
considering traffic conditions, which integrates the effect of vehicle speed due to congestion as well as load on carbon
emissions. Liu[5] proposed a mathematical model for urban logistics and distribution path planning with the
introduction of traffic congestion conditions, and proved that the model has higher practical application value. Yao[6]
established a cold chain logistics distribution model with multiple customer points in a single distribution center based
on real-time road condition information, which reduced distribution costs and improved customer satisfaction. These
studies stay on the distribution model of single distribution center and multiple customers, which lacks adaptation with
the actual distribution model of multiple distribution centers and multiple customers nowadays and does not meet the
high-speed development of logistics and distribution environment.
Some scholars also focus on the characteristics of cold chain logistics distribution to achieve cost reduction and
improve distribution efficiency from the perspectives of environmental protection, improving customer satisfaction,
and optimization of the solution model. Wang[7] studied the cold chain logistics path planning problem with time
window based on carbon tax, but neglected to consider the increase in carbon emission cost due to the increase in time
cost under traffic congestion. Sheng[8] found that the vehicle path planning capability of particle swarm algorithm is
superior than that of adaptive genetic algorithm and genetic algorithm vehicle. Liao[9] studied the equilibrium
relationship between logistics cost, environmental protection, and customer satisfaction. Xu[10] established a multi-
objective optimization model for multi-oil and multi-depot vehicle path planning. The solved example verifies that the
model significantly reduces the vehicle distribution cost and significantly improves the distribution satisfaction rate.
Tang[11] and Ren[12] designed path optimization algorithms under the perspective of energy saving and emission
reduction to improve the solution performance and better meet the needs of green development and cost reduction and
efficiency. Although all these studies established the corresponding objective functions according to the research
objectives and optimized the optimal paths with various algorithms, which reduced the distribution costs and improved
the distribution services to a certain extent, there is still room for continuous drilling and improvement, which can be
combined with the actual traffic conditions to optimize the paths and reduce the deviation between cost measurement
and reality.
In this paper, based on the above research, we study the cold chain logistics path optimization problem of multiple
distribution centers considering traffic congestion index, construct the fixed cost of distribution vehicles, transportation
cost, cargo damage cost, refrigeration cost and penalty cost, and convert the traffic congestion index into the
corresponding roadway smoothness coefficient to join the established mathematical model of cold chain logistics
distribution path optimization. This model is more in line with the real-life situation and improves its own applicability
and reliability. Since the particle swarm algorithm is suitable for high-dimensional optimization problems with fast
convergence and simple and convenient parameter settings, we use an improved particle swarm algorithm with the
introduction of swappers to solve the example and compare the results with the solution of the particle swarm algorithm
before the improvement, based on the analysis of conventional factors such as customer requirement time window,
loading and unloading time and road congestion.

2. Problem description

2.1. Assumptions

• In the distribution network, the locations of distribution centers and customer points and the unloading dwell time
are known Second point.
• The demand of customer points is known, and the demand is less than the capacity of reefer trucks.
• Sufficient supply of goods, single type of refrigerated trucks and sufficient quantity.
• Each customer point has and only has one refrigerated truck to serve it.
 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350 1345
Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000 3

• The vehicles for distribution depart from the distribution center and return to the same distribution center
immediately after completing the task.
• The customer point has a service time window requirement.

2.2. Problem description

From the above assumptions, the problem studied in this paper is described as follows: Combining the traffic
congestion index of known delivery hours, serving customers under the conditions of satisfying the customer point
time window, demand and vehicle load, optimizing the vehicle path by considering the cost in the delivery process,
and minimizing the comprehensive cost of the delivery process.

3. Mathematical model of cold chain distribution considering traffic conditions

3.1. The setting of traffic constraints

The Traffic Performance Index (TPI) is a conceptual index that digitizes the congestion of the road network[13][14].
It has a value range of 0-10 and is divided into five levels. According to the levels of the traffic congestion index,
distribution vehicles incur corresponding time consumption on the road, as shown in Table 1.

Table 1. Congestion condition division table

TPI Congestion degree Section unimpeded factor α
0-2 smooth 1
2-4 basic smooth 1.2-1.5
4-6 light congestion 1.5-1.8
6-8 moderate congestion 1.8-2.1
8-10 severe congestion above 2.1

In this paper, based on the congestion index data predicted by Baidu Map Smart Traffic Network, the congestion
index is transformed into the corresponding road section smoothness coefficients, which are stored in the congestion
coefficient matrix A. With the passage of time and the change of road sections during the driving of distribution
vehicles, specific congestion coefficients are selected from the coefficient matrix and used for comprehensive cost
calculation.

3.2. Analysis of time variables

tijk = d ij / v0 (1)
Equation (1) tijk in the delivery vehicle in the smooth road conditions from customer point i to customer point j
travel time.
Tijk = aij tijk (2)
Tijk in Equation (2) indicates the time taken by the delivery vehicle to travel from customer point i to customer point
j under congested road conditions.

3.3. Route optimization model

In the formula:
M: denotes the number of cold chain distribution centers, m ∈ {1, 2, ..., M};
K: denotes the total number of deployable cold chain transportation vehicles, k ∈ {1, 2, ..., K};
N: denotes the total number of customer points in the cold chain distribution center, n∈ {M+1, M+2 ..., N};
dij: denotes the shortest distance from customer point i to customer point j, i, j∈ n;
1346 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350
4 Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000

tijk: denotes the passage time of the kth vehicle from customer point i to customer point j;
tjk: denotes the time for the kth vehicle to move and unload cargo at demand point j;
qj: denotes the demand quantity at the jth demand point;
Q: denotes the maximum load capacity of the cold chain distribution vehicle;
fk: denotes the fixed cost of the kth cold chain distribution vehicle;
p: denotes the unit price of fuel used per unit distance of the cold chain distribution vehicle;
ε: denotes the cost of cargo loss per unit time of goods in the cold chain distribution process;
λ1: denotes the refrigeration cost generated per unit time in the cold chain distribution process of the cold chain
distribution vehicle;
λ2: denotes the refrigeration cost per unit time generated by the cold chain vehicle in the process of moving and
unloading goods;
[tej,tlj]: denotes the delivery time limit agreed at customer point j;
ca: denotes the penalty cost coefficient per unit time for early arrival of the distribution vehicle;
cb: denotes the late arrival of the vehicle, the delay cost coefficient per unit time;
v0: denotes the speed of the cold chain distribution vehicle on the smooth section;
Ti: denotes the time after serving customer point i;
α: denotes the transportation time coefficient of the distribution vehicle under traffic congestion;
ì1 , Vehicle K serves customer point i to customer point j
ï
X ijk í (i £ M , j > M )
ï0 , other
î
The cold chain path optimization model for multiple distribution centers considering traffic congestion index is as
follows:
K
C1 = å f k (3)
k =1
K N N
C2 = p1 ååå aij dij X ijk (4)
k =1 i =1 j =1
K N N
C3 = ååå e (Tijk + t jk )X ijk (5)
k =1 i =1 j =1
K N N
C4 = ååå ( l1Tijk + l2t jk )X ijk (6)
k =1 i =1 j =1

ìca × max é(Tej - t j ) , 0 ù , 0 £ t j £ Tej

ïï ë û
C5 = í 0 , Tej £ t j £ Tlj (7)
ï
ïî cb × max éë( t j - Tlj ) , 0 ùû , Tlj £ t j
MinC = ( C1 + C2 + C3 + C4 + C5 ) (8)
K N N

åå å
k =1 i =1 j = M +1
X ijk = N - M (9)

N N

åå q X
i =1 j =1
j ijk £ Q, k Î K (10)

Illustrate:
Equation (3) indicates that the cold chain distribution vehicle to complete a delivery task to produce a certain fixed
cost.
 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350 1347
Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000 5

Equation (4) indicates that the transportation cost incurred by the cold chain distribution vehicle. We consider the
possible congestion of vehicles in transit, so the set speed is changed accordingly. Fuel consumption is inversely
related to vehicle travel speed, so the higher the congestion index, the longer the vehicle is in transit, the greater the
fuel consumption.
Equation (5) indicates that the cost of cargo spoilage incurred by the goods during transportation. In this paper, we
assume that the temperature-controlled compartment of the cold chain distribution vehicle is at a suitable temperature
and the goods hardly incur collision losses.
Equation (6) indicates that the cooling costs incurred during transportation and maintenance of temperature during
unloading.
Equation (7) indicates that the penalty cost incurred by the delivery vehicle's early or delayed delivery time under
the condition that the soft time window is used as a constraint.
The objective function (8) represents the comprehensive cost incurred by cold chain logistics distribution under the
condition of considering the traffic situation.
Equation (9) indicates that only one delivery vehicle per customer point is guaranteed for delivery service.
Equation (10) indicates the loading capacity of each refrigerated truck does not exceed its maximum load capacity.

4. Model solving based on improved particle swarm optimization

Particle Swarm Optimization (PSO) is a population intelligence based optimization algorithm. Particle swarm
algorithm is suitable for high-dimensional optimization problems, with information sharing mechanism and fast
convergence speed. The traditional particle algorithm has difficulties in the selection of weight encoding and
evolutionary operators in solving the actual problem, so this paper introduces an improved particle swarm optimization
[15]
to solve the above established mathematical model of cold chain distribution considering traffic conditions to
generate the cold chain distribution vehicle path and minimize the comprehensive cost of the distribution process.

4.1. Flow of algorithm

When solving the path planning model proposed in this paper based on the improved particle swarm algorithm, the
solution can be in the form of a sequence x to represent the order of access to the client points. Set the swapper and
swap sequence, the swapper is defined as s = Swap x(i, j), indicating that the swapper s acts on the sequence x, so that
the elements at position i and position j are exchanged with each other, which can be regarded as the velocity of the
particle, capable of changing the position of the solution x, i.e., the resulting cold chain distribution path sequence of
two node positions for one swap update; the swap sequence is defined as ss = [Swap1, Swap2,…], which denotes the
set of sequential swappers, Pbestid evolves through the swap sequence, i.e., the combination of two by two nodes
positions in the resulting cold chain distribution path sequence for multiple updates, as shown in equation (11), and
Gbestid evolves in the same way. Therefore, the position and velocity update formulas of the particles can be redefined
as shown in equation (12) and equation (13).
xid + ss = Pbestid (11)
Vid = Vid Å r1 ( Pbestid - xid ) Å r2 ( Gbestid - xid ) (12)
X id = X id + Vid (13)

4.2. Encoding and fitness function

Coding. This paper involves M cold chain logistics distribution centers, N-M customer points, using multiple cold
chain transport vehicles for distribution services in the form of integer coding, with integers {1, 2, 3, ..., N} denote M
cold chain logistics distribution centers, and {M+1, M+2, ..., N} denote N-M customer points. Based on a search-
based algorithm encoded by seeking the optimal solution through inter-particle information sharing, a particle swarm
with S particles is assumed to seek the location of the optimal solution in a D-dimensional space, and an initial location
is assigned to each particle as follows:
1348 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350
6 Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000

X id = ( xi1 , xi2 ,..., xiD ) i = 1, 2,3..., S (14)

The initial optimal position of each particle can be obtained by bringing the initial position into the objective
function for calculation, and the optimal position of each particle is recorded in each search process as follows:
Pbestid = ( Pbesti1 , Pbesti2 ,..., PbestiD ) i = 1, 2,3..., S (15)
Through this search process, the optimal position of each particle is evaluated, and the optimal solution is selected
to become the optimal position of the whole particle population, i.e., the global optimal position, and the global optimal
position of the particle population is recorded in each search process as follows:
Gbestid = ( Gbesti1 , Gbesti2 ,..., GbestiD ) i = 1, 2,3..., S
(16)
Fitness function. The objective function established for the cold chain path optimization problem of multiple
distribution centers considering the traffic congestion index includes five parts of cost, and the fitness function set as
the objective function, that is, the smaller the value of the objective function, then the smaller the fitness function,
indicating the higher the feasibility of the solution. Let W = MinC and the fitness function be as follows:
fitness = W (17)

5. Simulation experiment and analysis

There are three logistics distribution centers, numbered L1, L2, and L3, which provide cold chain distribution
services for customers on a certain day for 30, numbered C1-C30, with the earliest departure time of 6:30 a.m. Citing
the logistics node information in literature 错误!未找到引用源。, the realistic distance is reduced by a ratio of 1:5000
for the convenience of the solution. This experiment sets the fixed cost of each cold chain truck at 50 RMB, the
maximum load capacity at 30 kg, the uniform speed of the vehicle v0 at 35 km/h under smooth road conditions, the
unit transportation cost at 0.5 RMB/km, the cost of cargo damage and refrigeration cost at 8 RMB/h during the delivery
process, the uniform unloading service time at 15 minutes, the cost of dimensional temperature consumption at the
time of unloading cargo at 15 RMB/h, the cost of waiting for the cold chain truck to arrive at the customer point early
at 10 RMB/h, and the cost of delayed arrival at 60 RMB/h. Parameters of the improved particle swarm optimization:
the number of particles is 50, r1=r2=0.65, and the maximum number of iterations is 500.

5.1. Comparative cost analysis considering traffic conditions

Figure 1 shows that the least cost distribution strategy considering the traffic conditions is to have 7 cold chain
vehicles from 3 cold chain logistics distribution centers for distribution services. The distribution routes are shown as
follows:
L1-C29-C13-C25-C18-C9-L1; L1-C30-C17-C21-C24-C28-L1;
L2 -C6-C8-C7-C20-C32-C4-C26-L2; L2-C23-C12-C14-C16-C10-L2;
L3-C31-C3-C11-L3; L3-C5-C22-C27-L3; L3-C19-C15-L3;
Under this strategy, the total route length is 301700km and the comprehensive cost is 151,667.53 RMB. The lowest
cost distribution strategy without considering the traffic condition is the distribution service by 7 cold chain transport
vehicles from 3 cold chain logistics distribution centers, and the actual total route length under this strategy is
324700km, and the comprehensive cost is 163297.63 RMB. The experimental results show that the multi-distribution
center cold chain distribution strategy considering the traffic condition saves about 7.12% in the comprehensive cost
than the distribution strategy without considering the traffic condition, and completes the distribution service with
shorter route length.
 Shuo
Shuo CuiCui
et al.et/al. / Procedia
Procedia Computer
Computer Science
Science 221 (2023)
00 (2019) 1343–1350
000–000 13497

a b

Fig. 1. (a) Distribution routes that take into account traffic conditions; (b) Distribution routes that do not take into account traffic conditions.

5.2. Comparative analysis of different algorithms

a 151950
b
157000

151900
156950
fitness function

151850
fitness function

156900

151800
156850

151750
156800

151700
156750
151650
156700
0 100 200 300 400 500 0 100 200 300 400 500
step step

Fig. 2. (a) Iterative record of improved particle swarm optimization; (b) Iterative record of traditional particle swarm optimization.

Figure 2 shows that for the cold chain path optimization problem of multiple distribution centers considering traffic
congestion index studied in this paper, the optimal fitness value of the traditional particle swarm algorithm converges
at the 424th iteration; the optimal fitness value of the improved particle swarm algorithm is 151667.53, which
converges at the 51st iteration. Compared with the experimental results of the traditional particle swarm algorithm,
the proposed algorithm saves 3.23% in the comprehensive cost, accelerates the convergence speed of the algorithm,
and verifies the effectiveness of the algorithm.

6. Conclusion

In this paper, the cold chain path optimization problem of multi-distribution centers considering traffic congestion
index is studied, the comprehensive cost of cold chain transport vehicles is analyzed, the traffic congestion index is
added, the mathematical model of the problem is established, and the improved particle swarm algorithm is introduced
to solve the mathematical model. The comprehensive cost considering the traffic situation is analyzed by comparing
the comprehensive cost of cold chain distribution in multiple distribution centers considering the traffic congestion
index and not considering the traffic congestion index. The experimental results show that the integrated cost
considering traffic congestion index saves 7.12% compared with the latter, and completes the distribution service with
shorter path length, which further improves the distribution efficiency and more closely fits the actual distribution
1350 Shuo Cui et al. / Procedia Computer Science 221 (2023) 1343–1350
8 Shuo Cui et al. / Procedia Computer Science 00 (2019) 000–000

scenario, and verifies the practicality of the model. The traditional particle swarm algorithm and the improved particle
swarm algorithm are compared according to the mathematical model and experimental data. The experimental results
show that the algorithm adopted in this paper can effectively reduce the comprehensive cost incurred in the cold chain
distribution process by 3.23% and ensure the convergence speed, which further illustrates the practicality of the model
proposed in this paper and the advantages of the solution of the adopted algorithm.

Acknowledgements

This paper is supported by the Qinghai Province's key R & D and conversion plan(2022QY206), and the Qinghai
Provincial Science and Technology Innovation Base Construction Project(2022ZY007).

References

[1] Zhang L Y. (2019) “Low-carbon cold chain logistics using ribonucleic acid-ant colony optimization algorithm.” Journal of Cleaner
Production 233: 169–180.
[2] Huang Y, Zhao L and Van Woensel T. (2017) “Time-dependent vehicle routing problem with path flexibility.” Transportation Research
Part B-Methodological 95: 169–195.
[3] Ehmke J F, Campbell A M and Thomas B W. (2016) “Vehicle routing to minimize time-dependent emissions in urban areas.” European
Journal of Operational Research 251 (2): 478–494.
[4] Wen L, and Eglese R. (2015) “Minimum cost VRP with time-dependent speed data and congestion charge.” Computers & Operations
Research 56: 41–50.
[5] Jianren Liu. (2020) “Research on route planning of urban logistics distribution considering traffic congestion.” Modern Electronics Technique
43 (23): 116–119.
[6] Yuanguo Yao and Shengyu He. (2019) “Research on optimization of agricultural cold chain logistics distribution route based on traffic big
data.” Management Review 31 (4): 240-253.
[7] Songyi Wang, Fengming Tao and Yuhe Shi. (2017) “Optimization of Vehicle Routing Problem with Time Windows for Cold Chain Logistics
Based on Carbon Tax.” Sustainability 9 (5): 694.
[8] Longyu Sheng, Yuling Bo and Zhimin Chen. (2012) “Vehicle Path Planning Method Based on Particle Swarm Optimization Algorithm.”
Advanced Materials Research 468: 2745-2748.
[9] Liefa Liao,and Xingping Zhang. (2020) “Low carbon logistics route planning of multi-distribution stations considering customer satisfaction.”
Information and Control 49 (4): 420-428.
[10] Xiaofeng Xu, Ziru Lin and Peng Zhou. (2021) “Research on Vehicle Routing Problem of Multiple Oil Depot Passive Distribution under Multi
Oil Supply Constraints.” Chinese Journal of Management Science 29 (5): 157-165.
[11] Qiong Tang, Cui Li and Shiyang Liu. (2022) “Optimization of Cold Chain Logistics Distribution Path of Fresh Agricultural Products based
on Tabu Search Algorithm.” Business & Economy 554 (10): 55-56.
[12] Teng Ren, Tianyu Luo and Shuxuan Li. (2022) “Knowledge-based ant colony algorithm for cold chain logistics route optimization.” Control
and Decision 37 (3): 545-554.
[13] Yi Hao and Wengang Li. (2017) “Urban road congestion factors analysis and countermeasures research.” Journal of Highway and
Transportation Research and Development 13 (6): 325-327.
[14] Zhang Liu, Jian Li and Chao Wang. (2016) “Traffic congestion prediction model based on complex urban road network.” Journal of University
of Electronic Science and Technology of China 45(1): 17-25.
[15] Zhenyu Su. (2020). Python optimization algorithm actual combat (pp. 220). Beijing: Peking University Press.
[16] Weiqian Lin. (2018) “Research on multi-center route optimization of agricultural cold chain logistics in cities”. North China Electric Power
University, Beijing.