{'fraction_non_alphanumeric': 0.023478260869565216, 'fraction_numerical': 0.0026086956521739132, 'mean_word_length': 5.933734939759036, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Self-Adaptive Multiobjective Differential Evolution Algorithm for the Unrelated Parallel Batch Processing Machine Scheduling Problem

In this paper, the unrelated parallel batch processing machine (UPBPM) scheduling problem is addressed to minimize the total energy consumption (TEC) and makespan. Firstly, a mixed-integer line programming model (MILP) of the UPBPM scheduling problem is presented. Secondly, a self-adaptive multiobjective differential evolution (AMODE) algorithm is put forward. Since the parameter value can affect the performance of the algorithm greatly, an adaptive parameter control method is proposed according to the convergence index of the individual and the evolution degree of the population to improve the exploitation and exploration ability of the algorithm. Meanwhile, an adaptive mutation strategy is proposed to improve the algorithm’s convergence and the solutions’ diversity. Finally, to verify the effectiveness of the algorithm, comparative experiments are carried out on 20 instances with 5 different scales. Numerical comparisons indicate that the proposed method can achieve high comprehensive performance.