检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]海军指挥学院作战研究系理论研究室,南京210016 [2]江苏省农业科学院资源环境研究所,南京210014
出 处:《解放军医院管理杂志》2007年第2期84-86,共3页Hospital Administration Journal of Chinese People's Liberation Army
基 金:国家自然科学基金项目(30030090;39870534)
摘 要:本文介绍了基于线性规划的快速卫勤保障伤员后送的指挥控制方法,该方法根据接收和运送伤员的接收量和运送量、后送路径的长度和实施后送的后送工具的运载能力,建立一个以后送总时间为最小的线性规划模型。通过求解线性规划以及查找影响后送总时间的瓶颈,最终制订一个符合要求的战时卫勤保障伤员总运载力以及耗费时间为最小的后送指挥控制方案。一个典型的机械化作战师战时卫勤保障伤员后送的指挥控制方案分析表明:消除时间瓶颈可将伤员后送总时间减少47.06%,该指挥控制方法为解决此类问题提供了一条简单可行途径。The author introduced a command and control method of fast transportation of the wounded at wartime based on a linear programming. The input parameters of this method included available routes and their kilometers between different sending and receiving nodes, node numbers, available transport vehicles at each node, load capacity of vehicle, movement speeds, and units assigned to each node. According to removing time -bottleneck, a satisfactory command and control scheme of fast transportation of the wounded at wartime could be found as a linear programming by minimizing time of transporting the wounded from sending nodes to receiving nodes. The results gained from an example of transportation of the wounded of a mechanized division at wartime showed that the time of transportation would decrease by 47.06% due to removing time - bottleneck. It can be concluded that this method has provided a possible simple approach to solve the problem of fast transportation of the wounded at wartime.
分 类 号:R197.32[医药卫生—卫生事业管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117