FWFurong Wen

Furong Wen

*This is an algorithmically generated author record based on publicly available information.

Furong Wen has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Refined Collaborative Scheduling Method for Multi-Equipment at U-Shaped Automated Container Terminals Based on Rail Crane Process Optimization

    by Yongsheng Yang, Shu Sun, Meisu Zhong, Junkai Feng, Furong Wen, Haitao Song

    A U-shaped automated container terminal (ACT) has been proposed for the first time globally and has been adopted to construct the Beibu Gulf Port ACT. In this ACT layout, the double cantilevered rail crane (DCRC) simultaneously provides loading and unloading services for the external container trucks (ECTs) and the automatic guided vehicles (AGVs) entering the yard. The DCRC has a complex scheduling coupling relationship with the AGV and the ECT, and its mathematical model is extremely complex. There is an urgent need to study a practical collaborative scheduling optimization model and algorithm for the DCRC, the AGV, and the ECT. In this paper, we optimize the process flow of DCRCs to study the refined collaborative scheduling model of DCRCs, AGVs and ECTs in U-shaped ACTs. Firstly, we analyze the operation process of the DCRC and divide the 16 loading and unloading conditions of the DCRC into four operation modes for process optimization. Secondly, different variables and parameters are set for the DCRC’s four operating modes, and a refined collaborative dispatching model for the DCRCs with AGVs and ECTs is proposed. Finally, a practical adaptive co-evolutionary genetic algorithm solves the model. Meanwhile, arithmetic examples verify the correctness and practicality of the model and algorithm. The experimental results show that the total running time of the DCRCs is the shortest in the U-shaped ACT when the number of quay cranes (QC) to DCRC and AGV ratios are 1:2 and 1:10, respectively. At the same time, the number of QCs and DCRCs has a more significant impact on the efficiency of the ACT than that of AGVs, and priority should be given to the allocation of QCs and DCRCs. The research results have essential guidance value for U-shaped ACTs under construction and enrich the theory and method of collaborative scheduling of U-shaped ACT equipment.


  • Open Access

    Research on the Beibu Gulf Port Container Terminal Operation System Construction Performance Evaluation Based on the AISM-ANP

    by Guoxu Liu, Daofang Chang, Furong Wen

    With the continuous development of smart ports, the construction of port information systems has become the construction focus of the future development of such ports. However, the existing performance evaluation system for port information systems represents a research gap. It cannot effectively achieve specific improvement in the construction of information systems for port services and capabilities. In this paper, an evaluation index system was forged from the three perspectives of the operating level, management capability, and economic efficiency. As a first step, starting from the current situation of Beibu Gulf Port (Port B) construction, the three dimensions of the evaluation index system were determined using the scheme of literature review, questionnaire research, and fieldwork. Additionally, through adversarial interpretive structural modeling (AISM), it is concluded that the port loading and unloading operation capability and service level are the fundamental factors for measuring the construction performance of the container terminal operation system (CTOS). The results are used as input to construct an analytic network process (ANP) model to obtain the index weights. Finally, the gray clustering method (GCM) is introduced to construct a quantitative evaluation model to quantitatively evaluate the construction performance of the Port B CTOS. The quantitative benefits brought by the construction of the CTOS are finally verified. The scores of the corresponding dimensions of the port before and after the construction of the CTOS system in Beibu Gulf Port are obtained experimentally. The conclusion shows that the construction of CTOS makes the port operating level module improve the most, from 40.023 to 70.733 points; at the same time, it is found that two aspects, i.e., green security and economic benefits, in current construction are directions requiring further work in future port construction. Finally, a visualized quantitative analysis and evaluation method for the performance of smart port construction is proposed.


  • Open Access

    Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

    by Junjun Li, Jingyu Yang, Bowei Xu, Yongsheng Yang, Furong Wen, Haitao Song

    Aimed to improve the efficiency of port operations, Shanghai Zhenhua Heavy Industries Co., Ltd. (ZPMC) proposed a new U-shape trafficked automated terminal. The new U-shape trafficked automated terminal brings a new hybrid scheduling problem. A hybrid scheduling model for yard crane (YC), AGV and ET in the U-shape trafficked automated terminal yard is established to solve the problem. The AGV and ET yard lanes are assumed to be one-way lane. Take the YC, AGV and ET scheduling results (the container transportation sequences) as variables and the minimization of the maximum completion time as the objective function. A scheduling model architecture with hierarchical abstraction of scheduling objects is proposed to refine the problem. The total completion time is solved based on a static and dynamic mixed scheduling strategy. A chaotic particle swarm optimization algorithm with speed control (CCPSO) is proposed, which include a chaotic particle strategy, a particle iterative speed control strategy, and a particle mapping space for hybrid scheduling. The presented model and algorithm were applied to experiments with different numbers of containers and AGVs. The parameters of simulation part refer to Qinzhou Port. The simulation results show that CCPSO can obtain a near-optimal solution in a shorter time and find a better solution when the solution time is sufficient, comparing with the traditional particle swarm optimization algorithm, the adaptive particle swarm optimization algorithm and the random position particle swarm optimization algorithm.