Optimal refueling strategies for a mixed-vehicle fleet

The problem treated here involves a mixed fleet of vehicles comprising two types of vehicles: K₁ tanker-type vehicles capable of refueling themselves and other vehicles, and K₂ nontanker vehicles incapable of refueling. The two groups of vehicles have different fuel capacities as well as different fuel consumption rates. The problem is to find the tanker refueling sequence that maximizes the range attainable for the K₂ nontankers. A tanker refueling sequence is a partition of the tankers into m subsets (2 ≤ m ≤ K₁). A given sequence of the partition provides a realization of the number of tankers participating in each successive refueling operation. The problem is first formulated as a nonlinear mixed-integer program and reduced to a linear program for a fixed sequence which may be solved by a simple recursive procedure. It is proven that a “unit refueling sequence” composed of one tanker refueling at each of K₁ refueling operations is optimal. In addition, the problem of designing the “minimum fleet” (minimum number of tankers) required for a given set of K₂ nontankers to attain maximal range is resolved. Also studied are extensions to the problem with a constraint on the number of refueling operations, different nontanker recovery base geometry, and refueling on the return trip.     

Optimal refueling sequence for a mixed fleet with limited refuelings

Consider a fleet of vehicles comprised of K₁ identical tankers and K₂ identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K₂ nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K₁ refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture.     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015     

基于匈牙利算法的多车型车辆调度问题

武警部队车辆调度是一类高难度的运输决策工作,在编制合理的车辆使用方案过程中,要求以最低的费用完成运输工作量,实现经济效益和军事效益最大化.通过对车辆需求特性及车辆参数的分析,建立了以最小总油耗量为目标函数的车辆调度模型,选用匈牙利算法对该模型求解,并编写了车辆调度的DELPHI程序,经过实际计算验证,结果切实可行.     

Split delivery routing

