适应任务的模块化卫星快速构建优化决策方法

如何根据应急航天任务,在满足各种约束的前提下,从型号众多、能力各异的卫星平台及有效载荷中快速决策效费比最佳的卫星构造方案引起了越来越多的关注,这就是适应任务的模块化卫星快速构建优化决策问题.在深入分析该问题特点的基础上,建立优化决策数学模型,提出基于遗传算法的优化决策方法,为处理遗传算法迭代过程中产生的不可行解引入基于...     

Global planning of accelerated degradation tests based on exponential dispersion degradation models

The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms.     

Openshop scheduling under linear resources constraints

Consider n jobs (J₁, …, J_n), m working stations (M₁, …, M_m) and λ linear resources (R₁, …, R_λ). Job J_i consists of m operations (O_i1, …, O_im). Operation O_ij requires P_k(i, j) units of resource R_k to be realized in an M_j. The availability of resource R_k and the ability of the working station M_h to consume resource R_k, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029     

航天器近距离交会斜滑制导算法

提出了满足测量视场、最小脉冲间隔、最大脉冲受限等约束的燃料最省的航天器近距离交会多脉冲斜滑制导算法.建立了近距离交会(接近和撤离)多脉冲斜滑制导算法的统一数学模型;提出了理想交会轨道距离和速率的指数函数变化关系,使得算法能够实现任意时间的近距离交会,同时满足接近操作减速和撤离过程加速的任务要求;设计了对数函数映射法进行脉冲寻优.最后通过接近段和撤离段的操作仿真算例进行验证,仿真结果表明,相比最优化方法,对数函数映射法以较小的计算量实现了较好的寻优效果;算法能够以较省的燃料消耗实现轨道面内任意方向、任意时间内满足约束的近距离交会.     

汶川地震灾后重建住房规划环境制约因素及对策

汶川特大地震发生,四川省共有153个县（市、区）不同程度受灾,全省灾区需完成城乡住房重建49131．22万m^2（445．4万套）,重建城乡住房规划受到资源、环境的制约。通过对其制约因素分析,提出了对环境保护、资源保护有针对性的措施和对策,并对住房选址和建设生态人居环境提出了建议,有利于灾后重建城乡住房规划向建设生态人居环境方向发展。     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Ethnic groups,political exclusion and domestic terrorism

This study examines whether the exclusion of ethnic groups from political power is an important contributing factor to domestic terrorism. To empirically test this question, we employ a negative binomial regression estimation on 130 countries during the period from 1981 to 2005. We find that countries in which certain ethnic populations are excluded from political power are significantly more likely to experience domestic terrorist attacks and to suffer from terrorist casualties; furthermore, ethnic group political exclusion is a more consistent and substantive predictor of domestic terrorist activity than general political repression or economic discrimination.