Convergence stagnation is the chief difficulty to solve hard optimization problems for most particle swarm optimization variants. To address this issue, a novel particle swarm optimization using multi-information char...
详细信息
Convergence stagnation is the chief difficulty to solve hard optimization problems for most particle swarm optimization variants. To address this issue, a novel particle swarm optimization using multi-information characteristics of all personal-best information is developed in our research. In the modified algorithm, two positions are defined by personal-best positions and an improved cognition term with three positions of all personal-best information is used in velocity update equation to enhance the search capability. This strategy could make particles fly to a better direction by discovering useful information from all the personal-best positions. The validity of the proposed algorithm is assessed on twenty benchmark problems including unimodal, multi-modal, rotated and shifted functions, and the results are compared with that obtained by some published variants of particle swarm optimization in the literature. Computational results demonstrate that the proposed algorithm finds several global optimum and high-quality solutions in most case with a fast convergence speed.
We present a universally applicable hybrid modeling method for nonlinear industrial processes that combine the a priori process knowledge with a data-driven *** method constructs a unified framework for the modeling p...
详细信息
We present a universally applicable hybrid modeling method for nonlinear industrial processes that combine the a priori process knowledge with a data-driven *** method constructs a unified framework for the modeling process by integrating a data-driven modeling technique,sampling detection technique,constraint optimization problem,and an evolutionary *** the modeling process,a swarm intelligence algorithm is used to optimize the model parameters under the circumstances of satisfying the constraints of a priori *** adding the constraints of process a priori knowledge,we can obtain more information about the actual process and avoid the over-fitting problem to some extent,especially when modeling a system with a small quantity of *** order to show the effectiveness of the method proposed in this paper,two general data-driven models,the polynomial regression model and radial basis function network model,are used as case ***,a function simulation experiment is designed to test effectiveness,and applied to estimate average particle size of ZrO2-TiO2 composite colloidal sols.
Teaching-learning-based optimization (TLBO) algorithm is a new intelligence algorithm. It takes evaluation scheme which updates learners' grade totally in solving multidimensional function optimization problems, t...
详细信息
ISBN:
(纸本)9781467386609
Teaching-learning-based optimization (TLBO) algorithm is a new intelligence algorithm. It takes evaluation scheme which updates learners' grade totally in solving multidimensional function optimization problems, thus decreases the convergence speed. Moreover, the interference phenomena among dimensions would influence the quality of solutions. While all existing improvement strategies on TLBO introduce new parameters, thus destroy the simplicity of TLBO. To solve the above problems, a TLBO algorithm based on Course by course Improvement (TLBOCI) was proposed. This algorithm takes strategy which updates learners' grade based on course by course improvement in teaching and learning phase in each iteration, and this strategy combines an updated value of one course with the values of other courses into a new solution. The results of four classic test functions show that the TLBOCI algorithm could outperform TLBO in quality of solutions and convergence speed under the condition of not introducing new parameters thus keeping the simplicity of TLBO.
In recent years, the rapid development of modern electronic commerce challenges of software development technology. Because of the complex internal logic of e-commerce, the rigorous security demand, business rules cha...
详细信息
In recent years, the rapid development of modern electronic commerce challenges of software development technology. Because of the complex internal logic of e-commerce, the rigorous security demand, business rules change quickly, which requires the electronic commerce experimental simulation system development technology can be strong and flexible to adapt to the demand of the experimental teaching of electronic commerce. At the same time electronic commerce platform also has the advantages of high efficiency and stable to meet the increasing demand of Internet users. Therefore, it based on the fuzzy analytic hierarchy process, using Java technology design and development to adapt to the simulation system of electronic commerce experimental business majors. According to the algorithm principle of parallel FFT algorithm and its application in digital signal processing, engineering technology, electronic commerce experiment simulation system with high stability in the peak passenger flow when in use. Firstly, this paper introduces the present situation of simulation experiment system. And then introduced the fuzzy AHP theory and FFT algorithm, and establishes a evaluation model of the theory of learning. The author has not explored from the aspects of cognitive and psychological reality, the questionnaire survey and the two test results are not very objective, has yet to be further research.
The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths fr...
详细信息
The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi- swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.
This paper provides a path planning algorithm based on model that contains 3D vision data. Using this model and a six-legged platform, we propose that limited vision field should be considered in a path planning of 3D...
详细信息
ISBN:
(纸本)9783038350491
This paper provides a path planning algorithm based on model that contains 3D vision data. Using this model and a six-legged platform, we propose that limited vision field should be considered in a path planning of 3D vision robot. We also give out a machine learning method to analysis a robot's obstacle capacity, and formed vector to measure it. Based on the model, we designed an algorithm that allow robot to navigate in 3D environment. Observation on its behavior proof that our algorithm and model will allow a robot to pass through random 3D terrain.
Based on Plant Growth Simulation algorithm (PGSA), an intelligence optimization algorithm for solving Indeterminate equation is proposed herein. In this algorithm, the initial plant growth point is obtained after thre...
详细信息
In this paper, we present a new multiuser detection algorithm based on step ant colony optimization. This algorithm accelerates the process of search by setting the parameters of basic ant colony optimization appropri...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we present a new multiuser detection algorithm based on step ant colony optimization. This algorithm accelerates the process of search by setting the parameters of basic ant colony optimization appropriately and meanwhile introduces a strategy of jumping out of the local optimal solution, thus it can approach the minimum probability of error with great computation efficiency. Simulation results show that the proposed algorithm converges rapidly and provides good BER performance for cases where basic ant colony algorithms perform poorly.
In this paper, we present a new multiuser detection algorithm based on step ant colony optimization. This algorithm accelerates the process of search by setting the parameters of basic ant colony optimization appropri...
详细信息
In this paper, we present a new multiuser detection algorithm based on step ant colony optimization. This algorithm accelerates the process of search by setting the parameters of basic ant colony optimization appropriately and meanwhile introduces a strategy of jumping out of the local optimal solution, thus it can approach the minimum probability of error with great computation efficiency. Simulation results show that the proposed algorithm converges rapidly and provides good BER performance for cases where basic ant colony algorithms perform poorly.
暂无评论