•  
  •  
 

Journal of System Simulation

Abstract

Abstract: A hybrid algorithm based on a cutting and matching algorithm and an improved ant colony algorithm was proposed to solve the layout problem of rectangular parts in the process of wood and glass blanking. A layout optimization model was established to maximize the mean square utilization and the remaining processing time; the ant colony algorithm was used as the layout sequence algorithm to determine the layout sequence of some parts and meet the processing time constraint. In order to improve the search efficiency of the ant colony algorithm, an adaptive pheromone updating strategy was proposed, and a hybrid mutation strategy based on genetic mutation and 2-opt mutation was introduced to enhance the local search capability. For the arrangement of parts on the workblank, in order to improve the mean square utilization of the workblank and meet the guillotine constraint, a cutting and matching algorithm was proposed to optimize the layout of rectangular parts. Finally, the improved algorithm was compared with other optimization algorithms by international standard test cases and actual enterprise cases, and the effectiveness of the proposed hybrid algorithm was verified.

First Page

743

Last Page

755

CLC

TP391.9; TP931

Recommended Citation

Liu Ye, Ji Weixi, Su Xuan, et al. Research on Hybrid Solution Algorithm for Layout Problem of Rectangular Parts with Multiple Constraints[J]. Journal of System Simulation, 2024, 36(3): 743-755.

Corresponding Author

Ji Weixi

DOI

10.16182/j.issn1004731x.joss.22-1258

Share

COinS