Regenerator Location Problem and survivable extensions: A hub covering location perspective

Abstract

Survivable network design Branch and cut a b s t r a c tIn a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem seeks to place the minimum number of regenerators in an optical network so as to facilitate the communication of a signal between any node pair. In this study, the Regenerator Location Problem is revisited from the hub location perspective directing our focus to applications arising in transportation settings. Two new dimensions involving the challenges of survivability are introduced to the problem. Under partial survivability, our designs hedge against failures in the regeneration equipment only, whereas under full survivability failures on any of the network nodes are accounted for by the utilization of extra regeneration equipment. All three variations of the problem are studied in a unifying framework involving the introduction of individual flow-based compact formulations as well as cut formulations and the implementation of branch and cut algorithms based on the cut formulations. Extensive computational experiments are conducted in order to evaluate the performance of the proposed solution methodologies and to gain insights from realistic instances.

A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing

“…This constitutes an additional challenge to our design problem. Computational findings in the regenerator placement problem show that B&C approaches outperform other exact solution methods, especially in large-scale instances (Rahman et al 2015, Yıldız and Karaşan 2015, Li and Aneja 2017. We also observe similar results.…”

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

“…Wagner [31] proposed the hub covering location problem with bounded path lengths. Yildiz and Karaşan [32] applied the hub covering concept to model the regenerator location problem (RLP) in telecommunication networks and proposed a branch and cut algorithm for solving their model. Jabalameli et al [12] proposed an efficient simulated annealing based heuristic for solving the single allocation p-hub maximal covering problem.…”

Dry Port Location Problem: A Hybrid Multi-Criteria Approach

“…The problem of hub location has attracted many researchers. Many studies in hub location problem deals with exact methods, for example [30][31][32] [33] etc. In this paper, we recap studies that have been done and give a synthesis of the existing literature related to use in dry port location problem.…”