DocumentCode :
3155918
Title :
Simple value ordering heuristic in frequency assignment problem
Author :
Hu, Jun ; Caminada, Alexandre ; Mabed, Hakim
Author_Institution :
Lab. SeT, Univ. de Technol. de Belfort-Montbeliard, Belfort, France
fYear :
2009
fDate :
6-9 July 2009
Firstpage :
1596
Lastpage :
1598
Abstract :
In this paper, we introduce one simple heuristic for value ordering in solving frequency assignment problem. Our approach is based on a special container to organize the values selection by jumping between two sides of domain. In order to reduce the time and space complexities of algorithm, we change the current value selection with last unchecked element in the domain, and put all the inconsistent values after it. Then domain is managed by the increasing of acceptable level of values. Different from static value ordering scheme, our approach is dynamically selection the values during the constraint propagation.
Keywords :
computational complexity; frequency allocation; operations research; search problems; telecommunication networks; constraint propagation; frequency assignment problem; simple value ordering heuristic; space complexity; static value ordering scheme; time complexity; Bayesian methods; Containers; Evolutionary computation; Financial advantage program; Frequency; Genetic algorithms; Interference constraints; constraint satisfaction problem; min-conflict; value ordering; variable ordering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
Type :
conf
DOI :
10.1109/ICCIE.2009.5223888
Filename :
5223888
Link To Document :
بازگشت