{"title":"An optimisation model for minimising changes in frequency allocations","authors":"J.E. Beasley","doi":"10.1016/j.ejco.2022.100042","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we deal with a problem associated with frequency assignment. Suppose we have a number of transmitters, each of which has been allocated a frequency. The problem we consider is how, given one (or more) transmitters are requesting a new frequency allocation, for example because of the interference they are currently suffering, to decide the new frequencies. Here we wish to constrain overall interference, but minimise the number of frequency changes needed for transmitters that have not requested a change.</p><p>We present an optimisation model for frequency allocation that minimises changes in the existing allocation, whilst limiting interference. We consider the standard mathematical representation of interference in the literature and show that we can represent it in a way that involves far fewer variables and constraints.</p><p>We make use of this new representation of interference in our zero-one integer linear program for deciding a new frequency allocation. We also show how our formulation can be adapted to deal with a number of other possibilities, specifically allocating frequencies to new transmitters with known locations and also deciding a location (and frequency) for a single new transmitter.</p><p>We present computational results for our approach making use of minimum interference frequency assignment test problems taken from the literature. We compare the results from our new representation of interference with those obtained using the standard representation.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"10 ","pages":"Article 100042"},"PeriodicalIF":2.6000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192440622000181/pdfft?md5=4c8788ff211f90edb9b73aa9b0d471f9&pid=1-s2.0-S2192440622000181-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440622000181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we deal with a problem associated with frequency assignment. Suppose we have a number of transmitters, each of which has been allocated a frequency. The problem we consider is how, given one (or more) transmitters are requesting a new frequency allocation, for example because of the interference they are currently suffering, to decide the new frequencies. Here we wish to constrain overall interference, but minimise the number of frequency changes needed for transmitters that have not requested a change.
We present an optimisation model for frequency allocation that minimises changes in the existing allocation, whilst limiting interference. We consider the standard mathematical representation of interference in the literature and show that we can represent it in a way that involves far fewer variables and constraints.
We make use of this new representation of interference in our zero-one integer linear program for deciding a new frequency allocation. We also show how our formulation can be adapted to deal with a number of other possibilities, specifically allocating frequencies to new transmitters with known locations and also deciding a location (and frequency) for a single new transmitter.
We present computational results for our approach making use of minimum interference frequency assignment test problems taken from the literature. We compare the results from our new representation of interference with those obtained using the standard representation.
期刊介绍:
The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.