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
Ant Colony Optimization (Past, Present and Future)Ant Colony Optimization (Past, Present and Future) 163
7.9 ANTS
The Approximate Nondeterministic Tree Search (ANTS) was proposed in 1999
by (Maniezzo 1998); the name derives from the fact that the proposed
algorithm can be extended in a straightforward way to a branch & bound
procedure (Bertsekas 1995).
ANTS is based on the use of heuristic values derived from domain
knowledge a priori, but computes lower bounds on completing a partial
solution after temporarily adding a node (i,j
1
), and it uses all these lower
bounds of (i,j
1
) to (i,j
n
), with n the number of neighbors, as heuristic values.
The ...
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