{"title":"Making the best use of the airways: an important requirement for military communications","authors":"M. Williams","doi":"10.1049/ECEJ:20000204","DOIUrl":null,"url":null,"abstract":"The growing communication demands of modern warfare must be met with the fixed resources of the electromagnetic spectrum. When an armed force is deployed, frequencies must be assigned, within a restricted bandwidth and in a short time-scale, to its many (e.g. 400) radios so as to minimise the interference between them. There are too many ways in which a frequency allocation can be made for them all to be evaluated; instead the best assignment that can be discovered within a limited time must be chosen. This is typical of a class of problems known as combinatorial optimisation problems. This paper discusses some of the methods which can be used for solving such problems and presents results for a hybrid algorithm based on construction methods, tabu search and genetic algorithms which has been developed at DERA-Malvern.","PeriodicalId":127784,"journal":{"name":"Electronics & Communication Engineering Journal","volume":"431 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics & Communication Engineering Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/ECEJ:20000204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The growing communication demands of modern warfare must be met with the fixed resources of the electromagnetic spectrum. When an armed force is deployed, frequencies must be assigned, within a restricted bandwidth and in a short time-scale, to its many (e.g. 400) radios so as to minimise the interference between them. There are too many ways in which a frequency allocation can be made for them all to be evaluated; instead the best assignment that can be discovered within a limited time must be chosen. This is typical of a class of problems known as combinatorial optimisation problems. This paper discusses some of the methods which can be used for solving such problems and presents results for a hybrid algorithm based on construction methods, tabu search and genetic algorithms which has been developed at DERA-Malvern.