Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010     

多机种加油模拟训练系统设计与开发

开发多机种加油模拟训练系统,对于探索多机种飞行油料保障问题和提高机场后勤保障能力具有非常重要的意义。结合飞行油料保障实际要求,介绍了模拟训练系统的设计思想,建立了系统需求模型和总体层次结构模型;重点讨论了系统中所采用的场景生成、实体三维模型优化和动画等虚拟现实关键技术,最后给出实现系统所搭建的硬件环境。应用结果表明,该系统为多机种飞行油料保障训练和研究提供一种强有力的手段。     

基于CSCW的机关业务协同办公系统协作多用户界面研究

简要阐述了研究CSCW系统协作多用户界面的必要性,介绍了协作多用户界面的基本概念,分析并评价了几种传统的协作多用户界面体系结构,最后以某机关业务协同办公系统的协作多用户界面的设计为例,提出了一种协同混合式体系结构及具体的实现。     

基于SHARC流水集束型多处理器板研制

结合某重点工程课题 ,设计和实现了基于 SHARC流水集束型多处理器板即研制出了具有 5个 SHARC的高速并行数字信号处理机。板上处理器数量可实现重配置以获得高的性价比。当板上前端 4个 SHARC用于 FFT时 ,研究和分析了板上前端 4个 SHARC用于 FFT时的三种不同缓冲数据模式下 FFT节点处理性能     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

Dynamic evacuation routes for personnel on a naval ship

We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

多体结构连接部件的有限单元模型

针对多体结构中连接部位带来的运动不连续问题 ,提出了将连接部件不作节点处理而作单元看待的设想。从力学基本原理出发推导了单元的刚度矩阵与阻尼矩阵 ,并由拉格朗日方程推导了这种单元的平衡方程     

进化计算在机器人轨迹规划中的应用研究

本文介绍了采用进化计算思想研制的机器人轨迹规划系统ＲＴＰ－１，提出多层次动态结构化编码方案，利用低中高三层进化算法分别优化距离、路径和关节角度偏差，基于多层综合优化策略解决多目标多约束工程优化问题，建立了次序相关问题求解的通用框架。在进化算法中，利用拉马克效应加快轨迹规划速度，在ＲＭ－５０１机械手上实现的任意空间直线和空间曲线轨迹规划具有良好的鲁棒性，规划轨迹的相邻臂构型间具有良好的柔顺性，规划轨迹的臂构型序列具有良好的平滑性。本文所采用的机器人轨迹规划方法具有通用性，可推广应用于各种动力学系统的研制。     

进化计算在机器学习中的应用研究

采用进化计算思想研制机器学习实际系统，利用隐含并行机制及并行规则触发策略实现多目标优化技术。针对航天员模拟训练评分标准具体任务，采取灵活的多层次动态编码方案，建立多种简洁且完备的进化操作。利用信度分配组桶策略实现竞争机制，依赖进化算法搜索、发现并选择适当规则，引入启发知识产生缺省规则层次以实现多种隐式目标。设计并实现了遗传进化机器学习系统ＧＥＭＬ－１，该系统具有良好的鲁棒性和柔顺性。本文的遗传进化机器学习方法，可推广应用于各种军用专家系统和军事决策支持系统的研制，从而为人工智能在军事上的应用提供新的设计方法和实现途径。     

多因子动态加权威胁估计方法

在分析了以往威胁估计方法不足的基础上,提出了多因子动态加权威胁估计方法,该方法中给出了诸因子新的有作战背景的威胁隶属度函数,并运用层次分析法（ＡＨＰ）计算出权系数,而且随着作战环境的变化可动态调整之。