- 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
Three Genetic Solutions for Travel Salesman problem | ||
| Journal of Al-Qadisiyah for Computer Science and Mathematics | ||
| Article 1, Volume 1, Issue 1, 2009, Pages 1-6 PDF (0 K) | ||
| Author | ||
| Hanan A | ||
| Abstract | ||
| The classic Traveling Salesman Problem (TSP) has been frequently used as a test bed for the study of new local search techniques developed for general circuit-based permutation problems, local search heuristics for the traveling salesman problem (TSP) is chiefly based on algorithms using the classical Lin-Kernighan (L-K) procedure, La Lena simple genetic algorithm. This work give a detailed description of the three genetic solutions for this problem and found that genetic algorithms different in behavior according to the tour length. | ||
|
Statistics Article View: 127 PDF Download: 113 |
||