Adaptive Memory Tabu Search for Binary Quadratic Programs
Management Science
Memetic algorithms: a short introduction
New ideas in optimization
Tabu Search
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
A study of memetic search with multi-parent combination for UBQP
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
High-Order sequence entropies for measuring population diversity in the traveling salesman problem
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Using unconstrained binary quadratic programming problem as a case study, we investigate the role of multi-parent crossover operators within the memetic algorithm framework. We evaluate the performance of four multi-parent crossover operators (called MSX, Diagonal, U-Scan and OB-Scan) and provide evidences and insights as to why one particular multi-parent crossover operator leads to better computational results than another one. For this purpose, we employ several indicators like population entropy and average solution distance in the population.