Embedding Branch and Bound within Evolutionary Algorithms
Authors:
- 1 March 2003
- journal article
- Published by Springer Nature in Applied Intelligence
- Vol. 18 (2) , 137-153
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Using a Hybrid Evolutionary-A* Approach for Learning Reactive Behaviours2000
- Tackling Epistatic Problems Using Dynastically Optimal RecombinationLecture Notes in Computer Science, 1999
- Utilizing dynastically optimal forma recombination in hybrid genetic algorithms1998
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Evolutionary Algorithms in Theory and Practice1996
- Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP1995
- The algebra of genetic algorithmsAnnals of Mathematics and Artificial Intelligence, 1994
- Genetic algorithms with multi-parent recombination1994
- Genetic Algorithms + Data Structures = Evolution Programs1992
- Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of organic evolutionAnnals of Operations Research, 1984