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: | , , , , , |
|---|---|
| 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!
|