首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 240 毫秒
1.
搜索空间的规模和复杂程度是决定问题求解难度的重要因素,而解空间的信息往往可以引导搜索找到最优解.在已知JSP空间结构的基础上,提出一种空间收缩与划分算法.算法利用搜索算法获得的较优解,结合组合优化问题解的backbone的概念,将搜索空间收缩并划分为一个或多个优解域,在优解域内再进行小规模问题的优化.该算法不必在求解前或求解过程中进行大量的统计分析工作,可以利用求解信息对解空间的地形进行估计,提高求解速度和解的质量.实验结果也证明了算法的有效性.  相似文献   

2.
矢量水听器阵时频MUSIC算法研究   总被引:1,自引:0,他引:1       下载免费PDF全文
时频MUSIC算法利用信号的时频分布构造空间时频分布矩阵,并用该矩阵代替传统的相关矩阵进行DOA估计,可以有效抑制噪声和干扰,提高算法的稳健性。时频子空间算法突破了传统子空间算法中阵元数对估计信号个数的限制,时频点包含了信号的时频空三维信息,通过时频点的选择可直接确定信号的频率从而确定阵列流型矩阵。对于宽带信号,在进行方位估计时避免了频域搜索,减少了运算量。将时频MUSIC算法应用于二维矢量水听器垂直线阵中,充分利用矢量水听器的标、矢量信息和信号的时、频信息进行宽带信号的二维波达方位估计。仿真研究验证了算法的有效性。  相似文献   

3.
赵志彪  李瑞  刘彬  周武洲 《计量学报》2020,41(8):1012-1022
为了提高粒子群算法的求解精度,改善算法的搜索性能,提出一种基于速度交流的共生多种群粒子群算法(SMPSO)。该算法采用速度交流机制划分整个从种群为多个子种群,负责解空间的全局搜索,将获得的最优信息分享给主种群;主种群综合从种群与自身最优经验,负责局部深度优化,获得最优信息反馈给从种群,从而建立主从群间的共生关系,实现解空间的充分搜索。迭代后期,在主种群中引入自适应变异策略,提高算法跳出局部最优的能力。将提出的SMPSO算法应用于基准测试函数中,与其它改进的PSO算法进行比较。实验结果表明,SMPSO算法在求解精度、搜索能力、稳定性等方面均有较大的提高。  相似文献   

4.
基于并行混沌和复合形法的桁架结构形状优化   总被引:1,自引:0,他引:1  
针对多工况下受应力、位移和局部稳定性约束的桁架形状优化问题,提出了基于并行混沌优化算法和复合形法的混合优化算法。该算法综合利用了并行混沌的全局搜索能力,复合形法的快速局部搜索能力和混沌细搜索。首先,利用并行混沌优化算法快速搜索到全局最优解附近,然后应用改进复合形法以并行混沌的优化解为初始复形进行搜索,提高了最优解的搜索速度,最后应用混沌细搜索策略提高最优解的精度。两个典型数值算例验证了该混合优化方法对桁架形状优化问题的有效性和稳定性。  相似文献   

5.
蚁群算法、遗传算法作为两大仿生优化算法,有其各自的适用域与局限性。原有的遗传融合蚁群算法虽然克服了基本蚁群算法的不足,优化效果得到了改善,但是由于两种算法混合,当求解问题规模变得越来越大时,求解步骤也会增多,从而使得求解速度会有所缓慢。本文改进算法采用信息素挥发因子自适应调整机制,调节算法收敛速度,保证算法的全局搜索能力,进而扩大解的搜索空间。同时根据公共路径降低蚁群算法运算时间,诱导蚁群寻找更优解,提高了其寻优能力和速度。仿真结果表明,改进后的算法在寻优能力,收敛速度及求解精度上均取到了较好的效果。  相似文献   

6.
成宝芝 《光电工程》2014,41(6):38-44
由于高光谱图像具有高阶性和背景分布特性复杂的特点,这使得现有的算法在解决异常检测问题时存在一些不足。通过分析高光谱图像的光谱特性和空间特性,基于统计学习理论,利用光谱解混技术和子空间划分方法,提出了基于光谱解混的选择性波段子集高光谱图像异常检测算法。该算法首先利用光谱解混技术提取出对背景分布特性有严重影响的端元光谱,由此降低背景干扰突出异常目标信息;在此基础上,利用子空间划分方法将整个波段空间划分为大小不等的多个子空间,并在每个子空间内利用非高斯程度度量准则提取出富含异常目标信息的特征波段;最后,采用KRX算法作为异常检测算子完成异常目标检测。利用真实的高光谱图像对提出的算法进行实验验证,结果表明该算法是有效和合理的,具有良好的异常检测性能。  相似文献   

