| 1. | A hybrid genetic algorithm based on neighborhood search in resource - constrained project scheduling problem
资源受限项目调度中基于邻域搜索的混合遗传算法 |
| 2. | It is a global search algorithm which combines the respective advantages of hybrid genetic algorithm and neighborhood search algorithm
它综合了遗传算法和邻域搜索算法各自优势的全局搜索算法。 |
| 3. | The paper based on the idea of k - opt algorithm for tsp , present a swap algorithm for the one - dimensional cutting - stock problem
摘要根据旅行商问题( tsp )的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。 |
| 4. | Based on ant algorithm with its mechanisms of transfer search and adjacent domain search , an ant algorithm model for the short - term optimal operation of hydropower station is constructed
摘要利用蚂蚁算法的转移搜索和邻域搜索机制，构造了水电站短期优化运行蚂蚁算法模型。 |
| 5. | Secondly , based on the analysis of the relationship between the processing tasks , a hybrid algorithm combined the filtered beam search algorithm with the local search algorithm is proposed
其次,在对工序任务之间的逻辑关系深入分析的基础上,提出一种基于过滤束算法思想与基本邻域搜索算法相结合的混合算法。 |
| 6. | Based on analysis and comparison of the existed biochip image segmentation methods , the adaptive circle segmentation algorithm combined with the neighborhood searching algorithm is realized to biochip image segmentation
在分析并比较了现有生物芯片图象分割方法的基础上，采用自适应圆形分割法，结合邻域搜索算法，实现了对生物芯片图象的分割。 |
| 7. | We develop a adaptive evolutionary algorithm based on neighborhood searching . firstly , class the individuals by the fitness number to realize the division of population . secondly , mutate each individual , that is mutating a good individual in a small range and a bad individual a large range
本文设计了一种基于邻域搜索的自适应演化算法：首先将种群中的个体按适应值分级，实现对种群中的优势个体与劣势个体的分割。 |
| 8. | The local search procedure based on several critical block based neighborhood structure is hybrid with aco _ stag algorithm , comparisons with other well - performed algorithms on taillard ' s benchmark problems show that the hybrid algorithm performs better
给出了fiowshop问题的几种基于关键路径的邻域结构，并把蚁群算法与邻域搜索相结合构成混合算法，与其他算法在taillard流水作业调度测试问题集上的比较试验表明，混合算法性能更优。 |
| 9. | The proposed genetic - tabu algorithms , which are based on the parallel search main flame provided by genetic algorithms , integrating biology evolution of genetic algorithms and local search of tabu search which can avoid circuit search , can solve global optimization problems quickly
本文提出的遗传禁忌搜索算法基于遗传算法提供的并行搜索主框架,结合遗传群体进化和禁忌搜索算法较强的具有避免迂回搜索能力的邻域搜索,可以实现快速全局优化。 |
| 10. | This hybrid algorithm take advange of local search of pattern search and whole search of genetic algorithm . it first confines the direction of large scale search to the area of high fitness by genetic algorithm , and then utilizes pattern search to search in the small area got by the searching of genetic algorithm . , thereby the optim value is got
该方法利用了单纯形法的局域搜索能力和遗传算法的全局搜索能力，通过遗传算法控制大范围搜索的方向，使得搜索向着适应度值高的区域发展，再通过单纯形法在遗传算法搜索到的区域内进行小范围的邻域搜索，从而能够得到高适应度值域的最优值。 |
