A mixed integer linear programming model for multi-satellite scheduling

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2019
Autor:innen
Chen, Xiaoyu
Reinelt, Gerhard
Dai, Guangming
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
EU-Projektnummer
DFG-Projektnummer
Angaben zur Forschungsförderung (Freitext)
Projekt
Open Access-Veröffentlichung
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
European Journal of Operational Research. Elsevier. 2019, 275(2), pp. 694-707. ISSN 0377-2217. eISSN 1872-6860. Available under: doi: 10.1016/j.ejor.2018.11.058
Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Scheduling, Earth observing satellites, Integer programming, Mathematical programming
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690CHEN, Xiaoyu, Gerhard REINELT, Guangming DAI, Andreas SPITZ, 2019. A mixed integer linear programming model for multi-satellite scheduling. In: European Journal of Operational Research. Elsevier. 2019, 275(2), pp. 694-707. ISSN 0377-2217. eISSN 1872-6860. Available under: doi: 10.1016/j.ejor.2018.11.058
BibTex
@article{Chen2019mixed-55153,
  year={2019},
  doi={10.1016/j.ejor.2018.11.058},
  title={A mixed integer linear programming model for multi-satellite scheduling},
  number={2},
  volume={275},
  issn={0377-2217},
  journal={European Journal of Operational Research},
  pages={694--707},
  author={Chen, Xiaoyu and Reinelt, Gerhard and Dai, Guangming and Spitz, Andreas}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/55153">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Chen, Xiaoyu</dc:creator>
    <dc:creator>Spitz, Andreas</dc:creator>
    <dcterms:issued>2019</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Chen, Xiaoyu</dc:contributor>
    <dc:creator>Dai, Guangming</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-05T11:22:01Z</dcterms:available>
    <dc:contributor>Spitz, Andreas</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55153"/>
    <dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-05T11:22:01Z</dc:date>
    <dc:contributor>Dai, Guangming</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:language>eng</dc:language>
    <dcterms:title>A mixed integer linear programming model for multi-satellite scheduling</dcterms:title>
    <dc:contributor>Reinelt, Gerhard</dc:contributor>
    <dc:creator>Reinelt, Gerhard</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
Diese Publikation teilen