基于三阶段过程模型的军交运输体系建模

信息化条件下军交运输体系复杂性问题日益凸显,军交运输体系建设已经进入能力“涌现”的新阶段。本文在分析军交运输体系概念内涵和体系特征的基础上,运用体系层次划分模型和三阶段过程模型,分别从定义阶段、抽象阶段和实施阶段对军交运输体系建模方法进行了研究,搭建了体系建模总体框架,建立了军交运输体系概念抽象模型,并对军交运输体系问题建模仿真方法进行了分析,为全新规划军交运输体系建设提供了新的途径。     

管线最大通过能力求解方法研究

长输管线的密闭输送方式采取"泵到泵"接力运行,全线是一个统一的整体, 对管线最大通过能力的计算,要考虑前后泵站间的相互影响,进行迭代计算。针对长输管线 最大通过能力的两种求解方式:迭代法,通过逐步校核,调整计算结果的大小,使其逐步逼近 最终计算结果;分段计算法,分步校核,逐步搜寻全线"瓶颈"段,得到"瓶颈"段的通过能力, 即为全线最大通过能力。分别建立了数学模型,并基于Visual Basic 6.0编程,进行迭代运 算,得到了相应计算结果,对两种方法的理论方法、程序编写、计算结果进行了比较,用于指 导管线计算方法的选择。     

联合战役油料输送系统模拟模型及优化研究

油料输送是联合战役油料保障中的重要环节,其本质是一个受多种随机因素影响的复杂过程。以运筹学的排队论为建模指导思想,将联合战役油料输送视为一个由多个子系统组成的排队系统,在这一系统中有活动实体(油料)在其中流动。对此动态过程进行模拟分析,结合优化技术,定量分析各种输送方案的军事经济效益,为组织计划联合战役油料输送提供有效的决策支持。     

运输装备保障效能评估模型研究

运输装备保障效能评估是军交运输系统优化的基础。构建了运输装备效能评估指标体系,提出了指标标准化和定性指标定量化的思路和方法,建立了不同条件下设计保障效能和瞬时保障效能评估模型。这些模型不仅具有很强的适用性,而且为成系统成建制装备的整体保障效能评估奠定了基础。     

A method for solving the transportation problem

A new method has been developed f o r solving the transportation problem. This method is a modification and a generalization of the method for solving the multiple assignment problem developed by Dr. A. J. Hoffman and Dr. H. M. Markowitz. This method is of interest for several reasons. In the first place it is significantly different from all other methods for solving the trans -portation problem known to the author. Secondly, it is moderately simple touse and understand. Thirdly, and perhaps most important, it has proved to be very adaptable tri high-speed computer operations. It is now being used by several branches of the armed services.     

一种新的运输问题对偶算法

本文给出求解运输问题的一种新的方法——运输问题对偶算法(仍是表上作业法)。最后给出的实例说明本文算法在解决某些问题时比[1]中方法简便。     

D运输问题在物资调度中的应用

D运输问题是含离散目标约束的目标规划问题.首先将此多目标问题转化为单一目标问题,使之简化为传统的运输问题,然后使用一种相对简单的方法求解.最后结合一个实例,讨论了D运输问题在物资调度中的应用.     

An efficient primal approach to bottleneck transportation problems

This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods.     

A squared-euclidean distance location-allocation problem

This article is concerned with the analysis of a squared-Euclidean distance location-allocation problem with balanced transportation constraints, where the costs are directly proportional to distances and the amount shipped. The problem is shown to be equivalent to maximizing a convex quadratic function subject to transportation constraints. A branch-and-bound algorithm is developed that utilizes a specialized, tight, linear programming representation to compute strong upper bounds via a Lagrangian relaxation scheme. These bounds are shown to substantially dominate several other upper bounds that are derived using standard techniques as problem size increases. The special structure of the transportation constraints is used to derive a partitioning scheme, and this structure is further exploited to devise suitable logical tests that tighten the bounds implied by the branching restrictions on the transportation flows. The transportation structure is also used to generate additional cut-set inequalities based on a cycle prevention method which preserves a forest graph for any partial solution. Results of the computational experiments, and a discussion on possible extensions, are also presented.     

