This paper focuses on the barges shipping problem, also known as the tugboats scheduling problem, within the context of a scenario where a single tugboat has the capacity to tow multiple barges and conduct multiple trips in a drop-and-pull mode during a daily work shift. The problem is mathematically formalized as mixed-integer programming models. To tackle real-world-sized problem instances, an adaptive large neighborhood search (ALNS) algorithm integrated with a decoding mathematical model is proposed. When applied to large-scale instances, the ALNS algorithm showcases performance superiority over the strengthened mathematical model.

翻译：本文研究驳船运输问题，亦称拖船调度问题，其场景设定为单艘拖船具备牵引多艘驳船的能力，并可在每日工作班次内以甩挂运输模式执行多个航次。该问题被形式化为混合整数规划模型。为处理实际规模的问题实例，本文提出一种融合解码数学模型的自适应大邻域搜索（ALNS）算法。在大规模实例应用中，ALNS算法展现出相较于强化数学模型的性能优势。