{"ID":2866334,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.19718","arxiv_id":"2509.19718","title":"ALNS for Tugboat Scheduling in Inland Waterway","abstract":"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.","short_abstract":"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 mixe...","url_abs":"https://arxiv.org/abs/2509.19718","url_pdf":"https://arxiv.org/pdf/2509.19718v2","authors":"[\"Zihang Ma\"]","published":"2025-09-24T03:00:27Z","proceeding":"math.OC","tasks":"[\"math.OC\",\"cs.DS\"]","methods":"[]","has_code":false}