Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

VB程序设计课程教学的探索与实践

实践表明，对影响VB程序设计课程教学中存在的突出问题进行认真分析，充分利用网络教学平台，改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣，提高学生的编程能力，同时也有助于提高教学质量和效果。     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

某型末制导炮弹偏流的分析与计算

针对某型激光半主动式末制导炮弹偏流问题，基于考虑末制导炮弹各个典型弹道飞行阶段的刚体弹道模型，通过仿真计算，分析该末制导炮弹偏流的基本特点；探讨偏流形成的原因，确定影响其大小的关键因素，并对计算偏流所需要的数值积分时间步长进行了探讨。有关结论对准确编拟末制导炮弹射表所需要的偏流有直接应用价值，对新型末制导炮弹的弹道设计有积极的指导意义。     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

隐身飞机突防建模及低可探测性轨迹规划

针对隐身飞机突防飞行规划,分析了隐身飞机对警戒雷达网突防过程问题特性,建立了雷达探测模型与组网警戒雷达信息融合模型;综合考虑隐身飞机的隐身能力、预警时间和燃料消耗将隐身飞机低可探测性轨迹规划问题形式化为一个复杂多目标非线性连续时间最优控制问题;并提出基于伪谱法的低可探测性轨迹规划方法。仿真实验实现了在组网警戒雷达下隐身飞机的低可探测性突防轨迹规划,证明了方法的可用性和有效性。     

非奇异快速终端滑模及动态面控制的轨迹跟踪制导律

针对飞行器跟踪预设轨迹的问题,提出非奇异快速终端滑模和角度约束的轨迹跟踪制导律。通过引入虚拟目标点,提出参考轨迹曲率半径的期望视线角约束条件,建立带有视线角约束并考虑自动驾驶仪动态特性的轨迹跟踪数学模型。为了保证在有限时间内跟踪预设轨迹并避免出现奇异问题,采用快速非奇异终端滑模和动态面控制方法进行制导律设计。推导出视线角误差和轨迹跟踪误差之间的数学关系,并利用Lyapunov稳定性准则证明轨迹跟踪误差最终有界任意小。与弹道成型轨迹跟踪制导律进行仿真对比,仿真结果表明所提出的制导律具有良好的跟踪性能及鲁棒性。     

基于协方差矩阵估计的稳健Capon波束形成算法

常规Capon波束形成器性能对模型误差或失配非常敏感,尤其是当期望信号包含在训练数据中,导向矢量失配将引起性能急剧下降。为解决这一问题,提出了一种采用干扰噪声协方差矩阵和导向矢量联合估计的稳健波束形成算法。该方法通过对Capon空间谱在非目标信号的方位区域内的积分,实现对干扰噪声协方差矩阵的估计,解决数据协方差矩阵包含有目标信号时引起信号自相消问题;其次为了克服导向矢量失配的影响,通过最大化输出功率,并增加二次型约束防止估计的导向矢量接近于干扰导向矢量,实现对导向矢量的估计。仿真实验表明:该算法能获得近似最优的输出信干噪比,与现有算法相比稳健性更强。     

高超声速滑翔式飞行器再入轨迹多目标多约束优化

轨迹优化是高超声速滑翔式飞行器关键技术之一.为避免间接法求解轨迹优化问题时对初值敏感以及伪谱法求解轨迹优化问题中难以处理航路点和禁飞区等问题,提出采用基于Akima插值多项式的直接法求解高超声速滑翔式飞行器再入轨迹优化问题.以驻点热流密度最小和到达目标点时间最小为优化目标,考虑了终端约束、航路点约束、禁飞区约束、动压约束、过载约束等约束条件.仿真结果表明:采用的插值方法可以减少插值过程中的控制变量越界问题;得到的Pareto前沿具有良好的分布性,在初步设计时能够给设计者较大的选择余地;和文献中的单目标优化结果相比,本文所采用的算法也具有较好的寻优能力.