Multi-satellite control resource scheduling based on ant colony optimization |
| |
| Affiliation: | 1. School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou, Jiangsu 221116, China;2. School of Information and Control Engineering, Xi’an University of Architecture and Technology, Xi’an, Shaanxi 710055, China;3. State Key Laboratory for Manufacturing Systems Engineering, Systems Engineering Institute, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China;1. Department of Computer Science and Engineering, University of Dhaka, Bangladesh;2. Department of Computer Engineering, Kyung Hee University, South Korea;1. College of Computer Science and Technology, Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education, Jilin University, 130012 Changchun, China;2. College of Computer Science and Engineering, Changchun University of Technology, 130012 Changchun, China;1. Biomedical Knowledge Engineering Laboratory, Seoul National University, Republic of Korea;2. Dental Research Institute, Seoul National University, Republic of Korea;3. Institute of Human-Environment Interface Biology, Seoul National University, Republic of Korea;1. Computer Science Department, University of Science, VNU-Ho Chi Minh, Viet Nam;2. Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Viet Nam;1. School of Engineering, Nanjing Agricultural University, Nanjing, China;2. School of Management Science and Engineering, Nanjing University, Nanjing, China;1. University of Information Technology, Ho Chi Minh City, Vietnam;2. Department of Computer Science and Computer Engineering, La Trobe University, VIC 3086, Australia |
| |
| Abstract: | The multi-satellite control resource scheduling problem (MSCRSP) is a kind of large-scale combinatorial optimization problem. As the solution space of the problem is sparse, the optimization process is very complicated. Ant colony optimization as one of heuristic method is wildly used by other researchers to solve many practical problems. An algorithm of multi-satellite control resource scheduling problem based on ant colony optimization (MSCRSP–ACO) is presented in this paper. The main idea of MSCRSP–ACO is that pheromone trail update by two stages to avoid algorithm trapping into local optima. The main procedures of this algorithm contain three processes. Firstly, the data get by satellite control center should be preprocessed according to visible arcs. Secondly, aiming to minimize the working burden as optimization objective, the optimization model of MSCRSP, called complex independent set model (CISM), is developed based on visible arcs and working periods. Ant colony algorithm can be used directly to solve CISM. Lastly, a novel ant colony algorithm, called MSCRSP–ACO, is applied to CISM. From the definition of pheromone and heuristic information to the updating strategy of pheromone is described detailed. The effect of parameters on the algorithm performance is also studied by experimental method. The experiment results demonstrate that the global exploration ability and solution quality of the MSCRSP–ACO is superior to existed algorithms such as genetic algorithm, iterative repair algorithm and max–min ant system. |
| |
| Keywords: | Ant colony optimization Visible arc Complex independent set model Two stages |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
