A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

DOI10.1111/ITOR.13146MaRDI QIDQ6082271zbMATH OpenOpenAlexFDO

Authors Andre L. L. Aquino, Bruno Nogueira, Rian G. S. Pinheiro

Publication date 29 November 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.13146

zbMATH Keywords

biased random-key genetic algorithmcombinatorial optimizationmatheuristicminimum broadcast time

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
• A Neighborhood Search Technique for the Freeze Tag Problem
• A survey of gossiping and broadcasting in communication networks
• An algorithm for constructing minimal c-broadcast networks
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
• Biased random-key genetic algorithms with applications in telecommunications
• Broadcasting in DMA-bound bounded degree graphs
• Broadcasting in heterogeneous tree networks
• Designing broadcasting algorithms in the postal model for message-passing systems
• Efficient approaches for the flooding problem on graphs
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• Hybridizing exact methods and metaheuristics: a taxonomy
• Improved upper and lower bounds for k-broadcasting
• Information dissemination in trees with nonuniform edge transmission times
• On the design of resilient heterogeneous wireless sensor networks based on small world concepts
• Random Graphs
• The minimum broadcast time problem for several processor networks

Cited in

(7)

• Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach
• Tighter bounds on the minimum broadcast time
• Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
• Strong bounds and exact solutions to the minimum broadcast time problem
• Biased random-key genetic algorithms for the weighted minimum broadcast time problem
• Biased random-key genetic algorithms: a review
• Broadcasting two messages in wheel graphs

This page was built for publication: A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6082271)