共查询到19条相似文献,搜索用时 78 毫秒
1.
谢琳 《微电子学与计算机》2011,28(10)
在经典规划中,目标是找到一系列连续的行为,改变初始状态Z到一些满意的目标状态G.局部满意规划(PSP)问题是规划问题中的核心问题之一.在PSP中,文献[1-2]给出的每个目标有一个功能值ug≥0,代表每个目标对于用户的价值;每个行为a∈A,有一个关联执行代价Ca≥0,代表它执行每个行为的代价.P为所有有效规划集,Gp∈G为目标集,目标是寻找一个规划p在功能ug和执行代价之间寻找最大差,即arg p∈P max sum (ug)from g∈Gp-sum (Ca) from c∈p针对局部满意问题,提出了一种新的启发式搜索算法.该算法经过验证,取得了明显的效果. 相似文献
2.
本文直接从结构力滨三个基本方程出发,构造了一种有效的布局优化设计方法,最优解通过一个线性规划的求解完成,此外,将m n个性态约束等效为n个独立的性态约束。在线性规划的求解中,需要给定的是应力场而不是位移场。最后,将专家系统应用于结构的机动性分析。几个数值计算结果说明了方法的有效性。 相似文献
3.
4.
5.
6.
7.
一种基于改进混合遗传算法的贴片机装配工艺优化方法 总被引:4,自引:1,他引:3
贴片工艺流程是贴片机装配速度提高的瓶颈。首先对遗传算法的遣值线性尺度变换作了改进,然后在改进的遗传算法中融入模拟退火算法,提出了改进的混合遗传算法,提高了遗传算法的全局寻优能力。针对拱架型贴装机,采用改进混合遗传算法对装配工艺进行优化设计。计算结果表明,能明显缩短PCB的装配时间,优化效果较采用遗传算法和邻近算法更为明显。 相似文献
8.
本文首先说明了光纤局域网的优点及其发展,然后着重讨论了一种实用光纤局域网的方案及其拓朴结构设计,在此基础上进一步分析了网络设备及软件的指标和功能。最后,介绍了该网在文汇报社新闻大楼中的使用情况。 相似文献
9.
利用计算机局域网来实现网络化考试已经成为当今比较流行的考试方式,许多计算机等级考试均采用这种考试方式。介绍了一种利用Visual Basic6.0中的文件系统对象FSO,实现基于局域网的试卷收发的方法,此方法同样也适用于平时上机实验课程作业的收发。 相似文献
10.
在对信道分配问题分析的基础上,给出数学模型,将此问题转化为带约束的优化问题,并通过设计遗传算法的个体编码方式,适应度函数、遗传算子实现了移动通信中的信道分配问题的优化。 相似文献
11.
The Optimal Multiple Multicast Problem (OMMP) on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and the set of multicast requests are given, OMMP is the problem that selects a suitable path (or paths) and wavelength (or wavelengths) among the many possible choices for each multicast request such that not any pair of paths using the same wavelength pass through the same link. In this paper, a formulation of OMMP is given; this problem is NP-hard since the famous RWA problem which has been proved NP-hard is a special case of OMMP. In this paper, the OMMP is divided into two subproblems: path routing and wavelength assignment subproblems. For each subproblem, two heuristic algorithms are proposed to solve it. Moreover, a hybrid method which combines heuristic and simulated annealing algorithm is proposed to find the near optimal solution. Experimental results indicate that these algorithms are efficient. 相似文献
12.
13.
14.
In this paper, we investigate the extended cell assignment problem which optimally assigns new adding and splitting cells in Personal Communication Service (PCS) to switches in a wireless Asynchronous Transfer Mode (ATM) network. Given cells in a PCS network and switches on an ATM network (whose locations are fixed and known), we would like to do the assignment in an attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem, and finding an optimal solution to this problem is NP‐hard. A heuristic algorithm and a simulated annealing algorithm are proposed to solve this problem. The heuristic algorithm, Extended Assignment Algorithm (EEA), consists of two phases, initial assigning phase and cell exchanging phase. First, in the initial assigning phase, the initial assignments of cells to switches are found. Then, these assignments are improved by performing cell exchanging phase in which two cells are repeatedly exchanged in different switches with great reduction of the total cost. The simulated annealing algorithm, ESA (enhanced simulated annealing), generates constraint‐satisfied configurations, and uses three configuration perturbation schemes to change current configuration to a new one. Experimental results indicate that EAA and ESA algorithms have good performances. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
15.
针对遗传算法(GA)易陷入局部最优解、搜索精度低等缺点,提出了网络启发式策略的遗传算法(NSHGA),并将其成功地应用于0-1背包问题的求解。该算法采用网络节点关联策略,使算法具有良好的全局寻优能力。同时引入网络节点矩阵优化,利用其精细的局部遍历搜索性能,使算法具有较高地搜索精度。实例仿真结果表明,NSHGA算法可有效避免基本GA算法的早熟收敛,且具有寻优能力强、搜索精度高等特点。此外,与基本遗传算法仿真相比,可明显提高0-1背包问题求解的精度。 相似文献
16.
17.
18.