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
"synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798603748931
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798603748931
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9798603748931_new
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. Seller Inventory # 599423738
Quantity: Over 20 available