Skip to Main Content
High Performance Programming for Soft Computing
book

High Performance Programming for Soft Computing

by Oscar Montiel Ross, Roberto Sepulveda
February 2014
Intermediate to advanced content levelIntermediate to advanced
376 pages
11h 49m
English
CRC Press
Content preview from High Performance Programming for Soft Computing
182 High Performance Programming for Soft Computing
8.3 Ant Colony Optimization for Hole Making NC Sequences:
A Special Case of the Traveling Salesman Problem (TSP)
The TSP problem (M. Dorigo 1997a,b) is the problem of a salesman who,
starting from his hometown, wants to fi nd a shortest tour that takes him
through a given set of customer cities and then back home, visiting each
customer city exactly once. The TSP can be represented by a completed
weighted graph G = (N, A) with N being the set of nodes representing the
cities, and A being the set of arcs. Each arc (i,j) ¢ A has an assigned value
(length) d
ij
which is the distance between cities ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Soft Computing and Its Applications, Volume One

Soft Computing and Its Applications, Volume One

Kumar S. Ray
Point-Based Graphics

Point-Based Graphics

Markus Gross, Hanspeter Pfister

Publisher Resources

ISBN: 9781466586017