Yongxin Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yongxin Lu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Junyan Ma
School of Mechanical Engineering, Xinjiang University, Urumqi 830047, China
2 shared publications - Yiping Yuan
School of Mechanical Engineering, Xinjiang University, Urumqi 830017, China
2 shared publications - Adilanmu Sitahong
School of Mechanical Engineering, Xinjiang University, Urumqi 830047, China
1 shared publication - Adilanmu Sitahong
School of Mechanical Engineering, Xinjiang University, Urumqi 830047, China
1 shared publication - Ming Li
School of Mechanical Engineering, Xinjiang University, Urumqi 830047, China
1 shared publication - Peiyin Mo
School of Mechanical Engineering, Xinjiang University, Urumqi 830047, China
1 shared publication
Latest Publications
- Open Access
- 30 May 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (11) , 6631
Effective and Interpretable Rule Mining for Dynamic Job-Shop Scheduling via Improved Gene Expression Programming with Feature Selection
Gene expression programming (GEP) is frequently used to create intelligent dispatching rules for job-shop scheduling. The proper selection of the terminal set is a critical factor for the success of GEP. However, there are various job features and machine features that can be included in the terminal sets to capture the different characteristics of the job-shop state. Moreover, the importance of features in the terminal set varies greatly between scenarios. The irrelevant and redundant features may lead to high computational requirements and increased difficulty in interpreting generated rules. Consequently, a feature selection approach for evolving dispatching rules with improved GEP has been proposed, so as to select the proper terminal set for different dynamic job-shop scenarios. First, the adaptive variable neighborhood search algorithm was embedded into the GEP to obtain a diverse set of good rules for job-shop scenarios. Secondly, based on the fitness of the good rules and the contribution of features to the rules, a weighted voting ranking method was used to select features from the terminal set. The proposed approach was then compared with GEP-based algorithms and benchmark rules in the different job-shop conditions and scheduling objectives. The experimentally obtained results illustrated that the performance of the dispatching rules generated using the improved GEP algorithm after the feature selection process was better than that of both the baseline dispatching rules and the baseline GEP algorithm.
- 30 May 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (11) , 6631
Open AccessEffective and Interpretable Rule Mining for Dynamic Job-Shop Scheduling via Improved Gene Expression Programming with Feature Selection
Gene expression programming (GEP) is frequently used to create intelligent dispatching rules for job-shop scheduling. The proper selection of the terminal set is a critical factor for the success of GEP. However, there are various job features and machine features that can be included in the terminal sets to capture the different characteristics of the job-shop state. Moreover, the importance of features in the terminal set varies greatly between scenarios. The irrelevant and redundant features may lead to high computational requirements and increased difficulty in interpreting generated rules. Consequently, a feature selection approach for evolving dispatching rules with improved GEP has been proposed, so as to select the proper terminal set for different dynamic job-shop scenarios. First, the adaptive variable neighborhood search algorithm was embedded into the GEP to obtain a diverse set of good rules for job-shop scenarios. Secondly, based on the fitness of the good rules and the contribution of features to the rules, a weighted voting ranking method was used to select features from the terminal set. The proposed approach was then compared with GEP-based algorithms and benchmark rules in the different job-shop conditions and scheduling objectives. The experimentally obtained results illustrated that the performance of the dispatching rules generated using the improved GEP algorithm after the feature selection process was better than that of both the baseline dispatching rules and the baseline GEP algorithm.
- Open Access
Designing Dispatching Rules via Novel Genetic Programming with Feature Selection in Dynamic Job-Shop Scheduling
Genetic Programming (GP) has been widely employed to create dispatching rules intelligently for production scheduling. The success of GP depends on a suitable terminal set of selected features. Specifically, techniques that consider feature selection in GP to enhance rule understandability for dynamic job shop scheduling (DJSS) have been successful. However, existing feature selection algorithms in GP focus more emphasis on obtaining more compact rules with fewer features than on improving effectiveness. This paper is an attempt at combining a novel GP method, GP via dynamic diversity management, with feature selection to design effective and interpretable dispatching rules for DJSS. The idea of the novel GP method is to achieve a progressive transition from exploration to exploitation by relating the level of population diversity to the stopping criteria and elapsed duration. We hypothesize that diverse and promising individuals obtained from the novel GP method can guide the feature selection to design competitive rules. The proposed approach is compared with three GP-based algorithms and 20 benchmark rules in the different job shop conditions and scheduling objectives. Experiments show that the proposed approach greatly outperforms the compared methods in generating more interpretable and effective rules for the three objective functions. Overall, the average improvement over the best-evolved rules by the other three GP-based algorithms is 13.28%, 12.57%, and 15.62% in the mean tardiness (MT), mean flow time (MFT), and mean weighted tardiness (MWT) objective, respectively.
Open AccessDesigning Dispatching Rules via Novel Genetic Programming with Feature Selection in Dynamic Job-Shop Scheduling
Genetic Programming (GP) has been widely employed to create dispatching rules intelligently for production scheduling. The success of GP depends on a suitable terminal set of selected features. Specifically, techniques that consider feature selection in GP to enhance rule understandability for dynamic job shop scheduling (DJSS) have been successful. However, existing feature selection algorithms in GP focus more emphasis on obtaining more compact rules with fewer features than on improving effectiveness. This paper is an attempt at combining a novel GP method, GP via dynamic diversity management, with feature selection to design effective and interpretable dispatching rules for DJSS. The idea of the novel GP method is to achieve a progressive transition from exploration to exploitation by relating the level of population diversity to the stopping criteria and elapsed duration. We hypothesize that diverse and promising individuals obtained from the novel GP method can guide the feature selection to design competitive rules. The proposed approach is compared with three GP-based algorithms and 20 benchmark rules in the different job shop conditions and scheduling objectives. Experiments show that the proposed approach greatly outperforms the compared methods in generating more interpretable and effective rules for the three objective functions. Overall, the average improvement over the best-evolved rules by the other three GP-based algorithms is 13.28%, 12.57%, and 15.62% in the mean tardiness (MT), mean flow time (MFT), and mean weighted tardiness (MWT) objective, respectively.