Priority-based and conflict-avoidance heuristics for multi-satellite scheduling

Chen, Xiaoyu; Reinelt, Gerhard; Dai, Guangming; Wang, Maocai

doi:10.1016/j.asoc.2018.04.021

Cited by 47 publications

(15 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, in the case of joint probabilities, our scheduling model can be reformulated as: ( 27)-( 32), ( 5)- (10). Note that there are random variablesλ ik in the model, and thus the model cannot be solved directly.…”

Section: Branch-and-boundmentioning

confidence: 99%

“…Considering task merging for EOS observation, Wu et al [41] proposed a simulated annealing algorithm based on the adaptive neighborhood operators. Moreover, metaheuristics for EOS scheduling also include tabu search algorithms [20,26,34,35,46], genetic algorithms [23,31,39,42], ant colony algorithms [10,24,40,45], local search algorithms [21,22] and simulated annealing algorithms [18,20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Expectation and SAA Models and Algorithms for Scheduling of Multiple Earth Observation Satellites Under the Impact of Clouds

Wang

Demeulemeester²,

et al. 2020

IEEE Systems Journal

View full text Add to dashboard Cite

In the explosively increased number of applications of earth observation satellites (EOSs), scheduling is a significative issue to satisfy more requests and obtain a high observation efficiency. This paper investigates the scheduling of multiple EOSs under the impact of clouds. Firstly, we formulate the presences of clouds as stochastic events, and propose an expectation model. Afterwards, for the first time, a branch-and-price algorithm based on Dantzig-Wolfe decomposition is devised to solve the model optimally and efficiently. In order to obtain initial columns for column generation, a dynamic programming algorithm and a heuristic algorithm are suggested, respectively. Furthermore, we discuss the impact of clouds in the case of joint probabilities, and establish a sample average approximation (SAA) model accordingly. With respect to the expectation model, numerical experiment results demonstrate the relative dominance of the proposed branch-and-price algorithm in terms of solution time compared to CPLEX. In addition, the solution of the proposed SAA model is proven to be more robust than that of the expectation model.

show abstract

Section: Branch-and-boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Expectation and SAA Models and Algorithms for Scheduling of Multiple Earth Observation Satellites Under the Impact of Clouds

Wang

Demeulemeester²,

et al. 2020

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…problems. Practices show that heuristic rules can obtain a rapid initial schedule and significantly speed up the solving procedure of satellite scheduling [34][35][36]. In this section, a priority-based construction heuristic is chosen to perform as initial algorithms for integrated AEOS scheduling, as shown in Algorithm 1.…”

Section: Construction Heuristicmentioning

confidence: 99%

Integrated agile observation satellite scheduling problem considering different memory environments: a case study

Xing

Chen

et al. 2020

J Braz. Soc. Mech. Sci. Eng.

View full text Add to dashboard Cite

This paper presents an experimental study on an integrated agile earth observation satellite (AEOS) scheduling problem involving the satellite memory environments of the partially erasable memory (PEM) and the holistically erasable memory (HEM). The integrated AEOS scheduling problem simultaneously considers the satellite observation and transmission events, in which the onboard memory functions as a very important connective resource. To address the memory constraints in the AEOS scheduling problem, an integrated AEOS scheduling model that is suitable for both the PEM and HEM environments is proposed in this paper. Based on commonly used construction heuristic and meta-heuristics, two hybrid approaches, Tabusimulated annealing (TSA) and Tabu late acceptance (TLA) algorithms, are adopted to solve this problem. The highlights in this paper are the formulation of novel adaptive memory constraints for the AEOS scheduling and the quantitatively scheduling comparison of separated and integrated modeling methods. Experimental results indicate that (1) the memory environment has a direct influence on the AEOS integrated scheduling results, where the PEM environment sufficiently utilizes memory resources and advances the efficiency of the AEOS a lot. (2) The integrated scheduling method enables the reduction in resource consumption and obtains a better result than the separated scheduling method, especially in the HEM environment, (3) and the hybrid meta-heuristics TLA and TSA that show better overall performance are suggested for addressing the studied AEOS integrated scheduling problem.

show abstract

“…High attention has been paid on the imaging task scheduling with multiple satellites relatively recently [3,25,[27][28][29][30][31][32][33][34][35]. The review of past studies on scheduling of agile satellite imaging led the authors to identify the opportunity primarily for improving the quality of a schedule solution.…”

Section: Introductionmentioning

confidence: 99%

Task Scheduling of Agile Satellites with Transition Time and Stereoscopic Imaging Constraints

Kim

Ahn

Choi

et al. 2020

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

This paper proposes a framework for scheduling the observation and download tasks of multiple agile satellites with practical considerations such as attitude transition time, onboard data capacity, and stereoscopic image acquisition. A mixed integer linear programming (MILP) formulation for optimal scheduling that can address these practical considerations is introduced. A heuristic algorithm to obtain a near-optimal solution of the formulated MILP based on the time windows pruning procedure is proposed. A comprehensive case study demonstrating the validity of the proposed formulation and heuristic is presented. Nomenclature Indices / Index Sets

show abstract

Priority-based and conflict-avoidance heuristics for multi-satellite scheduling

Cited by 47 publications

References 38 publications

Expectation and SAA Models and Algorithms for Scheduling of Multiple Earth Observation Satellites Under the Impact of Clouds

Expectation and SAA Models and Algorithms for Scheduling of Multiple Earth Observation Satellites Under the Impact of Clouds

Integrated agile observation satellite scheduling problem considering different memory environments: a case study

Task Scheduling of Agile Satellites with Transition Time and Stereoscopic Imaging Constraints

Contact Info

Product

Resources

About