基于蚁群算法的易逝品订货问题研究  

Research on Order Problem for Perishable Products Based on Ant Colony Algorithms

作　　者：徐辉[1] 李成严[1] 周力波[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2010年第3期10-13,共4页Journal of Harbin University of Science and Technology

基　　金：黑龙江省自然科学基金(F200821)

摘　　要：针对易逝品的订货问题,以实现供应链的整体利益最优为目标,根据产品的实际销售和获利情况建立数学模型.采用蚁群算法对该数学模型进行求解,以各分销商的获利情况作为蚁群信息素.仿真结果表明该模型和算法可以适应市场需求的波动,并快速找到全局最优的订货量.This paper presents a new methodology to support the global optimum.Considering the particularity of perishable products,a new model is proposed to make the whole supply chain obtain maximum profit when the global optimum order quantity is achieved.The ant colony algorithm is applied to solve system model and the actual profit of retailers is defined as pheromone.A numerical example with sensitivity analysis is provided to demonstrate the theory and the simulation results show that the model and algorithm can adapt to uncertain environments.

关 键 词：供应链 订货问题 易逝品 蚁群算法 

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