A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Fine-grained parallel genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Intelligence through simulated evolution: forty years of evolutionary programming
Intelligence through simulated evolution: forty years of evolutionary programming
Memetic algorithms: a short introduction
New ideas in optimization
On the influence of the representation granularity in heuristic forma recombination
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Utilizing Dynastically Optimal Forma Recombination in Hybrid Genetic Algorithms
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Genetic algorithms with multi-parent recombination
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Genetic forma recombination in permutation flowshop problems
Evolutionary Computation
On the futility of blind search: An algorithmic view of “no free lunch”
Evolutionary Computation
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
On complexity of optimal recombination for binary representations of solutions
Evolutionary Computation
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
A unified view on hybrid metaheuristics
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Iterative patching and the asymmetric traveling salesman problem
Discrete Optimization
Hi-index | 0.00 |
A framework for hybridizing evolutionary algorithms with the branch-and-bound algorithm (B&B) is presented in this paper. This framework is based on using B&B as an operator embedded in the evolutionary algorithm. The resulting hybrid operator will intelligently explore the dynastic potential (possible children) of the solutions being recombined, providing the best combination of formae (generalized schemata) that can be constructed without introducing implicit mutation. As a basis for studying this operator, the general functioning of transmitting recombination is considered. Two important concepts are introduced, compatibility sets, and granularity of the representation. These concepts are studied in the context of different kinds of representation: orthogonal, non-orthogonal separable, and non-separable.The results of an extensive experimental evaluation are reported. It is shown that this model can be useful when problem knowledge is available in the form of an optimistic evaluation function. Scalability issues are also considered. A control mechanism is proposed to alleviate the increasing computational cost of the algorithm for highly multidimensional problems.