- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Hybrid Ant Colony Optimization Algorithm to Solve Assignment Problem by Hungarian Method | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 14, Volume 6, Issue 2, 2009, Pages 159-175 PDF (436.75 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2009.163805 | ||
| Author | ||
| Isra N. Alkallak | ||
| Computer Unit College of Medicine University of Mosul, Mosul, Iraq | ||
| Abstract | ||
| This research studied ant colony optimization with optimization problem as an assignment model problem by Hungarian method. The proposed heuristic algorithm simulate ant colony optimization algorithm with Hungarian method for Assignment problem. The ant colony optimization algorithm simulates the behavior of real ant colony, to find the shortest path between many paths for solving the problem. It dependent on the path from the nest (problem of research) to food (optimal solution) by deposited pheromone on the path they take between the nest and food, so that other ants can smell it. The experiment in this research shows that the algorithm provides optimal solution. It has outperforms with computation and it is an effective approach and the algorithm performs significantly better than the classical method, to reduce the region of the space considered and computation as compared to the classical methods. | ||
| Keywords | ||
| Ant colony Algorithm; Assignment Problem | ||
|
Statistics Article View: 403 PDF Download: 343 |
||