Ship Selection and Inspection Scheduling in Inland Waterway Transport

Abstract

Inland waterway transport is considered a critical component of sustainable maritime transportation and is subject to strict legal regulations on fuel quality. However, crew members often prefer cheaper, inferior fuels for economic reasons, making government inspections crucial. To address this issue, we formulate the ship selection and inspection scheduling problem into an integer programming model under a multi-inspector and multi-location scenario, alongside a more compact symmetry-eliminated model. The two models are developed based on ship itinerary information and inspection resources, aiming to maximize the total weight of the inspected ships. Driven by the unique property of the problem, a customized heuristic algorithm is also designed to solve the problem. Numerical experiments are conducted using the ships sailing on the Yangtze River as a case study. The results show that, from the perspective of the computation time, the compact model is 102.07 times faster than the original model. Compared with the optimal objectives value, the gap of the solution provided by our heuristic algorithm is 0.37% on average. Meanwhile, our algorithm is 877.19 times faster than the original model, demonstrating the outstanding performance of the proposed algorithm in solving efficiency.