Improved heuristics for the regenerator location problem

Telecommunication systems use optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it goes farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive its intended destination with good quality, it is necessary to regenerate the signal periodically using regenerators. These components are relatively expensive and therefore it is desirable to deploy as few of them as possible in the network. In the regenerator location problem (RLP), we are given an undirected graph, positive edge lengths, and a parameter specifying the maximum length that a signal can travel before its quality deteriorates and regeneration is required. The problem consists in determining paths that connect all pairs of nodes in the graph and, if necessary, locating single regenerators in some of those nodes such that the signal never travels more than the maximum allowed distance without traversing a regenerator node. In this paper, we present new implementations of previous heuristics and two new heuristics—a GRASP and a biased random-key genetic algorithm—for the RLP. Computational experiments comparing the proposed solution procedures with previous heuristics described in the literature illustrate the efficiency and effectiveness of our methods.

[1]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[2]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[3]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[4]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[5]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[6]  Luís Gouveia,et al.  MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Ezhan Karasan,et al.  Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks , 2004, Photonic Network Communications.

[8]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[9]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[10]  S. Raghavan,et al.  The regenerator location problem , 2010 .

[11]  Gianpiero Monaco,et al.  On the Complexity of the Regenerator Placement Problem in Optical Networks , 2011, IEEE/ACM Transactions on Networking.

[12]  Mauricio G. C. Resende,et al.  Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[13]  Celso C. Ribeiro,et al.  Probabilistic stopping rules for GRASP heuristics and extensions , 2013, Int. Trans. Oper. Res..

[14]  Mauricio G. C. Resende,et al.  Randomized heuristics for the family traveling salesperson problem , 2014, Int. Trans. Oper. Res..

[15]  Mauricio G. C. Resende,et al.  An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling , 2014, Int. Trans. Oper. Res..

[16]  Si Chen,et al.  The Generalized Regenerator Location Problem , 2015, INFORMS J. Comput..