GOA-ACO: A goose optimized ant colony algorithm for the automated guided vehicle path planning

This article proposes a goose optimized ant colony algorithm (GOA-ACO) to enhance the quality and efficiency of path optimization for Automated Guided Vehicle(AGV) in intelligent production environments. By integrating initialized parameters, the fixed parameters of the ant colony optimization algorithm(ACO) are replaced with a dynamic adjustment mechanism optimized via the goose optimization algorithm (GOA), while a sound propagation model is introduced to construct a hybrid initial solution space. In each iteration, the pheromone utilization coefficient and heuristic weight of the ACO are adjusted through the single leg balance strategy(SLBS) optimized by the GOA, thereby achieving dynamic parameter collaborative updating. An embedded inspired wake-up mechanism is incorporated into the ant path search process, and random perturbation strategy(RPS) are added to the probability formula to enhance the diversity of path selection probabilities. Furthermore, the dimension scaling factor of the GOA is employed to dynamically compress the search space, which improves the optimization efficiency and convergence speed for high-dimensional problems. Experimental results indicate that the proposed GOA-ACO achieves significant improvements in path planning performance compared to benchmark algorithms, while demonstrating stronger adaptability to practical AGV operating environments.

Institutions

Publication Details

Journal
Alexandria Engineering Journal
Published
2025-09-27
DOI
https://doi.org/10.1016/j.aej.2025.09.036
Citations
2
Primary Topic
Agricultural Research and Practices
Type
article
Field-Weighted Citation Impact
9.66
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GOA-ACO: A goose optimized ant colony algorithm for the automated guided vehicle path planning

2 citations
Alexandria Engineering Journal
Agricultural Research and Practices
9.66
article

GOA-ACO: A goose optimized ant colony algorithm for the automated guided vehicle path planning

article en
2 citations

Abstract

This article proposes a goose optimized ant colony algorithm (GOA-ACO) to enhance the quality and efficiency of path optimization for Automated Guided Vehicle(AGV) in intelligent production environments. By integrating initialized parameters, the fixed parameters of the ant colony optimization algorithm(ACO) are replaced with a dynamic adjustment mechanism optimized via the goose optimization algorithm (GOA), while a sound propagation model is introduced to construct a hybrid initial solution space. In each iteration, the pheromone utilization coefficient and heuristic weight of the ACO are adjusted through the single leg balance strategy(SLBS) optimized by the GOA, thereby achieving dynamic parameter collaborative updating. An embedded inspired wake-up mechanism is incorporated into the ant path search process, and random perturbation strategy(RPS) are added to the probability formula to enhance the diversity of path selection probabilities. Furthermore, the dimension scaling factor of the GOA is employed to dynamically compress the search space, which improves the optimization efficiency and convergence speed for high-dimensional problems. Experimental results indicate that the proposed GOA-ACO achieves significant improvements in path planning performance compared to benchmark algorithms, while demonstrating stronger adaptability to practical AGV operating environments.

Alexandria Engineering JournalVol. 130
China Tobacco (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 2%
Agricultural Research and Practices
9.66
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.