7.
为了有效的识别非线性转子系统的若干参数,提出了基于遗传算法、蚁群算法和邻域搜索算法的混合方法(Ne-GAAC),该算法利用遗传算法的快速随机搜索能力的优点,形成了蚁群算法的初始信息素分布和寻优区间,同时利用了蚁群算法正反馈以及具有分布式并行全局搜索能力的优点,最终在解收敛后采用局部邻域搜索算法得到精确解,算例结果表明,该方法可以有效的识别非线性转子系统的参数。  相似文献   

8.
在激光诱导扩散中,需要利用二元光学元件对激光器输出的高斯光束进行整形,以实现曝光区的温度分布均匀化。为了得到二元光学元件的位相分布,采用免疫遗传对相位分布进行设计。免疫遗传算法中采取变频率的交叉操作、变异操作,克服了遗传算法在局部搜索解空间上效率差的缺点,并使算法跳出局部极大值的能力得到了增强。采取由正向记忆细胞库提取的免疫疫苗对抗体群进行接种,使群体的进化方向得到引导,提高了算法的进化效率;采取由反向记忆细胞库提取的劣化疫苗对抗体群进行反向接种,减少算法的重复运算,极大地抑制了群体退化;采用B、T细胞的作用机制,保持群体在进化过程中的多样性,很大程度上抑制了算法未成熟收敛。运算结果表明,免疫遗传算法较遗传算法具有更高的算法效率和更强的寻优能力。最后考虑到实际加工,对最优解做适当调整得到了更适合于实际加工的二元光学元件的位相分布。  相似文献   

9.
粒子群算法适合求解连续变量优化问题,本文提出了粒子群算法的新离散化方法。常规粒子群算法在电力系统优化问题中取得了成功,但有"趋同性"。本文提出了改进多粒子群优化算法(IPPSO),IPPSO是两层结构:底层用多个粒子群相互独立地搜索解空间以扩大搜索范围;上层用1个粒子群追逐当前全局最优解以加快收敛。粒子群以及粒子状态更新策略不要求相同。  相似文献   

10.
本文描述的三维重建的方法旨在从提高重建效率和扩大形体覆盖域两个方面改进现有算法。本算法模拟人工识图的经验,采用启发式的搜索方式,加速了由解空间求解的进程,程序改造了一些基本模块的现有算法,提出了通过构造“生成树”搜索物体表面投影的“环路搜索法”,还提出了寻找基本块的“一点入手,两边定面”的搜索方法,本算法已能处理由平面及圆柱面构成的物体,其中通过完整表面轮廓线和切边在各个视图中的投影,已使轴矢量处于空间任意位置的圆柱表面得到了重建,文章阐述了形体覆盖域进一步扩展的可能。病态问题和多解情况在程序中得到了处理。  相似文献   

11.
Ant colony optimization (ACO) is a metaheuristic that takes inspiration from the foraging behaviour of a real ant colony to solve the optimization problem. This paper presents a multiple colony ant algorithm to solve the Job-shop Scheduling Problem with the objective that minimizes the makespan. In a multiple colony ant algorithm, ants cooperate to find good solutions by exchanging information among colonies which are stored in a master pheromone matrix that serves the role of global memory. The exploration of the search space in each colony is guided by different heuristic information. Several specific features are introduced in the algorithm in order to improve the efficiency of the search. Among others is the local search method by which the ant can fine-tune their neighbourhood solutions. The proposed algorithm is tested over set of benchmark problems and the computational results demonstrate that the multiple colony ant algorithm performs well on the benchmark problems.  相似文献   

12.
In multi-objective optimization computing, it is important to assign suitable parameters to each optimization problem to obtain better solutions. In this study, a self-adaptive multi-objective harmony search (SaMOHS) algorithm is developed to apply the parameter-setting-free technique, which is an example of a self-adaptive methodology. The SaMOHS algorithm attempts to remove some of the inconvenience from parameter setting and selects the most adaptive parameters during the iterative solution search process. To verify the proposed algorithm, an optimal least cost water distribution network design problem is applied to three different target networks. The results are compared with other well-known algorithms such as multi-objective harmony search and the non-dominated sorting genetic algorithm-II. The efficiency of the proposed algorithm is quantified by suitable performance indices. The results indicate that SaMOHS can be efficiently applied to the search for Pareto-optimal solutions in a multi-objective solution space.  相似文献   

13.
For many structural optimization problems, it is hard or even impossible to find the global optimum solution owing to unaffordable computational cost. An alternative and practical way of thinking is thus proposed in this research to obtain an optimum design which may not be global but is better than most local optimum solutions that can be found by gradient-based search methods. The way to reach this goal is to find a smaller search space for gradient-based search methods. It is found in this research that data mining can accomplish this goal easily. The activities of classification, association and clustering in data mining are employed to reduce the original design space. For unconstrained optimization problems, the data mining activities are used to find a smaller search region which contains the global or better local solutions. For constrained optimization problems, it is used to find the feasible region or the feasible region with better objective values. Numerical examples show that the optimum solutions found in the reduced design space by sequential quadratic programming (SQP) are indeed much better than those found by SQP in the original design space. The optimum solutions found in a reduced space by SQP sometimes are even better than the solution found using a hybrid global search method with approximate structural analyses.  相似文献   

