Sciweavers

336 search results - page 1 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 4 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
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 4 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
PREMI
2007
Springer
13 years 10 months ago
Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
Shigeyoshi Tsutsui
EMO
2009
Springer
219views Optimization» more  EMO 2009»
13 years 11 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva