No abstract

Considering the low flexibility and efficiency of the scheduling problem, an improved multi-objective immune algorithm with non-dominated neighbor-based selection and Tabu search (NNITSA) is proposed. A novel Tabu search algorithm (TSA)-based operator is introduced in both the local search and mutation stage, which improves the climbing performance of the NNTSA. Special local search strategies can prevent the algorithm from being caught in the optimal solution. In addition, considering the time costs of the TSA, an adapted mutation strategy is proposed to operate the TSA mutation according to the scale of Pareto solutions. Random mutations may be applied to other conditions. Then, a robust evaluation is adopted to choose an appropriate solution from the obtained Pareto solutions set. NNITSA is used to solve the problems of static partitioning optimization and dynamic cross-regional co-operative scheduling of agricultural machinery. The simulation results show that NNITSA outperforms the other two algorithms, NNIA and NSGA-II. The performance indicator C-metric also shows significant improvements in the efficiency of optimizing search.