CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Wireless Flexible Personalized Communications
Wireless Flexible Personalized Communications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Evolutionary Divide and Conquer for the Set-Covering Problem
Selected Papers from AISB Workshop on Evolutionary Computing
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Transportation Science
Parallel branch and cut for capacitated vehicle routing
Parallel Computing - Special issue: Parallel computing in logistics
An enumerative algorithm for the frequency assignment problem
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
A cluster algorithm for graphs
A cluster algorithm for graphs
Parallel algorithms for combinatorial search problems
Parallel algorithms for combinatorial search problems
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
A divide-and-conquer local search heuristic for data visualization
Computers and Operations Research
Evolutionary divide and conquer (i): A novel genetic approach to the tsp
Evolutionary Computation
A genetic algorithm for frequency assignment with problem decomposition
International Journal of Mobile Network Design and Innovation
Expert Systems with Applications: An International Journal
Partitioning based algorithms for some colouring problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
| Hi-index | 0.00 |
This paper proposes a problem decomposition approach to solve hard Frequency Assignment Problem instances with standard meta-heuristics. The proposed technique aims to divide the initial problem into a number of easier subproblems, solve them and then recompose the partial solutions into one of the original problem. We consider the COST-259 MI-FAP instances and other Cardiff University test problems in order to simulate larger and more realistic networks. For both benchmarks the standard implementations of meta-heuristics do not generally produce a satisfactory performance within reasonable times of execution. However, the decomposed assignment approach can improve their results, both in terms of solution quality and runtime.