UNIGE document Scientific Article
previous document  unige:26177  next document
add to browser collection
Title

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

Authors
Hertz, Alain
Schindl, David
Published in 4OR. 2005, vol. 3, p. 139-161
Abstract The problem retained for the ROADEF'2001 international challenge was a Frequency Assignment Problem with polarization constraints (FAPP). This NP-hard problem was proposed by the CELAR of the French Department of Defense, within the context of the CALMA project. Twenty seven competitors took part to this contest, and we present in this paper the contribution of our team that allowed us to be selected as one of the six finalists qualified for the final round of the competition. There is typically no solution satisfying all constraints of the FAPP. For this reason, some electromagnetic compatibility constraints can be progressively relaxed, and the objective is to find a feasible solution with the lowest possible level of relaxation. We have developed a procedure that computes a lower bound on the best possible level of relaxation, as well as two tabu search algorithms for the FAPP, one for the frequency assignment, and one for the polarization assignment.
Keywords Frequency Assignment ProblemsTabu searchLower bounds
Identifiers
Full text
Article (Published version) (164 Kb) - private document Private access
Structures
Citation
(ISO format)
HERTZ, Alain, SCHINDL, David, ZUFFEREY, Nicolas. Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. In: 4OR, 2005, vol. 3, p. 139-161. https://archive-ouverte.unige.ch/unige:26177

176 hits

0 download

Update

Deposited on : 2013-02-04

Export document
Format :
Citation style :