A Novel Firefly Algorithm Based Ant Colony Optimization for Solving Combinatorial Optimization Problems
نویسندگان
چکیده
Inspired by ant colony optimization algorithm, a new firefly optimization algorithm is presented which we call firefly colony optimization algorithm (FCO). Unlike the standard firefly algorithm, the proposed approach is a distributed, and constructive greedy metaheuristic which uses the positive feedback to construct greedily good solutions, and to avoid a premature convergence to low quality solutions. We have assessed the performance of the proposed methodology on the bin packing problem (BPP). The results found show clearly the feasibility and the effectiveness of the proposed algorithm.
منابع مشابه
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...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGenetic Algorithm and Firefly Algorithm in a Hybrid Approach for Breast Cancer Diagnosis
Feed-forward neural networks are popular classification tools which are broadly used for early detection and diagnosis of breast cancer. In recent years, a great attention has been paid to bio-inspired optimization techniques due to its robustness, simplicity and efficiency in solving complex optimization problems. In this paper, it is intended to introduce a Genetic Algorithm based Firefly Alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJCSA
دوره 11 شماره
صفحات -
تاریخ انتشار 2014