Multi-Objective Optimization of Short-Inverted Transport Scheduling Strategy Based on Road–Railway Intermodal Transport

3Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

This study focuses on the ‘short-inverted transportation’ scenario of intermodal transport. It proposes a vehicle unloading reservation mechanism to optimize the point-of-demand scheduling system for the inefficiency of transport due to the complexity and uncertainty of the scheduling strategy. This paper establishes a scheduling strategy optimization model to minimize the cost of short backhaul and obtain the shortest delivery time window and designs a hybrid NSGWO algorithm suitable for multi-objective optimization to solve the problem. The algorithm incorporates the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm based on the Grey Wolf Optimizer (GWO) algorithm, compensating for a single algorithm’s premature convergence. The experiment selects a logistics carrier’s actual road–rail intermodal short-inverted data and compares and verifies the above data. The results show that the scheduling scheme obtained by this algorithm can save 41.01% of the transport cost and shorten the total delivery time by 46.94% compared with the original scheme, which can effectively protect the enterprise’s economic benefits while achieving timely delivery. At the same time, the optimized scheduling plan resulted in a lower number of transport vehicles, which positively impacted the sustainability of green logistics.

Cite

CITATION STYLE

APA

Guo, D., Su, Y., Zhang, X., Yang, Z., & Duan, P. (2024). Multi-Objective Optimization of Short-Inverted Transport Scheduling Strategy Based on Road–Railway Intermodal Transport. Sustainability (Switzerland), 16(15). https://doi.org/10.3390/su16156310

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free