Finding and proving the optimum : cooperative stochastic and deterministic search - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Finding and proving the optimum : cooperative stochastic and deterministic search

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.
Fichier principal
Vignette du fichier
401.pdf (231.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00938712 , version 1 (24-04-2014)

Identifiers

  • HAL Id : hal-00938712 , version 1

Cite

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. ⟨hal-00938712⟩
193 View
272 Download

Share

Gmail Facebook X LinkedIn More