关键词: 信息素机制，混沌，离散粒子群，背包问题

Abstract: Considering their own characteristics of ant colony algorithm and particle swarm optimization algorithm, the update equations of the speed and position of particles were redefined on the basis of PSO algorithm. A discrete particle swarm optimization algorithm based on chaotic ant behavior was proposed using the idea of pheromone refresh mechanism of ant colony algorithm for reference. Knapsack problem was used to test the performance of the algorithm. Compared with other algorithms, the results of the experiment show that the proposed algorithm can result in better profits.

Key words: Pheromone mechanism, Chaotic, Discrete particle swarm optimization, Knapsack problem