An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator

An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator

The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given set of cities and distance. This paper proposes a...

Full description

Bibliographic Details
Main Authors: Md. Sabir Hossain, Ahsan Sadee Tanim, Sadman Sakib Choudhury, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Mohammad Mainul Islam
Format: Article
Language:English
Published: Politeknik Elektronika Negeri Surabaya 2019-12-01
Series:Emitter: International Journal of Engineering Technology
Subjects:
Traveling Salesman Problem
Crossover Operator
Minimal Weight Variable
Genetic Algorithm
Online Access:https://emitter.pens.ac.id/index.php/emitter/article/view/380

Internet

https://emitter.pens.ac.id/index.php/emitter/article/view/380

Similar Items