par Zlochin, Mark ;Dorigo, Marco
Référence Lecture notes in computer science, 2439, page (651-661)
Publication Publié, 2002
Article révisé par les pairs
Résumé : In this paper we introduce model-based search as a unifying framework accommodating some recently proposed heuristics for combinatorial optimization such as ant colony optimization, stochastic gradient ascent, cross-entropy and estimation of distribution methods. We discuss similarities as well as distinctive features of each method, propose some extensions and present a comparative experimental study of these algorithms.

Documents en relation

DI-fusion