ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

אופטימיזציית מושבת נמלים מבוססת סוכנים×אופטימיזציית נחיל חלקיקים (PSO)×
תחוםסימולציהאופטימיזציה
משפחהProcess / pipelineProcess / pipeline
שנת המקור1992-20041995
הוגה השיטהDorigo, M. and colleagues; agent-based framing developed in swarm intelligence community
סוגMetaheuristic optimization — agent-based swarm simulationPopulation-based metaheuristic / swarm intelligence
מקור מכונןDorigo, M., Stutzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA. ISBN: 9780262042192Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
כינוייםAB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACOPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
קשורות56
תקצירAgent-Based Ant Colony Optimization (AB-ACO) models individual ants as autonomous agents that probabilistically construct solutions by following and depositing pheromone trails on a search graph. By coupling agent-level behavioral rules with a shared pheromone environment, the collective system converges on high-quality solutions to hard combinatorial and simulation-embedded optimization problems without central coordination.Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Agent-based ant colony optimization · Particle Swarm Optimization. אוחזר בתאריך 2026-06-17 מתוך https://scholargate.app/he/compare