一种解决带有紧急插单问题的果蝇优化算法  

AFOA Method for Rush Order Insertion Problem

作　　者：裴小兵[1] 杨景霞 PEI Xiao-bing;YANG Jing-xia(School of Management,Tianjin University of Technology,Tianjin 300384,China)

机构地区：[1]天津理工大学管理学院,天津300384

出　　处：《系统工程》2020年第6期139-146,共8页Systems Engineering

基　　金：国家创新方法工作专项(2017IM010800)。

摘　　要：生产过程中紧急订单的到来会影响现有调度方案,甚至造成订单延期交货。以订单延迟交付时间最小为目标,构建带有插单问题的调度模型,使用改进果蝇优化算法(improved fruit fly optimization algorithm,IFOA)寻求带有插单问题的调度最优解。考虑三个特征参数建立三维优先级列表来确定订单的优先级从而指导初始中心果蝇的产生,并采用NEH启发式算法和交换策略来寻求周围新个体果蝇,采用基于工序的单层整数编码方式进行编码。使用算例进行测试,插入的紧急订单能够被合理安排,且在求解质量方面IFOA优于顺延插单算法,求解速度方面IFOA优于退单插单算法。In the production process,the arrival of urgent orders may affect the existing scheduling scheme,or even cause the delay of the delivery of orders.In order to minimize the delay delivery time of an order,a scheduling model with insertion problem is constructed,an improved fruit fly optimization algorithm is used to find the optimal scheduling solution with insertion problem.Considering three characteristic parameters,a 3 d priority list is established to determine the priority of the order so as to guide the generation of the central fruit fly.NEH and exchange strategy is adopted to seek the new fruit fly aroundand the single-layer integer coding method based on process is used for coding.The simulation results show that the inserted rush order can be reasonably arranged,in addition,IFOA is better than the sequential interpolation algorithm in quality, while IFOA is better than the untimed interpolation algorithm in speed.

关 键 词：紧急插单 延期交货 果蝇优化算法 三维优先级列表 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]