Exploration of Short Distance Freight Volume Prediction and Vehicle Scheduling Strategy Optimization

Authors

  • Pengyan Liu
  • Xin Wang

DOI:

https://doi.org/10.54097/k05mdf23

Keywords:

Lstm, Gradient Descent, Multi-Objective Programming, Genetic Algorithm, Hybrid Vehicle.

Abstract

In the logistics terminal operation scenario, accurate prediction of short distance transportation cargo volume is crucial for scientific vehicle scheduling, which is the key to improving logistics efficiency and reducing operating costs. This study utilizes data-driven predictive modeling and multi-objective programming scheduling modeling techniques to construct a complete analysis system, aiming to improve the accuracy of cargo volume prediction and optimize vehicle scheduling efficiency. Therefore, the research focuses on evaluating the robustness of the model in the face of prediction bias, providing a solid scientific basis for logistics enterprises' actual operational decisions. Based on LSTM model for time series prediction and gradient descent model for hyperparameter optimization, accurate prediction of time-based cargo volume is achieved. For the route of "Site 3- Station 83-0600", the coefficient of determination on the test set (R^2) reached 0.942, and the average absolute percentage error (MAPE) was 0.0432. For the "Site 3-station 83-1400" model, the average coefficient of determination (R^2) reached 0.9273 and the average MAPE was 0.1419, indicating good prediction accuracy and generalization ability of the model. Finally, the model decomposes the predicted results into a 10 minute granularity, providing data support for fine-grained regulation. The analysis and verification of the prediction results confirmed the accuracy of the prediction.

References

[1]A. Burinskiene, "Interconnection of freight delivery transport service networks," 2022 IEEE 28th International Conference on Engineering, Technology and Innovation (ICE/ITMC) & 31st International Association For Management of Technology (IAMOT) Joint Conference, Nancy, France, 2022, pp. 1-9.

[2]Evergreen Multi constraint full bottleneck Steiner tree algorithm under the background of logistics transportation network planning [D]. Yunnan University of Finance and Economics, 2024.

[3]Lai Yuanwei, Yang Lufeng Logistics transportation path planning based on improved Floyd algorithm [J]. Journal of Science and Technology at Normal University, 2023, 43 (12): 22-26.

[4]Guo Chuan, Shan Junliang, Rui Maoyu Simulation of Air Logistics Transportation Path Planning with Improved Ant Colony Algorithm [J]. Computer Simulation, 2023, 40 (08): 48-52

[5]Yang Yifan Logistics path planning algorithm based on divide and conquer [J]. Logistics Technology and Applications, 2023, 28 (03): 154-160

[6]S. Hochreiter and J. Schmidhuber, "Long Short-Term Memory," in Neural Computation, vol. 9, no. 8, pp. 1735-1780, 15 Nov. 1997.

[7]Li Xingyi, Yue Yang. A Review of Gradient Descent Algorithm Research [J]. Software Engineering, 2020, 23(2): 1-4.

[8]N. K. Sinha and M. P. Griscik, "A Stochastic Approximation Method," in IEEE Transactions on Systems, Man, and Cybernetics, vol. SMC-1, no. 4, pp. 338-344.

Downloads

Published

26-05-2025

Issue

Section

Articles