Genetic Algorithms for the Travelling Salesman Problem

A Crossover Comparison

Tariq ALQURA'N ALZYADAT, Mohammad Yamin, Girija CHETTY

Research output: A Conference proceeding or a Chapter in BookConference contribution

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 languageEnglish
Title of host publicationProceedings of the 11th INDIACom
EditorsDr. M.N. Hoda
Place of PublicationNew Delhi, India
PublisherBVICAM
Pages1465-1469
Number of pages5
ISBN (Electronic)9789380544243
Publication statusPublished - 8 Mar 2017
Event11th 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 20173 Mar 2017
Conference number: 40353

Conference

Conference11th INDIACom
CountryIndia
CityNew Delhi
Period1/03/173/03/17

Fingerprint

Traveling salesman problem
Genes
Genetic algorithms

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.
ALQURA'N ALZYADAT, Tariq ; Yamin, Mohammad ; CHETTY, Girija. / Genetic Algorithms for the Travelling Salesman Problem : A Crossover Comparison. Proceedings of the 11th INDIACom. editor / Dr. M.N. Hoda. New Delhi, India : BVICAM, 2017. pp. 1465-1469
@inproceedings{8a75fae9f20340359a02840a839c54fe,
title = "Genetic Algorithms for the Travelling Salesman Problem: A Crossover Comparison",
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.",
keywords = "Genetic Algorithms , Machine Learning, Travelling Salesman Problem",
author = "{ALQURA'N ALZYADAT}, Tariq and Mohammad Yamin and Girija CHETTY",
year = "2017",
month = "3",
day = "8",
language = "English",
pages = "1465--1469",
editor = "Hoda, {Dr. M.N.}",
booktitle = "Proceedings of the 11th INDIACom",
publisher = "BVICAM",

}

ALQURA'N ALZYADAT, T, Yamin, M & CHETTY, G 2017, Genetic Algorithms for the Travelling Salesman Problem: A Crossover Comparison. in DMN Hoda (ed.), Proceedings of the 11th INDIACom. BVICAM, New Delhi, India, pp. 1465-1469, 11th INDIACom, New Delhi, India, 1/03/17.

Genetic Algorithms for the Travelling Salesman Problem : A Crossover Comparison. / ALQURA'N ALZYADAT, Tariq; Yamin, Mohammad; CHETTY, Girija.

Proceedings of the 11th INDIACom. ed. / Dr. M.N. Hoda. New Delhi, India : BVICAM, 2017. p. 1465-1469.

Research output: A Conference proceeding or a Chapter in BookConference contribution

TY - GEN

T1 - Genetic Algorithms for the Travelling Salesman Problem

T2 - A Crossover Comparison

AU - ALQURA'N ALZYADAT, Tariq

AU - Yamin, Mohammad

AU - CHETTY, Girija

PY - 2017/3/8

Y1 - 2017/3/8

N2 - 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.

AB - 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.

KW - Genetic Algorithms

KW - Machine Learning

KW - Travelling Salesman Problem

M3 - Conference contribution

SP - 1465

EP - 1469

BT - Proceedings of the 11th INDIACom

A2 - Hoda, Dr. M.N.

PB - BVICAM

CY - New Delhi, India

ER -

ALQURA'N ALZYADAT T, Yamin M, CHETTY G. Genetic Algorithms for the Travelling Salesman Problem: A Crossover Comparison. In Hoda DMN, editor, Proceedings of the 11th INDIACom. New Delhi, India: BVICAM. 2017. p. 1465-1469