自适应分组量子衍生蛙跳算法

为提高传统蛙跳算法的优化能力,基于组内平均目标函数值实施动态分组,采用多量子比特概率幅实施个体编码,基于组内最优蛙和组间最优蛙确定旋转角度,采用基于张量积构造的多比特量子旋转门实施组内最差蛙的更新.标准函数极值优化的实验结果表明,该算法的单步迭代时间较长但优化能力较传统蛙跳算法约有两个数量级的提高,从而表明提出的分组策略和编码方法切实能够提高传统蛙跳算法的优化能力.     

求解随机规划问题新方法——优劣解法

随机规划最优化,即使随机规划的目标函数最优化,达到最优值。那么怎样求随机规划目标函数的最优值呢?设随机规划问题min z=c′x,C为n维随机列向量,x为n维列向量,D为约束域。求其在满足约束条件下随机目标函数的最优值z~*=c′x~*。而如何判断随机变量是最小的呢?下面就此讨论,从而提出比较随机变量的方法。     

一种军用综合接入设备的设计和应用

军用通信网正在向数字化、综合化和智能化方向发展,设计和开发能够提供多种业务接入的军用综合接入设备是保障部队通信高效运行的一项迫切需求.阐述了发展军用综合接入设备的背景和必要性,并提出了通过发展能实现业务综合的接入设备的ISDN过渡的策略.重点对我们正在业务能务和应用场合,最后对军用综合接入设备的应用前景进行了展望.     

加拿大旅行者问题

针对加拿大旅行者问题 ,分析其主要变形——确定型可恢复的加拿大旅行者问题。考虑堵塞边动态产生 ,一个遇到且堵塞边在时间 l( x,x)后可以自动恢复情况下的道路选择。通常对于在线算法可以从两个方面进行评价 :最坏情形分析和竞争比分析。本文先设计了求解最坏情形下旅行时间最短的标号算法并分析了其计算复杂性。而后在竞争比分析中 ,设计了基于贪婪原则的选路策略 ,并对其进行了竞争比分析 ,证明了该贪婪策略对于确定型可恢复加拿大旅行者问题的竞争比为 ( k+ 2 ) /2     

“优胜劣汰”与指导性计划管理的最优决策方法

“优胜劣汰”与指导性计划管理的最优决策方法郭仲伟，徐联仓，崔德光（清华大学，北京１０００８４）（中国科学院）（清华大学，北京１０００８４）“ＮａｔｕｒａｌＳｅｌｅｃｔｉｏｎ”ａｎｄＯｐｔｉｍａｌＤｅｃｉｓｉｏｎ－ＭａｋｉｎｇＭｅｔｈｏｄｏｆＧｕｉｄａ...     

呼叫中心中排队系统服务率的动态控制方法

对多服务台、缓存容量受限、用户等待太久后厌烦而中途离开的呼叫中心排队系统,运用马尔科夫决策过程理论,建立折扣准则最小期望代价函数模型,动态控制服务率.结果表明,合适的服务台数和到达率的情况时,最优策略会具有单调性,提高决策的效率, 并且结合有限阶段和无限阶段进行分析,兼顾了系统稳态工作时服务台利用率.     

系统可靠度约束下的备件配置优化

备件的配置优化对于系统可靠性的保障和维护成本的降低具有重要的作用。为了保障系统的长期稳定经济运行,构建了系统可靠性模型和备件配置模型,以系统可靠度阈值和任务运行时长为约束条件,采用成本效益重要度对备件配置模型进行优化,寻求以备件配置成本最低为目标的备件配置方案。当系统可靠度下降到预设阈值时,计算系统各组件的成本效益重要度,选择成本效益重要度最大的组件进行备件,如此进行迭代,直到完成运行任务,形成最优的备件配置方案。最后,以数控机床主轴系统伺服驱动装置为例验证了该方法的可行性。     

Method for Risky Multiobjective Group Decision-Making and Its Application

