An integrated scheduling genetic algorithm based on process constraint matrix and family definition coding
To address the complex product-integrated scheduling problem, an improved genetic algorithm based on process constraint matrix and family definition is proposed. The algorithm features a coding method that accurately represents the processing sequence constraints in the product process tree and intr...
Saved in:
| Published in: | Journal of physics. Conference series Vol. 3009; no. 1; pp. 12066 - 12072 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Bristol
IOP Publishing
01.05.2025
|
| Subjects: | |
| ISSN: | 1742-6588, 1742-6596 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To address the complex product-integrated scheduling problem, an improved genetic algorithm based on process constraint matrix and family definition is proposed. The algorithm features a coding method that accurately represents the processing sequence constraints in the product process tree and introduces a simplified method for defining families and sub-processes. On this basis, a hierarchical relationship matrix is derived from the constraint matrix. To resolve the issue of infeasible solutions arising from crossover and mutation operations, a family-based single-parent genetic improvement algorithm is designed. Experimental results validate the effectiveness of the proposed algorithm. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1742-6588 1742-6596 |
| DOI: | 10.1088/1742-6596/3009/1/012066 |