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...
Uloženo v:
| Vydáno v: | Journal of physics. Conference series Ročník 3009; číslo 1; s. 12066 - 12072 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Bristol
IOP Publishing
01.05.2025
|
| Témata: | |
| ISSN: | 1742-6588, 1742-6596 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 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 |