Abstract.
In the Frequency Assignment Problem with Polarization (FAPP), a given set of links must each be assigned a frequency and a polarization, while respecting given radio-electric compatibility constraints defined on pairs of links. In this paper, we propose a tabu search algorithm for the FAPP. A specialized neighborhood is proposed for the problem. Other key features of the algorithm are an adaptive technique to adjust the tabu tenure, an original diversification technique, and a pre-processing procedure based on arc-consistency techniques. The algorithm is tested on the 40 instances of the ROADEF Challenge 2001. It reaches the best known feasibility level for all instances and finds or improves on the best known solutions of the Challenge for a majority of the instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: July 2003 / Revised version: September 2004
MSC classification:
90B18, 68T20
All correspondence to: Philippe Galinier
Rights and permissions
About this article
Cite this article
Galinier, P., Gendreau, M., Soriano, P. et al. Solving the frequency assignment problem with polarization by local search and tabu. 4OR 3, 59–78 (2005). https://doi.org/10.1007/s10288-004-0056-4
Issue Date:
DOI: https://doi.org/10.1007/s10288-004-0056-4