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     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

电传动装甲车辆电源系统建模与仿真

电源系统是电传动装甲车辆的核心,对其进行建模与仿真研究具有重要意义。电源系统的非线性特性导致了建模困难、模型精度低以及模型实用性差等难题,针对不同的部件特性采取不同的方法建立其仿真模型,完成了基于模糊控制的系统多目标优化功率分配策略研究。并在此基础上进行了部件和系统两个层次的仿真试验,证明所建模型能够较好地反映电传动车辆电源系统的工作特性。     

采用状态转移矩阵的拦截中段制导方法

基于相对运动理论提出拦截中段制导方法。方法原理为,将拦截器初始轨迹与施加修正后的轨迹视为一主一从两空间目标,以相对运动理论描述从目标相对于主目标的运动规律,于是初始的修正量可由终点处相对状态求解。给出了一般形式的相对运动模型,运用几何法与变分法推导得到了J2摄动影响下相对运动的状态转移矩阵,在此基础上,提出了采用状态转移矩阵的拦截中段制导方法。仿真算例表明,提出的方法能够为工程实际中的拦截中段制导提供有效支持。     

基于VxWorks653分区操作系统的IMA设计与实现

综合模块化航电系统(Integrated Modular Avionics System,IMA)在飞机航电设备的研制中逐渐得到应用。为了完整地说明IMA的设计方法,以某型飞机航电系统的升级改进为背景,提出一种基于VxWorks653分区操作系统的IMA方案,首次实现将两个独立分系统的设备集成到一台IMA中,方案对IMA的软件架构、分区任务规划、时间空间资源分配等关键要素进行设计和实现,并建立实验平台。实验数据表明,IMA运行正确,可以实现原有系统的功能,分区之间时间和空间隔离机制工作正常,通信工作正常,具有较高稳定性和可靠性。     

指控系统中多操作系统启动工具的研究

指控系统中GRUB2作为启动引导器,管理多种操作系统平台。GRUB2采用模块化设计,可以提供给使用者更大的灵活性和性能改进。Linux系统的模块化设计与运行机制已被广泛讨论,有关GRUB2的模块化设计与运行机制的资料却很少。为了了解它的模块化编程与运行机制,通过对一个模块程序的分析,介绍了GRUB2中模块程序的基本结构及模块化设计的灵活性;并讨论了GRUB2的模块运行机制,明确了模块运行所需的底层工作。在此基础上,可以对GRUB2进行二次开发,扩展其应用场合。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

激光陀螺SINS/GPS组合导航车载试验系统

SINS GPS组合导航系统已经应用于许多不同的领域。介绍一种已经进入试验阶段的低成本激光陀螺SINS GPS组合导航系统。根据系统的硬件结构,设计实现了与实际系统相匹配的组合导航滤波器,根据车载试验的结果,着重分析了系统车载试验中不同导航模式对系统性能的影响,最后给出了一些有益的结论。