求解不确定型车辆路径问题的弱鲁棒优化方法

为降低鲁棒优化模型最优解的保守性,以最小化违约车辆数和总惩罚成本为目标,建立针对旅行时间不确定的开放式车辆路径问题的弱鲁棒优化模型。对于不确定数据集的每个取值,该模型的最优解可以使其目标函数值始终不超过某数值,进而改善最优解的保守性。为提高启发式算法发现最优解的概率,提出一种自设计遗传算法对模型进行求解,其主要思想是利用粒子群算法搜索出可使遗传算法预期产生最好解的算法要素,并将其进行组合,从而产生新的遗传算法。采用新产生的遗传算法对模型继续求解,输出最好解。计算结果表明:与以往的鲁棒优化方法相比,弱鲁棒优化方法的最优解的保守性显著降低。     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

惯性导航系统故障诊断的不确定性问题研究

针对构造惯性导航系统 ( INS)故障诊断所面临的确定性和不确定性问题 ,提出了基于模糊集理论的诊断方法 ,并给出诊断系统自动获取不确定性证据和确定性证据隶属度的方法及函数 .认为对于确定性证据和不确定性证据可以用统一的方法和原则来处理 ,并建立了两类证据的实用数学模型     

朝核问题对中国边境安全的影响

朝核问题一直是困扰东北亚地区安全的核心问题,自20世纪90年代第一次朝核危机至今．朝核问题不但没有得到妥善解决,反而更加复杂。2006年10月9日,朝鲜宣布成功进行了地下核试验,朝鲜半岛再一次成为全球关注的焦点。在前人研究的基础上,就朝核问题产生的背景,朝核问题对中国边境地区经济、地区稳定以及生态环境等方面产生的影响进行分析和探讨。     

建筑防排烟系统存在问题及对策

结合火灾烟气蔓延扩散的客观规律和防排烟工程的实际状况,分析了建筑防排烟工程存在的几个共性问题及其危害,剖析了出现这些问题的根本原因,提出了尽快制定一部统一的《防排烟系统设计规范》、加强防排烟系统的设计、施工队伍监督管理和部件质量管理的对策。     

消防无线通信存在问题及对策研究

介绍了我国消防无线通信在灭火救援中的重要性,重点从消防通信装备的配备、技术和管理等方面分析了消防无线通信在使用中存在的问题,并提出了解决这些问题的对策。     

对办好高等院校研究生课程进修教育的思考

近年来,高校纷纷举办各种形式多样的在职研究生课程进修班,针对这一新生的、过热的教育形式,本文从其定位和目前存在问题等方面进行系统分析,并提出了进一步办好研究生课程进修班的措施.     

基于移动Agent的特定数值求解算法研究

在分布式环境下,运用移动Agent技术实现大型复杂系统研究中经常使用的特定数值算法求解,可显著提高计算效率。以分支定界法为例,介绍了其设计思想和实践步骤,并对算法的时间复杂度进行了分析。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

一类带容量限制的运输问题

考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.