Modified Whale Optimization Algorithm for Multi-Type Combine Harvesters Scheduling

Abstract

The optimal scheduling of multi-type combine harvesters is a crucial topic in improving the operating efficiency of combine harvesters. Due to the NP-hard property of this problem, developing appropriate optimization approaches is an intractable task. The multi-type combine harvesters scheduling problem considered in this paper deals with the question of how a given set of harvesting tasks should be assigned to each combine harvester, such that the total cost is comprehensively minimized. In this paper, a novel multi-type combine harvesters scheduling problem is first formulated as a constrained optimization problem. Then, a whale optimization algorithm (WOA) including an opposition-based learning search operator, adaptive convergence factor and heuristic mutation, namely, MWOA, is proposed and evaluated based on benchmark functions and comprehensive computational studies. Finally, the proposed intelligent approach is used to solve the multi-type combine harvesters scheduling problem. The experimental results prove the superiority of the MWOA in terms of solution quality and convergence speed both in the benchmark test and for solving the complex multi-type combine harvester scheduling problem.

Keywords

• multi-type combine harvesters scheduling
• whale optimization algorithm
• opposition-based learning
• adaptive convergence factor
• heuristic mutation