Guided genetic algorithm and its application to radio link frequency assignment problems

Constraints

Volumn 6, Issue 4, 2001, Pages 373-398

  Lau, T L ^a   Tsang, E P K ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Constraint satisfaction optimization problem; Genetic algorithm; Partial constraint satisfaction problem

Indexed keywords

BENCHMARKING; CONSTRAINT THEORY; FEEDBACK; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; RADIO LINKS;

CONSTRAINT SATISFACTION PROBLEMS (CSP); RADIO LINK FREQUENCY ASSIGNMENT PROBLEMS (RLFAP);

GENETIC ALGORITHMS;

EID: 0035479210     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011406425471     Document Type: Article

References (48)

1. Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit
2. Anytime lower bounds for constraint violation minimization problems
3. Constructing minimum path configurations for multiprocessor systems
4. Genetic algorithms for the generalized assignment problem
5. An evolutionary approach for frequency allocation problem in cellular radio-networks
6. Constraint handling in evolutionary search: A case study of the frequency assignment
7. Heuristic genetic algorithms for constrained problems
8. Solving constraint satisfaction problem using genetic algorithms
9. GA-easy and ga-hard constraint satisfaction problems
10. Systematic versus stochastic constraint satisfaction
11. Partial constraint satisfaction
12. Frequency assignment: Theory and applications
13. Study of genetic search for the frequency asignment problem
14. Some practical aspects of adaptive systems theory
15. Guided local search for the vehicle routing problem
16. Algorithms for constraint satisfaction problems: A survey
17. Systematic and non-systematic search strategies
18. Applying a mutation-based genetic algorithm to the processor configuration problem
19. Solving the processor configuration problem with a mutation-based genetic algorithm
20. Constraint satisfaction problems: An overview
21. Guided local search for solving SAT and weighted MAX-SAT problems
22. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
23. Improving the performance of GAs on a GA-hard CSP
24. A new method for solving hard satisfiability problems
25. Bounds for the frequency assignment problem
26. Improving heuristics for the frequency assignment problem
27. An efficient heuristic-based evolutionary algorithm for solving constraint satisfaction problems
28. An overview of algorithmic approaches to frequency assignment problems
29. Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
30. Russian doll search for solving constraint optimization problems
31. Guided Local Search - An illustrative example in function optimization
32. Partial constraint satisfaction problems and guided local search
33. Guided local search and its application to the travelling salesman problem
34. Solving the radio link frequency assignment problem using guided local search
35. Using a genetic algorithm to tackle the processor configuration problem
36. Tackling car sequencing problems using a generic genetic algorithm