Sciweavers

17 search results - page 3 / 4
» A Comparative Study of Ant Colony Optimization and Reactive ...
Sort
View
IBIS
2006
109views more  IBIS 2006»
13 years 5 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 9 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
CEC
2008
IEEE
13 years 12 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 6 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 11 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano