Bin Li

Prof. Bin Li

Fujian University of Technology, Fuzhou, Fujian, China
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
BLBin Li
Bin Li
CYCaijie Yang
Caijie Yang
ZYZhongzhen Yang
Zhongzhen Yang
In response to the evolving challenges of the integration and combination of multiple container terminal operations under berth water depth constraints, the multi-terminal dynamic and continuous berth allocation problem emerges as a critical issue. Based on computational logistics, the MDC-BAP is formulated to be a unique variant of the classical resource-constrained project scheduling problem, and modeled as a mixed-integer programming model. The modeling objective is to minimize the total dwelling time of linerships in ports. To address this, a Dueling Double DQN-based reinforcement learning algorithm is designed for the multi-terminal dynamic and continuous berth allocation problem A series of computational experiments are executed to validate the algorithm’s effectiveness and its aptitude for multiple terminal joint operation. Specifically, the Dueling Double DQN algorithm boosts the average solution quality by nearly 3.7%, compared to the classical algorithm such as Proximal Policy Optimization, Deep Q Net and Dueling Deep Q Net also have better results in terms of solution quality when benchmarked against the commercial solver CPLEX. Moreover, the performance advantage escalates as the number of ships increases. In addition, the approach enhances the service level at the terminals and slashes operation costs. On the whole, the Dueling Double DQN algorithm shows marked superiority in tackling complicated and large-scale scheduling problems, and provides an efficient, practical solution to MDC-BAP for port operators.

26 October 2020 in IEEE Access
Verified
Journal Article
Open access
BLBin Li
Bin Li
GSGuanggang Song
Guanggang Song
The volatile global shipping market puts forward the higher requirements to the container terminal logistics systems (CTLS) than ever, especially in terms of programming, planning, scheduling and decision. The computational logistics provide a systematic methodology to overcome the issues that differs from traditional approaches distinctly. This paper discusses the theoretical framework, important components and core concept of computational logistics, and then presents the container terminal logistics generalized computation design, implement, execution, analysis and evaluation hierarchy (LGC-DIE-AEH) by the integration of the computational lens and computing principles to explore the computational logistics in the field of CTLS. Subsequently, the execution performance of a quay crane farm at a regional container hub terminal in China is analyzed and evaluated by LGC-DIE-AEH. The crane performance evaluation core indicator framework (CPE-CIF) is proposed by the fusion of the design philosophy and underlying principles of computing architecture, operating system, and virtual machine by computational lens. The CPE-CIF help us to find out the advantages, disadvantages and improvement directions of quay crane farm operation. That illustrates and verifies the feasibility and credibility of LGC-DIE-AEH from the perspective of the practice of container terminal decision-making support at the tactical level.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
BLBin Li
Bin Li
YHYuqing He
Yuqing He
Container terminals are playing an increasingly important role in the global logistics network; however, the programming, planning, scheduling, and decision of the container terminal handling system (CTHS) all are provided with a high degree of nonlinearity, coupling, and complexity. Given that, a combination of computational logistics and deep learning, which is just about container terminal‐oriented neural‐physical fusion computation (CTO‐NPFC), is proposed to discuss and explore the pattern recognition and regression analysis of CTHS. Because the liner berthing time (LBT) is the central index of terminal logistics service and carbon efficiency conditions and it is also the important foundation and guidance to task scheduling and resource allocation in CTHS, a deep learning model core computing architecture (DLM‐CCA) for LBT prediction is presented to practice CTO‐NPFC. Based on the quayside running data for the past five years at a typical container terminal in China, the deep neural networks model of the DLM‐CCA is designed, implemented, executed, and evaluated with TensorFlow 2.3 and the specific feature extraction package of tsfresh. The DLM‐CCA shows agile, efficient, flexible, and excellent forecasting performances for LBT with the low consuming costs on a common hardware platform. It interprets and demonstrates the feasibility and credibility of the philosophy, paradigm, architecture, and algorithm of CTO‐NPFC preliminarily.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
BLBin Li
Bin Li
YHYuqing He
Yuqing He
The booming computational thinking and deep learning make it possible to construct agile, efficient, and robust deep learning‐driven decision‐making support engine for the operation of container terminal handling systems (CTHSs). Within the conceptual framework of computational logistics, an attention mechanism oriented hybrid convolutional neural network and recurrent neural network deep learning architecture (AMO‐HCR‐DLA) is proposed technically to predict the container terminal liner handling conditions that mainly include liner handling time (LHT) and total working time of quay crane farm (TWT‐QCF) for a calling liner. Consequently, the container terminal oriented logistics generalized computation (CTO‐LGC) automation and intelligence are established tentatively by AMO‐HCR‐DLA. A typical regional container terminal hub of China is selected to design, implement, execute, and evaluate the AMO‐HCR‐DLA with the actual production data. In the case of severe vibration of LHT and TWT‐QCF, while forecasting the handling conditions of 210 ships based on the CTO‐LGC running log of four years, the forecasting error of LHT within one hour is more than 97% and that of TWT‐QCF within six hours accounts for 89.405%. When predicting the operating conditions of 300 liners by the log of five years, the forecasting deviation of LHT within one hour is more than striking 99% and that of TWT‐QCF within six hours reaches up to 94.010% as well. All are far superior to the predicting outcomes by the classical algorithms of machine learning and deep learning. Hence, the AMO‐HCR‐DLA shows excellent performance for the prediction of CTHS with the low and stable computational consuming. It also demonstrates the feasibility, credibility, and realizability of the computing architecture and design paradigm of AMO‐HCR‐DLA preliminarily.

