基于果蝇优化算法的越库调度问题  

Cross-docking scheduling problem with multi dock based on fruit fly optimization algorithm

作　　者：包华晟 吴斌[1] 董敏[1] 

机构地区：[1]南京工业大学经济与管理学院,江苏南京211800

出　　处：《计算机工程与设计》2016年第12期3295-3299,共5页Computer Engineering and Design

基　　金：江苏省高校自然科学基金项目(13KJB520010);教育部人文社科青年基金项目(11YJCZH184)

摘　　要：针对现有研究中未考虑多站台和暂存区约束的问题,以最小化操作时间为目标,建立有暂存区约束的多站台越库调度问题的数学模型。针对问题特征结合果蝇算法特点,采用贪婪搜索和随机方法初始化种群,使用交换操作进行嗅觉搜索,为提高算法的全局搜索能力和收敛速度,设计一种基于优势解集的协作引导机制。仿真结果表明,改进果蝇算法具有较好的全局搜索能力。The multi dock and temporary area constraints are not considered in the existing researches,the mathematical model of cross-docking problem with multi dock and temporary area constraints was built.The objective of the model is to minimize the operation time.According to the characteristics of the problem and the fruit fly optimization algorithm（FOA）,greedy search and random method were applied to initialize the population.An exchange operation was used to produce neighbors in the smellbased search stage and an update mechanism ensuring quality was used to update population in the vision-based search stage.A collaboration guiding mechanism based on the better solution set was designed to improve the algorithm＇s global search ability and convergence speed.Experimental results show that the improved FOA has better global search capability.

关 键 词：越库调度 暂存区 多站台 果蝇算法 协作引导 

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