arrow
Return

Obstacle-Aware Multi-Target Routing for Campus Logistics Using an Improved Mayfly Optimization Algorithm

delete2026-09-07
delete0
delete
OA
AI
Z
Ze Yang
X
Xinyi Cheng
H
Haomin Wang *
DOI:10.3390/su18179138delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Autonomous mobile robots are increasingly considered for campus delivery and service logistics, where route efficiency can reduce unnecessary travel under spatial constraints. This study develops an obstacle-aware routing framework that combines a 1 m occupancy grid, A* shortest-path computation, and an Improved Mayfly Optimization Algorithm (IMOA). The A* stage constructs a pairwise distance matrix using orthogonal costs of 1, diagonal costs of 2 , an octile heuristic, and a no-corner-cutting rule; IMOA then optimizes the closed visiting order through random-key decoding, elite 2-opt, and stagnation handling. Validation comprises ten independent benchmark instances, the fixed G40 scenario, and a campus-derived G-real application. Under a common budget of 50,000 full-tour evaluations and 30 independent runs, a Friedman test detected overall differences across the ten instances (χ2(7) = 66.2488, p = 8.434 × 10−12). After Holm correction, IMOA significantly outperformed GA, PSO, GWO, ACO, and MOA, showed no significant difference from MS2OPT, and had a worse average rank than the deterministic LKH reference, which achieved the best overall rank. On G-real, IMOA obtained a median distance of 8178.37 m, compared with 8223.99 m for MS2OPT; this difference was not significant, while LKH achieved the lowest deterministic cost of 8076.46 m. A three-instance exploratory ablation ranked IMOA first and consistently identified elite 2-opt as the principal observed improvement source; component-level inference remains exploratory because only three instances were available. These findings establish routing-efficiency gains under the evaluated protocol. Such gains may support more resource-efficient campus logistics, but energy consumption and carbon emissions were not evaluated.
Keywords:
campus logistics
autonomous mobile robots
obstacle-aware routing
traveling salesman problem
swarm intelligence

Journal

Sustainability cover
Sustainability
IF:
3.3
Papers:
10.7W
Citations:
28.4W

Organization

S
southwestern university of finance and economics
Scholars:
648
Papers: 385
Citations: 0
Cited Papers

Cited Papers

Grey Wolf Optimizer
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
errShare
errSave
A comprehensive survey on the generalized traveling salesman problem
err2024-05-01
err37
errOAAI
errPop, Petrica C.; Cosma, Ovidiu; Sabo, Cosmin; Sitar, Corina Pop
errShare
errSave
Dynamic Parameter Encoding for Genetic Algorithms
err1992-06-01
err0
PREAI
errSchraudolph,Nicol N.; Belew,Richard K.
errShare
errSave
A machine learning optimization approach for last-mile delivery and third-party logistics
err2023-09-01
err16
errOAAI
errBruni, Maria Elena; Fadda, Edoardo; Fedorov, Stanislav; Perboli, Guido
errShare
errSave
A review: On path planning strategies for navigation of mobile robot
err2019-08-01
err535
errOAAI
errPatle, B. K.; Babu, Ganesh L.; Pandey, Anish; Parhi, D. R. K.; Jagadeesh, A.
errShare
errSave
Modified Mayfly Algorithm for UAV Path Planning
errDRONES
IF4.8
err2022-05-23
err43
errOAAI
errWang, Xing; Pan, Jeng-Shyang; Yang, Qingyong; Kong, Lingping; Snasel, Vaclav; Chu, Shu-Chuan
errShare
errSave
Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems
err2023-01-01
err18
errOAAI
errZheng, Jiongzhi; He, Kun; Zhou, Jianrong; Jin, Yan; Li, Chu-Min
errShare
errSave
researcher View more