15 July 2019 in IEEE Access
Verified
Journal Article
Open access
BLBin Li
Bin Li
BSBing Sun
Bing Sun
WYWei Yao
Wei Yao
YHYuqing He
Yuqing He
GSGuanggang Song
Guanggang Song
The planning and scheduling of container terminal logistics systems (CTLS) are the multi-objective and multiple strong constraints combinatorial optimization challenges under the uncertain environments, and those are provided with high goal orientation, dynamics, context-sensitivity, coupling, timeliness, and complexity. The increasingly sophisticated decision-making for CTLS is one of the most pressing problems for the programming and optimization method available. This paper discusses CTLS in terms of logistics generalized computation complexity based on computational thinking, great principles of computing, and computational lens, which three are abbreviated with 3CTGPL, and makes a definition of container terminal oriented logistics generalized computational complexity (CTO-LGCC) and container terminal logistics generalized computation comprehensive performance perspective (CTL-GCCPP) from the dimensions of time, space, communication, processor, and memory access. Both can analyze, generalize, migrate, translate, localize, modificate, and evaluate the above-complicated problems and lay solid foundations and establish a feedback improvement framework for the computational model and scheduling algorithms of the CTLS, which is an essential complement to the modeling and optimization methodology and solutions to CTLS with computational logistics. Finally, aimed at the logistics service cases for a large-scale container terminal, the simulation is designed and implemented for different scheduling algorithms, and the qualitative and quantitative comprehensive analysis is executed for the concomitant CTO-LGCC that demonstrates and verifies the feasibility and credibility of the CTO-LGCC and CTL-GCCPP from the viewpoint of the practice of container terminal decision-making support on the tactical level.

1 January 2022 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
BLBin Li
Bin Li
XJXiong Jiang
Xiong Jiang
JLJunhan Lei
Junhan Lei
Container terminal operators have practical and clear requirements on improving operational efficiency and service level to address running challenges. The resource allocation and collaborative scheduling of quayside berth and storage yard are vital issues in the optimization of container terminal handling systems (CTHSs). The allocation of berth in quayside and blocks on storage yard directly affects the running efficiency of CTHS. Consequently, we focus on the berth and yard collaborative allocation for import and export synchronous operations (BYCA‐IESOs) and propose the BYCA‐IESO research model based on synchronous or asynchronous integrated scheduling strategy by computational logistics. The BYCA‐IESO model is a mixed integer quadratic programming model to minimize multiple time consumption of calling liners and the total horizontal transferring distances of yard trailers at container terminals. Furthermore, we design other two allocation policies for comparison on the BYCA‐IESO, which are both multistage scheduling strategy profiles. CPLEX 20.1.0 is applied to implement and solve the model and tactics of BYCA‐IESO. Accordingly, the feasibility, validity, and relative merits of the models and strategies are obtained and verified by analyzing and comparing multiple numerical experimental results.