Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

着力解决政治工作信息化建设的重点难点问题

推进政治工作信息化建设,必须聚焦重点,突破难点,着力解决影响发展全局的一些关键问题和薄弱环节。目前需着力解决的重点难点问题主要有:政治工作信息化建设的统筹指导问题;政治工作信息资源的集成整合问题;关键信息技术在政治工作中的有机运用问题;政治工作信息化人才的培养成长问题。     

海水中电磁波的弯曲

利用导电媒质中的斯耐尔定律 ,研究了电磁波在空气—海水界面的行为及在海水中的传播情况 ,得出了低频电磁波总是沿垂直海面的方向向海里传播 ,在存在温度梯度的情况下电磁波在向海底传播过程中会发生弯曲的结论     

基于Neumann谱和PM谱的海浪感应磁场能量分布计算

结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 .     

视景仿真中运动实体的动态碰撞检测

在视景仿真中,经常会出现运动实体穿入或穿透其他实体的现象,而用现有的各类包围盒模型不能很好地处理这一问题。为了解决这个问题,介绍了包围盒方法,分析了实体平动、转动、组合运动及相应包围盒的碰撞检测;针对所发现的问题,提出动态碰撞检测方法,并建立了运动实体的动态碰撞检测模型;运用OpenGVS图形引擎,通过VC++编程对模型进行了仿真,通过对仿真结果的对比实验,验证了模型的可行性。     

积极推进"网络政工"科学发展

积极推进"网络政工"科学发展,要突出更新思想观念,在充分认清"网络政工"重要意义中强化自觉、明确责任;切实加强统筹规划,在协调推进"网络政工"重点建设中夯实基础、提升起点;积极拓展网络功能,在纵深开掘"网络政工"丰富资源中促进工作、见诸实效:始终坚持科学管理,在系统规范"网络政工"运行秩序中兴利抑弊、安全发展.     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

复杂环境下线天线隔离度分析

讨论了一种复杂环境下线天线隔离度分析方法,此方法可以广泛运用于飞机、战车、导弹、舰船等复杂环境.采用一种矩量法(MOM)和一致几何绕射理论(UTD)的混合法,并结合二端口网络下天线间隔离度的知识来计算复杂环境下线天线隔离度.此混合法克服了单纯的矩量法难以计算电大尺寸系统中的天线,以及一致几何绕射理论的计算精度不够的缺点,最终能实现计算速度和计算精度的统一.