Choix de noeud dans un algorithme de Branch and Bound sur intervalles

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya

Resultado de la investigación: Contribución a una conferenciaArtículorevisión exhaustiva

Resumen

We present in this article new strategies for selecting nodes in interval Branch and Bound algorithms for constrained global optimization. The standard best-first strategy selects a node with the lowest lower bound of the objective estimate. We first propose 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 contracting operators leads to a good performance of the criterion. We propose another strategy that also makes a tradeoff between diversification and intensification by greedily diving into potential feasible regions at each node of the best-first search. These new strategies obtain better experimental results than classical best-first search on difficult constrained global optimization instances.

Título traducido de la contribuciónNode selection in interval Branch and Bound algorithms
Idioma originalFrancés
Páginas236-245
Número de páginas10
EstadoPublicada - 2015
Publicado de forma externa
Evento11th French Speaking Symposium on Constraint Programming, JFPC 2015 - Bordeaux, Francia
Duración: 22 jun. 201524 jun. 2015

Conferencia

Conferencia11th French Speaking Symposium on Constraint Programming, JFPC 2015
País/TerritorioFrancia
CiudadBordeaux
Período22/06/1524/06/15

Huella

Profundice en los temas de investigación de 'Choix de noeud dans un algorithme de Branch and Bound sur intervalles'. En conjunto forman una huella única.

Citar esto