Real‐Time Logistics Path Planning of <scp>IIoT</scp> Edge Computing Based on Improved Ant Colony Algorithm

ABSTRACT To address the challenges of real‐time logistics path planning in industrial IoT edge computing scenarios, this paper proposes an enhanced heuristic path planning method based on an improved ant colony algorithm. The proposed method integrates an iterative incentive factor with a Levy flying strategy in a dual‐ant colony mechanism, effectively enhancing global search capability and convergence speed. It further constructs a super‐heuristic framework incorporating dynamic pheromone updates and multi‐objective balancing strategies. Simulation results demonstrate that the proposed algorithm achieves optimal performance across seven benchmark instances, with superior hyper‐volume and inverse generation distance values. In large‐scale networks, the algorithm exhibits fast convergence and low computational latency. The conclusion indicates that this method significantly improves path planning quality, efficiency, and multi‐objective balance, providing effective technical support for intelligent logistics scheduling.

Authors

Institutions

Publication Details

Journal
Internet Technology Letters
Published
2026-04-06
DOI
https://doi.org/10.1002/itl2.70269
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

Real‐Time Logistics Path Planning of IIoT Edge Computing Based on Improved Ant Colony Algorithm

Dong Li
Internet Technology Letters
Advanced Technologies in Various Fields
article

Real‐Time Logistics Path Planning of IIoT Edge Computing Based on Improved Ant Colony Algorithm

Dong Li
article en

Abstract

ABSTRACT To address the challenges of real‐time logistics path planning in industrial IoT edge computing scenarios, this paper proposes an enhanced heuristic path planning method based on an improved ant colony algorithm. The proposed method integrates an iterative incentive factor with a Levy flying strategy in a dual‐ant colony mechanism, effectively enhancing global search capability and convergence speed. It further constructs a super‐heuristic framework incorporating dynamic pheromone updates and multi‐objective balancing strategies. Simulation results demonstrate that the proposed algorithm achieves optimal performance across seven benchmark instances, with superior hyper‐volume and inverse generation distance values. In large‐scale networks, the algorithm exhibits fast convergence and low computational latency. The conclusion indicates that this method significantly improves path planning quality, efficiency, and multi‐objective balance, providing effective technical support for intelligent logistics scheduling.

Internet Technology LettersVol. 9(3)
Xinyang Agriculture and Forestry University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 22%
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.