Title: Freight vehicle path planning method based on Logistics 4.0 technology and customer dynamic needs

Authors: Xinchun Wang

Addresses: School of Economics and Management, Chongqing Normal University, Shapingba District, Chongqing, China; School of Aviation and Tourism Management, Chongqing Aerospace Polytechnic, Chongqing, China

Abstract: In the process of logistics transportation, customer demand is constantly changing, but the current vehicle path planning method considering customer dynamic demand has the problem of low quality. For enhancing the quality of logistics services and to decrease logistics costs, this study constructed a freight vehicle path planning model using Logistics 4.0 technology and customer dynamic needs. Firstly, the mathematical model of path planning under fixed demand is constructed from the aspects of vehicle driving cost, time window constraint and vehicle loading constraint. The mathematical model of fixed demand is solved by simulated annealing algorithm. Then, we use the master-slave parallel thought and Tabu search algorithm to develop the path planning strategy under dynamic demand. The experimental results show that the time utilisation rate and vehicle loading utilisation rate reach 100% and 94.34%, respectively after considering the actual dynamic demand of users. With the increase of customer size, the solution deviation of the research design model is less than 2%. This indicates that the model constructed by the research institute can effectively improve the efficiency of logistics transportation and customer satisfaction. And it can meet the dynamic needs of customers and enhance the quality and efficiency of logistics transportation.

Keywords: tabu search algorithm; Logistics 4.0; path planning; dynamic demand; transportation efficiency.

DOI: 10.1504/IJVICS.2025.145797

International Journal of Vehicle Information and Communication Systems, 2025 Vol.10 No.2, pp.148 - 164

Received: 11 Jan 2024
Accepted: 10 Jul 2024
Published online: 24 Apr 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article