广义指派问题及其在军事装备运输中的推广应用  

Generalized Assignment Problem and It′s Generalization Application within The Armaments Transportation

作　　者：刘家学[1] 陈世国[1] 

机构地区：[1]空军第一航空学院数学教研室,河南信阳464000

出　　处：《数学的实践与认识》2006年第1期199-203,共5页Mathematics in Practice and Theory

摘　　要：军事装备中的运输问题复杂多样,如何建立数学模型是寻求优化方案的关键.本文首先将最优线性指派模型推广到广义指派模型并给出其两种算法,其次对带有时间约束的运输问题进行建模,并设法将其转化为广义指派问题来处理,从而为这类运输问题提供了一种有效可行的算法.The armaments transportation problem is complicated and various. How to build the mathematical model is the key that seeking majorized scheme. In this paper we popularized the optimum linear assignment model to the generalized assignment model and gave two algorithms first. Next, we built the model for the transportation problem that with time constraint condition and transformed it into the generalized assignment problem. Thus we provided a effective and feasible algorithm for this kind of transportation problem.

关 键 词：广义指派模型 军事装备 运输问题 表上标号法 优化方案 数学模型 时间约束 

分 类 号：E075[军事—军事理论]