نتایج جستجو برای: meta heuristic optimization
تعداد نتایج: 516163 فیلتر نتایج به سال:
A new meta-heuristic method, based on Neuronal Communication (NC), is introduced in this article. The neuronal communication illustrates how data is exchanged between neurons in neural system. Actually, this pattern works efficiently in the nature. The present paper shows it is the same to find the global minimum. In addition, since few numbers of neurons participate in each step of the method,...
This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions. The teams exert pulling forces on each other...
Nature Inspired Meta-Heuristic algorithms are proved to be beneficial for solving real world combinatorial problems such as minimum spanning tree, knapsack problem, process planning problems, load balancing and many more. In this research work, existing meta-heuristic approaches are discussed. Due to astonishing feature of echolocation, bat algorithm has drawn major attention in recent years an...
This paper presents three efficient approaches for solving the Optimal Power Flow (OPF) problem using the meta-heuristic algorithms. Mathematically, OPF is formulated as non-linear equality and inequality constrained optimization problem. The main drawback of meta-heuristic algorithm based OPF is the excessive execution time required due to the large number of load flows/power flows needed in t...
In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...
This article presents a comprehensive review of chaos embedded meta-heuristic optimization algorithms and describes the evolution of this algorithms along with some improvements, their combination with various methods as well as their applications. The reported results indicate that chaos embedded algorithms may handle engineering design problems efficiently in terms of precision and convergenc...
The various meta-heuristic techniques for cloud and grid environment are: Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search, Firefly Algorithm, BAT Algorithm and many more. So this paper represents the two types of meta-heuristic techniques, i.e. BAT algorithm and Genetic Algorithm. The different types of methods which comprise meta-heuristic ...
Investment decision making is one of the key issues in financial management. Selecting the appropriate tools and techniques that can make optimal portfolio is one of the main objectives of the investment world. This study tries to optimize the decision making in stock selection or the optimization of the portfolio by means of the artificial colony of honey bee algorithm. To determine the effect...
Quadratic Assignment Problem (QAP) is an NPhard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime effici...
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remissi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید