Improving heuristics for the frequency assignment problem

Smith, Derek H.; Hurley, S.; Thiel, S.

doi:10.1016/s0377-2217(98)80006-4

Cited by 80 publications

(35 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The term "satisfactory" gives rise to different interpretations in different papers. In Smith et al (1998) (MS-FAP) the initial subproblem is found by selecting a p-level clique, i.e., a subset C of the vertices of G with the property that δ(u, v) ≥ p for all u, v ∈ C. Such a clique is selected in order to maximize the associated lower bound for MS-FAP, see Sect. 4.4.2.…”

Section: Solve and Extendmentioning

confidence: 99%

Models and solution techniques for frequency assignment problems

et al. 2007

View full text Add to dashboard Cite

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion.This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances. This is an updated version of a paper that appeared in 4OR 1, 261-317, 2003.

show abstract

Section: Solve and Extendmentioning

confidence: 99%

Models and solution techniques for frequency assignment problems

et al. 2007

View full text Add to dashboard Cite

show abstract

“…Besides its theoretical significance as a canonical NP-Hard problem [19], graph coloring arises naturally in a variety of real-world applications, such as register allocation [7], timetabling [4], frequency assignment [37], crew scheduling [17], printed circuit testing [18], satellite range scheduling [38] as well as manufacturing [20]. Due to its NP-Hardness, heuristics and metaheuristics are Email addresses: zhipeng.lui@gmail.com, lu@info.univ-angers.fr (Zhipeng Lü), hao@info.univ-angers.fr (Jin-Kao Hao).…”

Section: Introductionmentioning

confidence: 99%

A memetic algorithm for graph coloring

Lu¹,

Hao²

2010

European Journal of Operational Research

202

121

View full text Add to dashboard Cite

Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and the number of used colors k is minimized. This paper presents a memetic algorithm (denoted by MACOL) for solving the problem of graph coloring. The proposed MACOL algorithm integrates several distinguished features such as an adaptive multi-parent crossover (AMPaX) operator and a distance-and-quality based replacement criterion for pool updating. The proposed algorithm is evaluated on the DIMACS challenge benchmarks and computational results show that the proposed MACOL algorithm achieves highly competitive results, compared with 11 state-of-the-art algorithms. The influence of some ingredients of MACOL on its performance is also analyzed.

show abstract

“…FASoft is an integrated package of various methods for solving frequency assignment problems, such as heuristic sequential methods, methods using constraint satisfaction techniques, Simulated Annealing, GA, tabu search, etc. We show the results obtained with Simulated Annealing (SA) and tabu search (TS) reported in [12]. These two methods are the most efficient among the various components of FASoft.…”

Section: Resultsmentioning

confidence: 99%