BeiDou‐ <scp>ASEAN</scp> Cross‐Border Logistics Industrial Internet of Things Dynamic Path Optimization Algorithm Based on Particle Swarm Algorithm

ABSTRACT Aiming at the high‐dimensional dynamic path optimization problem of BeiDou‐ASEAN cross‐border logistics, this paper proposes an industrial Internet of Things optimization method based on improved particle swarm algorithm. By introducing the Close distance function to reduce high‐dimensional extreme dimensional interference, a dynamic inertial weight adjustment strategy and an adaptive variation operator are designed, and the path planning is optimized by combining BeiDou real‐time data. Experiments show that the average relative error of the algorithm in the static road network is only 0.18%, and the dynamic event preoptimization efficiency is more than 85%, which is 41.9% higher than the convergence speed of the traditional algorithm, and the response level of 200 ms is achieved in the 1000‐node road network. The study provides a high‐precision real‐time optimization scheme for cross‐border logistics, which significantly improves regional logistics efficiency.

Authors

Institutions

Publication Details

Journal
Internet Technology Letters
Published
2026-02-09
DOI
https://doi.org/10.1002/itl2.70216
Primary Topic
Advanced Technologies in Various Fields
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

BeiDou‐ ASEAN Cross‐Border Logistics Industrial Internet of Things Dynamic Path Optimization Algorithm Based on Particle Swarm Algorithm

Xueqi Huang
Internet Technology Letters
Advanced Technologies in Various Fields
article

BeiDou‐ ASEAN Cross‐Border Logistics Industrial Internet of Things Dynamic Path Optimization Algorithm Based on Particle Swarm Algorithm

Xueqi Huang
article en

Abstract

ABSTRACT Aiming at the high‐dimensional dynamic path optimization problem of BeiDou‐ASEAN cross‐border logistics, this paper proposes an industrial Internet of Things optimization method based on improved particle swarm algorithm. By introducing the Close distance function to reduce high‐dimensional extreme dimensional interference, a dynamic inertial weight adjustment strategy and an adaptive variation operator are designed, and the path planning is optimized by combining BeiDou real‐time data. Experiments show that the average relative error of the algorithm in the static road network is only 0.18%, and the dynamic event preoptimization efficiency is more than 85%, which is 41.9% higher than the convergence speed of the traditional algorithm, and the response level of 200 ms is achieved in the 1000‐node road network. The study provides a high‐precision real‐time optimization scheme for cross‐border logistics, which significantly improves regional logistics efficiency.

Internet Technology LettersVol. 9(2)
Nanning Normal University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 63%
Advanced Technologies in Various Fields
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.