เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Agent-Based Genetic Algorithm× | Multi-Objective Genetic Algorithm (MOGA)× | |
|---|---|---|
| สาขาวิชา | การจำลอง | การจำลอง |
| ตระกูล | Process / pipeline | Process / pipeline |
| ปีกำเนิด≠ | 1990s | 1984 |
| ผู้ริเริ่ม≠ | Adamidis, P. & Petridis, V. (early formal treatment); broader community development in 1990s | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) |
| ประเภท≠ | Hybrid evolutionary-agent simulation | Population-based evolutionary optimizer |
| แหล่งต้นตำรับ≠ | Adamidis, P., & Petridis, V. (1996). Co-operating populations with different evolution behaviors. Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1996), 188-191. IEEE. link ↗ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 |
| ชื่อเรียกอื่น | ABGA, Agent-Based GA, Multi-Agent Genetic Algorithm, Distributed Agent GA | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO |
| ที่เกี่ยวข้อง≠ | 5 | 4 |
| สรุป≠ | An Agent-Based Genetic Algorithm (ABGA) partitions a genetic algorithm's population across a network of autonomous agents, each maintaining a local sub-population and evolving it independently. Agents periodically exchange individuals (migration) based on proximity or communication rules, enabling parallel exploration of the search space while preserving population diversity and avoiding premature convergence. | A Multi-Objective Genetic Algorithm (MOGA) is an evolutionary computation method that evolves a population of candidate solutions toward a Pareto-optimal front, simultaneously optimizing two or more conflicting objective functions. It avoids collapsing trade-offs into a single score, instead producing a set of non-dominated solutions for the decision-maker to choose among. |
| ScholarGateชุดข้อมูล ↗ |
|
|