IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v275y2019i2p694-707.html
   My bibliography  Save this article

A mixed integer linear programming model for multi-satellite scheduling

Author

Listed:
  • Chen, Xiaoyu
  • Reinelt, Gerhard
  • Dai, Guangming
  • Spitz, Andreas

Abstract

We address the multi-satellite scheduling problem with limited observation capacities that arises from the need to observe a set of targets on the Earth’s surface using imaging resources installed on a set of satellites. We define and analyze the conflict indicators of all available visible time windows of missions, as well as the feasible time intervals of resources. The problem is then formulated as a mixed integer linear programming model, in which constraints are derived from a careful analysis of the interdependency between feasible time intervals that are eligible for observations. We apply the proposed model to several different problem instances that reflect real-world situations. The computational results verify that our approach is effective for obtaining optimum solutions or solutions with a very good quality.

Suggested Citation

  • Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
    • Handle: RePEc:eee:ejores:v:275:y:2019:i:2:p:694-707
    DOI: 10.1016/j.ejor.2018.11.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718309998
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.11.058?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    2. Tangpattanakul, Panwadee & Jozefowiez, Nicolas & Lopez, Pierre, 2015. "A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite," European Journal of Operational Research, Elsevier, vol. 245(2), pages 542-554.
    3. Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena, 2010. "Strong formulation for the spot 5 daily photograph scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 385-398, November.
    4. Michel Vasquez & Jin-Kao Hao, 2003. "Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 87-103, March.
    5. J-F Cordeau & G Laporte, 2005. "Maximizing the value of an Earth observation satellite orbit," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 962-968, August.
    6. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.
    7. Djamal Habet & Michel Vasquez & Yannick Vimont, 2010. "Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite," Computational Optimization and Applications, Springer, vol. 47(2), pages 307-333, October.
    8. Gabrel, Virginie & Vanderpooten, Daniel, 2002. "Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite," European Journal of Operational Research, Elsevier, vol. 139(3), pages 533-542, June.
    9. Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Multi-agent scheduling on a single machine with max-form criteria," European Journal of Operational Research, Elsevier, vol. 188(2), pages 603-609, July.
    10. Virginie Gabrel, 2006. "Strengthened 0-1 linear formulation for the daily satellite mission planning," Journal of Combinatorial Optimization, Springer, vol. 11(3), pages 341-346, May.
    11. Bianchessi, Nicola & Cordeau, Jean-Francois & Desrosiers, Jacques & Laporte, Gilbert & Raymond, Vincent, 2007. "A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites," European Journal of Operational Research, Elsevier, vol. 177(2), pages 750-762, March.
    12. William J. Wolfe & Stephen E. Sorensen, 2000. "Three Scheduling Algorithms Applied to the Earth Observing Systems Domain," Management Science, INFORMS, vol. 46(1), pages 148-166, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bernhard, Pierre & Deschamps, Marc & Zaccour, Georges, 2023. "Large satellite constellations and space debris: Exploratory analysis of strategic management of the space commons," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1140-1157.
    2. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.
    2. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    3. Tangpattanakul, Panwadee & Jozefowiez, Nicolas & Lopez, Pierre, 2015. "A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite," European Journal of Operational Research, Elsevier, vol. 245(2), pages 542-554.
    4. Wang, Xin-Wei & Chen, Zhen & Han, Chao, 2016. "Scheduling for single agile satellite, redundant targets problem using complex networks theory," Chaos, Solitons & Fractals, Elsevier, vol. 83(C), pages 125-132.
    5. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    6. Alex Elkjær Vasegaard & Ilkyeong Moon & Peter Nielsen & Subrata Saha, 2023. "Determining the pricing strategy for different preference structures for the earth observation satellite scheduling problem through simulation and VIKOR," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 945-973, September.
    7. Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena, 2010. "Strong formulation for the spot 5 daily photograph scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 385-398, November.
    8. Bianchessi, Nicola & Cordeau, Jean-Francois & Desrosiers, Jacques & Laporte, Gilbert & Raymond, Vincent, 2007. "A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites," European Journal of Operational Research, Elsevier, vol. 177(2), pages 750-762, March.
    9. Xiao, Yiyong & Zhang, Siyue & Yang, Pei & You, Meng & Huang, Jiaoying, 2019. "A two-stage flow-shop scheme for the multi-satellite observation and data-downlink scheduling problem considering weather uncertainties," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 263-275.
    10. Philippe Monmousseau, 2021. "Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 846-873, December.
    11. Bernhard, Pierre & Deschamps, Marc & Zaccour, Georges, 2023. "Large satellite constellations and space debris: Exploratory analysis of strategic management of the space commons," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1140-1157.
    12. Lei He & Mathijs Weerdt & Neil Yorke-Smith, 2020. "Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm," Journal of Intelligent Manufacturing, Springer, vol. 31(4), pages 1051-1078, April.
    13. J-F Cordeau & G Laporte, 2005. "Maximizing the value of an Earth observation satellite orbit," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 962-968, August.
    14. Karapetyan, Daniel & Mitrovic Minic, Snezana & Malladi, Krishna T. & Punnen, Abraham P., 2015. "Satellite downlink scheduling problem: A case study," Omega, Elsevier, vol. 53(C), pages 115-123.
    15. Jie Chun & Wenyuan Yang & Xiaolu Liu & Guohua Wu & Lei He & Lining Xing, 2023. "Deep Reinforcement Learning for the Agile Earth Observation Satellite Scheduling Problem," Mathematics, MDPI, vol. 11(19), pages 1-20, September.
    16. Mahalec, Vladimir & Chen, Yingwu & Liu, Xiaolu & He, Renjie & Sun, Kai, 2015. "Reconfiguration of satellite orbit for cooperative observation using variable-size multi-objective differential evolutionAuthor-Name: Chen, Yingguo," European Journal of Operational Research, Elsevier, vol. 242(1), pages 10-20.
    17. Nong, Q.Q. & Cheng, T.C.E. & Ng, C.T., 2011. "Two-agent scheduling to minimize the total cost," European Journal of Operational Research, Elsevier, vol. 215(1), pages 39-44, November.
    18. Cheng He & Chunqi Xu & Hao Lin, 2020. "Serial-batching scheduling with two agents to minimize makespan and maximum cost," Journal of Scheduling, Springer, vol. 23(5), pages 609-617, October.
    19. Manahov, Viktor & Urquhart, Andrew, 2021. "The efficiency of Bitcoin: A strongly typed genetic programming approach to smart electronic Bitcoin markets," International Review of Financial Analysis, Elsevier, vol. 73(C).
    20. Huilong Fan & Zhan Yang & Shimin Wu & Xi Zhang & Jun Long & Limin Liu, 2021. "An Efficient Satellite Resource Cooperative Scheduling Method on Spatial Information Networks," Mathematics, MDPI, vol. 9(24), pages 1-23, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:275:y:2019:i:2:p:694-707. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.