Return to search

REACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULING

International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / The Broadcast Scheduling Problem (BSP) is a well known NP-complete problem that arises in the study of wireless networks. In the BSP, a finite set of stations are to be scheduled in a time division multiple access (TDMA) frame. The objective is a collision free transmission schedule with the minimum number of TDMA slots and maximal slot utilization. Such a schedule will minimize the total system delay. We present variations of a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. Path-relinking, a post-optimization strategy is applied. Also, a reactivity method is used to balance GRASP parameters. Numerical results of our research are reported and compared with other heuristics from the literature.

Identiferoai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/605798
Date10 1900
CreatorsCommander, Clayton W., Butenko, Sergiy I., Pardalos, Panos M., Oliveira, Carlos A.S.
ContributorsEglin Air Force Base, Texas A&M University, University of Florida
PublisherInternational Foundation for Telemetering
Source SetsUniversity of Arizona
Languageen_US
Detected LanguageEnglish
Typetext, Proceedings
RightsCopyright © International Foundation for Telemetering
Relationhttp://www.telemetry.org/

Page generated in 0.0022 seconds