The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the slid...The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.展开更多
Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In th...Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.展开更多
The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was ...The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.展开更多
提出了一种基于蚁群优化和粒子群优化的混合算法求解TSP(Traveling Salesm an Prob lem)问题。在应用蚁群算法对TSP问题的求解过程中,利用粒子群算法对蚁群系统的参数进行优化,其目的是提高蚁群系统的优化性能,使蚁群系统的参数不必靠...提出了一种基于蚁群优化和粒子群优化的混合算法求解TSP(Traveling Salesm an Prob lem)问题。在应用蚁群算法对TSP问题的求解过程中,利用粒子群算法对蚁群系统的参数进行优化,其目的是提高蚁群系统的优化性能,使蚁群系统的参数不必靠人工经验或反复试验选取,而是通过粒子搜索自适应选取。展开更多
文摘The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.
基金supported in part by the National Natural Science Foundation of China(62073330)in part by the Natural Science Foundation of Hunan Province(2019JJ20021,2020JJ4339)in part by the Scientific Research Fund of Hunan Province Education Department(20B272)。
文摘Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.
基金National Natural Science Foundation of China(No.70971020)the Subject of Ministry of Education of Hunan Province,China(No.13C818)+3 种基金the Project of Industrial Science and Technology Support of Hengyang City,Hunan Province,China(No.2013KG63)the Open Project Program of Artificial Intelligence Key Laboratory of Sichuan Province,Sichuan University of Science and Engineering,China(No.2012RYJ03)the Fund Project of Humanities and Social Sciences,Ministry of Education of China(No.13YJCZH147)the Special Fund for Shanghai Colleges' Outstanding Young Teachers' Scientific Research Projects,China(No.ZZGJD12033)
文摘The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.
文摘提出了一种基于蚁群优化和粒子群优化的混合算法求解TSP(Traveling Salesm an Prob lem)问题。在应用蚁群算法对TSP问题的求解过程中,利用粒子群算法对蚁群系统的参数进行优化,其目的是提高蚁群系统的优化性能,使蚁群系统的参数不必靠人工经验或反复试验选取,而是通过粒子搜索自适应选取。
