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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of Concurrent Testing Processes in Space Launches Based on Genetic Algorithms

Mingyang Geng, Zhengqiang Pan, Zhenshun Shi
1 citations
Technology Assessment and Management
0.36
article

Optimization of Concurrent Testing Processes in Space Launches Based on Genetic Algorithms

Mingyang Geng, Zhengqiang Pan, Zhenshun Shi
article en
1 citations

Abstract

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.

National University of Defense Technology (CN), Xichang University (CN)
Openalex Percentile: Top 35%
Technology Assessment and Management
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.