Inland waterway transport is becoming attractive due to its minimum environmental impact in comparison with other transportation modes. Fixed timetables and routes are adopted by most barge operators, avoiding the full utilization of the available resources. Therefore a flexible model is adopted to reduce the transportation cost and environmental impacts. This paper regards the route optimization of barges as a pickup and delivery problem (PDP). A Mixed Integer Programming (MIP) model is proposed to formulate the PDP with transshipment of barges, and an Adaptive Large Neighborhood Search (ALNS) is developed to solve the problem efficiently. The approach is evaluated based on a case study in the Rhine Alpine corridor and it is shown that ALNS is able to find good solutions in reasonable computation times. The results show that the cost is lower when there is more flexibility. Moreover, the cost comparison shows that transshipment terminals can reduce the cost for barge companies.
|Title of host publication||Computational Logistics|
|Subtitle of host publication||Proceedings of the 11th International Conference, ICCL 2020|
|Editors||Eduardo Lalla-Ruiz, Martijn Mes, Stefan Voß|
|Place of Publication||Cham, Switzerland|
|Publication status||Published - 2020|
|Event||11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands|
Duration: 28 Sep 2020 → 30 Sep 2020
|Name||Lecture Notes in Computer Science|
|Conference||11th International Conference on Computational Logistics, ICCL 2020|
|Period||28/09/20 → 30/09/20|
Bibliographical noteGreen Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
- Adaptive large neighborhood search
- Inland waterway transport
- Pickup and delivery problem