关键词: 有能力约束的生产批量计划, 成组技术, 二进制粒子群优化算法

Abstract: To solve the capacitated dynamic lot-sizing problem in group technology cell, a method based on binary Particle Swarm Optimization (PSO) algorithm and immune memory mechanism was proposed and its implementation was illustrated in detail. In this method, penalty functions were used as constraints, and each particle was used to represent a group of rules set to describe concrete batching planning. Through computation of a simulation instance and result comparison, the proposed algorithm has demonstrated its higher searching efficiency and better stability than the genetic algorithms mentioned in other literatures.

Key words: capacitated dynamic lot-sizing problem, group technology, binary particle swarm optimization algorithm