Enhanced Group Theory-Based Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem

Enhanced Group Theory-Based Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem

The group theory-based optimization algorithm (GTOA) is a discrete evolutionary algorithm designed by group theory methods, which is very suitable for solving combinatorial optimization problems with integer vectors as feasible solutions. In order to further improve the performance of GTOA for solvi...

Full description

Bibliographic Details
Main Author: ZHANG Hansong, HE Yichao, WANG Jinghong, SUN Fei, LI Mingliang
Format: Article
Language:zho
Published: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 2024-06-01
Series:Jisuanji kexue yu tansuo
Subjects:
group theory-based optimization algorithm; combinatorial optimization problems; discounted {0-1} knapsack problem; random mutation
Online Access:http://fcst.ceaj.org/fileup/1673-9418/PDF/2305055.pdf

Internet

http://fcst.ceaj.org/fileup/1673-9418/PDF/2305055.pdf

Similar Items