首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Solving the frequency assignment problem with polarization by local search and tabu
Authors:Philippe Galinier  Michel Gendreau  Patrick Soriano  Serge Bisaillon
Institution:(1) Département de génie informatique, Ecole Polytechnique de Montréal, Succursale Centre-ville, C.P. 6079, H3C 3A7 Montréal, Québec, Canada;(2) Centre de recherche sur les transports, Montréal, Québec, Canada
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.Received: July 2003 / Revised version: September 2004MSC classification: 90B18, 68T20All correspondence to: Philippe Galinier
Keywords:Frequency Assignment Problem  tabu search  metaheuristics
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号