A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

前传协同制导交接环节的导弹指示信息的解算

针对协同制导交接时的导弹指示问题,利用坐标变换及时空配准等方法,通过对协同信息处理设备的讨论以及导弹指示信息解算模型的分析,建立了平面解算模型与椭球面解算模型两种坐标变换解算模型.对两种模型的求解方法分别进行了说明.对各种模型的解算效果进行了仿真计算及比较分析.所得模型及解算方法对协同制导作战有一定的理论和实践意义.     

随机共振理论在雷达信号截获中的应用

雷达侦察主要通过无源侦察接收设备对空域中敌方雷达辐射源信号进行检测,若要实现对敌辐射源信号的截获,基本条件就是敌雷达信号能量能够达到雷达信号侦收设备的截获灵敏度。然而现代战场中,电磁环境复杂多变,敌雷达信号往往被干扰信号、噪声等掩盖,导致侦收设备漏警概率提高。针对以上问题,提出基于随机共振原理的雷达信号截获判断的方法,增大了截获信号的输出信噪比,解决了由于噪声过大掩盖的雷达信号的侦收问题。将该方法应用于雷达告警接收机的前端截获部分,大大降低了截获系统的漏警概率,保证了整个截获系统的稳定性。仿真实验验证了该方法的有效性。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

MADM中不同属性的规范化研究

不同属性值的规范化是多属性决策问题中的重要过程.提出了一种属性值作为点到优区间和劣区间的距离的定义,依据该定义得到了属性值规范化新方法,并通过实例证明了新规范化方法的有效性.     

增强景象匹配鲁棒性的灰度变换技术研究

高可靠高精度的景象匹配技术是自主导航飞行器图像制导技术的核心和关键所在,文章对匹配图像的灰度畸变进行了研究,提出了基于直方图相似变换灰度畸变校正技术,提高了景象匹配定位的准确性和可靠性。由于外部成像条件和成像传感器本身存在差异,匹配图像往往存在较大灰度畸变,使得实时图和基准图在灰度域存在较大不一致,从而影响景象匹配可靠性。文章通过对匹配图像进行直方图的相似变换,将匹配图像直方图调为一致,有效消除了匹配图像灰度差异,调整后图像间的直方图相似系数均在0.95以上。通过10300次独立真实外场景象匹配定位试验,证明本文基于直方图的匹配图像灰度预处理方法可有效消除图像间的灰度差异,减少匹配图像间由于灰度差异而产生的重复模式,大幅提高景象匹配鲁棒性,经过本文方法预处理后的匹配图像景象匹配成功率为99.98%,已满足工程实用对景象匹配算法高可靠性的要求。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于相关性函数的多站微动特征分析与提取

针对多站雷达精度跨度大、难以有效进行融合识别的问题,提出了基于相关性函数的多站加权融合方法。首先建立了弹道目标滑动散射模型,通过时延相乘重构回波,并利用扩展Hough变换提取出距离像的曲线参数,从而建立方程组以求取微动信息。然后利用相关性函数对各雷达的支持度进行分析,最终对支持度高的观测数据进行融合识别。仿真结果表明该方法计算简单,能有效提高微动参数的估计精度,客观地反映各部雷达的可靠度。     

基于瞬时相位差分特性的数据传输系统丢点检测方法

针对数据传输系统丢点问题,依据连续正弦信号瞬时相位差分特性,探讨了一种自动检测数据传输系统丢点方法。首先在数据传输系统采集前端加入正弦信号;然后将解包好的数据通过希尔伯特变换求取数据瞬时相位,并从前向后进行相位补偿,使数据瞬时相位呈连续递增形式;最后通过相位差分法求得瞬时相位前向差分。由理论分析可知:连续正弦信号未丢点时,当前位置数据相比前一位置数据相位差为2πfc/fs(fc为正弦信号频率,fs为数据传输系统采样率);连续正弦信号丢点时,当前位置数据相比前一位置数据相位差为2πfc(n+1)/fs(n为传输数据丢失点数)。由此特性,可实现对数据传输系统是否丢点实现自动检测。理论分析和实验结果表明,探讨的数据传输系统丢点检测方法可实现对数据传输系统是否丢点实现自动检测,便于工程应用。