Abstract
This paper addresses the use of Genetic Algorithms (GA) in solving the Travelling Salesman Problem (TSP), it compares the results of implementing two different approaches of ‘Order Crossover 1’ genes crossover, the static and the random position approaches, which are used to produce new offspring. By changing three factors; the number of cities, the number of generations and the population size, the goal is to show which approach is better in terms of finding the optimal solution (the shortest path) in as short time as possible as a result of these changes. Besides, it will explore the effect of changing the above factors on finding the optimal solution.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 11th INDIACom |
| Editors | Dr. M.N. Hoda |
| Place of Publication | New Delhi, India |
| Publisher | BVICAM |
| Pages | 1465-1469 |
| Number of pages | 5 |
| ISBN (Electronic) | 9789380544243 |
| Publication status | Published - 8 Mar 2017 |
| Event | 11th INDIACom: 2017 4th International Conference on Computing for Sustainable Global Development - Bharati Vidyapeeth's Institute of Computer Applications and Management (BVICAM), New Delhi, India Duration: 1 Mar 2017 → 3 Mar 2017 Conference number: 40353 |
Conference
| Conference | 11th INDIACom |
|---|---|
| Country | India |
| City | New Delhi |
| Period | 1/03/17 → 3/03/17 |
Fingerprint
Cite this
ALQURA'N ALZYADAT, T., Yamin, M., & CHETTY, G. (2017). Genetic Algorithms for the Travelling Salesman Problem: A Crossover Comparison. In D. M. N. Hoda (Ed.), Proceedings of the 11th INDIACom (pp. 1465-1469). New Delhi, India: BVICAM.