- 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
Optimize TSP using Ant Colony System using Java | ||
| JURNAL OF MADENAT ALELEM COLLEGE | ||
| Article 1, Volume 5, Issue 1, 2013, Pages 117-124 | ||
| Authors | ||
| Shatha Habeeb; Zainab Sadiq | ||
| Abstract | ||
| The travelling salesman problem (TSP) probably is the most prominent problem in combinatorial optimization. It is simple definition along with its notorious difficulty has stimulated many efforts to find an efficient algorithm. In this research use Ant Colony System to solving TSP and generating good solutions to both. The work has been extended to calculate the correlation coefficient between the number of nodes and number of iterations. | ||
| Keywords | ||
| Tsp; Ant Colony System | ||
|
Statistics Article View: 26 PDF Download: 8 |
||