Networks最新文献_第8页

Issue Information 问题信息

IF 2.1 4区计算机科学

Networks Pub Date : 2023-05-01 DOI: 10.1002/net.22105

引用次数: 0

The probabilistic uncapacitated open vehicle routing location problem 概率无能力开放车辆路径定位问题

IF 2.1 4区计算机科学

Networks Pub Date : 2023-04-06 DOI: 10.1002/net.22147

I. Averbakh, Wei Yu

引用次数: 0

A compact formulation for the base station deployment problem in wireless networks 无线网络中基站部署问题的一个紧凑公式

IF 2.1 4区计算机科学

Networks Pub Date : 2023-04-03 DOI: 10.1002/net.22146

P. Avella, Alice Calamita, L. Palagi

引用次数: 3

Two extended formulations for the virtual network function placement and routing problem 虚拟网络功能布局和路由问题的两个扩展公式

IF 2.1 4区计算机科学

Networks Pub Date : 2023-03-07 DOI: 10.1002/net.22144

Ahlam Mouaci, É. Gourdin, Ivana Ljubic, N. Perrot

{"title":"Two extended formulations for the virtual network function placement and routing problem","authors":"Ahlam Mouaci, É. Gourdin, Ivana Ljubic, N. Perrot","doi":"10.1002/net.22144","DOIUrl":"https://doi.org/10.1002/net.22144","url":null,"abstract":"Given a bi‐directed graph modeling a telecommunication network, and a set of origin‐destination pairs representing traffic requests (commodities) along with their associated Service Function Chains (SFCs), the Virtual Network Function Placement and Routing Problem (VNFPRP) aims to find, for each commodity, one latency‐constrained routing path that visits the required Virtual Network Functions in a specific order. The function installation costs together with the node activation costs have to be minimized. In this paper, we present two extended Mixed Integer Programming (MIP) formulations to model the VNFPRP. For each formulation we define the master problem, the pricing problem, the associated Lagrangian bound and a specific branching scheme, in order to derive an efficient Branch‐and‐Price algorithm. We also provide several families of valid inequalities to strengthen the LP‐relaxation bounds. Computational results are reported comparing the performance of the two Branch‐and‐Price algorithms with a compact MIP formulation and its Branch‐and‐Benders‐cut implementation on a set of SNDlib instances representing telecommunication networks.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"82 1","pages":"32 - 51"},"PeriodicalIF":2.1,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46153470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust capacitated Steiner trees and networks with uniform demands 具有一致需求的鲁棒有能力Steiner树和网络

IF 2.1 4区计算机科学

Networks Pub Date : 2023-03-03 DOI: 10.1002/net.22143

C. Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont

{"title":"Robust capacitated Steiner trees and networks with uniform demands","authors":"C. Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont","doi":"10.1002/net.22143","DOIUrl":"https://doi.org/10.1002/net.22143","url":null,"abstract":"We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in the case of terminals with uniform demands. Formally, we are given a graph, capacity, and cost functions on the edges, a root, a subset of vertices called terminals, and a bound k$$ k $$ on the number of possible edge failures. We first study the problem where k=1$$ k=1 $$ and the network that we want to design must be a tree covering the root and the terminals: we give complexity results and propose models to optimize both the cost of the tree and the number of terminals disconnected from the root in the worst case of an edge failure, while respecting the capacity constraints on the edges. Secondly, we consider the problem of computing a minimum‐cost survivable network, that is, a network that covers the root and terminals even after the removal of any k$$ k $$ edges, while still respecting the capacity constraints on the edges. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a bilevel formulation (with an attacker and a defender), a cutset‐based formulation and a flow‐based one. We compare the formulations from a theoretical point of view, and we propose algorithms to solve them and compare their efficiency in practice.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"82 1","pages":"3 - 31"},"PeriodicalIF":2.1,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44569732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm 关于部分覆盖无线传感器网络子树调度的优化求解：一种分支割算法

IF 2.1 4区计算机科学

Networks Pub Date : 2023-03-03 DOI: 10.1002/net.22145

Nicola Bianchessi

{"title":"On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm","authors":"Nicola Bianchessi","doi":"10.1002/net.22145","DOIUrl":"https://doi.org/10.1002/net.22145","url":null,"abstract":"Given a wireless sensor network, we consider the problem to minimize its total energy consumption over consecutive time slots with respect to communication activities. Nonempty and disjoint subsets of nodes are required to be active and connected under a tree topology configuration in the different time slots, and each network node must be active in a unique time slot. Moreover, the power required by the same pair of network nodes to communicate on the associated direct channel may vary in the different time slots. The problem has been recently introduced in the literature under the name Sub‐Tree Scheduling for Wireless Sensor Networks with Partial Coverage. We focus on the exact solution of the problem. We present a branch‐and‐cut (BC) algorithm based on a novel integer linear programming formulation which allows avoiding the introduction of symmetries in the solution space. In particular, the algorithm relies on an efficient and nontypical separation algorithm for known valid inequalities, and on an easy‐to‐implement primal bound heuristic. The effectiveness of the BC algorithm is empirically shown through an extensive experimental analysis involving 300 newly generated benchmark instances with up to 200 network nodes and 8 time slots. Additionally, the experimental results show that the BC algorithm represents a valid computational tool to benchmark the performance of heuristics addressing the problem, and can be used in practice, as an heuristic solver, to tackle problem instances that are not too large.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"81 1","pages":"499 - 513"},"PeriodicalIF":2.1,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47919336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

The hazardous orienteering problem 危险的定向运动问题

IF 2.1 4区计算机科学

Networks Pub Date : 2023-03-01 DOI: 10.1002/net.22129

Alberto Santini, C. Archetti

引用次数: 0

Issue Information 问题信息

IF 2.1 4区计算机科学

Networks Pub Date : 2023-02-12 DOI: 10.1002/net.22103

引用次数: 0

A genetic approach for the 2‐edge‐connected minimum branch vertices problem 二边连通最小分支顶点问题的遗传方法

IF 2.1 4区计算机科学

Networks Pub Date : 2023-02-01 DOI: 10.1002/net.22142

F. Carrabs, R. Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente

{"title":"A genetic approach for the 2‐edge‐connected minimum branch vertices problem","authors":"F. Carrabs, R. Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente","doi":"10.1002/net.22142","DOIUrl":"https://doi.org/10.1002/net.22142","url":null,"abstract":"This article addresses the 2‐edge‐connected minimum branch vertices problem, a variant of the minimum branch vertices problem in which the spanning subgraph is required to be 2‐edge‐connected for survivability reasons. The problem has been recently introduced and finds application in optical networks design scenarios, where branch vertices are associated to switch devices that allow to split the entering light signals and send them to several adjacent vertices. An exact approach to the problem has been proposed in the literature. In this paper, we formally prove its NP‐completeness and propose a genetic algorithm, which exploits some literature‐provided procedures for efficiently checking and restoring solutions feasibility, and makes use of novel ad‐hoc designed operators aiming to improve their values, reducing the number of branch vertices. The computational tests show that, on the benchmark instances, the genetic algorithm very often finds the optimal solution. Moreover, in order to further investigate the effectiveness and the performance of our algorithm, we generated a new set of random instances where the optimal solution is known a priori.","PeriodicalId":54734,"journal":{"name":"Networks","volume":" ","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42303704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set 具有一般模糊集的分布式风险接受性和风险厌恶性网络拦截问题

IF 2.1 4区计算机科学

Networks Pub Date : 2023-01-01 DOI: 10.1002/net.22114

Sumin Kang, M. Bansal

{"title":"Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set","authors":"Sumin Kang, M. Bansal","doi":"10.1002/net.22114","DOIUrl":"https://doi.org/10.1002/net.22114","url":null,"abstract":"We introduce generalizations of stochastic network interdiction problem with distributional ambiguity. Specifically, we consider a distributionally risk‐averse (or robust) network interdiction problem (DRA‐NIP) and a distributionally risk‐receptive network interdiction problem (DRR‐NIP) where a leader maximizes a follower's minimal expected objective value for either the worst‐case or the best‐case, respectively, probability distribution belonging to ambiguity set (a set of distributions). The DRA‐NIP arises in applications where a risk‐averse leader interdicts a follower to cause delays in their supply convoy. In contrast, the DRR‐NIP provides network vulnerability analysis where a network‐user seeks to identify vulnerabilities in the network against potential disruptions by an adversary (or leader) who is receptive to risk for improving the expected objective values. We present finitely convergent algorithms for solving DRA‐NIP and DRR‐NIP with a general ambiguity set. To evaluate their performance, we provide results of our extensive computational experiments performed on instances known for (risk‐neutral) stochastic NIP.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"81 1","pages":"22 - 3"},"PeriodicalIF":2.1,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42795363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1