求解粮食调运问题的两阶段优化算法  

A TWO-PHASE ALGORITHM FOR GRAIN DISPATCH AND TRANSPORTATION

作　　者：张秋闻[1] 甄彤[1] 张中华[2] 

机构地区：[1]河南工业大学信息科学与工程学院 [2]河南省电力公司周口供电公司,周口466000

出　　处：《粮食储藏》2008年第6期22-26,共5页Grain Storage

基　　金："十一五"国家科技支撑计划重点项目(2008BADA8B03);"十一五"国家科技支撑计划(2006BAD08B01);河南省高校新世纪优秀人才支持计划(2006HANCET-15)

摘　　要：粮食调运优化问题过去已有研究,但是当问题较为复杂时,传统算法就要花费大量时间而且准确性也难以保证。针对这一缺陷,本文对已有的粮食调运模型进行改进,并基于该改进模型提出了一个解决粮食调运优化问题的两阶段求解方法,在第一阶段,由图搜索算法产生所有可行的运输路线,并根据约束条件对搜索树进行剪枝;在第二阶段,采用蚁群算法从第一阶段产生的可行路线集合中选取最佳路线,使总的运输成本最低。经过实例测试,该算法在粮食调运过程中具有较好的效果。The problem of grain dispatch and transportation has been studied before. But when the problems become complex, it will take lots of time to get the answer. And you can＇t ensure the answer is right. Aiming at this limitation, we present a two--phase optimization algorithm for solving the problem. In the first stage, all the feasible routes are generated by means of a graph--search algorithm. The search tree is pruned according to the constraints. In the second stage, an ant colony algorithm is designed to select the optimum routes from the set of feasible routes. The total eost of all the optimum routes is the least. The algorithm was tested with a set of real instances. The resutis indicate that the effectiveness of the proposed algorithm is good in grain dispatch and trasportation.

关 键 词：粮食调运 图搜索算法 蚁群算法 优化 

分 类 号：F324.9[经济管理—产业经济] F224