Embedding branch and bound within evolutionary algorithms

DOI10.1023/A:1021934325079zbMath1040.68142MaRDI QIDQ1405381

Carlos Cotta, José M. Troya

Publication date: 25 August 2003

Published in: Applied Intelligence (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmrecombinationevolutionary algorithmshybridization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (11)

Local search-based hybrid algorithms for finding Golomb rulers ⋮ Evolutionary hybrid approaches for generation scheduling in power systems ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Iterative patching and the asymmetric traveling salesman problem ⋮ Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery ⋮ A BRANCH-AND-BOUND ALGORITHM FOR A PSEUDO-BOOLEAN OPTIMIZATION PROBLEM WITH BLACK-BOX FUNCTIONS ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Scatter search with path relinking for phylogenetic inference

Uses Software

• Genocop

This page was built for publication: Embedding branch and bound within evolutionary algorithms