带暂存区越库调度问题的改进食物链算法  

An Improved Food Chain Algorithm for Cross Docking Scheduling Problem with Temporary Storage

作　　者：陈可嘉 康健 洪凤莉 CHEN Kejia;KANG Jian;HONG Fengli(School of Economics and Management,Fuzhou University,Fuzhou 350116,China)

机构地区：[1]福州大学经济与管理学院,福建福州350116

出　　处：《武汉理工大学学报（信息与管理工程版）》2019年第2期180-185,共6页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金项目(71601050);教育部新世纪优秀人才支持计划基金项目(NCET-11-0903)

摘　　要：为了合理地对车辆和站台进行分配,提高带暂存区越库调度的效率,采用"自适应机制"设计了一种改进食物链算法对该问题进行求解。在参数分析基础上,选取文献典型算例进行了仿真求解及比较分析。结果表明,所设计的改进食物链算法性能优于食物链算法,并且随着问题规模的扩大,改进食物链算法求得解的质量的优势更加明显,进一步验证了改进食物链算法是求解带暂存区越库调度问题的有效方法。In order to allocate vehicles and platforms reasonably and improve the efficiency of cross docking scheduling with temporary storage,an improved food chain algorithm is designed to solve the problem by using"adaptive mechanism".On the basis of parameter analysis,typical examples in literature are selected for simulation and comparative analysis.The results show that the performance of the improved food chain algorithm is better than that of the food chain algorithm.With the expansion of the scale of the problem,the advantage of improving the quality of the solution of the food chain algorithm is more obvious.The simulation results show that the improved food chain algorithm is an effective method to solve the problem of cross-storage with temporary storage.

关 键 词：越库调度 食物链算法 自适应 暂存区 参数分析 

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