Tipsa dina vänner om produkten:
The Travel Salesman Problem (Greedy & Genetic algorithm) Matlab Script Zain Ul Abdain
Pris
SEK 229
Beställningsvara
Förväntad leverans 26 nov - 10 dec
Julklappar kan bytas fram till 31:e januari
Få avisering om nya utgåvor med Zain Ul Abdain
Lägg till din iMusic-önskelista
eller
The Travel Salesman Problem (Greedy & Genetic algorithm) Matlab Script
Zain Ul Abdain
The traveling salesman problem consists of a salesman and a set of cities. The salesman has to visit each one of the cities starting from a certain one and returning to the same city. The challenge of the problem is that the traveling salesman wants to minimize the total length of the trip. This book is about the Travel Salesman Problem (TSP) in which two algorithm are discussed with example and Matlab Simulation Codes and Script.* Greedy Algorithm * Genetic Algorithm
42 pages
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 24 januari 2020 |
| ISBN13 | 9798603748931 |
| Antal sidor | 42 |
| Mått | 178 × 254 × 3 mm · 117 g |
| Språk | Engelska |