The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

01/09/2019
by   Yahui Sun, et al.
0

It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms: the first one is a quasilinear time heuristic algorithm that is faster and consumes less memory than other algorithms; and the second one is an improvement of a stateof-the-art polynomial time heuristic algorithm that can find high-quality solutions at a speed that is only inferior to the first one. We demonstrate the competitiveness of our heuristic algorithms by comparing them with the state-of-the-art ones on the largest existing benchmark instances (169 800 vertices and 338 551 edges). Moreover, we generate new instances that are even larger (1 000 000 vertices and 10 000 000 edges) to further demonstrate their advantages in large networks. The state-ofthe-art algorithms are too slow to find high-quality solutions for instances of this size, whereas our new heuristic algorithms can do this in around 6 to 45s on a personal computer. Ultimately, we apply our post-processing techniques to update the bestknown solution for a notoriously difficult benchmark instance to show that they can improve near-optimal solutions to PCSTP. In conclusion, we demonstrate the usefulness of our heuristic algorithms and post-processing techniques for designing large and low-cost communication networks.

READ FULL TEXT
research
05/09/2021

Euclidean Distance-Optimal Post-Processing of Grid-Based Paths

Paths planned over grids can often be suboptimal in an Euclidean space a...
research
01/14/2020

On Hard-Decision Decoding of Product Codes

In this paper we review existing hard-decision decoding algorithms for p...
research
08/31/2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions

We propose a new heuristic algorithm for the Maximum Happy Vertices prob...
research
04/15/2017

A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks

We consider the problem of optimally designing a body wireless sensor ne...
research
12/16/2011

Ensemble Models with Trees and Rules

In this article, we have proposed several approaches for post processing...
research
12/17/2021

An Exact Algorithm for the Linear Tape Scheduling Problem

Magnetic tapes are often considered as an outdated storage technology, y...
research
09/02/2020

An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization

The gravity fed water distribution network design (WDND) optimization pr...

Please sign up or login with your details

Forgot password? Click here to reset