The Travel Salesman Problem (Greedy & Genetic algorithm) Matlab Script - Softcover

Inhaltsangabe

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

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.