Journal of System Simulation ›› 2024, Vol. 36 ›› Issue (4): 941-956.doi: 10.16182/j.issn1004731x.joss.22-1541

• Papers • Previous Articles     Next Articles

Hyper-heuristic Approach with K-means Clustering for Inter-cell Scheduling

Zhao Yanlin(), Tian Yunna   

  1. School of Mathematics and Computer Science, Yan'an University, Yan'an 716000, China
  • Received:2022-12-23 Revised:2023-04-11 Online:2024-04-15 Published:2024-04-18

Abstract:

According to the actual production situation of China's manufacturing industry, a hyper-heuristic algorithm based on K-means clustering is proposed for inter-cell scheduling problem of flexible job-shop. K-means clustering is applied to group entities with similar attributes into the corresponding work cluster decision blocks, and the ant colony algorithm is used to select heuristic rules for each decision block. The optimal scheduling solutions are generated by using corresponding heuristic rules for scheduling of entities in each decision block. Computational results show that, the computational granularity is properly increased by the form of decision blocks, and the computational efficiency of the optimal algorithm is improved. The clustering algorithm could group the processed entities with similar attributes and the suitable rules for entities with different attributes are easy to be chosen. The proposed approach not only improves computational efficiency but also exhibits good optimization performance, and provides a scientific optimization solution for inter-cell scheduling problems.

Key words: inter-cell scheduling, hyper-heuristic algorithm, decision block, clustering, ant colony optimization

CLC Number: