多目标拆卸线平衡问题的Pareto细菌觅食算法*

拆卸线平衡问题的优化涉及多个目标，为克服传统方法在求解多目标拆卸线平衡问题时不能很好处理各子目标间冲突及易于早熟等不足，提出了一种多目标细菌觅食优化算法。算法采用Pareto非劣排序技术对种群进行分级，并结合拥挤距离机制评价同级个体的优劣。为提高算法收敛性能，在趋向性操作结束后引入精英保留策略保留优秀个体，并采用全局信息共享策略引导菌群不断向均匀分布的Pareto最优前沿趋近。通过不同规模算例的对比验证表明了算法的有效性与优越性。

Pareto based bacteria foraging optimization for multi-objective disassembly line balancing problem

The optimization procedure of disassembly line balancing problem (DLBP) involves dealing with multiple objectives. Traditional algorithms could not handle the conflict between objectives properly and might get local optimum prematurely. To hedge against these shortcomings, the paper proposed a Pareto based multi-objective bacteria foraging optimization algorithm. The algorithm used a Pareto non-dominated sorting operator to grade the bacterial population. For those solutions which belong to the same grade, it adopted a crowding distance operator for the second rank. After chemotaxis phase, the algorithm introduced an elitism preservation strategy so that it would improve the convergence performance of the proposed algorithm. Furthermore, the algorithm used a global information sharing strategy to guide the bacterial population searching toward the well distributed Pareto optimal front. Computational comparisons of different size DLBP instances demonstrate the validity and superiority of the proposed algorithm.