Node Selection Heuristics Using the Upper Bound in Interval Branch and Bound - École des Ponts ParisTech Access content directly
Conference Papers Year : 2014

Node Selection Heuristics Using the Upper Bound in Interval Branch and Bound

Abstract

We present in this article a new strategy for selecting the current node in an interval Branch and Bound algorithm for constrained global optimization. The standard best-first strategy selects the node with the lowest lower bound of the objective estimate. We propose in this article new node selection policies where an upper bound of each node/box is also taken into account. The good accuracy of this upper bound achieved by several operators leads to a good performance of the criterion. These new strategies obtain better experimental results than classical best-first search on difficult instances.
Fichier principal
Vignette du fichier
17-MAGO.pdf (231.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01077483 , version 1 (24-10-2014)

Identifiers

  • HAL Id : hal-01077483 , version 1

Cite

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya. Node Selection Heuristics Using the Upper Bound in Interval Branch and Bound. MAGO-GOW: Global Optimization Workshop, Sep 2014, Malaga, Spain. ⟨hal-01077483⟩
418 View
571 Download

Share

Gmail Facebook Twitter LinkedIn More