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     

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     

北斗系统三频载波相位整周模糊度快速解算

北斗导航定位系统播发三个频率观测值,有助于载波相位整周模糊度的快速、准确固定。传统的几何无关模型三频载波相位模糊度固定算法通常采用遍历整数搜索的方法确定载波相位-伪距组合系数,组合后的噪声因子较大,模糊度固定成功率不高。在分析了北斗系统伪距测量误差特性的基础上,给出了加权组合噪声因子的定义及其约束下的最优组合系数的求解方法。采用Hatch滤波提高电离层延时误差实时估计精度,成功固定三组线性无关组合系数对应整周模糊度,进而确定基础整周模糊度。利用北斗系统短基线、长基线实测数据对算法性能进行了验证,实验表明:提出的算法可优化超宽巷、宽巷组合噪声因子20%以上,模糊度固定成功率提高10%~18%左右,30s历元平滑后的基础模糊度固定成功率可达90%以上。     

一种基于部分搜索的GNSS模糊度解算方法

为解决LAMBDA算法搜索策略效率不高的问题,提出了一种基于部分搜索的模糊度解算新方法。该方法的解算成功率接近LAMBDA算法,且只需对最后3维模糊度元素采取搜索策略。同时,通过合理设定搜索椭球的大小和搜索策略;大大提高了搜索效率。通过实验对该新算法与Bootraping算法、LAMBDA算法进行了比较分析,进一步验证了该新算法的有效性。     

大整数乘除运算在PC机上的实现

大整数在要求高精度的应用中非常有用.特别是大质数和一般大整数有一个极为重要的应用,就是关于计算机数据加密.在计算机数据加密技术中,常会遇到大整数的算术运算问题.由于所使用的机器和所用语言的限制,大整数的"乘""模"两种运算很难运用高级语言中的"乘""除"运算.提出了一种逐位存储、按字节运算的方法,并用C 实现了大整数的十进制乘除法运算,之后将提出的算法与类似算法的时间复杂度进行了比较,最后给出了算法的运行时间.     

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     

基于匈牙利算法求解的火力分配问题

匈牙利算法是求解指派问题的一个很好的算法,但一般情况下,火力分配问题的数学模型不具备指派问题的模型形式.针对目标函数是线性或非线性的一类火力分配问题,提出了虚拟火力单位或目标的方法,将问题转化为能够用匈牙利算法求解的指派问题,该方法简单、易于计算,有很高的应用价值.     

无源雷达GPS卫星信号模糊函数研究

研究了GPS卫星信号作为照射信号的双基无源雷达信号模糊函数性能,论述了雷达系统结构和信号模型,分析了GPS信号的模糊函数特性,给出了计算机仿真。理论分析和仿真结果表明,GPS信号作为无源雷达照射源具有良好的目标分辨力。