Finding and proving the optimum : cooperative stochastic and deterministic search

Jean-Marc Alliot 1 Nicolas Durand 1, 2 David Gianazza 1, 2 Jean-Baptiste Gotteland 1, 2
1 IRIT - Institut de recherche en informatique de Toulouse
2 MAIAA - ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien
Abstract : In this article, we introduce a global cooperative approach between an Interval Branch and Bound Algorithm and an Evolutionary Algorithm, that takes advantage of both methods to optimize a function for which an inclusion function can be expressed. The Branch and Bound algorithm deletes whole blocks of the search space whereas the Evolutionary Algorithm looks for the optimum in the remaining space and sends to the IBBA the best evaluation found in order to improve its Bound. The two algorithms run independently and update common information through shared memory. The cooperative algorithm prevents premature and local convergence of the evolutionary algorithm, while speeding up the convergence of the branch and bound algorithm. Moreover, the result found is the proved global optimum. In part 1, a short background is introduced. Part 2.1 describes the basic Interval Branch and Bound Algorithm and part 2.2 the Evolutionary Algorithm. Part 3 introduces the cooperative algorithm and part 4 gives the results of the algorithms on benchmark functions. The last part concludes and gives suggestions of avenues of further research.
Type de document :
Communication dans un congrès
ECAI 2012, 20th European Conference on Artificial Intelligence, Aug 2012, Montpellier, France. pp xxxx, 2012
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
https://hal-enac.archives-ouvertes.fr/hal-00938712
Contributeur : Laurence Porte <>
Soumis le : jeudi 24 avril 2014 - 15:17:30
Dernière modification le : mercredi 12 septembre 2018 - 17:46:02
Document(s) archivé(s) le : jeudi 24 juillet 2014 - 10:37:37

Fichier

401.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00938712, version 1

Collections

MAIAA | MAIAA-OPTIM | INSMI | UNIV-TLSE2 | UNIV-TLSE3 | ENAC | TDS-MACS | SMS

Citation

Jean-Marc Alliot, Nicolas Durand, David Gianazza, Jean-Baptiste Gotteland. Finding and proving the optimum : cooperative stochastic and deterministic search. ECAI 2012, 20th European Conference on Artificial Intelligence, Aug 2012, Montpellier, France. pp xxxx, 2012. 〈hal-00938712〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

380

Téléchargements de fichiers

238

Picto

Contact  : publications@enac.fr