Next Article in Journal
Evolutionary Game of Medical Knowledge Sharing Among Chinese Hospitals Under Government Regulation
Previous Article in Journal
Shifting the Burden: Corporate Indigenous Relations and How They Can Go Wrong
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Hybrid Genetic Algorithm and Proximal Policy Optimization System for Efficient Multi-Agent Task Allocation

Department of Vehicle Engineering, Rocket Force University of Engineering, Xi’an 710025, China
*
Author to whom correspondence should be addressed.
Systems 2025, 13(6), 453; https://doi.org/10.3390/systems13060453
Submission received: 18 February 2025 / Revised: 25 May 2025 / Accepted: 3 June 2025 / Published: 9 June 2025
(This article belongs to the Section Artificial Intelligence and Digital Systems Engineering)

Abstract

Efficient task allocation remains a fundamental challenge in multi-agent systems, particularly under resource constraints and large-scale deployments. Classical methods, including market-based mechanisms, centralized optimization techniques, and game-theoretic strategies, have been widely applied to address the multi-agent task allocation problem. While effective in small-to-medium-sized settings, these approaches often encounter limitations in terms of scalability, adaptability to dynamic environments, and computational efficiency as the problem size increases. To address these limitations, this study introduces a proximal policy optimization system augmented with a genetic algorithm (GAPPO) that integrates evolutionary search with deep reinforcement learning. GAPPO enables agents to develop energy-efficient task allocation strategies by perceiving environmental states and optimizing their actions through iterative policy updates. The genetic component promotes broader policy exploration beyond local optima, while the proximal policy optimization ensures update stability and sample efficiency. To evaluate the proposed GAPPO algorithm, extensive simulations are conducted across four scenarios, with the largest involving 50 tasks and 500 agents. The results demonstrate that GAPPO achieves superior performance compared to baseline methods, particularly in reducing task completion time. These findings highlight the algorithm’s robustness and efficiency in handling large-scale and computationally intensive coordination tasks.
Keywords: genetic algorithm; multi-agent systems; proximal policy optimization; reinforcement learning; task allocation genetic algorithm; multi-agent systems; proximal policy optimization; reinforcement learning; task allocation

Share and Cite

MDPI and ACS Style

Zhu, Z.; Yu, C.; Wang, J. A Hybrid Genetic Algorithm and Proximal Policy Optimization System for Efficient Multi-Agent Task Allocation. Systems 2025, 13, 453. https://doi.org/10.3390/systems13060453

AMA Style

Zhu Z, Yu C, Wang J. A Hybrid Genetic Algorithm and Proximal Policy Optimization System for Efficient Multi-Agent Task Allocation. Systems. 2025; 13(6):453. https://doi.org/10.3390/systems13060453

Chicago/Turabian Style

Zhu, Zimo, Chuanqiang Yu, and Junti Wang. 2025. "A Hybrid Genetic Algorithm and Proximal Policy Optimization System for Efficient Multi-Agent Task Allocation" Systems 13, no. 6: 453. https://doi.org/10.3390/systems13060453

APA Style

Zhu, Z., Yu, C., & Wang, J. (2025). A Hybrid Genetic Algorithm and Proximal Policy Optimization System for Efficient Multi-Agent Task Allocation. Systems, 13(6), 453. https://doi.org/10.3390/systems13060453

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop