Structure-optimized deep forest model for railway port container reloading time prediction: A hybrid integer programming and Bayesian optimization approach

Container reloading in international railway transport involves transferring containers to trains compatible with the destination’s railway gauge. The duration depends on factors like port facilities, staff proficiency, and customs clearance. Accurate forecasting is crucial for efficient planning and railway efficiency, including predicting train travel times and informing consignment customers about arrivals. However, current prediction methods cannot handle fluctuating nonlinear container reloading times and are too subjective in forest learner selection. Therefore, this paper proposes a novel structure-optimized deep learning model named the intelligent Bayesian deep forest (IBDF) model, which combines the deep forest and Bayesian optimization methods to handle complex datasets in predicting the railway port container reloading times. In this model, a combinatorial optimization algorithm incorporating an integer programming model and the Hungarian algorithm is first proposed to identify the optimal types of forest learners. Then, hyperparameter optimization technique is designed to obtain the optimal number of forest learners per type selected. Based on the container reloading time data from the Alataw Pass border station of China Railway Express (Chengdu-Europe) from 2017 to 2020, the performance of the IBDF model is systematically compared with ten benchmark models. This model averagely reduces the values of MSE, RMSE, MAE, and MAPE by 68.62%, 51.90%, 67.41%, and 59.52%, respectively. The prediction results show that the IBDF model provides high quality predictions, which can support the container reloading operations at the Alataw Pass border station, compressing the customs clearance time, and boosting the quality and speed of China Railway Express trains. • Design an IBDF model for complex datasets in container reloading time prediction • Develop a combinatorial optimization algorithm to find optimal forest learner types. • Propose a BO method to obtain the optimal number of forest learners per type selected. • Validate the IBDF model with actual data from the China Railway Express trains. • Establish an AI-powered analytics tool for improving data-driven decision-making

Authors

Institutions

Publication Details

Journal
Advanced Engineering Informatics
Published
2026-01-06
DOI
https://doi.org/10.1016/j.aei.2026.104309
Citations
1
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
35.67
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Structure-optimized deep forest model for railway port container reloading time prediction: A hybrid integer programming and Bayesian optimization approach

Xiang Guo, Tommaso Bosi, Yimin Wang, Jingwei Guo et al.
1 citations
Advanced Engineering Informatics
Railway Systems and Energy Efficiency
35.67
article

Structure-optimized deep forest model for railway port container reloading time prediction: A hybrid integer programming and Bayesian optimization approach

Xiang Guo, Tommaso Bosi, Yimin Wang, Jingwei Guo, Andrea D’Ariano, Yongxiang Zhang, Jiayi Guo
article en
1 citations

Abstract

Container reloading in international railway transport involves transferring containers to trains compatible with the destination’s railway gauge. The duration depends on factors like port facilities, staff proficiency, and customs clearance. Accurate forecasting is crucial for efficient planning and railway efficiency, including predicting train travel times and informing consignment customers about arrivals. However, current prediction methods cannot handle fluctuating nonlinear container reloading times and are too subjective in forest learner selection. Therefore, this paper proposes a novel structure-optimized deep learning model named the intelligent Bayesian deep forest (IBDF) model, which combines the deep forest and Bayesian optimization methods to handle complex datasets in predicting the railway port container reloading times. In this model, a combinatorial optimization algorithm incorporating an integer programming model and the Hungarian algorithm is first proposed to identify the optimal types of forest learners. Then, hyperparameter optimization technique is designed to obtain the optimal number of forest learners per type selected. Based on the container reloading time data from the Alataw Pass border station of China Railway Express (Chengdu-Europe) from 2017 to 2020, the performance of the IBDF model is systematically compared with ten benchmark models. This model averagely reduces the values of MSE, RMSE, MAE, and MAPE by 68.62%, 51.90%, 67.41%, and 59.52%, respectively. The prediction results show that the IBDF model provides high quality predictions, which can support the container reloading operations at the Alataw Pass border station, compressing the customs clearance time, and boosting the quality and speed of China Railway Express trains. • Design an IBDF model for complex datasets in container reloading time prediction • Develop a combinatorial optimization algorithm to find optimal forest learner types. • Propose a BO method to obtain the optimal number of forest learners per type selected. • Validate the IBDF model with actual data from the China Railway Express trains. • Establish an AI-powered analytics tool for improving data-driven decision-making

Advanced Engineering InformaticsVol. 71
Roma Tre University (IT), University of Shanghai for Science and Technology (CN), Zhengzhou Railway Vocational & Technical College (CN), Southwest Jiaotong University (CN), City University of Macau (MO)
Openalex Percentile: Top 2%
Railway Systems and Energy Efficiency
35.67
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.