Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

机动管线便携式混油界面检测仪研制

机动管线大量运用于抢险、救灾、作战等特殊场合,顺序输送多种油品(水)是其主要输送工艺.及时、准确地检测和跟踪混油界面是保证输送油品质量、正确进行混油切割、减少混油损失的关键.根据机动管线特点和使用要求,在分析研究国内外常用混油界面检测技术的基础上,采用超声波“波辐射”法,研制出一种新型便携式混油界面检测仪.     

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

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

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

有运力限制条件下的军械紧急调运优化模型研究

军械调运是军械保障工作中一个十分重要的环节,关系到军械保障工作能否快捷有效地完成.考虑到战时状况下军械调运的复杂性、快速性、危险性等特点,文中建立了2种有运力限制条件下的多需求点、多货种军械紧急调运的优化模型,通过严格的数学逻辑推导,对2种模型给出了解析算法,并通过具体的算例表明了模型的正确性及算法的有效性.     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

基于蝙蝠算法的多目标战备物资调运决策优化

战备物资的调运是部队后勤工作中十分重要的一环,面对复杂多变的战场环境,战备物资调运必须进行科学合理的决策优化。然而现有战备物资调运模型的优化模型较为复杂,如果涉及较多供应点和目标要求则不易实现。针对涉及多个调运点的多目标战备物资调运问题,提出一种新的决策优化模型,利用启发式蝙蝠算法进行优化计算,发挥出蝙蝠算法易于实现、性能优越的特点,较好地解决了涉及较多供应点的多目标战备物资调运决策优化问题,并结合一个仿真算例,证明该方法相对于其他方法更具简易性和有效性。     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

多参数带约束限制的风险运输网络优化研究

对赋有四个参数（可靠度、时间、费用、容量）的运输网络进行优化分析,给出求解最优路线的算法。