The multiobjective group decision-making problem under risk is common in reality. This paper focuses on the study about risky multiobjective group decision-making problem where the index value is not certain. We give indexes classifying method and index normalizing formula of this type problem. By building objective function that minimizes general weighted distance from every alternative to the relatively best and worst alternative, the optimal membership degree of every decision-maker to every alternative can be obtained, and by building another objective function that minimizes general weighted distance from the optimal membership degree of every decision-maker to every alternative to the group optimal alternative and the group inferior alternative, the optimal membership degree of every decision-maker to every alternative can be obtained, which are both based on probability theory and fuzzy theory. Aftermost a model is established which collects group preferences. This method provides a new idea and     

证券选择的极大极小设计方法

在现代金融理论的基本框架下,提出了证券选择的极大极小设计(即最差情况最优化)的概念与方法主要证明了当金融市场完备时使最差情况证券收益率最优的证券组合的存在性,给出极大极小收益率的大小及求解最优证券组合的方法最后还基于简单的算例讨论了极大极小证券选择方法的特点等问题.     

基于构件的变电站控制与信号系统仿真

本文用“输入—控制—输出”模型描述变电站控制与信号系统中的各种电气设备,创建具有一定可视性、通用性和开放性的系统仿真模型。针对仿真模型拥有大量的开关性电气部件和局部独立性等特点,提出了等效节点法、模块分割法、树梢消去法和局部调整法,以提高其仿真的快速性。     

Multiobjective Imperialist Competitive Algorithm for Solving Nonlinear Constrained Optimization Problems

Nonlinear constrained optimization problem(NCOP) has been arisen in a diverse range of sciences such as portfolio, economic management, airspace engineering and intelligence system etc.In this paper, a new multiobjective imperialist competitive algorithm for solving NCOP is proposed.First, we review some existing excellent algorithms for solving NOCP; then, the nonlinear constrained optimization problem is transformed into a biobjective optimization problem. Second, in order to improve the diversity of evolution country swarm, and help the evolution country swarm to approach or land into the feasible region of the search space, three kinds of different methods of colony moving toward their relevant imperialist are given. Thirdly, the new operator for exchanging position of the imperialist and colony is given similar as a recombination operator in genetic algorithm to enrich the exploration and exploitation abilities of the proposed algorithm. Fourth, a local search method is also presented in order to accelerate the convergence speed. At last, the new approach is tested on thirteen well-known NP-hard nonlinear constrained optimization functions, and the experiment evidences suggest that the proposed method is robust, efficient, and generic when solving nonlinear constrained optimization problem. Compared with some other state-of-the-art algorithms, the proposed algorithm has remarkable advantages in terms of the best, mean, and worst objective function value and the standard deviations.     

How Task Allocation Strategy Affects Team Performance: A Computational Experiment

This paper studies how to determine task allocation schemes according to the status and requirements of various teams, to achieve optimal performance for a knowledge-intensive team (KIT), which is different from traditional task assignment. The way to allocate tasks to a team affects task processing and, in turn, influences the team itself after the task is processed. Considering the knowledge requirement of tasks as a driving force and that knowledge exchange is pivotal, we build a KIT system model based on complex adaptive system theory and agent modeling technology, design task allocation strategies (TASs) and a team performance measurement scale utilizing computational experiment, and analyze how different TASs impact the different performance indicators of KITs. The experimental results show the recommend TAS varies under different conditions, such as the knowledge levels of members, team structures, and tasks to be assigned, particularly when the requirements to the team are different. In conclusion, we put forward a new way of thinking and methodology for real task allocation problems and provide support for allocation decision makers.     

基于遗传算法的区域防空部署优化研究

对区域防空战斗部署进行了详细分析 ,建立了兵力优化分配的数学规划模型。为了获得部署问题的全局最优解 ,将遗传算法 (GA)用于区域防空部署优化研究中 ,并对传统遗传算法进行了改进 ,最后给出了模型求解的方法和步骤。经过应用实例的计算 ,该方法能够取得良好的部署效果 ,这表明该方法可为制定防空作战指挥自动化决策提供科学、有效的支持。     

同类机半在线排序问题及其近似算法

