Code: 06817016
In this book a generic library of efficientmetaheuristics for combinatorial optimization ispresented. In the version at hand classes thatfeature local search, simulated annealing, tabusearch, guided local search and greedy randomi ... more
English
48.92 €
RRP: 49.94 €
You save 1.02 €

You get 118 loyalty points
Book synopsis
In this book a generic library of efficientmetaheuristics for combinatorial optimization ispresented. In the version at hand classes thatfeature local search, simulated annealing, tabusearch, guided local search and greedy randomizedadaptive search procedure were implemented.Most notably a generic implementation features theadvantage that the problem dependent classes andmethods only need to be realized once withouttargeting a specific algorithm because these parts ofthe source code are shared among all presentalgorithms contained in EAlib.This main advantage is then exemplary demonstratedwith the quadratic assignment problem. The sourcecode of the QAP example can also be used as ancommented reference for future problems.Concluding the experimental results of the individualmetaheuristics reached with the presentedimplementation are presented.
Book details
Book category Books in English Computing & information technology Computer science
48.92 €
English
Collection points Bratislava a 13230 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
26464 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )