Binary particle swarm optimization for tdma broadcast scheduling problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86092933" target="_blank" >RIV/61989100:27240/12:86092933 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/IBICA.2012.29" target="_blank" >http://dx.doi.org/10.1109/IBICA.2012.29</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/IBICA.2012.29" target="_blank" >10.1109/IBICA.2012.29</a>

Result language
angličtina
Original language name
Binary particle swarm optimization for tdma broadcast scheduling problem
Original language description
This paper presents binary particle swarm optimization (BPSO) for finding an optimum conflict-free transmission schedule for a broadcast radio network. This is known as Broadcast Scheduling Problem (BSP) and shown as an NP-complete problem in earlier studies. Because of this NP-complete nature, earlier studies used genetic algorithms, mean field annealing, neural networks, factor graph and sum product algorithm, and sequential vertex coloring algorithm to obtain the solution. We are able to achieve better results using our proposed BPSO. The results are obtained using our methodology is compared with CPLEX and all the other earlier solution methods. 2012 IEEE.
Czech name
—
Czech description
—

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings - 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012
ISBN
978-1-4673-2838-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
1-6
Publisher name
IEEE
Place of publication
New York
Event location
Kaohsiung City
Event date
Oct 26, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)