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) 153
node where it is located. The probabilistic selection is biased by the
pher
omone trials previously deposited on the graph by other ants. In
general, on each iteration or epoch all ants build a path to the destiny
node, the probabilistic formula for the next node selection is given by
(7.2.1),
݌
௜௝
೔ೕ
σ
೔ೕ
ೕאಿ
݆אܰ
Ͳ݆בܰ
(7.2.1)
where N
i
k
is the set of feasible nodes connected to the node i with respect
to ant k;
V
C
ij
is the total pheromone concentration of the link (i, j), and
C
is a positive constant used as gain for the pheromone ...
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