首页 | 官方网站   微博 | 高级检索  
     

基于两次禁忌搜索的军事物资装载与运输问题研究
引用本文:齐玉东,齐玉华,谢晓方.基于两次禁忌搜索的军事物资装载与运输问题研究[J].微型电脑应用,2011,27(11):6-8,68.
作者姓名:齐玉东  齐玉华  谢晓方
作者单位:1. 海军航空工程学院,烟台,264001
2. 国际科学技术大学,长沙,410073
摘    要:针对当前军事物资装载与运输问题,映射建立数学模型,运用两次禁忌搜索算法自动输出较优的可行运输方案。实例计算结果表明,该模型通过两次禁忌搜索算法,可以得出在满足时间限制条件下的成本较小的装运方案,使用该模型可以有效提高载具的利用率,避免运力的浪费。

关 键 词:装载  运输  禁忌搜索算法

Study on Loading and Transportation of Military Materials Based on Twice Tabu Search Algorithm
Qi Yudong,Qi Yuhua,Xie Xiaofang.Study on Loading and Transportation of Military Materials Based on Twice Tabu Search Algorithm[J].Microcomputer Applications,2011,27(11):6-8,68.
Authors:Qi Yudong  Qi Yuhua  Xie Xiaofang
Affiliation:Qi Yudong1,Qi Yuhua2,Xie Xiaofang1(1.Naval Aeronautical and Astronautical University,Yantai 264001,China,2.National University of Defense Technology,Changsha 410073,China)
Abstract:Aim at the question of loading and transportation of military Materials,this paper builds mathematical model,gets the good fealible solution of transport problems automaticly based on twice tabu search algorithm.Example calculations show that the model can be drawn through the twice tabu search algorithm under time constraints to meet the less cost of the shipping program,using the model can effectively improve the utilization of vehicles,to avoid the waste of transportation capacity.
Keywords:Packing  Transport  Tabu Search Algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号