Colombo, Gualtiero B. and Allen, Stuart Michael ORCID: https://orcid.org/0000-0003-1776-7489 2007. Problem decomposition for minimum interference frequency assignment. Presented at: IEEE Congress on Evolutionary Computation, 2007, Singapore, 25-28 September 2007. CEC 2007, IEEE Congress on Evolutionary Computation, 2007. Piscataway, N.J.: IEEE, pp. 3492-3499. 10.1109/CEC.2007.4424925 |
Abstract
This paper applies a problem decomposition approach in order 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, which can then be solved either independently or in sequence respecting the constraints between them. Finally, partial subproblems solutions are recomposed into a solution of the original problem. Our results focus on the COST-259 MI-FAP instances, for which some good assignments produced by local search meta-heuristics are widely available. However, standard implementations do not usually produce the best performance and, in particular, no good results have been previously obtained using evolutionary techniques. We show that problem decomposition can improve standard heuristics, both in terms of solution quality and runtime. Furthermore, genetic algorithms seem to benefit more from this approach, showing a higher percentage improvement, therefore reducing the gap with other local search methods.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Advanced Research Computing @ Cardiff (ARCCA) Computer Science & Informatics Systems Immunity Research Institute (SIURI) |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Uncontrolled Keywords: | genetic algorithms, meta-heuristics, minimum interference frequency assignment, problem decomposition approach |
Publisher: | IEEE |
ISBN: | 9781424413393 |
Last Modified: | 24 Oct 2022 10:11 |
URI: | https://orca.cardiff.ac.uk/id/eprint/43377 |
Citation Data
Cited 12 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |