An optimisation model for minimising changes in frequency allocations

IF 2.6 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
J.E. Beasley
{"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.

频率分配变化最小化的优化模型
本文研究了一个与频率分配有关的问题。假设我们有许多发射机,每个发射机都被分配了一个频率。我们考虑的问题是,给定一个(或多个)发射机请求一个新的频率分配,例如,因为它们目前正在遭受干扰,如何决定新的频率。在这里,我们希望限制总体干扰,但最大限度地减少未请求更改的发射机所需的频率更改次数。我们提出了频率分配的优化模型,该模型可以最大限度地减少现有分配的变化,同时限制干扰。我们考虑了文献中干扰的标准数学表示,并表明我们可以用一种涉及更少变量和约束的方式来表示它。在0 - 1整数线性规划中,我们利用这种新的干扰表示来决定新的频率分配。我们还展示了我们的公式如何适应处理许多其他可能性,特别是为已知位置的新发射机分配频率,并为单个新发射机决定位置(和频率)。我们提出的计算结果,我们的方法利用最小干扰频率分配测试问题,从文献中采取。我们将我们的新干扰表示与使用标准表示得到的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
3.50
自引率
0.00%
发文量
28
审稿时长
60 days
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信