基于果蝇优化算法的柔性工艺规划问题研究

Research on Flexible Process Planning Based on Fruit Fly Optimization Algorithm

针对以最小加工时间为目标的柔性工艺规划问题,提出一种改进的果蝇优化算法求解该问题。为了适应工艺规划问题的求解,增强算法的搜索性能,在嗅觉搜索阶段采用交换、插入、变异,三种操作进行邻域搜索。在视觉搜索阶段,种群中的所有个体都通过选择最优邻域解对自身进行更新。并且增加了全局协作机制,加强种群个体之间的相互协作,提高果蝇优化算法的全局寻优能力。最后,进行实例仿真测试,将仿真结果与其他算法所得结果进行对比分析,验证了果蝇优化算法在解决柔性工艺规划问题上的高效性。

Aiming at the flexible process planning problem with minimum processing time,an improved fruit fly optimization algorithm is proposed to solve the problem.In order to adapt to the problem solving of process planning and enhance the search performance of the algorithm,three operations,exchange,insertion and mutation,were used in olfactory search phase to search neighborhood.In the visual search stage,all individuals in the population update themselves by selecting the optimal neighborhood solution.It also increases the global collaboration mechanism,strengthens the cooperation among individual individuals,and improves the global optimization ability of the fruit fly optimization algorithm.Finally,an example simulation test is carried out,and the simulation results are compared with the results obtained by other algorithms,which verifies the efficiency of the fruit fly optimization algorithm in solving the flexible process planning problem.