研究两台同类机系统两个半在线排序问题 .第一个为总加工时间已知 ,第二个为最大工件加工时间已知 .对这两个问题 ,文章给出了各自的近似算法 ,证明了它们的最坏情况界分别为 3和3/2 .文章还研究了上述问题的下界并与我们的算法的最坏情况界进行了比较.     

大系统管理决策

对具有众多子系统及其一个平衡关系——投入产出分析表的大系统,提出了一套管理决策方法此技术涉及许多新概念,如田口的信噪比[1],多变量Cp统计[4],多边矩阵[6]等关于大系统的最优方案组合可以从它的子系统的决策方案逐步得到一般地,此方法可以立即给出许多优良的方案,以供管理决策者从中选取可行的、经济的和满意的方案.     

基于系统最优策略的占线交通流量分配

针对n次连续的交通需求依次到达出发点选择路径到目的地去的问题,本文从占线与竞争策略的角度出发,研究流量是任意可分的情形下交通流量分配,采用系统最优策略分配交通需求,即每次分配流量后都能使得当前网络上所有用户花费费用总和最小.借助于变分不等式对系统最优策略进行了竞争分析,特别地,当路阻函数是系数非负的线性函数时,证明该策略是4-竞争的;当路阻函数是系数非负、度数至多是d的多项式函数时,该策略是(d+)d+1-竞争的,同时给出系统最优策略竞争比的下界是5/3.     

基于适应度分组的进化策略

一般的进化策略都采用选择子代中最好的一部分个体替代原来的父代个体进入下一代进化,这样使那些相对劣的个体没有机会进入以后的进化过程。但每一个个体都有优良的一面,它们都有可能进化成最优解。鉴于此,根据每代群体的平均适应度将种群分为两部分:优势种群和劣势种群。父代个体以一定的比例在两组中选取,这样使劣质个体也有机会参加到进化中。仿真结果表明该方法对求解优化问题是有效的。     

Optimal decisions when balancing expected profit and conditional value-at-risk in newsvendor models

This paper investigates a risk-averse inventory model by balancing the expected profit and conditional value-at-risk (CVaR) in a newsvendor model setting. We find out that: i) The optimal order quantity is increasing in the shortage cost for both the CVaR only criterion and the tradeoff objective. ii) For the case of zero shortage cost, the optimal order quantity to the CVaR criterion or tradeoff objective is increasing in the selling price, respectively. However, it may not be monotonic in the selling price when incorporating a substantial shortage cost. Moreover, it may be larger or less than the risk-neutral solution. iii) Under the tradeoff objective function, although the optimal order quantity for the model without shortage cost is increasing in the weight put on the expected profit, this property may not be true in general for the model with a substantial shortage cost. Some numerical examples are conducted to verify our results and observations.     

考虑不完美维修的定期检测与备件策略联合优化

针对退化过程服从三阶段故障过程的单部件系统提出了定期检测与备件订购策略联合优化.该策略下,根据检测时系统的状态执行不同的维修活动:当系统处于正常状态,不执行任何维修活动;若识别轻缺陷进行不完美维修并采用比例役龄回退模型描述不完美维修效果;若识别严重缺陷则更换系统.当更换系统时需考虑备件状态:若处于存货状态则立即更换,若正处于途中则到货时更换,若未订货需立即订货并在到货时刻更换.考虑所有更新事件采用更新报酬理论建立以最小化单位时间内期望成本为目标的模型,同时优化检测周期和订货点.最后,设计枚举优化算法和离散仿真算法求解模型,并在算例分析中验证模型的有效性和适用性.     

面向多源多目标协作网络的中继选择方法

在多源多目标无线网络中采用最佳中继协作方法时,多个通信对有可能同时选择同一个节点作为最佳中继来进行协作传输,从而导致最佳中继冲突问题,进而对系统的协作性能产生严重影响。为了解决这一问题,提出了两种低冲突的中继选择方法,并将其扩展至功率可分配场景;同时,还提出了一种支持功率分配的分布式选择方法。仿真结果表明,所提方法在保证系统分集增益不变条件下,相比于已有方法,显著降低了中继冲突情况发生,改善了系统协作效果;并在性能接近于最优方法的前提下,有效降低了中继选择方法的复杂度。