A permutation based Genetic Algorithm for minimum span frequency assignment

Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272, Hurley, Steve and Smith, Derek 1998. A permutation based Genetic Algorithm for minimum span frequency assignment. Presented at: PPSN V: 5th International Conference, Amsterdam, The Netherlands, 27-30 September 1998. Published in: Eiben, Agoston E., Back, Thomas, Schoenauer, Marc and Schnefel, Hans-Paul eds. Parallel Problem Solving from Nature — PPSN V: 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998: Proceedings. Lecture notes in computer science (1498) Springer, pp. 907-916. 10.1007/BFb0056932

Full text not available from this repository.

Abstract

We describe a Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP).The MSFAP involves assigning frequencies to each transmitter in a region, subject to a number of constraints being satisfied, such that the span, i.e. the range of frequencies used, is minimized. The technique involves finding an ordering of the transmitters for use in a sequential (greedy) assignment process. Results are given which show that our GA produces optimal solutions to several practical problem instances, and compares favourably to simulated annealing and tabu search algorithms.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Publisher:	Springer
Related URLs:	Publisher
Last Modified:	20 Oct 2022 09:26
URI:	https://orca.cardiff.ac.uk/id/eprint/31948

Citation Data

Cited 29 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item