Efficient mixed-integer linear programming formulations for the satellite broadcast scheduling problem

S. Ananthu Krishna, B.S. Girish and Devendra Prakash Ghate

International Journal of Operational Research, 2024, vol. 51, issue 2, 233-259

Abstract: Satellite broadcast scheduling problem (SBSP) is an important optimisation problem in satellite communication systems and is known to be NP-complete. The existing state-of-the-art solution methodologies for the SBSP include neural networks, evolutionary algorithms, and other heuristic approaches. This paper proposes two new mixed-integer linear programming (MILP) formulations for the problem. The performance of the proposed MILP formulations has been evaluated using benchmark problem instances and several other test instances on a commercial MILP solver. Computational results show that the proposed formulations outperform the existing approaches in terms of solution accuracy and computation time.

Keywords: satellite communications; satellite broadcast scheduling; NP-complete problem; mixed-integer linear programming. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=142251 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:51:y:2024:i:2:p:233-259

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().