Multi-objective optimization for multi-satellite scheduling task
Article Sidebar
Main Article Content
Abstract
The satellites scheduling mission play an effective role in enhancing the role of ground station control and monitoring systems. In this search, SGSEO is re-formulated into a multi-objective optimization task. Therefore, the Gravitational Search Algorithm GSA is exploited to attain several essential objectives for generating tight scheduling. Moreover, particle swarm optimization model PSO is consolidated with GSA in a novel form for strengthening its ability of local search and slow the speed of convergence. On the other side, to make the most of the satellite resources in the right direction, we have observed targets that have fewer observational opportunities to keep them from being lost. The PageRank algorithm is used to fulfil this issue by ranking the candidate's strips. Finally, the effect of different parameters of the proposed approach was studied by experimental outcomes and compared with previous methods. It has shown that the performance of the proposed approach is superior to its peers from other methods.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
References
J. Frank, A. Jonsson, R. Morris, D. E. Smith, and P. Norvig, “Planning and scheduling for fleets of earth observing satellites,” in Int. Symp. Artif. Intell. Robot. Autom. Space, 2001.
A. Sarkheyli, B. G. Vaghei, and A. Bagheri, “New tabu search heuristic in scheduling earth observation satellites,” in 2010 2nd Int. Conf. Softw. Technol. Eng., 2010, vol. 2, pp. V2-199.
N. Bianchessi, J.-F. Cordeau, J. Desrosiers, G. Laporte, and V. Raymond, “A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites,” Eur. J. Oper. Res., vol. 177, no. 2, pp. 750–762, 2007.
N. Zufferey, P. Amstutz, and P. Giaccari, “Graph colouring approaches for a satellite range scheduling problem,” J. Sched., vol. 11, no. 4, pp. 263–277, 2008.
F. Marinelli, S. Nocella, F. Rossi, and S. Smriglio, “A Lagrangian heuristic for satellite range scheduling with resource constraints,” Comput. Oper. Res., vol. 38, no. 11, pp. 1572–1583, 2011.
L. Barbulescu, A. E. Howe, J.-P. Watson, and L. D. Whitley, “Satellite range scheduling: A comparison of genetic, heuristic and local search,” in Int. Conf. Parallel Probl. Solving Nat., 2002, pp. 611–620.
S. Baek et al., “Development of a scheduling algorithm and GUI for autonomous satellite missions,” Acta Astronaut., vol. 68, no. 7–8, pp. 1396–1402, 2011.
Y. Chen, D. Zhang, M. Zhou, and H. Zou, “Multi-satellite observation scheduling algorithm based on hybrid genetic particle swarm optimization,” in Adv. inf. technol. ind. appl., Springer, 2012, pp. 441–448.
R. H. Saputra and B. Prasetyo, “Improve the accuracy of c4. 5 algorithm using particle swarm optimization (pso) feature selection and bagging technique in breast cancer diagnosis,” J. Soft Comput. Explor., vol. 1, no. 1, pp. 47–55, 2020.
M. A. Mosa, A. S. Anwar, and A. Hamouda, “A survey of multiple types of text summarization with their satellite contents based on swarm intelligence optimization algorithms,” Knowl.-Based Syst., vol. 163, pp. 518–532, 2019.
D. Thiruvady, C. Blum, and A. T. Ernst, “Maximising the net present value of project schedules using CMSA and parallel ACO,” in Int. Workshop Hybrid Metaheuristics, 2019, pp. 16–30.
I. A. Ashari, M. A. Muslim, and A. Alamsyah, “Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing,” Sci. J. Inform., vol. 3, no. 2, pp. 149–158, 2016.
K. bin Gao, G. H. Wu, and J. H. Zhu, “Multi-satellite observation scheduling based on a hybrid ant colony optimization,” in Adv. Mater. Res., 2013, vol. 765, pp. 532–536.
M. A. Mosa, “Real-time data text mining based on Gravitational Search Algorithm,” Expert Syst. Appl., vol. 137, pp. 117–129, 2019.
M. A. Mosa, “A novel hybrid particle swarm optimization and gravitational search algorithm for multi-objective optimization of text mining,” Appl. Soft Comput., vol. 90, p. 106189, 2020.
E. Rashedi, H. Nezamabadi-Pour, and S. Saryazdi, “GSA: a gravitational search algorithm,” Inf. sci., vol. 179, no. 13, pp. 2232–2248, 2009.
I. Das and J. E. Dennis, “Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems,” SIAM j. optim., vol. 8, no. 3, pp. 631–657, 1998.
S. Augenstein, A. Estanislao, E. Guere, and S. Blaes, “Optimal scheduling of a constellation of earth-imaging satellites, for maximal data throughput and efficient human management,” in Proc. Int. Conf. Autom. Plan. Sched., 2016, vol. 26, pp. 345–352.
X. Shao, Z. Zhang, J. Wang, and D. Zhang, “NSGA-II-based multi-objective mission planning method for satellite formation system,” J. Aerosp. Technol. Manag., vol. 8, pp. 451–458, 2016.
G. Wu, H. Wang, W. Pedrycz, H. Li, and L. Wang, “Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task clustering strategy,” Comput. Ind. Eng., vol. 113, pp. 576–588, 2017.