Sciweavers

420 search results - page 1 / 84
» An Intensive Search Algorithm for the Quadratic Assignment P...
Sort
View
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
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
13 years 10 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
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
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 8 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