遗传算法在装备调拨辅助决策中的应用

利用遗传算法求解装备调拨中的路径优化问题和运输装载问题,并利用MATLAB进行了实例仿真,对装备调拨的辅助决策具有积极的意义。     

任务分配与调度中遗传算子的设计

应用遗传算法等进化方法进行任务分配与调度为越来越多的计算机学者们所关注。基于任务排列的知识表示 ,常规的标准遗传操作算子并不总是有效的。好的遗传算子对算法收敛性及收敛到好点是非常重要的。在列表编码的知识表示基础上 ,设计了三个有针对性的遗传算子 ,即改进的交配算子、内部交配算子和一种作为变异的迁移算子。模拟实验结果与分析表明这些算子对任务分配与调度是有效的。     

直接网络中的自适应路由算法分析

互连网络是大规模并行计算机的重要组成部分，路由算法是其中决定网络性能的重要因素，本文在直接网络结构基础上对路由算法进行讨论，给出了一种分类方法，并着重对采用虫孔路由开关技术的自适应路由算法进行分析，为进一步的评价和设计新的算法提供了参考。     

地形相关算法度量值的统计特性

考虑到地形相关匹配算法度量值统计特性与二维地形自相关系数的关系，本文提出一种改进的约翰逊方法——相关地形下的匹配算法度量值统计特性分析方法。首先，基于约翰逊方法的问题框架，修改其中基准数据的相邻像元值相互独立的假设，导出了地形相关 Ｍ Ｓ Ｄ 算法度量值的统计分布的解析函数。然后，讨论了约翰逊方法与本文方法的适用性，指出了约翰逊方法的不足之处。最后，给出了本文方法在地形可匹配性分析中的一种应用。     

基于遗传算法的协同多目标攻击空战决策方法

多机协同多目标攻击是未来空对空作战的一种重要形式。首先建立了多机协同空战的自主优势矩阵 ,并依据多人冲突决策理论构造了空战的总体优化指标向量 ,然后针对其他优化算法的不足 ,提出用遗传算法优化该指标向量 ,实现多机协同多目标攻击空战决策 ,最后对 2∶ 2空战进行了仿真。仿真结果证明了上述思想的正确性。     

A competitive genetic algorithm for resource-constrained project scheduling

In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998     

基于排挤机制改进的多目标进化算法

进化算法是求解多目标优化问题(MOP)重要而有效的方法。为加快收敛速度,提高收敛精度,在已有算法(NSGA-Ⅱ)的基础上,引进小生境思想,提出了更为合理的排挤机制。通过典型应用函数的计算测试,结果表明:上述改进不仅具有较高的计算效率,而且能够得到分布更为合理的解,且能保持解的多样性分布。     

经马氏修正的Poisson过程的极大似然估计

近年来 ,隐马氏模型成为研究相依随机变量的一个十分有用的工具。实际应用过程中的一个很重要的问题是如何对隐马氏模型的参数进行估计。将一类连续时间隐马氏模型的问题转化为离散时间隐马氏模型的问题 ,给出了具体的隐马氏模型———经马氏修正的Poisson过程的极大似然估计及其算法。此类过程被广泛用来对复杂电信网络的交通流进行建模     

基于遗传算法的嵌入式软件测试用例生成系统研究

综合考虑了嵌入式软件的特点,将遗传算法应用于搜索全面覆盖软件特殊路径的测试用例生成的问题,合理构建了嵌入式软件测试用例自动生成系统,给出了系统流程图,改进了部分算子,使搜索效果得以加强,并分析了交叉率、变异率等参数的取值范围,通过改变不同的参数值得到对比图,以确定适合该系统的最佳参数值,并针对实际汇编语言编写的嵌入式软件指定路径进行仿真测试,从理论和实践上证明了该思路的正确性和可行性。     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009