An improved hybrid firefly algorithm with probability attraction model (IHFAPA) is proposed to solve the problems of low computational efficiency and accuracy in solving complex optimization problems. First, method square-root sequence was used generate initial population, so that population had better diversity. Second, an adaptive probabilistic attract fireflies according brightness level fir...

A New Improved Firefly Algorithm for Global Numerical Optimization Gai-Ge Wang1 ∗, Lihong Guo2, Hong Duan3, and Heqi Wang2 1School of Computer Science and Technology, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China 2Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China 3School of Computer Science and Information Technology, Nor...

Cloud Computing organization deals with large scale, large amount of data, and the demand of computing power, needs to increase system investment. It is one of efficient technology that is popular now days in IT field. The paper proposes an Adaptive firefly algorithm for solving the job scheduling problem in cloud computing. The results of the algorithm were tested on cloudsim-3.0 by varying th...

This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several...

Today, in computer science, a computational challenge exists in finding a globally optimized solution from an enormously large search space. Various meta-heuristic methods can be used for finding the solution in a large search space. These methods can be explained as iterative search processes that efficiently perform the exploration and exploitation in the solution space. In this context, thre...

— Effective methods for solving the complex and noisy engineering problems using a finite sequence of instructions can be categorised into optimisation and meta-heuristics algorithms. The latter might be defined as an iterative search process that efficiently performs the exploration and exploitation in the solution space aiming to efficiently find near optimal solutions. Various natural intell...