A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

杂合数据的粗糙集属性约简方法

针对决策表中属性取值为杂合数据的情况,提出了基于粗糙集理论的属性约简算法.首先给出了对象间在杂合数据下的相似度计算定义.为了获取合理的对象集合的软划分,给出了阈值计算的最优化模型,并基于粗糙集的上、下近似的概念,得到对象集合在条件属性下的上、下近似的覆盖划分.之后,通过各对象基于条件属性和决策属性的上、下近似下的分布矩阵描述,利用最大分布矩阵,直观地得到两种不同观点下的约简结果.实验结果表明了本算法的合理和有效性.     

常规导弹战前运输任务优化模型

制定常规导弹战前运输计划时,各车辆运输时间和运输路线的安排是一个组合优化问题.运用军事运筹学和不确定性优化理论,充分考虑节点冲突性、车辆隐蔽性、任务时间、道路容量等因素,建立了运输任务方案的优化模型.该研究为常规导弹波次作战计划的制定和优化提供模型支持,有助于提高常规导弹作战指挥自动化和部队的生存能力.     

Optimality of the greedy shooting strategy in the presence of incomplete damage information

Consider a situation where a single shooter engages, sequentially, a cluster of targets that may vary in terms of vulnerability and value or worth. Following the shooting of a round of fire at a certain target, the latter may either be killed or remain alive. We assume neither partial nor cumulative damage. If the target is killed, there is a possibility that the shooter is not aware of that fact and may keep on engaging that target. If the shooter recognizes a killed target as such, then this target is considered to be evidently killed. If the objective is to maximize the weighted expected number of killed targets, where the weight reflects the value of a target, then it is shown that a certain type of a shooting strategy, called a Greedy Strategy, is optimal under the general assumption that the more a target is engaged, but still not evidently killed, the less is the probability that the next round will be effective. If all weights are equal, then the greedy shooting strategy calls to engage, at each round, the least previously engaged target that is not evidently killed. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 613–622, 1997     

VRML三维模型文件的优化技术

目前在Web3D领域,VRML是主流的开发平台。但在建模过程中,通常使用第三方三维建模软件。这样极大地减轻了制作模型的难度,节约了时间;但由于建模平台本身的原因,转换后的VRML文件的体积比较大,不利于网络传输与浏览。因此,对模型的空间位置进行调整,尽可能地优化模型的视觉效果,缩减其文件体积,是建立虚拟环境非常重要的环节。主要针对这个问题提出了一些具体的优化技术与算法以及新的数据结构。     

基于稳态遗传算法的间歇式覆盖天基雷达星座优化设计

针对天基雷达星座的构型优化设计,建立了能够反映星座重要工作性能的单双基地间歇式覆盖模型、星间链路模型、双基地雷达的动目标检测模型,得到了低轨道卫星星座星间链路判断准则,给出了统计评价特性和综合评估指标体系。在此基础上,建立星座设计的优化模型,采用基于可行解搜索法的协同演化遗传算法并融入稳态遗传进化策略,有效地处理带有复杂计算的目标函数和约束条件的星座优化问题,计算分析实例表明利用该方法进行星座设计是非常有效的。     

域间流量工程体系结构的研究

随着Internet的快速发展,为了提高网络整体资源的利用率,出现了通过跨域网络性能的优化,达到优化网络资源使用的域间流量工程技术。在分析与评价域间流量工程体系结构研究状况的基础上,提出了面向域间流量工程的RCP体系结构以及今后需要研究的主要问题。     

利用动态规划原理实现多冲量最优交会问题

多冲量最优交会问题是航天领域非常重要的一个研究方向,从运筹学角度将此问题转化为一个多阶段多维动态规划问题,并着重对多阶段二维动态规划进行分析研究。在给出状态方程及指标函数递推公式的基础上,得到了两冲量和三冲量交会问题最优解的求解算法,之后分别通过实例验证了算法的有效性。对于以地心角等参数为决策变量的更高维问题,讨论了利用进化算法等降维方法实现多维动态规划的思想。