Optimization of Software Engineering Supervision Network Based on Genetic Algorithm

This paper proposes an optimization method for the software engineering supervision network based on genetic algorithm. Aiming at the deficiencies of traditional supervision network optimization methods in dynamic adaptability, multi-objective optimization efficiency, and global optimality, a collaborative optimization model covering task scheduling, resource allocation, and risk control is constructed. By employing a double-layer chromosome encoding mechanism and a dynamic fitness function, the comprehensive utility of cost, time, and quality is quantified through the combination of the Pareto frontier theory and the entropy weight method. Additionally, a sliding window mechanism is introduced to update the environmental state in real-time, thereby enhancing the algorithm's adaptability to dynamic changes. Experimental results show that this method outperforms traditional methods in terms of reducing project completion time and improving resource utilization, and it exhibits higher stability in high-disturbance scenarios. It provides theoretical support and a practical paradigm for the intelligent upgrade of software engineering supervision networks.

Authors

Institutions

Publication Details

Published
2025-06-28
DOI
https://doi.org/10.1109/icipca65645.2025.11138474
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of Software Engineering Supervision Network Based on Genetic Algorithm

Dongyu Jiang, Xiaoting Yu
Distributed and Parallel Computing Systems
article

Optimization of Software Engineering Supervision Network Based on Genetic Algorithm

Dongyu Jiang, Xiaoting Yu
article en

Abstract

This paper proposes an optimization method for the software engineering supervision network based on genetic algorithm. Aiming at the deficiencies of traditional supervision network optimization methods in dynamic adaptability, multi-objective optimization efficiency, and global optimality, a collaborative optimization model covering task scheduling, resource allocation, and risk control is constructed. By employing a double-layer chromosome encoding mechanism and a dynamic fitness function, the comprehensive utility of cost, time, and quality is quantified through the combination of the Pareto frontier theory and the entropy weight method. Additionally, a sliding window mechanism is introduced to update the environmental state in real-time, thereby enhancing the algorithm's adaptability to dynamic changes. Experimental results show that this method outperforms traditional methods in terms of reducing project completion time and improving resource utilization, and it exhibits higher stability in high-disturbance scenarios. It provides theoretical support and a practical paradigm for the intelligent upgrade of software engineering supervision networks.

Harbin Huade University (CN)
Openalex Percentile: Top 73%
Distributed and Parallel Computing Systems
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.