Sciweavers

35 search results - page 1 / 7
» A GA-ACO-local search hybrid algorithm for solving quadratic...
Sort
View
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
JUCS
2007
186views more  JUCS 2007»
13 years 5 months ago
An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
Hongbo Liu, Ajith Abraham
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 9 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
13 years 9 months ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 5 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache