In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new cro...In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.展开更多
Appropriate schemata as a novel concept to characterize building blocks are introduced, and then, the traits of appropriate schemata are presented. The effects of building blocks by search operators are analyzed. Henc...Appropriate schemata as a novel concept to characterize building blocks are introduced, and then, the traits of appropriate schemata are presented. The effects of building blocks by search operators are analyzed. Hence, the experiments on RR-8X8 are employed to verify that appropriate schemata construct the building blocks. The validity of appropriate schemata and building blocks from the views of theory and practice is presented.展开更多
This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for ge...This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for genetic operator, the crossover can maintain a diversity of population without disrupting the characteristics and search the global optimization. Simulation results on famous benchmark problems MT06, MT10 and MT20 coded by Matlab show that our genetic operators are suitable to job-shop scheduling problems and outperform the previous GA-based approaches.展开更多
针对实际道路路网的一类路径寻优问题,提出了带回退机制的蚁群搜索算法,求解在实际道路路网中完成遍历所有规定节点的一条较优路径。为解决大规模实际道路路网数据量大、蚁群算法收敛速度慢的问题,分别采用Intel Threading Building Blo...针对实际道路路网的一类路径寻优问题,提出了带回退机制的蚁群搜索算法,求解在实际道路路网中完成遍历所有规定节点的一条较优路径。为解决大规模实际道路路网数据量大、蚁群算法收敛速度慢的问题,分别采用Intel Threading Building Blocks(TBB)和Cilk++并行编程模型实现了并行蚁群搜索。与基于WinAPI函数的多线程蚁群算法相比,这两种模型均避免了手动启动线程及识别临界区资源等复杂操作,开发难度降低;在运行效率方面,基于TBB的并行蚁群算法和基于WinAPI的并行蚁群算法效率接近,而基于Cilk++的并行蚁群算法在双核环境下,运行效率和加速比都超过了基于WinAPI的并行蚁群算法。展开更多
在诸多图像边缘检测的算法中,Canny算法具有边缘检测性能良好、不易受噪声的影响、可以在噪声和边缘检测间获得很好的平衡等优点,不足之处是计算量大、实时性差。针对Canny算法存在的计算量大和实时性差等问题,提出了一种并行实现策略,...在诸多图像边缘检测的算法中,Canny算法具有边缘检测性能良好、不易受噪声的影响、可以在噪声和边缘检测间获得很好的平衡等优点,不足之处是计算量大、实时性差。针对Canny算法存在的计算量大和实时性差等问题,提出了一种并行实现策略,即基于Threading Building Block(TBB)工具和C++语言的并行Canny算法,可以有效的缓解上述问题。通过串、并行算法执行时间的比较,证明了并行算法的优越性。展开更多
文摘In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.
文摘Appropriate schemata as a novel concept to characterize building blocks are introduced, and then, the traits of appropriate schemata are presented. The effects of building blocks by search operators are analyzed. Hence, the experiments on RR-8X8 are employed to verify that appropriate schemata construct the building blocks. The validity of appropriate schemata and building blocks from the views of theory and practice is presented.
文摘This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for genetic operator, the crossover can maintain a diversity of population without disrupting the characteristics and search the global optimization. Simulation results on famous benchmark problems MT06, MT10 and MT20 coded by Matlab show that our genetic operators are suitable to job-shop scheduling problems and outperform the previous GA-based approaches.
文摘针对实际道路路网的一类路径寻优问题,提出了带回退机制的蚁群搜索算法,求解在实际道路路网中完成遍历所有规定节点的一条较优路径。为解决大规模实际道路路网数据量大、蚁群算法收敛速度慢的问题,分别采用Intel Threading Building Blocks(TBB)和Cilk++并行编程模型实现了并行蚁群搜索。与基于WinAPI函数的多线程蚁群算法相比,这两种模型均避免了手动启动线程及识别临界区资源等复杂操作,开发难度降低;在运行效率方面,基于TBB的并行蚁群算法和基于WinAPI的并行蚁群算法效率接近,而基于Cilk++的并行蚁群算法在双核环境下,运行效率和加速比都超过了基于WinAPI的并行蚁群算法。
文摘在诸多图像边缘检测的算法中,Canny算法具有边缘检测性能良好、不易受噪声的影响、可以在噪声和边缘检测间获得很好的平衡等优点,不足之处是计算量大、实时性差。针对Canny算法存在的计算量大和实时性差等问题,提出了一种并行实现策略,即基于Threading Building Block(TBB)工具和C++语言的并行Canny算法,可以有效的缓解上述问题。通过串、并行算法执行时间的比较,证明了并行算法的优越性。
