Swarm Intelligence-Based Algorithms for Distributed Problem Solving in AI: A Comprehensive Analysis of Ant Colony Optimization and Particle Swarm Optimization with Novel Collective Intelligence Models

collective behaviour of social insects and animal groups to solve complex distributed problems. This comprehensive research paper presents an in-depth analysis of two prominent SI algorithms—Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO)—and introduces innovative collective intelligence models that enhance their capabilities. Our investigation combines theoretical analysis with empirical evaluation across multiple problem domains, including routing optimization, function approximation, and multi-objective decision-making. Through a series of controlled experiments and comparative studies, we demonstrate that while ACO exhibits superior performance in discrete optimization problems (achieving an average of 23.7% better convergence in TSP instances compared to traditional algorithms), PSO excels in continuous optimization spaces (demonstrating 31.4% faster convergence in benchmark functions). The paper introduces a novel hybrid approach termed "Adaptive Collective Intelligence Framework" (ACIF) that dynamically integrates ACO and PSO mechanisms based on problem characteristics, resulting in a 17.8% performance improvement over standalone implementations. Our findings also reveal critical insights into parameter sensitivity, convergence properties, and scalability limitations of these algorithms. Statistical analysis across 500 experimental runs confirms the significance of our results (p < 0.01) and validates the robustness of our proposed models. This research contributes to the field by (1) providing a comprehensive comparative framework for SI algorithms, (2) identifying key factors affecting their performance in distributed environments, and (3) proposing innovative collective intelligence models that address existing limitations. The implications of this work extend to various domains including robotics, telecommunications, logistics, and distributed computing systems.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-26
DOI
https://doi.org/10.5281/zenodo.19230465
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Swarm Intelligence-Based Algorithms for Distributed Problem Solving in AI: A Comprehensive Analysis of Ant Colony Optimization and Particle Swarm Optimization with Novel Collective Intelligence Models

Akhilesh Ghritlahare
Zenodo (CERN European Organization for Nuclear Research)
Metaheuristic Optimization Algorithms Research
article

Swarm Intelligence-Based Algorithms for Distributed Problem Solving in AI: A Comprehensive Analysis of Ant Colony Optimization and Particle Swarm Optimization with Novel Collective Intelligence Models

Akhilesh Ghritlahare
article en

Abstract

collective behaviour of social insects and animal groups to solve complex distributed problems. This comprehensive research paper presents an in-depth analysis of two prominent SI algorithms—Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO)—and introduces innovative collective intelligence models that enhance their capabilities. Our investigation combines theoretical analysis with empirical evaluation across multiple problem domains, including routing optimization, function approximation, and multi-objective decision-making. Through a series of controlled experiments and comparative studies, we demonstrate that while ACO exhibits superior performance in discrete optimization problems (achieving an average of 23.7% better convergence in TSP instances compared to traditional algorithms), PSO excels in continuous optimization spaces (demonstrating 31.4% faster convergence in benchmark functions). The paper introduces a novel hybrid approach termed "Adaptive Collective Intelligence Framework" (ACIF) that dynamically integrates ACO and PSO mechanisms based on problem characteristics, resulting in a 17.8% performance improvement over standalone implementations. Our findings also reveal critical insights into parameter sensitivity, convergence properties, and scalability limitations of these algorithms. Statistical analysis across 500 experimental runs confirms the significance of our results (p < 0.01) and validates the robustness of our proposed models. This research contributes to the field by (1) providing a comprehensive comparative framework for SI algorithms, (2) identifying key factors affecting their performance in distributed environments, and (3) proposing innovative collective intelligence models that address existing limitations. The implications of this work extend to various domains including robotics, telecommunications, logistics, and distributed computing systems.

Zenodo (CERN European Organization for Nuclear Research)
State University of Semarang (ID)
Peace, Justice and strong institutions
Openalex Percentile: Top 12%
Metaheuristic Optimization Algorithms Research
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.

Swarm Intelligence-Based Algorithms for Distributed Problem Solving in AI: A Comprehensive Analysis of Ant Colony Optimization and Particle Swarm Optimization with Novel Collective Intelligence Models — Akhilesh Ghritlahare · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS