Genetic Algorithm Approach to the Search for Golomb Rulers
نویسندگان
چکیده
GOLOMB RULERS Stephen W. Soliday soliday@gar eld.ncat.edu Abdollah Homaifar homaifar@gar eld.ncat.edu Department of Electrical Engineering North Carolina A&T State University Greensboro, North Carolina 27411 Gary L. Lebby lebby@gar eld.ncat.edu Abstract The success of genetic algorithm in nding relatively good solutions to NP-complete problems such as the traveling salesman problem and job-shop scheduling problem provided a good starting point for a machine intelligent method of nding Golomb Rulers. These rulers have been applied to radio astronomy, X-ray crystallography, circuit layout and geographical mapping. Currently the shortest lengths of the rst sixteen rulers are known. The nature of NP-complete makes the search for higher order rulers difcult and very time consuming. While the shortest lengths for each order are important as a mathematical exercise, nding relatively short high order valid rulers has a more important impact on real world applications. Genetic algorithm has shown good results in nding usable Golomb Rulers in minutes or hours instead of weeks or months.
منابع مشابه
On the Design of Optimum Order 2 Golomb Ruler
A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...
متن کاملCombining the Scalability of Local Search with the Pruning Techniques of Systematic Search
Systematic backtracking is used in many constraint solvers and combinatorial optimisation algorithms. It is complete and can be combined with powerful search pruning techniques such as branchand-bound, constraint propagation and dynamic variable ordering. However, it often scales poorly to large problems. Local search is incomplete, and has the additional drawback that it cannot exploit pruning...
متن کاملGolomb Rulers: The Advantage of Evolution
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solu...
متن کاملA Memetic Approach to Golomb Rulers
Finding Golomb rulers is an extremely challenging optimization problem with many practical applications. This problem has been approached by a variety of search methods in recent years. We consider in this work a hybrid evolutionary algorithm that incorporates ideas from greedy randomized adaptive search procedures (GRASP), tabu-based local search methods (TS) and scatter search (SS). In partic...
متن کاملConstructing Optimal Golomb Rulers in Parallel
In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...
متن کامل