A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines
研究了装配线零件配送问题，将其建模为多目标混合整数线性规划模型，证明其为NP完全问题，并提出一种改进的粒子群优化算法，能快速找到高质量解。
The Assembly Line Part Feeding Problem (ALPFP) is a complex combinatorial optimisation problem concerned with the delivery of the required parts to the assembly workstations in the right quantities at the right time. Solving the ALPFP includes simultaneously solving two sub-problems, namely tour scheduling and tow-train loading. In this article, we first define the problem and formulate it as a multi-objective mixed-integer linear programming model. Then, we carry out a complexity analysis, proving the ALPFP to be NP-complete. A modified particle swarm optimisation (MPSO) algorithm incorporating mutation as part of the position updating scheme is subsequently proposed. The MPSO is capable of finding very good solutions with small time requirements. Computational results are reported, demonstrating the efficiency and effectiveness of the proposed MPSO.