New genetic operator for solving the travelling salesman problem / Fadzilawani Astifar Alias ... [et al.]
The Travelling Salesman Problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest distance tour that visits each city in a given list exactly once and then returns to the starting city. TSP is an NP-complete problem that has many interaction var...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Book |
| Published: |
Universiti Teknologi MARA, Pulau Pinang,
2015.
|
| Subjects: | |
| Online Access: | Link Metadata |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!