Optimization of Concurrent Testing Processes in Space Launches Based on Genetic Algorithms
The increasing frequency of space launch missions underscores their vital role in national security and technological advancement. These missions involve a complex set of tasks, each reliant on limited resources and subject to various constraints. Traditionally, mission planning has depended on the expertise of personnel, leading to potential biases and inefficiencies. Thus, there is a critical need for automated methods that facilitate objective and rapid task planning, minimizing human error. Modeling the task planning for these missions poses significant challenges due to the vast search space and multiple resource constraints. As the complexity of tasks and their inter-dependencies increase, finding optimal solutions becomes more difficult. To address this, this paper introduces a dynamic resource intelligent scheduling model that incorporates executable task lists, resource constraints, and the progress of ongoing tasks. Utilizing advanced optimization techniques such as genetic algorithms, simulated annealing, and particle swarm optimization, our model effectively identifies solutions consistent with manual calculations. This innovative approach enhances task scheduling efficiency and ensures optimal outcomes, marking a significant advancement in space launch mission planning.
Authors
- Mingyang Geng (ORCID: https://orcid.org/0000-0002-7239-1819)
- Zhengqiang Pan (ORCID: https://orcid.org/0000-0002-8715-7830)
- Zhenshun Shi (ORCID: https://orcid.org/0000-0002-6749-870X)
Institutions
- National University of Defense Technology (CN)
- Xichang University (CN)
Publication Details
- Published
- 2024-10-25
- DOI
- https://doi.org/10.1145/3707292.3707346
- Citations
- 1
- Primary Topic
- Technology Assessment and Management
- Type
- article
- Field-Weighted Citation Impact
- 0.36