Research on Order Problem for Perishable Products Based on Ant Colony Algorithms
|更新时间:2026-07-10
|
Research on Order Problem for Perishable Products Based on Ant Colony Algorithms
Vol. 15, Issue 3, Pages: 10-13(2010)
作者机构:
哈尔滨理工大学计算机科学与技术学院
作者简介:
基金信息:
DOI:
CLC:F274;TP18
Published:2010
稿件说明:
移动端阅览
XU Hui, LI Cheng-yan, ZHOU Li-bo. Research on Order Problem for Perishable Products Based on Ant Colony Algorithms[J]. 2010, 15(3): 10-13.
DOI:
XU Hui, LI Cheng-yan, ZHOU Li-bo. Research on Order Problem for Perishable Products Based on Ant Colony Algorithms[J]. 2010, 15(3): 10-13.DOI:
Research on Order Problem for Perishable Products Based on Ant Colony Algorithms
摘要
针对易逝品的订货问题
以实现供应链的整体利益最优为目标
根据产品的实际销售和获利情况建立数学模型.采用蚁群算法对该数学模型进行求解
以各分销商的获利情况作为蚁群信息素.仿真结果表明该模型和算法可以适应市场需求的波动
并快速找到全局最优的订货量.
Abstract
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 c...