Agárdi, Anita (2025) Efficiency analysis comparison of the Particle Swarm Optimization and Tabu Search in Flow Shop Scheduling Problem. In: Proceedings of the International Conference on Formal Methods and Foundations of Artificial Intelligence. Eszterházy Károly Katolikus Egyetem Líceum Kiadó, Eger, pp. 4-13. ISBN 9789634963035
|
Text
fmfai2025_pp004-013.pdf - Published Version Download (613kB) | Preview |
Abstract
The paper investigates the efficiency of two metaheuristic algorithms, the Particle Swarm Optimization and the Tabu Search, on the FlowShop Scheduling Problem. Particle Swarm Optimization is a population algorithm. The algorithm maintains a population of solutions. It improvesthe population during the iteration. Tabu Search improves a single possiblesolution. The paper presents the efficiency of the algorithms on a benchmarkdataset and compares it with results published by other researchers.
| Item Type: | Book Section |
|---|---|
| Additional Information: | International Conference on Formal Methods and Foundations of Artificial Intelligence, Eger, June 5–7, 2025 |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 30 Oct 2025 14:46 |
| Last Modified: | 30 Oct 2025 14:46 |
| URI: | https://real.mtak.hu/id/eprint/227764 |
Actions (login required)
 |
Edit Item |
