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...
Bewaard in:
Hoofdauteurs: | , , , |
---|---|
Formaat: | Boek |
Gepubliceerd in: |
Universiti Teknologi MARA, Pulau Pinang,
2015.
|
Onderwerpen: | |
Online toegang: | Link Metadata |
Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
Wees de eerste die reageert!