Content area

Abstract

A mathematical programming model is constructed for the scheduling problem of large-scale power grid material quality inspection bases under complex and multi constraint conditions, with the completion time of material inspection, equipment utilization rate of the base, and total equipment load as multi-objective performance indicators. Based on the characteristics of the problem, a genetic algorithm is proposed as a tool for solving, and the encoding and decoding in the algorithm are specially designed for the detection base to ensure the generation of feasible solutions; Introducing roulette wheel to select populations, combining the characteristics of the problem to randomly mutate chromosomes, and using POX for chromosome crossover, in order to obtain the optimal solution to the problem. The proposed method effectively solves the scheduling problem of the testing base and greatly improves its operational efficiency by using the current quality testing example of dry-type transformers in the base for verification.

Details

1009240
Title
Genetic algorithm solving the scheduling problem of large-scale power grid material quality inspection bases under multiple constraints
Publication title
Volume
77
Source details
2025 International Conference on Education, Management and Information Technology (EMIT 2025)
Number of pages
11
Publication year
2025
Publication date
2025
Publisher
EDP Sciences
Place of publication
Les Ulis
Country of publication
France
ISSN
24317578
e-ISSN
22712097
Source type
Conference Paper
Language of publication
English
Document type
Conference Proceedings
Publication history
 
 
Online publication date
2025-07-02
Publication history
 
 
   First posting date
02 Jul 2025
ProQuest document ID
3232182677
Document URL
https://www.proquest.com/conference-papers-proceedings/genetic-algorithm-solving-scheduling-problem/docview/3232182677/se-2?accountid=208611
Copyright
© 2025. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-07-22
Database
ProQuest One Academic