A Novel Hybrid Optimization Algorithm Based on GA and ACO for Solving Complex Problem
نویسندگان
چکیده
In allusion to the deficiencies of the ant colony optimization algorithm for solving the complex problem, the genetic algorithm is introduced into the ant colony optimization algorithm in order to propose a novel hybrid optimization (NHGACO) algorithm in this paper. In the NHGACO algorithm, the genetic algorithm is used to update the global optimal solution and the ant colony optimization algorithm is used to dynamically balance the global search ability and local search ability in order to improve the convergence speed. Finally, some complex benchmark functions are selected to prove the validity of the proposed NHGACO algorithm. The experiment results show that the proposed NHGACO algorithm can obtain the global optimal solution and avoid the phenomena of the stagnation, and take on the fast convergence and the better robustness.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA Novel Hybrid Optimization Algorithm and its Application in Solving Complex Problem
Ant colony optimization (ACO) algorithm is a new heuristic algorithm which has been demonstrated a successful technology and applied to solving complex optimization problems. But the ACO exists the low solving precision and premature convergence problem, particle swarm optimization (PSO) algorithm is introduced to improve performance of the ACO algorithm. A novel hybrid optimization (HPSACO) al...
متن کاملSmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots
Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...
متن کاملSolving Multi-objective Optimal Power Flow Using Modified GA and PSO Based on Hybrid Algorithm
The Optimal Power Flow (OPF) is one of the most important issues in the power systems. Due to the complexity and discontinuity of some parameters of power systems, the classic mathematical methods are not proper for this problem. In this paper, the objective function of OPF is formulated to minimize the power losses of transmission grid and the cost of energy generation and improve the voltage ...
متن کامل