Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index

DOI10.1007/s11047-018-9670-5OpenAlexW2786144772MaRDI QIDQ6084237

No author found.

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-018-9670-5

zbMATH Keywords

feedback control schemebounded knapsack problemlinear diversity indexpopulation diversity controlsimilarity guide matrixsymbol-coding problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Ectropy of diversity measures for populations in Euclidean space
• Global optimization and simulated annealing
• Evolutionary algorithms. The role of mutation and recombination
• Core Problems in Knapsack Algorithms
• Exploration and exploitation in evolutionary algorithms
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Local Search Based on Genetic Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index