Ibrahima Diarrassouba, Youssouf Hadhbi, A. Ridha Mahjoub
{"title":"受限路由和频谱分配问题的分支-切割-价格算法","authors":"Ibrahima Diarrassouba, Youssouf Hadhbi, A. Ridha Mahjoub","doi":"10.1007/s10878-024-01125-x","DOIUrl":null,"url":null,"abstract":"<p>The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5<i>G</i> telecommunication optical networks. Given an undirected, loopless, and connected graph <i>G</i>, an optical spectrum of available contiguous frequency slots <span>\\({\\mathbb {S}}\\)</span>, and a set of traffic demands <i>K</i>, the C-RSA consists of assigning, to each traffic demand <span>\\(k\\in K\\)</span>, a path in <i>G</i> between its origin and destination, and a subset of contiguous frequency slots in <span>\\({\\mathbb {S}}\\)</span> subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem\",\"authors\":\"Ibrahima Diarrassouba, Youssouf Hadhbi, A. Ridha Mahjoub\",\"doi\":\"10.1007/s10878-024-01125-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5<i>G</i> telecommunication optical networks. Given an undirected, loopless, and connected graph <i>G</i>, an optical spectrum of available contiguous frequency slots <span>\\\\({\\\\mathbb {S}}\\\\)</span>, and a set of traffic demands <i>K</i>, the C-RSA consists of assigning, to each traffic demand <span>\\\\(k\\\\in K\\\\)</span>, a path in <i>G</i> between its origin and destination, and a subset of contiguous frequency slots in <span>\\\\({\\\\mathbb {S}}\\\\)</span> subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01125-x\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01125-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5G telecommunication optical networks. Given an undirected, loopless, and connected graph G, an optical spectrum of available contiguous frequency slots \({\mathbb {S}}\), and a set of traffic demands K, the C-RSA consists of assigning, to each traffic demand \(k\in K\), a path in G between its origin and destination, and a subset of contiguous frequency slots in \({\mathbb {S}}\) subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.