Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

多UCAV协同控制中的任务分配模型及算法

任务分配是多UCAV协同控制的核心和有效保证。分析了影响目标价值毁伤、UCAV损耗、任务消耗时间等三项关键战技指标的因素,综合考虑实战中多UCAV同时攻击同一目标和使用软杀伤武器这两种典型情况对UCAV执行任务的影响,建立了针对攻击任务的多UCAV协同任务分配模型,并应用粒子群算法求解。仿真结果验证了模型的合理性和算法的有效性。     

Aerodynamics analysis of a hypersonic electromagnetic gun launched projectile

A hypersonic aerodynamics analysis of an electromagnetic gun (EM gun) launched projectile configuration is undertaken in order to ameliorate the basic aerodynamic characteristics in comparison with the regular projectile layout. Static margin and pendulum motion analysis models have been applied to evaluate the flight stability of a new airframe configuration. With a steady state computational fluid dynamics (CFD) simulation, the basic density, pressure and velocity contours of the EM gun projectile flow field at Mach number 5.0, 6.0 and 7.0 (angle of attack = 0°) have been analyzed. Furthermore, the static margin values are enhanced dramatically for the EM gun projectile with configuration optimization. Drag, lift and pitch property variations are all illustrated with the changes of Mach number and angle of attack. A particle ballistic calculation was completed for the pendulum analysis. The results show that the configuration optimized projectile, launched from the EM gun at Mach number 5.0 to 7.0, acts in a much more stable way than the projectiles with regular aerodynamic layout.     

A novel facial emotion recognition scheme based on graph mining

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.     

采用遗传算法的弹托迎风窝结构设计

针对一体化弹丸弹托易分离性和轻质化的设计要求,构建弹托迎风窝参数化外形模型,基于激波和膨胀波理论建立弹托气动力计算模型;以弹托分离加速度和弹托质量综合最优为目标函数,采用遗传算法对弹托迎风窝的外形参数进行优化设计,从而得到弹托迎风窝的优化外形。以中口径尾翼稳定脱壳穿甲弹的弹托设计为例,采用提出的优化设计模型对其迎风窝结构进行优化设计,并采用基于动网格技术的弹托分离仿真模型验证其最优性。仿真结果表明：所提优化模型能够得到最优的弹托迎风窝结构;针对现有的中口径尾翼稳定脱壳穿甲弹,可进一步对其弹托结构进行优化,以提高其分离快速性。     

火箭-双燃烧室冲压组合循环发动机概念研究

临近空间高超声速飞行器近年来获得了广泛关注,本文提出一种以基于火箭发动机和双燃烧室冲压发动机的多模态火箭-双燃烧室冲压组合循环发动机作为飞行器的动力系统,并进行了性能分析研究。该飞行器在海拔10 km左右高度以0.8马赫的速度投放,在重力和发动机推力的联合作用下,能够在海拔5～8 km处加速到2马赫;然后加速爬升进入临近空间,发动机工作在引射亚燃或者双燃烧室亚燃模态下。可以根据实际选择高推重比、较低推进剂比冲效率的引射亚燃模态,或是较低推重比、高推进剂比冲效率的双燃烧室亚燃模态。最终飞行器加速到6马赫(26 km),进入双燃室超燃模态。针对空中发射模式和地面发射模式进行了轨道优化,仿真结果表明:在加速爬升到6马赫(26 km)的过程中,空中发射模式相比较地面发射模式可以节省37%的推进剂;空中发射模式存在一个负的最优初始飞行角度使得剩余质量与初始质量的比值达到最大。     

基于混合粒子群优化的多目标决策新方法

多目标优化问题中的一个关键在于合理地评判各有效解的优劣。通过引入灰色系统理论中灰色关联度的概念作为评判准则,结合粒子群优化算法进行有约束多目标规划问题的研究。提出了一种新的不可行解的保留策略,进化过程中以此策略保留适量的不可行解,有利于增强对约束边界附近可能的最优解的搜索,同时,针对粒子群优化算法的容易陷入局部最优的缺点,实现了以粒子群优化为载体的混合算法:即对全局极值邻域进一步混沌搜索寻优。仿真结果表明改进的算法对多目标决策问题是有效的。     

AHP-SWOT分析法在控制下交付行动方案决策中的应用

控制下交付作为打击毒品犯罪尤其是跨国有组织毒品犯罪的重要措施和手段,已发挥越来越重要的作用,是其他缉毒措施和手段无法取代的。但是,由于毒品犯罪的集团化、国际化、种类多元化程度加剧,使得控制下交付的复杂性与不确定性越来越明显。鉴于此,将AHP植入SWOT分析法中,以定性和定量相结合的科学方法解决控制下交付行动方案的优选问题,对提高控制下交付的成功率具有重要意义。