Optimization of Reclaiming–Loading Scheduling in Dry Bulk Terminals Based on Knowledge-Driven Memetic Algorithm

Reclaiming–loading operations in dry bulk terminals often face conflicts and delays due to limitations in equipment processing capacity and operational line accessibility, which significantly compromise the safety and efficiency of these operations. This paper aims to optimize the reclaiming–loading schedule for each incoming vessel by considering parallel equipment operations and potential conflicts, with the goal of enhancing both the safety and efficiency of the loading processes. Through a detailed analysis of bulk reclaiming and reclaiming–loading mechanisms, we formulate the dry bulk terminal loading scheduling problem to minimize the total operational time for all loading tasks, taking into account constraints such as parallel reclaiming, collaborative loading, operational conflicts, and line accessibility. In order to obtain a good solution, including task execution sequences and allocation of reclaimers and shiploaders, a knowledge-driven memetic algorithm is developed by integrating knowledge-driven mechanisms with problem-specific operators within a memetic computing framework. Finally, numerical experiments for various scales are conducted using the layout and operational data from the Huanghua Port’s coal port area. The experimental results demonstrate the effectiveness of the proposed optimization algorithm.