This article examines a relaxed version of the generic vehicle routing problem. In this version, a delivery to a demand point can be split between any number of vehicles. In spite of this relaxation the problem remains computationally hard. Since only small instances of the vehicle routing problem are known to be solved using exact methods, the vehicle route construction for this problem version is approached using heuristic rules. The main contribution of this article to the existing body of literature on vehicle routing issues in (a) is presenting a new vehicle routing problem amenable to practical applications, and (b) demonstrating the potential for cost savings over similar “traditional” vehicle routing when implementing the model and solutions presented here. The solution scheme allowing for split deliveries is compared with a solution in which no split deliveries are allowed. The comparison is conducted on six sets of 30 problems each for problems of size 75, 115, and 150 demand points (all together 540 problems). For very small demands (up to 10% of vehicle's capacity) no significant difference in solutions is evident for both solution schemes. For the other five problem sets for which point demand exceeds 10% of vehicle's capacity, very significant cost savings are realized when allowing split deliveries. The savings are significant both in the total distance and the number of vehicles required. The vehicles' routes constructed by our procedure tend to cover cohesive geographical zones and retain some properties of optimal solutions.     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

基于AMESim的液压混合动力车辆建模仿真研究

在阐述并联式液压混合动力车辆的结构原理及液压系统参数设计的基础上,利用AMESim创建了整车模型。根据液压混合动力系统的工作特性,以改善车辆燃油的经济性为目标,提出了基于车辆扭矩需求的发动机和液压泵/马达扭矩控制策略。仿真结果表明:该混合动力系统能合理控制扭矩分配,实现不同工作模式的平顺切换,在满足车辆动力性能指标的前提下,有效地提高了燃油的经济性。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

装甲火控可靠性建模

装甲武器是陆军及其两栖机械化部队实施地面突击的主要兵器,也是海军陆战部队实施抢滩登陆、岛屿攻防的主要兵器。装甲火控是装甲武器的重要组成部分,其可靠性直接影响装甲武器的打击效能。两栖装甲武器肩负海上、陆上的作战使命,使用环境更加恶劣,可靠性问题更加突出。描述了装甲火控的一般组成、功能及工作方式,基于两栖装甲武器的使用特点,分析了装甲火控基本任务、工作方式和作战环境的关系,建立了不同任务剖面的可靠性模型,为装甲火控可靠性设计、分析提供了一种参考。     

直升机野战油料保障模拟优化研究

野战条件下,场站通常在前沿阵地开设野战直升机场实施伴随保障,其中油料保障主要采取飞机加油车先对直升机实施加油,后到野战机场油库领取油料这一方式进行。若将野战直升机场油料保障作为一个系统来研究,要实现适时、适量的油料保障,确定合适的飞机加油车及野战机场油库发油鹤位数量是一个关键问题。利用GPSSW语言对这一问题进行模拟,得出模拟结果并进行统计分析,经反复模拟和参数比较得到适合的参数,为部队保障提供依据。     

群车加油系统水力计算方法

加油系统是群车加油装备的主要系统之一,其不同工况的水力计算结果是研究和分析加油系统规律和特性的基础。介绍了新型群车加油车加油系统基本结构,针对其结构简单、工况随机多变的特点,运用排列组合知识对系统工况进行了归纳分类,共有1 023种工况组合和10种加油模式;提出距离矩阵法用于建立加油系统的随机工况数学模型,并详细阐述了模型计算过程;通过对单枪、五枪和十枪加油模式的典型工况进行计算,最终结果验证了该方法用于求解群车加油系统和其他多分支管路系统随机工况的水力计算是可行的。     

网络中心战中舰艇编队的作战效能分析

在网络中心战条件下,舰艇编队通过互通、互联和互操作,可在编队范围内共享资源,进行跨平台的通道组织和实现武器共用,这种跨平台的资源共享充分发挥了作战资源的利用率,增强了编队作战系统的生命力。建立了在网络中心战条件下的舰艇编队作战效能计算数模,并进行了分析和计算,解释了在网络支持下编队作战效能提升的原理,分析和计算方法可用于网络兵力的兵力指数计算和作战效能评估。     

群车加油装备效能评估指标体系研究

构建科学的评估指标体系,是对群车加油装备效能进行评估的基础.针对群车加油装备效能影响因素进行了系统分析,提出了构建评估指标体系的原则.通过广泛的调查研究和专家咨询,借鉴国外相关研究以及国内有关油料装备的研究成果,依据建立评估指标体系的原则构建了群车加油装备效能评估指标体系,并利用可拓层次分析法求得了群车加油装备效能评估...     

基于理想解法的空中加油机驻地分配选择

一体化联合作战条件下,跨战区、跨军兵种实施空中加油将更加频繁,空中加油机驻地分配选择对空中加油任务的实施有重要影响。分析了影响空中加油机驻地分配选择的主要因素,以此确定决策指标,这是一个多指标综合评价问题。基于理想解法的原理和方法,构建了空中加油机驻地分配选择决策的数学模型。通过示例分析表明,该方法计算简单,较好地解决了空中加油机驻地分配选择问题,并可在此基础上做进一步研究,为实际应用中解决类似问题提供了一种新思路。     

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     

装甲车辆使用故障探讨

从装甲车辆的故障及分类入手,引入使用故障的概念,以装甲车辆使用、维护过程中发生的典型使用故障案例为基本素材,运用归纳、分析的方法,真实体现使用故障的原因,客观提出预防使用故障的对策.     

金属带式无级变速汽车的性能仿真研究

介绍了金属带式无级变速装置的结构特点和工作原理,建立了带式无级变速汽车的仿真模 型。利用该模型可以模拟各种工况下无级变速汽车的动态特性,评价无级变速汽车的驱动性能、燃油经 济性和排放特性等,最后给出了几种典型道路循环工况下的仿真结果。     

并联TBCC动力对高超声速飞行器性能的影响

针对马赫数为6的一级高超声速巡航飞行器的动力需求，提出涡轮/亚燃冲压/双模态超燃冲压组合动力（T/RJ/DMSJ）和射流预冷涡轮/亚燃冲压/双模态超燃冲压组合动力(PCT/RJ/DMSJ)两种方案。在给定的飞行任务下，分析起飞推重比分别为0.8和1.0时，飞行器完成任务时的航程和飞行时间，并对比了PCT/RJ/DMSJ在两种工作模态下的性能。研究结果表明：在相同的起飞推重比下，两种组合动力方案的航程和飞行时间相差不大。当起飞推重比为0.8时，采用PCT/RJ/DMSJ组合动力方案比T/RJ/DMSJ组合动力方案的航程高出3.6%，飞行时间高出3.8%；当起飞推重比为1.0时，PCT/RJ/DMSJ的航程和飞行时间比T/RJ/DMSJ的分别高出4.6%和4.8%。在小推重比下，跨声速段的燃料消耗和飞行时间占整个加速爬升段的比例较大，随着推重比的增加，这个比例减小，巡航可用的燃料比例增大，巡航距离增加，提高起飞推重比可以提高超声速飞行器的航程并缩短飞行时间。     

An extension of the (szwarc) truck assignment problem

In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p². This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p². Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity.     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007