Sciweavers

9 search results - page 1 / 2
» Solving the frequency assignment problem with polarization b...
Sort
View
4OR
2005
53views more  4OR 2005»
13 years 5 months ago
Solving the frequency assignment problem with polarization by local search and tabu
Philippe Galinier, Michel Gendreau, Patrick Sorian...
ISCIS
2009
Springer
14 years 1 days ago
Channel assignment problem in cellular networks: A reactive tabu search approach
—The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the i...
Didem Gözüpek, Gaye Genç, Cem Ers...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
13 years 11 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
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
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 5 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle