Using a decision tree algorithm to predict the robustness of a transshipment schedule

被引:7
|
作者
Maria Aguilar-Chinea, Rosa [1 ]
Castilla Rodriguez, Ivan [1 ]
Exposito, Christopher [1 ]
Melian-Batista, Belen [1 ]
Marcos Moreno-Vega, Jose [1 ]
机构
[1] Univ La Laguna, Dept Comp & Syst Engn, San Cristobal la Laguna 38200, Tenerife, Spain
关键词
Machine Learning; Decision Tree Regressor; Transshipment schedule;
D O I
10.1016/j.procs.2019.01.172
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Maritime ports are complex systems where any decision may affect the interests of many different stakeholders. New technologies are transforming the maritime transport sector, improving economic efficiency, optimizing the systems and operations of logistics management and enhancing connectivity. One of the problems that can benefit from the use of new technologies is finding the best transshipment schedule for incoming vessels. In this paper, we propose using automatic learning techniques to obtain a predictor of the robustness of transshipment schedules proposed by a scheduler. This measure of the goodness of the loading/unloading plan will consider the uncertainty to which processes in ports are subject, due to the weather, personnel skills, and the number of resources available, among other factors. Specifically, in this paper we propose using the so-called 'decision tree' algorithm to create a model for predicting the goodness of the proposed transshipment schedule. To obtain the historical data needed to train the machine-learning algorithm, we resorted to discrete event systems simulation, which can be used to test, for the same schedule, various scenarios with different disturbances. This yielded a model that predicts the behavior of the transshipment schedule based on the actual situation at the port. (C) 2019 The Authors. Published by Elsevier B.V.
引用
收藏
页码:529 / 536
页数:8
相关论文
共 50 条
  • [41] Financial Management and Decision Based on Decision Tree Algorithm
    Maozhu Jin
    Hua Wang
    Qian Zhang
    Cheng Luo
    Wireless Personal Communications, 2018, 102 : 2869 - 2884
  • [42] Evaluating skin condition using a new decision tree induction algorithm
    Dong, M
    Kothari, R
    Visscher, M
    Hoath, SB
    IJCNN'01: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2001, : 2456 - 2460
  • [43] THE PREDICTION OF OFFENDER IDENTITY USING DECISION-MAKING TREE ALGORITHM
    Shi, Shao-Chong
    Chen, Peng
    Yuan, Peng-Hui
    Hou, Chao
    Ming, Hong-Xia
    PROCEEDINGS OF 2018 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL 2, 2018, : 405 - 409
  • [44] Multiobjective Task Scheduling in Cloud Environment Using Decision Tree Algorithm
    Mahmoud, Hadeer
    Thabet, Mostafa
    Khafagy, Mohamed H.
    Omara, Fatma A.
    IEEE ACCESS, 2022, 10 : 36140 - 36151
  • [45] Using Quick Decision Tree Algorithm to Find Better RBF Networks
    Sug, Hyontai
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2011, PT I, 2011, 6591 : 207 - 217
  • [46] Financial Management and Decision Based on Decision Tree Algorithm
    Jin, Maozhu
    Wang, Hua
    Zhang, Qian
    Luo, Cheng
    WIRELESS PERSONAL COMMUNICATIONS, 2018, 102 (04) : 2869 - 2884
  • [47] Prediction of molecular bioactivity for drug design using a decision tree algorithm
    Lee, S
    Yang, J
    Oh, KW
    DISCOVERY SCIENCE, PROCEEDINGS, 2003, 2843 : 344 - 351
  • [48] Monitoring of Lupus disease using Decision Tree Induction classification algorithm
    Gomathi, S.
    Narayani, V.
    ICACCS 2015 PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING & COMMUNICATION SYSTEMS, 2015,
  • [49] Using decision tree algorithm to construct intelligent traffic management system
    Zhang, C. (zhangcaiqian2012@sina.com), 1600, Advanced Institute of Convergence Information Technology, Myoungbo Bldg 3F,, Bumin-dong 1-ga, Seo-gu, Busan, 602-816, Korea, Republic of (04):
  • [50] Analysis of robustness about decision tree induced by insensible attribute
    Wang, JF
    Gu, YS
    Wang, XZ
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1874 - 1877