军械调运方案优化算法的设计与仿真  

Design and Simulation of The Algorithm for Choosing The Best Project of Ordnance Transportation

作　　者：王威[1] 胡斌[1] 董鹏[1] 杨超[2] 

机构地区：[1]海军工程大学管理工程系 [2]华中科技大学管理学院,湖北武汉430074

出　　处：《微计算机信息》2006年第07S期245-247,共3页Control & Automation

基　　金：国家自然科学基金资助项目(70271027)

摘　　要：军械调运问题的数学模型和手工算法过去已有研究,但是当问题较为复杂时,手工算法就要花费大量时间而且准确性也难以保证。针对这一缺陷,本文在已有的数学模型和手工算法的基础上,设计了一种可以用计算机实现的基于递归的算法来寻求军械紧急调运问题的最优方案,并使用面向对象的java语言将算法实现。Models and handwork algorithms of the ordnance＇s transportation have been studied before, but when the problems become complex, it will take lots of time to get the answer if you work them out by hand, and you can＇t ensure the answer is right. Aiming at this limitation, we design a recursion-based algorithm that can be realized by computer to search for the best project of urgent transportation of ordnance. This algorithm is based on the existing mathematics model and handwork algorithm. We then real- ize this algorithm by java, a object-oriented language.

关 键 词：军械紧急调运 算法设计与实现 递归算 JAVA语言 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]