改进的哈里斯鹰算法求解农产品供应链调度  

Improved Harris hawks algorithm for agricultural supply chain scheduling

作　　者：支永坤 刘欢[1] 代永强[1] Zhi Yongkun;Liu Huan;Dai Yongqiang(College of Information Science&Technology,Gansu Agricultural University,Lanzhou 730070,China)

机构地区：[1]甘肃农业大学信息科学技术学院,兰州730070

出　　处：《计算机应用研究》2023年第2期413-417,449,共6页Application Research of Computers

基　　金：甘肃省自然科学基金资助项目(20JR10RA510);甘肃农业大学青年导师基金项目(GAU-QDFC-2019-02);甘肃省高等学校创新能力提升项目(2019A-056)。

摘　　要：针对农产品流通体系的效率低、流通链条协同效率不高、紧急情况下食品供给慢等问题,将农产品供应链调度问题建模成混合流水车间调度问题。结合禁忌搜索算法中禁忌表机制,离散化实数编码,提出了一种改进的哈里斯鹰算法来求解农产品供应链调度问题。该方法相比较原始的哈里斯鹰算法,降低了算法陷入局部最优的可能,进一步提高了算法的求解精度。实验结果表明相比较对比算法,改进的哈里斯鹰算法在提出的农产品供应链调度问题模型上取得了更好的效果。Aiming at the problems of low efficiency of agricultural products circulation system,inefficient circulation chain collaboration and slow food supply in emergency situations,this paper modeled the agricultural products supply chain scheduling problem as a hybrid flow shop scheduling problem.Combining the tabu table mechanism in the tabu search algorithm and discretizing the real number encoding,this paper proposed an improved Harris hawk algorithm to solve the agricultural pro-ducts supply chain scheduling problem.The method reduced the possibility of the algorithm falling into local optimum and further improved the solution accuracy of the algorithm compared with the original Harris hawk algorithm.The experimental results show that the improved Harris hawk algorithm achieves better results on the model of the agricultural products supply chain scheduling problem proposed in this paper compared with other comparative algorithms.

关 键 词：农产品供应链 哈里斯鹰算法 混合流水车间调度 禁忌搜索 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]