Lagrangian relaxation for maximum service in multicast routing with QoS constraints

Autor(es)

Araujo, Carlos Victor Dantas ; de Souza, Cid Carvalho ; Usberti, Fabio Luiz

• Tipo de documento: Artigo Científico
• Fonte: International Transactions in Operational Research; v. N/A, p. 27-pg., 2022-08-10.

Resumo

In this paper, we propose a new variant of the Multicast Routing Problem called Maximum Service in Multicast Routing with Quality of Service constraints applied in the context of vehicular ad hoc networks, for which data must be sent from a root node to a set of terminal nodes. The use of all nodes is not mandatory and each connection between the root and a terminal aims to satisfy the quality of service according to the limits established for each metric. The objective is to maximize the number of serviced terminals according to the network's quality of service metrics. We present an integer programming formulation and four Lagrangian relaxations, to obtain good primal and dual bounds. We also develop a local search applied during the resolution of the Lagrangian relaxations. These methodologies were subjected to computational experiments with a set of 40 instances generated with characteristics of vehicular ad hoc networks. Statistical analyses were performed to compare the performance between methodologies, where the model achieved optimal values for 29 instances, and the Lagrangian relaxations rendered competitive bounds, especially for large instances. (AU)

• Processo FAPESP: 15/11937-9 - Investigação de problemas difíceis do ponto de vista algorítmico e estrutural
• Beneficiário: Flávio Keidi Miyazawa
• Modalidade de apoio: Auxílio à Pesquisa - Temático