Адаптивний квантовий генетичний алгоритм для 0–1 задачі пакування рюкзака

• Дата: 2018
• Автор: Tkachuk, Valerii M.
• Формат: Стаття
• Мова: Ukrainian
• Опубліковано: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2018
• Теми: quantum computing; quantum bit; quantum genetic algorithm; quantum gate operator; 0-1 knapsack problem; квантовые вычисления; квантовый бит; квантовый генетический алгоритм; оператор квантового гейта; 0-1 задача упаковки рюкзак; квантові обчислення; квантовий біт; квантовий генетичний алгоритм; оператор квантового гейту; 0-1 задача пакування рюкзака
• Онлайн доступ: http://journal.iasa.kpi.ua/article/view/125371
• Назва журналу: System research and information technologies

Quantum Genetic Algorithm (QGA) has a number of advantages in comparison with its classical version: operating speed, small population size and auto-balance between the global search and the local search. It is based on the ideas of traditional evolutionary algorithms, applied to the quantum computations technology, which operate with quantum bits, superposition of states and quantum measurements. This paper proposes a QGA with a new adaptive quantum gate operator and a restoring technology for the quantum chromosome during the process of solving combinatorial problems with constraints. Meta-optimization of the primary algorithm parameters is used for providing the algorithm efficiency. The productiveness of the suggested approach is proven by the model studies, carried out using a wide range of test 0–1 knapsack problems.