共查询到20条相似文献，搜索用时 343 毫秒
1.
A new algorithm is presented by using the ant colony algorithm based on genetic method (ACG) to solve the continuous optimization problem.Each component has a seed set.The seed in the set has the value of component,trail information and fitness.The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed.The genetic method is used to form new solutions from the solutions got by the ants.Best solutions are selected to update the seeds in the sets and trail information of the seeds.In updating the trail information,a diffusion function is used to achieve the diffuseness of trail information.The new algorithm is tested with 8 different benchmark functions. 相似文献
2.
提出了一种解决无线传感器网络覆盖问题的能量有效性启发式机制.该机制在节能的前提下,实现了对目标监控区域的完全覆盖,且覆盖精度与目标的重要性级别成正比关系.机制的实现运用了蚁群优化算法,算法的设计过程采用了新颖的启发式因子构造方法和基于评价函数的全局信息素更新规则,由此,人工蚂蚁被赋予了对目标监控区域的覆盖状况和对传感器网络区域能量状况的自适应感知能力,并通过增加优化解集中节点上的信息素量,加速求取最优解的收敛过程.最后,蚁群在迭代优化的基础上构建出解决无线传感器网络覆盖问题的健壮优化解,该优化解能够在能量有效性的基础上具备良好的覆盖有效性和较长的生命周期. 相似文献
3.
ＩＮＴＲＯＤＵＣＴＩＯＮＡｎｔｃｏｌｏｎｙａｌｇｏｒｉｔｈｍｓ (Ｈｅｒｔｚ ,ｅｔａｌ.,2 0 0 0 ) ,ｉｎｖｅｓｔｉｇａｔｅｄｓｙｓｔｅｍａｔｉｃａｌｌｙａｔｆｉｒｓｔｉｎＤｏｒｉｇｏ’ｓＰｈ .Ｄ .ｄｉｓｓｅｒｔａｔｉｏｎ ( 1 992 )ａｓｔｈｅｉｍｉ ｔａｔｉｏｎｏｆｔｈｅｆｏｏｄ ｓｅｅｋｉｎｇｂｅｈａｖｉｏｒｉｎａｎｔｓｏｃｉｅｔ ｉｅｓ,ｈａｖｅａｔｔｒａｃｔｅｄｔｈｅｇｒｅａｔａｔｔｅｎｔｉｏｎｏｆｒｅ ｓｅａｒｃｈｅｒｓｉｎｃｏｍｐｒｅｈｅｎｓｉｖｅｆｉｅｌｄｓｏｆｓｙｓｔｅｍｏｐｔｉ ｍｉｚａｔ… 相似文献
4.
Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially
for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle
continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone
update to filtrate solution candidates. Global optimal solutions can be reached more rapidly by self-adjusting the path searching
behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant
colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The
results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.
Project (No. 9845-005) supported by National High-Tech. Research & Development Plan, China 相似文献
5.
给出了求解具有简单约束的下模集函数最大值问题的一种局部搜索算法,并讨论了所给算法的性能保证．该算法的基本思想是：算法每次迭代总是在当前近似解集的邻域内,求出使目标函数取得最大的集合,将其作为新的近似解集．分析表明,所给算法是一种多项式时间近似算法． 相似文献
6.
7.
序列中的标签SNPs—tagSNPs携带了SNPs数据集的绝大部分遗传信息,因此寻找tagSNPs意义重大。但从SNPs数据集中找出tagSNPs需要耗费巨大的计算量,传统的方法效率低且费用昂贵,对于复杂的集合覆盖问题,现有算法难以得到优化解。鉴于蚁群算法有较强的近优解搜索能力,因此,将改进的罚函数集合覆盖蚁群算法(RCACO)用于tagSNPs搜索。模拟数据集上进行的算法实验结果表明,与近两年的PSO、GA两类算法相比,所提出的算法运行时间较短,且搜索结果精确度更高。 相似文献
8.
TSP（旅行商问题）作为一种解决组合优化问题的有效方法,在近几十年来受到了广泛的研究。理论证明它是一个典型的NP难问题,为了更快捷地求解,候选集方法在多种求解算法比如LKH算法中都有用到,一般是用于产生一个接近局部最优的初始解,较少用于寻路过程中。本文提出了一种新的简单的候选集方法,它采用一种新的距离度量,更好地符合了对称TSP的寻路规则。将其应用于最大最小蚁群算法（MMAS）的寻路过程中,实验结果表明针对对称TSP问题,该方法能比基本的MMAS取得更好的性能。这种候选集方法也可以用于其他求解对称TSP问题的进化计算。 相似文献
9.
针对传统启发式算法难以平衡求解收敛次数与求解精度问题,通过充分分析GA和ACO两种算法的优缺点,设计了一种改进的遗传蚁群算法。将算法分为上下两步,分别以GA和ACO为主。在GA中引入信息素更新机制连接上下两部分算法|在ACO中引入遗传变异操作尽可能扩大解的范围。同时结合两种算法各自解的继承方式,采用合适的方法分别处理这两部分产生的不可行解。获得解后,通过引入交换邻域的爬山法思想进一步尝试优化解。最终在保证求解精度的前提下,减少求解所需的迭代次数。实验结果表明,在需要保证求解精度的前提下,相比传统GA,该方法的求解效率提高了一个量级。 相似文献
10.
11.
余慧 《湖北第二师范学院学报》2012,(8):9-12
由于常规蚁群算法容易陷入局部最优,出现停滞现象等问题,本文采用了城市选择策略,局部信息素更新策略,最优解预测策略和局部优化策略对蚁群算法进行优化改进,提出了基于局部信息素更新的思想。并通过一些TSP问题对改进的蚁群算法进行验证。实验结果表明改进后的蚁群算法在求解一些TSP问题上可以得到比目前所了解的最优解更满意的解。 相似文献
12.
为了提高求解0-1背包问题的效率,提出了两种贪心局部搜索算法,分别称为固定候选算法和变化候选算法.算法都以有效的方式构造好的初始解,随后执行局部搜索对其进行解质量上的改进.实验结果表明了两种算法的有效性、可行性及与价值密度贪心算法相比的优越性,同时进一步看出两种算法中变化候选算法相对较优,能够取得更好的结果. 相似文献
13.
针对机会路由的候选转发集中存在恶意节点导致网络性能下降问题,提出一种计算节点信任度的评估模型。使用贝叶斯公式计算节点的直接信任度,根据节点的代数连通度得到间接信任度,利用信息熵的概念得到综合信任度。为高效辨别出候选转发集中的恶意节点,预先设定信任度阈值[β]。提出一种基于节点信任度的机会路由算法TBOR。TBOR利用信任模型初始化候选集中每个节点的综合信任度,再利用信任度阈值判断潜在的恶意节点,并将信任度大于信任度阈值的节点添加到候选转发集。实验结果表明,TBOR能高效识别并剔除候选转发集中的恶意节点,具有较高的检测率,保证了数据可靠传输。 相似文献
14.
Middle matching mining algorithm 总被引：1，自引：0，他引：1
郭平 《重庆大学学报(英文版)》2003,2(2)
1. Introduction With the increase in the amount of information, we feel the pressure from 搕he exploring information? and find that we are in a dilemma of having huge data but with little knowledge [1]. Data mining is an effective method to help us to get rid of the morass, and is a process of inferring knowledge from such huge data. A sequence is an ordered list of transactions (or itemsets), in which each transaction is a set of items. Typically there is a transaction-time associated with ea… 相似文献
15.
The standard particle swarm optimization （PSO） algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group＇s previous best solutions to optimization problems. One problem in PSO is its tendency of trapping into local optima. In this paper, a multi-swarm technique based on fast particle swarm optimization（FPSO） algorithm is proposed by introducing crossover operation. FPSO is global search algorithm which can prevent PSO from trapping into local optima in light of Cauchy mutation. Though it can get high optimizing precision, the convergence rate is not satisfactory. FMSO can not only find satisfying solutions, but also speed up the search. 相似文献
16.
针对目前随机产生候选检测器的方式存在亲和度较低的问题。根据克隆选择的原理,对获取的入侵检测数据包进行预处理,对提取的属性采用归一化实数编码,应用混沌原理和抗原的先验知识产生亲和度高的候选检测器集合。根据检测器亲和度的不同,采用了不同的变异算子与进化策略,使算法不仅在保持高检测率下,降低了漏报率,且有效地提高了检测器进化速度。 相似文献
17.
The constrained Viterbi algorithm (C-VA) makes use of some prior reliable information to reduce complexity andimprove performance of Viterbi algorithm (VA). However it can only be used in the concatenate code scheme because thedetection result of cyclic redundancy check code (CRC) is exploited to provide reliable information. In this paper, a differentway is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were addedto the set partitioning in hierarchical trees (SPIHT) coded image sequence periodically and directly. They were thought to bereliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much bettererror resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired qualityof reconstructed images can be sacrificed. 相似文献
18.
Hao Zheng Yi-xiong Feng Jian-rong Tan Zhi-feng Zhang Zi-xian Zhang 《浙江大学学报(A卷英文版)》2016,17(4):286-294
Conceptual design plays an important role in product life cycle, which requires engineers to use sound design theory, cross-disciplinary knowledge, and complex technical support to acquire design concepts. However, the lack of sufficient computational tools makes it difficult for designers to fully explore in the wide design solution spaces. Therefore, this paper proposes an integrated cognitive computing approach to formalize the cognitive activities of conceptual design. A cognitive computing model composed of concept associative memory, concept generation, and decision-making process is established based on the integration of cognitive psychology and engineering design. First of all, the Hopfield neural network is used to acquire similar concept solutions for specific subfunctions from a knowledge base. Then, morphological matrix and genetic algorithm are introduced to produce a set of feasible candidate solutions in the concept generation process. Furthermore, a technique for order preference by similarity to an ideal solution is applied to evaluate the generated concept solutions and obtain the optimal solution automatically. Finally, a case study is given to demonstrate the effectiveness and efficiency of the proposed approach. 相似文献
19.
王慧 《宁波职业技术学院学报》2014,(3):84-86
针对医学领域无法解决的传染病感染问题,将差分系统的吴特征列方法实际应用于一类离散时间的SIR传染病模型的精确求解,并对求得模型解的结构进行分析,从而为传染病学的研究提供可靠数据。结果表明,该方法有助于同类传染病的控制及防范。 相似文献
20.
YU Bin TIAN Feng-chun HE Qing-hu RAN Jian LV Bo HONG Xin LIU Tao BI Yu-tian 《重庆大学学报(英文版)》2016,15(4):127-138
In this paper, a wavelet packet feature selection method for lung sounds based on optimization is proposed to obtain the best feature set which maximizes the differences between normal lung sounds and abnormal lung sounds (sounds with wheezes or rales). The proposed method includes two main steps: Firstly, the wavelet packet transform (WPT) is used to extract the original features of lung sounds; then the genetic algorithm (GA) is used to select the best feature set. The obtained optimal feature set is sent to four different classifiers to evaluate the performance of the proposed method. Experimental results show that the feature set obtained by the proposed method provides a higher classification accuracy of 94.6% in comparison with the best wavelet packet basis approach and multi-scale principal component analysis (PCA) approach. Meanwhile, the proposed method has effective generalization performance and can obtain the best feature set without priori knowledge of lung sounds. 相似文献