Hybrid Genetic Algorithms for Constrained Optimization Problems
Received: 23 Oct 2026 Revised: 24 Oct 2026 Accepted: 08 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 160–163
Abstract
We present a hybrid genetic algorithm for one- and multidimensional knapsack problems. Its Rust implementation combines parallel island evolution, greedy chromosome repair, and local search.
Keywords: knapsack problem, multidimensional knapsack problem, genetic algorithm, parallel computing.
BibTeX
@article{IS-Zavarukhin-Semishkin-Khvorostukhina2026,
author = {Zavarukhin, Andrej Evgenevich and Semishkin, Maxim Sergeevich and Khvorostukhina, Ekaterina Vladimirovna},
title = {{Hybrid Genetic Algorithms for Constrained Optimization Problems}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {160--163},
}
AMSBIB
\Bibitem{IS-Zavarukhin-Semishkin-Khvorostukhina2026}
\by A.\,E.~Zavarukhin, M.\,S.~Semishkin, E.\,V.~Khvorostukhina
\paper Hybrid Genetic Algorithms for Constrained Optimization Problems
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 160--163
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU