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 an...
Saved in:
Main Authors: | Hossain, Md. Sabir, Tanim, Ahsan Sadee, Choudhury, Sadman Sakib, Hayat, S. M. Afif Ibne, M. Nomani, Kabir, Islam, Mohammad Mainul |
---|---|
Format: | Article |
Language: | English |
Published: |
Politeknik Elektronika Negeri Surabaya
2019
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/27534/1/An%20Efficient%20Solution%20to%20Travelling%20Salesman%20Problem.pdf http://umpir.ump.edu.my/id/eprint/27534/ https://doi.org/10.24003/emitter.v7i2.380 https://doi.org/10.24003/emitter.v7i2.380 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996) -
The retrace traveling salesman problem : a new extension of traveling salesman problem
by: Arbain, Juraidawati
Published: (2003) -
Modified reactive tabu search for the symmetric traveling salesman problems
by: Lim, Yai Fung, et al.
Published: (2013) -
Optimization of travelling salesman problem with precedence constraint using modified GA encoding
by: M. F. F., Ab Rashid, et al.
Published: (2018) -
Study on genetic algorithm and heuristic method for solving traveling salesman problem
by: Sze , San Nah
Published: (2004)