A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

改进的笛卡尔遗传编程组合电路演化设计

利用笛卡尔遗传编程进行电路演化时,存在收敛速度慢、收敛时间波动较大等问题．对笛卡尔遗传编程中的可编程单元模型进行改进,增加与目标函数相关的逻辑运算,去除无关的逻辑运算,从而提高演化算法命中目标的概率．利用改进的笛卡尔遗传编程方法分别对电机换相电路和乘法器等组合电路进行演化设计．结果表明,改进后的方法明显缩短了电路演化生成的时间,且收敛时间波动较小．     

基于单变量多目标规划的装甲车辆冷却系统智能化控制

根据新一代装甲车辆推进系统热部件散热特点及其冷却系统调控原理,提出了一种单变量多目标数学规划与模糊智能控制相结合的控制算法。该算法将冷却系统抽象为单变量多目标数学规划问题,采用加权的方法将多个目标函数转化为综合目标函数,输入到模糊智能控制器中进行冷却控制。仿真结果表明:该控制算法具有良好的控制效果,能够有效地解决新型推进系统热源多、目标温度范围广而可调参数单一的问题。     

屋面太阳能电池布设优化模型

以光伏电池接受太阳能辐射强度最大化为目标,建立了太阳能电池板倾角和朝向优化模型,以确定太阳能电池板的最佳布设方式。根据发电量最大化、单位发电费用最小化原则,以净经济效益为目标函数,建立了光伏电池优选模型,对光伏电池进行优选排序从而选出性价比最高的光伏电池,并对模型进行了检验。结果表明：在山西省大同市地区铺设太阳能光伏电池,架空布设电池板的最佳倾角为36°,朝向为南偏西26.5°,光伏电池板最佳布设方式及电池优选模型与实际情况基本相符。     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

非高斯噪声下信号盲检测算法*

针对实际甚低频和超低频接收机不仅受非高斯噪声的影响,同时受到接收机内部和外部环境中高斯噪声影响的问题,对噪声采用高斯尺度混合分布和高斯分布的混合模型建模,根据混合模型的性质,设计了一种基于马尔可夫链蒙特卡罗方法的信号盲检测算法。盲检测算法在贝叶斯层次模型下,采用Gibbs抽样和M-H抽样更新参数,同步检测信道衰落系数、噪声模型参数和信号。算法迭代效率快、精度高。通过与最优检测性能比较,盲检测算法性能优异,对甚低频和超低频信号接收具有重要的现实意义。     

基于“招标—投标”策略的舰艇编队协同反导优化

针对舰艇编队协同防空反导的作战过程,以缩短舰艇编队协同反导的整体拦截时间、降低反导资源的消耗为目标,构建了一种"招标—投标"策略的舰艇编队协同反导优化模型。该模型利用模糊数学和动态规划相结合的优化技术,在单个作战单元需要编队内其他作战单元协同反导的情况下,运用"招标—投标"策略建立满足反导策略的决策方案,能实时、动态的调整舰艇编队整体协同反导策略。     

基于EVALPSN的循环式多轿厢电梯避撞设计与实现

多轿厢电梯系统作为垂直运输的新方式,避免轿厢之间的碰撞成为了其安全运行急需解决的重要问题。根据循环式多轿厢电梯控制系统的轿厢安全运行准则,分析了循环式多轿厢电梯系统的避撞控制问题,研究了基于带有强否定的扩展矢量注解的逻辑规划方法,设计一种电梯轿厢安全避障方法。通过建立了禁止轿厢危险运行的EVALPSN算式,避免了派梯中所选轿厢在井道中发生碰撞,保证电梯控制系统的安全运行,实验结果表明:所设计的方法针对循环式多轿厢断电梯避撞问题有较好的效果,可有效地保证多轿厢运行的安全性。