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...

This survey focuses on the problem of parameters selection in image edge detection by ant colony optimization (ACO) algorithm. By introducing particle swarm optimization (PSO) algorithm to optimize parameters in ACO algorithm, the fitness function based on connectivity of image edge is proposed to evaluate the quality of parameters in ACO algorithm. And the ACO-PSO algorithm is applied to image...

A hybrid population based Ant Colony Optimization (ACO) algorithm PFold-P-ACO for protein folding in the HP model is proposed in this paper. This is the first population based ACO algorithm in the bioinformatics. It is shown experimentally that the algorithms achieves on nearly all test sequences at least comparable results to other state of the art algorithms. Compared to the state of the art ...

we propose a novel hybrid algorithm named ACO-FA, which integrates the merits of ant colony optimization (ACO) with firefly algorithm (FA) to solve unconstrained optimization problems. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ACO with the FA. In our hybrid algorithm, the initial solutions are generated randomly from the search space, an...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

Ant Colony Optimization (ACO) a natureinspired metaheuristic algorithm has been successfully applied in the traveling salesman problem (TSP) and a variety of combinatorial problems. ACO algorithms have been modified in recent years to improve the performance of the first algorithm, posed by Dorigo. In this paper we compare different ACO algorithms and combine them in order to collect their adva...

A hybrid ant colony optimization algorithm is proposed by introducing extremal optimization localsearch algorithm to the ant colony optimization (ACO) algorithm, and is applied to multiuser detection in direct sequence ultra wideband (DS-UWB) communication system in this paper. ACO algorithms have already successfully been applied to combinatorial optimization; however, as the pheromone accumul...

This paper presents the design of two Ant Colony Optimization (ACO) approaches and their improved variants on the degree-constrained minimum spanning tree (d-MST) problem. The first approach, which we call p-ACO, uses the vertices of the construction graph as solution components, and is motivated by the well-known Prim’s algorithm for constructing MST. The second approach, known as k-ACO, uses ...