14.
A novel immune algorithm is suggested for finding Pareto-optimal solutions to multiobjective optimization problems based on opt-aiNET, the artificial immune system algorithm for multi-modal optimization. In the proposed algorithm, a randomly weighted sum of multiple objectives is used as a fitness function, and a local search algorithm is incorporated to facilitate the exploitation of the search space. Specifically, a new truncation algorithm with similar individuals (TASI) is proposed to preserve the diversity of the population. Also, a new selection operator is presented to create the new population based on TASI. Simulation results on seven standard problems (ZDT2, ZDT6, DEB, VNT, BNH, OSY and KIT) show that the proposed algorithm is able to find a much better spread of solutions and better convergence near the true Pareto-optimal front compared to the vector immune algorithm and the elitist non-dominated sorting genetic system.  相似文献   

15.
 提出了信息熵改进的粒子群优化算法用于解决有应力约束、位移约束的桁架结构杆件截面尺寸优化设计问题.首先介绍了信息熵基本理论和基本粒子群优化算法理论,然后对粒子群优化算法作了合理的参数设置,并将信息熵引入粒子群优化算法的适应函数和停机判别准则中.最后对2个经典的优化问题进行求解并与其他算法进行了比较.数据结果表明信息熵改进后的粒子群优化算法在桁架结构优化设计中优于其他同类算法.  相似文献   

16.
The flow shop scheduling problem with blocking has important applications in a variety of industrial systems but is under-represented in the research literature. In this paper, a modified fruit fly optimisation (MFFO) algorithm is proposed to solve the above scheduling problem for makespan minimisation. The MFFO algorithm mainly contains three key operators. One is related to the initialisation scheme in which a problem-specific heuristic is adopted to generate an initial fruit fly swarm location with high quality. The second is concerned with the smell-based search in which a neighbourhood strategy is designed to generate a new location. To further enhance the exploitation of the proposed algorithm considered, a speed-up insert-neighbourhood-based local search is applied with a probability. Finally, the last is for the vision-based search in which an update criterion is proposed to induce the fruit fly into a better searching space. The simulation experimental results demonstrated the efficiency of the proposed algorithm, in spite of its simple structure, in comparison with a state-of-the-art algorithm. Moreover, new best solutions for Taillard’s instances are reported for this problem, which can be used as a basis of comparison in future studies.  相似文献   

17.
The facility layout problem (FLP), a typical combinational optimisation problem, is addressed in this paper by implementing parallel simulated annealing (SA) and genetic algorithms (GAs) based on a coarse-grained model to derive solutions for solving the static FLP with rectangle shape areas. Based on the consideration of minimising the material flow factor cost (MFFC), shape ratio factor (SRF) and area utilisation factor (AUF), a total layout cost (TLC) function is derived by conducting a weighted summation of MFFC, SRF and AUF. The evolution operations (including crossover, mutation, and selection) of GA provide a population-based global search in the space of possible solutions, and the SA algorithm can lead to an efficient local search near the optimal solution. By combing the characteristics of GA and SA, better solutions will be obtained. Moreover, the parallel implementation of simulated annealing based genetic algorithm (SAGA) enables a quick search for the optimal solution. The proposed method is tested by performing a case study simulation and the results confirm its feasibility and superiority to other approaches for solving FLP.  相似文献   

18.
Many methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) heuristic algorithm. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this article, a discrete search strategy using the HS algorithm is presented in detail and its effectiveness and robustness, as compared to current discrete optimization methods, are demonstrated through several standard truss examples. The numerical results reveal that the proposed method is a powerful search and design optimization tool for structures with discrete-sized members, and may yield better solutions than those obtained using current methods.  相似文献   

19.
A search procedure with a philosophical basis in molecular biology is adapted for solving single and multiobjective structural optimization problems. This procedure, known as a genetic algorithm (GA). utilizes a blending of the principles of natural genetics and natural selection. A lack of dependence on the gradient information makes GAs less susceptible to pitfalls of convergence to a local optimum. To model the multiple objective functions in the problem formulation, a co-operative game theoretic approach is proposed. Examples dealing with single and multiobjective geometrical design of structures with discrete–continuous design variables, and using artificial genetic search are presented. Simulation results indicate that GAs converge to optimum solutions by searching only a small fraction of the solution space. The optimum solutions obtained using GAs compare favourably with optimum solutions obtained using gradient-based search techniques. The results indicate that the efficiency and power of GAs can be effectively utilized to solve a broad spectrum of design optimization problems with discrete and continuous variables with similar efficiency.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号