摘要： 为解决粮食应急调度问题，建立一个适合多应急点、多出救点的多目标优化模型。将“应急开始时间最早”和“出救点数目最少”作为优化目标，考虑每个应急点的紧急重要程度和粮食自身的消耗特点，引入相应因子。应用蚁群算法对模型进行求解，给出算法求解的具体步骤。数值算例表明，该模型可提高粮食的应急调度效率。
关键词:
蚁群算法,
粮食应急,
应急调度,
应急点,
出救点
Abstract: According to the problem of grain emergency scheduling, establishing a multi-objective optimization model for multi-emergency point and multi-rescue point, which treat the earliest start time of emergency and the least number of rescue point as optimization target. To consider the urgent importance of each emergency point and the characteristics of nonconstant grain continuous consumption, corresponding factors are introduced. Using ant colony algorithm to solve and giving out the steps for solving as well, an example verifies that the model can improve the efficiency of grain emergency scheduling.
Key words:
ant colony algorithm,
grain emergency,
emergency scheduling,
emergency point,
rescue point
中图分类号:
肖乐, 甄彤, 郭天池, 张校铭. 基于蚁群算法的粮食应急调度问题研究[J]. 计算机工程, 2011, 37(20): 10-12.
XIAO Le, JUAN Tong, GUO Tian-Che, ZHANG Jiao-Ming. Research on Grain Emergency Scheduling Problem Based on Ant Colony Algorithm[J]. Computer Engineering, 2011, 37(20): 10-12.