铁路军事运输中梯队装载问题的数学模型和求解算法  

Mathematical Model and Algorithm for Echelon Loading Problem in Military Rail Transportation

作　　者：杨镭[1] 韦广银[1] 张新军[1] 刘中[1] 周飞飞[1] 

机构地区：[1]军事交通学院,天津300161

出　　处：《交通信息与安全》2009年第1期68-70,129,共4页Journal of Transport Information and Safety

摘　　要：梯队装载问题是铁路军事运输中的典型NP问题,军事装备存在可跨装、可重叠、成套装载和成建制装载的特点.在分析铁路军事运输梯队装载问题的基础上,对军事运输相关装载要求进行了合理的量化,提出以装备长度为装载依据,以使用车辆总数最少为目标的装载优化模型.针对普通计算机求解梯队装载问题计算能力不足的瓶颈,引入并行求解思想,设计了求解模型的并行全排列算法,并在集群上进行实例测试。Echelon loading problem is a typical NP problem in military rail transportations. In view of the traits of echelon loading such as straddling, overlapping, whole-set and organic, the echelon loading problem in military transportation was analyzed, and a model with the objective to minimize the number of vehicles was proposed. The former model was subjected to the military loading requirements with the length of equipments. For the sake of the computing disability of PC, the parallel computing was introduced. A parallel algorithm of full permutation for this model was designed. An experiment performed on a cluster shows that the model is appropriate and the algorithm is accurate, effective and efficient.

关 键 词：梯队装载 全排列算法 并行计算 

分 类 号：U294.893[交通运输工程—交通运输规划与管理]