Author
Listed:
- Chou, Jui-Sheng
- Pham, Tran-Bao-Quyen
Abstract
Over the past decade, metaheuristic optimization has garnered substantial attention. Nonetheless, the application of hierarchical strategies to augment the optimization process and enhance adaptability across various problem domains, particularly through the utilization of particle-specific characteristics, remains inadequately explored. This study presents the Agent Assembly Algorithm (A-Cubed), a novel meta-heuristic optimization algorithm inspired by the evolutionary strategies of elite adaptive societies and the collective adaptation of agents. A-Cubed introduces an innovative hierarchical assembly framework that distinctly organizes agent search behavior based on fitness and spatial proximity, marking a departure from conventional meta-heuristics that depend on static or predefined strategies. This framework facilitates dynamic, level-specific control over search behaviors. To bolster this approach, a time-distance adjustment mechanism progressively refines agent movement, thereby promoting an effective balance between global exploration and local exploitation. The efficacy of A-Cubed has been substantiated through four rigorous evaluations: (1) performance testing on 50 mathematical benchmark functions, in comparison with 12 leading meta-heuristic algorithms; (2) assessment on 12 benchmark functions from the IEEE CEC 2022 competition; (3) evaluation of its practicability in three scenarios of truss structure optimization to minimize weights; and (4) application in two topology optimization scenarios aimed at minimizing compliance. A-Cubed has exhibited consistent effectiveness in identifying optimal solutions, managing complex problems with stability, and adapting to diverse numerical optimization challenges. In engineering applications, it has excelled by achieving optimal results with fewer objective function evaluations and a high convergence rate, thereby establishing itself as a highly promising metaheuristic algorithm for optimization tasks. A-Cubed emerges as an efficient technique for addressing a wide array of problems, particularly in complex structural design, due to its ease of implementation and robust adaptability to varying problem characteristics.
Suggested Citation
Chou, Jui-Sheng & Pham, Tran-Bao-Quyen, 2026.
"Advancing hierarchical optimization: A-Cubed algorithm for adaptive agent collaboration,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 240(C), pages 1041-1070.
Handle:
RePEc:eee:matcom:v:240:y:2026:i:c:p:1041-1070
DOI: 10.1016/j.matcom.2025.07.024
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:240:y:2026:i:c:p:1041-1070. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.