Solving the Radio Link Frequency Assignment Problem with the Guided Genetic Algorithm
نویسندگان
چکیده
The Radio Link Frequency Assignment Problem is an abstraction of a real life military application that involves the assigning of frequencies to radio links. This problem set consists of eleven instances that are classed as either a Constraint Satisfaction Optimization Problem or a Partial Constraint Satisfaction Problem. Each problem has di erent optimization and constraint requirements, and can have up to 916 variables, and up to 5548 constraints. The Guided Genetic Algorithm (GGA) is a hybrid of Genetic Algorithm and meta-heuristic search algorithm Guided Local Search. As the search progresses, GGAmodi es both the tness function and tness template of candidate solutions based on feedback from constraints. In this paper, we have shown that GGA has the best optimality-robustness advantage over current published results.
منابع مشابه
Solving the Radio Link Frequency Assignment Problem using Guided Local Search
In this paper, we examine the application of the combinatorial optimisation technique of Guided Local Search to the Radio Link Frequency Assignment Problem (RLFAP). RLFAP stems from real world situations in military telecommunications and it is known to be an NP-hard problem. Guided Local Search is a metaheuristic that sits on top of local search procedures allowing them to escape from local mi...
متن کاملAn Empirical Study of Extended Guided Local Search on the Quadratic Assignment Problem
In this paper, we show how an Extended Guided Local Search can be applied to the Quadratic Assignment Problem and show the extensions can improve its performance. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms, to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real life problems, such as the...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کامل