Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/3168
Title: Metaheuristic approach to solve a variant of generalized regenerator location problem in optical networks
Authors: Mrkela, Lazar
Stanimirović, Zorica 
Marić, Miroslav 
Affiliations: Numerical Mathematics and Optimization 
Informatics and Computer Science 
Keywords: generalized location problem;S-metaheuristic;P-metaheuristic;multi-objective optimization
Issue Date: 2025
Rank: M34
Publisher: Beograd : Fakultet organizacionih nauka
Related Publication(s): Book of Abstracts of the 52nd International Symposium on Operational Research (SYM-OP-IS 2025), September 7-10, 2025, Palić, Serbia
Conference: International Symposium on Operational Research SYM-OP- IS (52 ; 2025 ; Palić)
Abstract: 
The generalized regenerator location problem (GRLP) deals with the optimal placement of regenerators in optical network in order to preserve signal quality between the end-user pairs with minimal number of installed regenerators. This study considers a variant of GRLP that involves weights of end-user pairs reflecting their importance or priorities in an optical network and the costs of installing regenerators for each location. The considered GRLP variant addresses two objectives: to maximize the sum of weights of connected end-user pairs and to minimize the total costs of installing regenerators. As the optical network involves large number of nodes, metaheuristic approach is used to solve the problem under consideration. Several S-metaheuristic and P-metaheuristic concepts are modified in accordance to the problem's characteristics. The proposed metaheuristic methods are tested on the modified GRLP data sets from the literature and the obtained results are compared in terms of solution quality in respect to several metrics.
URI: https://research.matf.bg.ac.rs/handle/123456789/3168
Appears in Collections:Research outputs

Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.