The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes fusion of synchronous germ computing (SGC) with twin swarm intelligence (TSI) technique named as SGCTSI to enhance quality of global solutions with faster convergence of multimodal functions. In this paper, initially the authors tried to increase the speed of bacteria by updating bacteria positions synchronously, which is treated as SGC. In SGC, all the bacteria update their positions...
This paper presents fusion of Bacterial Foraging with parameter free Particle Swarm Optimization (HBF-pfPSO). The proposed technique is used to enhance quality of global optima of multimodal functions. The authors propose two major modifications in Bacterial Foraging Optimization (BFO). Firstly, all bacteria position and direction are updated after all fitness evaluations instead of each fitness evaluation...
This paper presents a new diversity guided particle swarm optimization algorithm (PSO) named beta mutation PSO or BMPSO for solving global optimization problems. The BMPSO algorithm makes use of an evolutionary programming based mutation operator to maintain the level of diversity in the swarm population, thereby maintaining a good balance between the exploration and exploitation phenomena and preventing...
Proposing a new algorithm which is simple but effective. Using characteristic of biological evolution and common sense to design the selection operator, improve the variation method of the crossover probability and the mutation probability. Numerical experiments show that the new algorithm is more effective than the comparative algorithm in realizing the high convergence speed, convergence precision,...
Standard genetic algorithms have the defects of pre-maturity and stagnation when applied in optimizing problems. In order to avoid the shortcomings, an adaptive niche genetic algorithm (ANGA) is proposed. The Elitist strategy is utilized to ensure the stable convergence, niche ideology is used to maintain diversity of evolution population, and the adaptive crossover rate and mutation probability are...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.