Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

Mabed, Hakim; Caminada, Alexandre; Hao, Jin‐Kao

doi:10.1007/s10589-010-9376-9

Cited by 9 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this category, we find the generalisation of DSATUR procedure [4]. [15] proposes a hybrid method combining a problem specific crossover and a Tabu search procedure while the interference is formulated by np directed graphs. Other more sophisticated algorithms, such as local search, metaheuristics, ILP, and constraint programming approaches, are frequently encountered [1].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Frequency assignment in a SDMA satellite communication system with beam decentring feature

et al. 2013

View full text Add to dashboard Cite

International audienceIn satellite communication, Spatial Division Multiple Access (SDMA) has become one of the most promising techniques that can accommodate continuing increase in the number of users and traffic demands. The technology is based on radio resource sharing that separates communication channels in space. It relies on adaptive and dynamic beam-forming technology and well-designed algorithms for resource allocation among which frequency assignment is considered. This paper studies static Frequency Assignment Problem (FAP) in a satellite communication system involving a satellite and a number of users located in a service area. The objective is to maximize the number of users that the system can serve while maintaining the signal to interference plus noise ratio of each user under a predefined threshold. Traditionally, interference is treated as fixed (binary interferences or fixed minimal required separation between frequencies) . In this paper, the interference is cumulative and variable. To solve the problem, we work on both discrete and continuous optimizations. Integer linear programming formulations and greedy algorithms are proposed for solving the discrete frequency assignment problem. The solution is further improved by beam decentring algorithm which involves continuous adjustment of satellite beams and deals with non-linear change of interference

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…Solving the ILP formulations provides optimal solutions only for small instances of (12)- (15). For large-sized instances, a heuristic approach is necessary.…”

Section: Greedy Algorithmmentioning

confidence: 99%

Frequency assignment in a SDMA satellite communication system with beam decentring feature

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Moreover, two recent works suggested a harmony search algorithm to handle the MI-FAP (Lahsinat et al , 2017a, 2017b). Some other works used trajectory methods including the Tabu search algorithm (Castelino et al , 1996; Montemanni, et al , 2003; Montemanni and Smith, 2010; Mabed et al , 2011). Other researchers proposed simulated annealing algorithms (Duque-Anton et al , 1993; Beckmann and Killat, 1999).…”

Section: Introductionmentioning

confidence: 99%

Breakout variable neighbourhood search for the minimum interference frequency assignment problem

Lahsinat¹,

Boughaci

Benhamou

2018

JSIT

View full text Add to dashboard Cite

Purpose This paper aims to describe two enhancements of the variable neighbourhood search (VNS) algorithm to solve efficiently the minimum interference frequency assignment problem (MI-FAP) which is a major issue in the radio networks, as well as a well-known NP-hard combinatorial optimisation problem. The challenge is to assign a frequency to each transceiver of the network with limited or no interferences at all. Indeed, considering that the number of radio networks users is ever increasing and that the radio spectrum is a scarce and expensive resource, the latter should be carefully managed to avoid any interference. Design/methodology/approach The authors suggest two new enhanced VNS variants for MI-FAP, namely, the iterated VNS (It-VNS) and the breakout VNS (BVNS). These two algorithms were designed based on the hybridising and the collaboration approaches that have emerged as two powerful means to solve hard combinatorial optimisation problems. Therefore, these two methods draw their strength from other meta-heuristics. In addition, the authors introduced a new mechanism of perturbation to enhance the performance of VNS. An extensive experiment was conducted to evaluate the performance of the proposed methods on some well-known MI-FAP datasets. Moreover, they carried out a comparative study with other metaheuristics and achieved the Friedman’s non-parametric statistical test to check the actual effect of the proposed enhancements. Findings The experiments showed that the two enhanced methods (It-VNS) and (BVNS) achieved better results than the VNS method. The comparative study with other meta-heuristics showed that the results are competitive and very encouraging. The Friedman’s non-parametric statistical test reveals clearly that the results of the three methods (It-VNS, BVNS and VNS) are significantly different. The authors therefore carried out the Nemenyi’s post hoc test which allowed us to identify those differences. The impact of the operated change on both the It-VNS and BVNS was thus confirmed. The proposed BVNS is competitive and able to produce good results as compared with both It-VNS and VNS for MI-FAP. Research limitations/implications Approached methods and particularly newly designed ones may have some drawbacks that weaken the results, in particular when dealing with extensive data. These limitations should therefore be eliminated through an appropriate approach with a view to design appropriate methods in the case of large-scale data. Practical implications The authors designed and implemented two new variants of the VNS algorithm before carrying out an exhaustive experimental study. The findings highlighted the potential opportunities of these two enhanced methods which could be adapted and applied to other combinatorial optimisation problems, real world applications or academic problems. Originality/value This paper aims at enhancing the VNS algorithm through two new approaches, namely, the It-VNS and the BVNS. These two methods were applied to the MI-FAP which is a crucial problem arising in a radio network. The numerical results are interesting and demonstrate the benefits of the proposed approaches in particular BVNS for MI-FAP.

show abstract

“…The goal of FS-FAP is then to determine a frequency assignment of minimum cost. Note that in the literature, there exist other similar FS-FAP models which differ mainly in the way the cost function is defined (Aardal et al, 2007;Hale, 1980;Hurley et al, 1997;Kendall and Mohamad, 2004;Mabed et al, 2011;Park et al, 2002).…”

Section: Introductionmentioning

confidence: 99%

Path relinking for the fixed spectrum frequency assignment problem

Lai

Hao

2015

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

The fixed spectrum frequency assignment problem (FS-FAP) is a highly relevant application in modern wireless systems. This paper presents the first path relinking (PR) approach for solving FS-FAP. We devise four relinking operators to generate intermediate solutions (or paths) and a tabu search procedure for local optimization. We also adopt a diversity-and-quality technique to maintain population diversity. To show the effectiveness of the proposed approach, we present computational results on the set of 42 benchmark instances commonly used in the literature and compare them with the current best results obtained by any other existing methods. By showing improved best results (new upper bounds) for 19 instances, we demonstrate the effectiveness of the proposed PR approach. We investigate the impact of the relinking operators and the population updating strategy. The ideas of the proposed could be applicable to other frequency assignment problems and search problems.

show abstract

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

Cited by 9 publications

References 32 publications

Frequency assignment in a SDMA satellite communication system with beam decentring feature

Frequency assignment in a SDMA satellite communication system with beam decentring feature

Breakout variable neighbourhood search for the minimum interference frequency assignment problem

Path relinking for the fixed spectrum frequency assignment problem

Contact Info

Product

Resources

About