基于熵权多目标决策的战时物资运输方案优选研究

提出了战时物资运输方案优选问题,分析战时运输的影响因素,提出了评估战时物资运输方案的较有代表性的指标,并给出了具体计算方法.在没有指标权重的情况下,应用熵权多目标决策方法对多个合理方案进行优选评估,得出了可信度较高的优选方案.     

The dynamic transportation problem: A survey

The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work.     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

基于PCA-RBF网络的储运过程管道堵塞故障诊断方法

针对现代储运过程管道堵塞故障诊断时,提取的过程参数多导致诊断速度慢、性能差等问题,提出了基于主成分分析（PCA）和径向基函数（RBF）神经网络故障的诊断方法。首先利用PCA方法对储运过程高维历史数据矩阵进行特征提取,提取的故障特征信息作为训练集,并给出故障特征信息的分类号;然后将其作为RBF神经网络分类器的输入输出进行故障模式识别。仿真实验表明：该方法应用于储运过程管道堵塞故障诊断,不仅大幅度地降低了诊断模型的训练时间,而且提高了诊断正确率。     

电梯事故的救援和预防

电梯作为住宅楼、写字楼等楼宇内的垂直运输工具,应用日益广泛,电梯的事故也逐渐增多,已引起人们的普遍关注。分析了当前电梯事故的原因及类型,从外部救援和电梯内自救两方面阐述了电梯事故救援的方案,提出了有效预防电梯事故的对策。     

Determining adjacent vertices on assignment polytopes

To rank the solutions to the assignment problem using an extreme point method, it is necessary to be able to find all extreme points which are adjacent to a given extreme solution. Recent work has shown a procedure for determining adjacent vertices on transportation polytopes using a modification of the Chernikova Algorithm. We present here a procedure for assignment polytopes which is a simplification of the more general procedure for transportation polytopes and which also allows for implicit enumeration of adjacent vertices.     

战场物资快速运输的指挥控制

针对战场快速物资运输的指挥控制问题,提出一种基于线性规划的方法。根据供求双方物质的供应和需求总量、地理空间上的位置以及运输工具的运载能力等信息,制订一个满足供求双方物资总运载量,并以运送所有物资耗费时间为最小的优化目标,改进了传统运输问题模型。仿真分析表明,该方法为实现战场物资快速运输的指挥控制提供了有价值的参考。     

Time-minimizing transportation problems

A method is given for finding those solutions of a transportation problem which minimize the total time necessary for transporting goods from the suppliers to the consumers. Several extensions of the model are presented.     

A streamlined simplex approach to the singly constrained transportation problem

A primal simplex procedure is developed to solve transportation problems with an arbitrary additional linear constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing-out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the MODI method. Furthermore, the pricing-out and change-of-basis procedures are organized in a manner that permits the calculations for one to be utilized in the other. Computational results are presented which indicate that this method is at least 50 times faster than the state-of-the-art LP code, APEX-III. Methods for obtaining basic primal “feasible” starts and “good” feasible integer solutions are also presented.     

遗传算法在装备调拨辅助决策中的应用

利用遗传算法求解装备调拨中的路径优化问题和运输装载问题,并利用MATLAB进行了实例仿真,对装备调拨的辅助决策具有积极的意义。     

战时交通运输路径优化研究

以战时交通运输路径优化问题为研究对象,分析问题特点,考虑多式联运,以运输时间代价、运输费用代价、路段和运输节点的危险性代价为优化目标,建立起广义运输代价最小的运输路径优化模型,并设计了蚁群算法来求解问题模型。给出的算例表明,文中模型符合战时交通运输的特点和实际需要,可为确定战时运输路径提供决策支持,而采用的蚁群算法是求解该问题的一种有效方法。