A Path Planning Method Based on Hybrid Sand Cat Swarm Optimization Algorithm of Green Multimodal Transportation

Aiming at the difficulty of measuring various costs and time-consuming elements in multimodal transport, this paper constructs a green vehicle comprehensive multimodal transport model which incorporates transportation, transit, quality damage, fuel consumption, and carbon emission costs and proposes a hybrid embedded time window to calculate the time penalty cost in order to reflect the actual transport characteristics. Furthermore, in order to better solve the model, a hybrid sand cat swarm optimization (HSCSO) algorithm is proposed by introducing Logistic–Tent chaotic mapping and an adaptive lens opposition-based learning strategy to enhance the global search capability, and inspired by the swarm intelligence scheme, a momentum–bellicose strategy and an equilibrium crossover pool are introduced to improve the search efficiency and convergence ability. Through testing nine benchmark functions, the HSCSO algorithm exhibits superior convergence accuracy and speed in dealing with complex multi-dimensional problems. Based on the excellent global performance, the HSCSO algorithm was utilized for multimodal vehicle transportation in East China, and a path with a lower comprehensive cost was successfully planned, which proved the effectiveness of the HSCSO algorithm in green intermodal transport path planning.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2024-09-08
DOI
https://doi.org/10.3390/app14178024
Citations
7
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Path Planning Method Based on Hybrid Sand Cat Swarm Optimization Algorithm of Green Multimodal Transportation

Qiming Yang, Zhe Sun, Junyi Liu, Zhixin Sun et al.
7 citations
Applied Sciences
Robotic Path Planning Algorithms
1.74
article

A Path Planning Method Based on Hybrid Sand Cat Swarm Optimization Algorithm of Green Multimodal Transportation

Qiming Yang, Zhe Sun, Junyi Liu, Zhixin Sun, Xu Zhang
article en
7 citations

Abstract

Aiming at the difficulty of measuring various costs and time-consuming elements in multimodal transport, this paper constructs a green vehicle comprehensive multimodal transport model which incorporates transportation, transit, quality damage, fuel consumption, and carbon emission costs and proposes a hybrid embedded time window to calculate the time penalty cost in order to reflect the actual transport characteristics. Furthermore, in order to better solve the model, a hybrid sand cat swarm optimization (HSCSO) algorithm is proposed by introducing Logistic–Tent chaotic mapping and an adaptive lens opposition-based learning strategy to enhance the global search capability, and inspired by the swarm intelligence scheme, a momentum–bellicose strategy and an equilibrium crossover pool are introduced to improve the search efficiency and convergence ability. Through testing nine benchmark functions, the HSCSO algorithm exhibits superior convergence accuracy and speed in dealing with complex multi-dimensional problems. Based on the excellent global performance, the HSCSO algorithm was utilized for multimodal vehicle transportation in East China, and a path with a lower comprehensive cost was successfully planned, which proved the effectiveness of the HSCSO algorithm in green intermodal transport path planning.

Applied SciencesVol. 14(17)
Nanjing University of Posts and Telecommunications (CN), Wuhu Hit Robot Technology Research Institute (CN)
Openalex Percentile: Top 14%
Robotic Path Planning Algorithms
1.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.