A Comparison of Heuristic Methods for Scheduling Earth Observing Satellites Fleet

Wang, Pei; Tan, Yuejin; Reinelt, Gerhard

doi:10.1109/itcs.2009.174

Cited by 4 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we gather the different case types from the constellation type point of view (Table 4) and the most common used planning horizons (Table 5). Bensana et al (1996Bensana et al ( , 1999, Li and Wang (2008) and Wolfe and Sorensen (2000) 2 Integer linear programming (ILP) Wang et al (2015Wang et al ( , 2009, Bianchessi et al (2007), Wang (2007) and Bensana et al (1997) 3 Window constrained problem (WCP) Wolfe and Sorensen (2000) 4 Graph theory Lemaitre et al (2002) 5 Knapsack problem Vasquez and Hao (2001) and Cordeau and Laporte (2005) 6 Mathematical programming (Xu et al, 2016) 7…”

Section: Literature Surveymentioning

confidence: 99%

“…Used by reference Approximate algorithms Greedy search (GS) Bensana et al (1997Bensana et al ( ), 1996, Lemaitre et al (2002), Frank et al (2001), and Dungan et al (2002) Tabu search (TS) Bensana et al (1997Bensana et al ( , 1996Bensana et al ( , 1999, Vasquez and Hao (2001), Cordeau and Laporte (2005), Wang et al (2009) and Bianchessi et al (2007) Priority dispatch Wolfe and Sorensen (2000) Look ahead Florio (2006), Wolfe and Sorensen (2000) and Bianchessi and Righini (2008) Genetic algorithm Li and Wang (2008), Wolfe and Sorensen (2000), Globus et al (2002Globus et al ( , 2004, Wang (2007) and Sun et al (2012) Ant colony (Xu et al, 2016) Simulated annealing Lemaitre et al (2002), Globus et al (2002Globus et al ( , 2004 and Wang et al (2009) Hill climbing (HC) Globus et al (2002Globus et al ( , 2004 Column generation Wang et al (2015) Bensana et al (1999Bensana et al ( , 1997, Lemaitre et al (2002), Dungan et al (2002), Globus et al (2002Globus et al ( , 2004, Frank et al (2001), Bianchessi et al (2007), Florio (2006, Wang et al (2011…”

Section: Search Algorithmmentioning

confidence: 99%

“…,Vasquez and Hao (2001),Cordeau and Laporte (2005) andLi and Wang (2008) 2 EOS >1Wang et al (2015Wang et al ( , 2009,Dungan et al (2002),Globus et al (2002Globus et al ( , 2004,Frank et al (2001),Wolfe and Sorensen (2000), andWang (. (2007), Florio (2006,Bianchessi and Righini (2008),Wang et al (2011), Sun et al (2012 andXu et al …”

mentioning

confidence: 98%

See 2 more Smart Citations

Mission planning and scheduling for Earth observation space system

Qamar¹,

Salah²,

Badran³

et al. 2020

IJSSE

View full text Add to dashboard Buy / Rent full text

Planning and scheduling systems are needed to manage Earth observing satellites for satisfying the optimum usage of the constellation's resources. This is a combinatorial optimisation NP-hard problem which is solved in this paper using the constraint programming technique. The proposed system can deal with a heterogeneous constellation that consists of satellites with different manoeuvrability, placed in different orbits, and loaded with different payloads. The system's user can choose one of six optimisation objectives, three of them were not used before, for constructing the satellites' mission plan. Searching within the system is performed using one of five different search algorithms. The system produces plans with different planning horizons ranging from one track to more than one month. The obtained results depict that the proposed system behaves, comparatively, in a perfect manner even when dealing with a complicated case study consisting of three satellites, 2,500 targets, and one month planning horizon.

show abstract