Please use this identifier to cite or link to this item: 192.168.6.56/handle/123456789/48958
Full metadata record
DC FieldValueLanguage
dc.contributor.authorA. P ́etrowski, J. Dr ́eo-
dc.date.accessioned2019-02-28T07:12:55Z-
dc.date.available2019-02-28T07:12:55Z-
dc.date.issued2003-
dc.identifier.isbn13 978-3-540-23022--
dc.identifier.urihttp://10.6.20.12:80/handle/123456789/48958-
dc.descriptionEach one of these metaheuristics is actually a family of methods, of which we try to discuss the essential elements. Some common features clearly appear in most metaheuristics, such as the use of diversification, to force the exploration of regions of the search space, rarely visited until now, and the use of intensification, to go thoroughly into some promising regions.en_US
dc.languageenen_US
dc.language.isoenen_US
dc.publisherSpringer Science+Business Media, LLCen_US
dc.subjectGenetic Algorithms, Ant Coloniesen_US
dc.titleMetaheuristicsfor Hard Optimization Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,en_US
dc.typeBooken_US
Appears in Collections:Education Planning & Management(EDPM)

Files in This Item:
File Description SizeFormat 
6..pdf4.57 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.