新混合智能计算法在 UCAV 航路规划中的应用

无人作战飞机(UCAV)出航执行对地攻击(或侦察)任务,若事先针对敌方防御区内的威胁部署和目标的分布情况,就飞行航路进行整体规划设计,则可以综合减小被敌方发现和反击的可能性,最大限度地降低耗油量,从而显著提高其执行任务的成功率.在对进化算法研究的基础上.将用于解决旅行商问题(TSP)的进化算法加以改进,引入优秀个体保护法和模拟退火的策略思想,借以克服进化算法固有的易陷于局部最优的早熟现象,然后运用于UCAV的航路规划.实验结果表明,改进的混合智能计算方法简易而有效,寻优效果明显优于常规进化算法,规划出的航路能够满足UCAV飞行任务规划的综合需要.     

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     

饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

基于fMRI的静息状态脑功能复杂网络分析

分析静息状态下人脑中不同区域之间的功能连接模式对研究静息状态下人脑正常功能活动具有重要意义。基于复杂网络理论对脑功能网络进行建模,考察静息状态脑功能网络的结构和拓扑特性。结果显示,网络具有小世界性质和无标度特性。进一步引入一种概率混合模型分析网络社团结构,得到的10个子网络中包含视觉系统、听觉系统、运动系统、默认网络以及与执行和工作记忆相关的脑区。推测出静息状态脑功能网络是由这些相对独立又彼此关联的子网络组成,其中楔前叶和扣带回作为网络的关键节点,在信息调度和传递中占据重要地位。     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

基于组成要素的作战体系构建方法研究

针对当前作战体系构建理论研究中的若干问题,提出了基于组成要素的作战体系构建方法,对作战体系进行了模块分解和功能要求分析,得出了基于组成要素构建一般作战体系的框架图,可为同类作战体系构建提供参考。     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

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     

大容量储能发电机并联运行励磁控制算法

大容量储能发电机作为脉冲电源，整流后通过逆变器向大功率脉冲负载供电。采用储能发电机直流侧并联方式工作，可以有效提高系统带载能力与可靠性。当并联运行的储能发电机转速不同时，根据转速合理分配电机释放功率可以有效提高系统工作效能，因此需要设计一种具有功率调节功能的励磁控制算法。在电压、电流双闭环控制的基础上，引入功率前馈控制，推导并求解了前馈功率与励磁电流关系以及控制参数，并根据电机初始转速设计了功率分配算法。仿真试验结果表明，功率前馈控制在励磁控制过程中起主导作用，有效分配储能电机释放功率大小，提高了励磁电流响应速度，抑制了负载功率扰动对励磁控制系统的影响。     

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.