一类军械物资紧急调运的数学模型及算法研究  

Mathematics Model and Arithmetic of a Kind of Ordnance's Urgent Transportation Problem

作　　者：董鹏[1] 罗朝晖[1] 杨超[2] 

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

出　　处：《武汉理工大学学报（信息与管理工程版）》2006年第4期93-97,共5页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金资助项目(70271027);国防预研基金资助项目(98J19.3.2.JB1105)

摘　　要：军械物资调运是军械保障工作的一个十分重要的环节,关系到军械保障工作能否快捷有效地完成。考虑到战时状况下军械物资调运的复杂性、快速性和危险性等特点,建立了不同时间要素规定情况下多需求点、单货种军械物资有运力限制条件的紧急调运的2种优化模型。通过严格的数学逻辑推导,对这2种模型给出了解析算法,并通过具体的算例表明了模型的正确性及算法的有效性。Ordnance＇s transportation is very important for ordnance support and affects whether it can accomplish rapidly and efficiently. According to its complexity, rapidness and fatalness in wartime, two optimized models of single ordnance＇s urgent transportation with capacity limitation and multi- requirement points are established. By logic deducing, arithmetic of the two models are achieved. Finally the models and arithmetic are proved to be correct and valid by an example.

关 键 词：军械物资紧急调运 多需求点 单货种 运力限制 多目标决策 

分 类 号：TH17[机械工程—机械制造及自动化]