Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations
Ports are striving to improve operational efficiency in the context of constantly growing volumes of trade. In this context, port terminal storage yard operation is key, since complexity and poor coordination lead to containers stacked without consideration of retrieval schedules, resulting in time-...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Open Journal of Intelligent Transportation Systems |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10555291/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832590330356039680 |
|---|---|
| author | Robert Klar Anders Andersson Anna Fredriksson Vangelis Angelakis |
| author_facet | Robert Klar Anders Andersson Anna Fredriksson Vangelis Angelakis |
| author_sort | Robert Klar |
| collection | DOAJ |
| description | Ports are striving to improve operational efficiency in the context of constantly growing volumes of trade. In this context, port terminal storage yard operation is key, since complexity and poor coordination lead to containers stacked without consideration of retrieval schedules, resulting in time- and energy-consuming reshuffling operations. This problem, known as the block relocation (and retrieval) problem (BRP), has recently gained considerable attention. Indeed, there are promising solutions to the BRP. However, the literature views the problem in isolation, optimizing one operational parameter for one of the many port stakeholders. This often leads to efficiency losses since port processes involve different stakeholders and port parts. In this work, we explicitly focus on scheduling trucks for pick-up for hinterland distribution. Appointments are often postponed in order to minimize reshuffling operations, leading to losses for the transport forwarders and decreasing the competitiveness of the port. We discuss the trade-off between minimizing container reshuffling operations while maintaining scheduled time windows for container retrieval. We describe the multi-objective optimization problem as a weighted sum of the two objectives. Given the complexity of the problem, we also present a greedy heuristic. Our results indicate that the number of schedule deviations can be reduced without significantly affecting the number of relocations compared to solutions that consider only the latter. Ideally, a weighting of 0.4 and 0.6 should be applied, reflecting schedule deviations and relocations, respectively, to achieve the highest joint optimization potential. This demonstrates that in complex environments, such as ports, with multiple interacting stakeholders and processes, coordination of solutions yields significant benefits. |
| format | Article |
| id | doaj-art-63e55fb9f352458eb2719717efa5f4a7 |
| institution | Kabale University |
| issn | 2687-7813 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of Intelligent Transportation Systems |
| spelling | doaj-art-63e55fb9f352458eb2719717efa5f4a72025-01-24T00:02:52ZengIEEEIEEE Open Journal of Intelligent Transportation Systems2687-78132024-01-01536037910.1109/OJITS.2024.341319710555291Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and RelocationsRobert Klar0https://orcid.org/0000-0001-6956-7695Anders Andersson1https://orcid.org/0000-0001-7994-7202Anna Fredriksson2https://orcid.org/0000-0001-7494-8134Vangelis Angelakis3https://orcid.org/0000-0003-0351-9134Department of Science and Technology, Linköping University, Campus Norrköping, Norrköping, SwedenDepartment of Vehicle Systems and Driving Simulation, Swedish National Road and Transport Research Institute (VTI), Linköping, SwedenDepartment of Science and Technology, Linköping University, Campus Norrköping, Norrköping, SwedenDepartment of Science and Technology, Linköping University, Campus Norrköping, Norrköping, SwedenPorts are striving to improve operational efficiency in the context of constantly growing volumes of trade. In this context, port terminal storage yard operation is key, since complexity and poor coordination lead to containers stacked without consideration of retrieval schedules, resulting in time- and energy-consuming reshuffling operations. This problem, known as the block relocation (and retrieval) problem (BRP), has recently gained considerable attention. Indeed, there are promising solutions to the BRP. However, the literature views the problem in isolation, optimizing one operational parameter for one of the many port stakeholders. This often leads to efficiency losses since port processes involve different stakeholders and port parts. In this work, we explicitly focus on scheduling trucks for pick-up for hinterland distribution. Appointments are often postponed in order to minimize reshuffling operations, leading to losses for the transport forwarders and decreasing the competitiveness of the port. We discuss the trade-off between minimizing container reshuffling operations while maintaining scheduled time windows for container retrieval. We describe the multi-objective optimization problem as a weighted sum of the two objectives. Given the complexity of the problem, we also present a greedy heuristic. Our results indicate that the number of schedule deviations can be reduced without significantly affecting the number of relocations compared to solutions that consider only the latter. Ideally, a weighting of 0.4 and 0.6 should be applied, reflecting schedule deviations and relocations, respectively, to achieve the highest joint optimization potential. This demonstrates that in complex environments, such as ports, with multiple interacting stakeholders and processes, coordination of solutions yields significant benefits.https://ieeexplore.ieee.org/document/10555291/Container relocation problemportsoptimizationdigital twinsschedule deviations |
| spellingShingle | Robert Klar Anders Andersson Anna Fredriksson Vangelis Angelakis Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations IEEE Open Journal of Intelligent Transportation Systems Container relocation problem ports optimization digital twins schedule deviations |
| title | Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations |
| title_full | Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations |
| title_fullStr | Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations |
| title_full_unstemmed | Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations |
| title_short | Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations |
| title_sort | container relocation and retrieval tradeoffs minimizing schedule deviations and relocations |
| topic | Container relocation problem ports optimization digital twins schedule deviations |
| url | https://ieeexplore.ieee.org/document/10555291/ |
| work_keys_str_mv | AT robertklar containerrelocationandretrievaltradeoffsminimizingscheduledeviationsandrelocations AT andersandersson containerrelocationandretrievaltradeoffsminimizingscheduledeviationsandrelocations AT annafredriksson containerrelocationandretrievaltradeoffsminimizingscheduledeviationsandrelocations AT vangelisangelakis containerrelocationandretrievaltradeoffsminimizingscheduledeviationsandrelocations |