Open AccessCost-based multi-parameter logistics routing path optimization algorithm
Author(s) -
Fu Lin Dang,
Chun Xue Wu,
Yan Wu,
Rui Li,
Sheng Zhang,
Jiaying Huang,
Zhi Gang Liu
Publication year - 2019
Publication title -
mathematical biosciences and engineering
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2019350
Subject(s) - shortest path problem , mathematical optimization , path (computing) , constrained shortest path first , simulated annealing , computer science , correctness , vehicle routing problem , routing (electronic design automation) , algorithm , k shortest path routing , mathematics , computer network , theoretical computer science , programming language , graph
The traditional path optimization problem is to consider the shortest path of the vehicle, but the shortest path does not effectively reduce the logistics cost. On the contrary, in the case of one-sided pursuit of the shortest path, it may cause some negative effects. This paper constructs a more realistic path optimization model on the path of traditional logistics distribution, and designs a path model based on simulated annealing algorithm which taking fuel consumption, cost, road gradient and condition of vehicle into account. The algorithm model of load capacity and other problems is used to verify the algorithm of the model through a simulation case of multiple distribution points. The experimental results show that the path optimization strategy considering the gradient of the road reduces the cost of the vehicle path, indicating the correctness of considering the vehicle load and road gradient factors in logistics transportation.