Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach

Abstract : This paper deals with solving MI-FAP problem. Because of the NP-hardness of the problem, it is difficult to cope with real FAP instances with exact or even with heuristic methods. This paper aims at solving MI-FAP using a decomposition approach and mainly proposes a generic Top-Down approach. The key idea behind the generic aspect of our approach is to link the decomposition and the resolution steps. More precisely, two generic algorithms called Top-Down and Iterative Top-Down algorithms are proposed. To validate this approach two decomposition techniques and one efficient Adaptive Genetic Algorithm (AGA-MI-FAP) are proposed. The first results demonstrate good trade-off between the quality of solutions and the execution time.
Document type :
Conference papers
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01784608
Contributor : Lcoms Ul <>
Submitted on : Thursday, May 3, 2018 - 4:11:24 PM
Last modification on : Wednesday, January 23, 2019 - 11:42:05 AM

Identifiers

Collections

Citation

Lamia Sadeg-Belkacem, Zineb Habbas, Fatima Benbouzid-Sitayeb, Daniel Singer. Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach. International Conference on Agents and Artificial Intelligence, Mar 2014, Angers, France. pp.477-484, ⟨10.5220/0004820204770484⟩. ⟨hal-01784608⟩

Share

Metrics

Record views

36