电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

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     

A1 Qaeda and the radical Islamic challenge to western strategy

The September 11 global crisis prompted by the attacks on the World Trade Center and the Pentagon raises major questions concerning the nature and trajectory of terrorism in the post-Cold War global order. Hitherto, terrorism has been largely debated by analysts at the level of nation states. Terrorist and insurgent movements have also been largely anchored in nationalist and ethnic power bases even when they have sought to mobilise a transnational ideological appeal on religious or class grounds. There have been a few exceptions to this pattern such as the alliance between the German Baader-Meinhof group and the Japanese Red Army Faction, but even such international alliances as this did not, until at least the 1980s, presage anything like a global terrorist network necessitating a global strategic response. This study examines terrorism and global strategic responses.     

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     

Setting a place at the table: ending insurgencies through the political process

This article argues that, under certain conditions, allowing insurgents into the political process – through elections or government posts – can be a useful tool in the peace process and can help end insurgencies. However, bringing insurgents into the political process is unlikely to end insurgencies on its own, particularly if insurgents, the government, or the population believes that force is still a viable means of defeating the opponent and changing the status quo. The article begins with a brief overview of the causes of insurgency and on conflict resolution for internal wars. The article then considers two examples of insurgents that have entered the political process – the Irish Republican Army (IRA) in Northern Ireland and Hezbollah in Lebanon – and the differing degrees of success in transforming these insurgents to non-violent participants in the political process. It concludes by suggesting how insurgents can be brought into the political process as part of conflict resolution and the implications for Afghanistan.     

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     

高精度高分辨率WENO格式分析与改进

高精度、高分辨率计算格式对提高超声速复杂流场的计算水平有重要的意义。WENO格式是在ENO格式基础上发展起来的一类新型高精度、高分辨率格式,本文在格式加权算法理论和数值分析的基础,对加权算法进行了改进,通过模型问题应用可以看出:改进后格式权值的计算更为光滑,仍具有高精度、高分辨率的性质,并克服了随网格变化而出现的波动现象。     

一种新的高分辨极化目标检测方法

针对宽带毫米波高分辨雷达体制 ,研究了杂波环境中的目标检测问题。提出了极化域线性积累滤波的思路以提高雷达接收信号的信杂比 ,在此基础上利用宽带波形固有的径向高分辨力对目标进行一维距离成像 ,估计出回波中强散射点的数量和分布 ,通过对不同径向分辨单元内的强散射点进行整体检测 ,可进一步有效地提高信杂比 ,改善雷达的检测性能。最后在毫米波段的实验仿真结果表明该方法是一种非常有效的扩展目标检测方法     

Institutions,information, and commitment: the role of democracy in conflict

This paper explores the hypothesis that both the preexisting quality of democracy in a polity at the onset of conflict and the quality of democracy expected to emerge in the aftermath influence the likelihood of civil war. An empirical investigation of the hypothesis presents a challenge due to concerns of endogeneity and selection: the post-conflict level of democracy is endogenous to the pre-conflict level. Further, for a given time period, either a number of countries have not experienced civil war; or if they did, did not resolve the conflict. We overcome this selection bias by implementing a three-step extension to the Heckman procedure using an unbalanced cross-country panel of 77 countries over the period 1971–2005. Consistent with our hypothesis, we find that a standard deviation improvement in the existing level of democracy reduces the probability of civil war by approximately 9 percentage points and a corresponding improvement in expected post-conflict democratization increases the probability of conflict by approximately 48 percentage points.     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017