A graph-based approach for integrating massive data in container terminals with application to scheduling problem.
Saved in:
| Title: | A graph-based approach for integrating massive data in container terminals with application to scheduling problem. |
|---|---|
| Authors: | Liu, Suri1 (AUTHOR), Wang, Wenyuan1 (AUTHOR) wangwenyuan@dlut.edu.cn, Zhong, Shaopeng2,3 (AUTHOR), Peng, Yun1 (AUTHOR), Tian, Qi1 (AUTHOR), Li, Ruoqi4 (AUTHOR), Sun, Xubo1 (AUTHOR), Yang, Yi5 (AUTHOR) |
| Source: | International Journal of Production Research. Aug2024, Vol. 62 Issue 16, p5945-5965. 21p. |
| Subjects: | Container terminals, Knowledge graphs, Reinforcement learning, Cranes (Machinery), Internet of things |
| Abstract: | The deployment of the Industrial Internet of Things (IIoT) in smart container terminals provides a foundation for sensing and recording all operational processes. However, little effort has been devoted to integrating the massive data regarding interoperability challenges, thus limiting the value of data in advancing the intelligent evolution of ports. In this research, we propose a graph-based approach to organise operational records semantically, thereby facilitating data-driven decision-making in container terminals. We first construct a knowledge graph for operational processes in container terminals, employing a tailored procedure for the automatic conversion of operational records into triples. By utilising the graph information, we propose a novel method that integrates reinforcement learning (RL) with a mathematical solver for optimising scheduling problems. The quay crane scheduling problem (QCSP) is illustrated as an example to elaborate on the technical details. Based on a dataset from a real-world container terminal, numerical studies demonstrate the superiority of the proposed framework in terms of information retrieval efficiency and solution quality compared with the traditional data organisation approach. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
