Professional Documents
Culture Documents
1 s2.0 S0959652622053562 Main
1 s2.0 S0959652622053562 Main
A R T I C L E I N F O A B S T R A C T
Handling Editor: Cecilia Maria Villas Bôas de The sustainable development of port operation management is strongly related to the energy consumption of
Almeida production at automated container terminals (ACTs). This paper focuses on the production activities at a
container yard, which is the primary facility of ACTs. A digital twin-based approach is proposed to optimize the
Keywords: operation of an automatic stacking crane (ASC) handling containers in terms of energy consumption. A virtual
Sustainable development
container yard that syncs with a physical container yard in the ACT digital twin system for observation and
Energy consumption
validation is developed. A mathematical model is established to minimize the total energy consumption of
Digital twin
Automatic stacking crane scheduling completing all tasks. Then, the Q-learning algorithm is adapted to optimize a solution based on the operating
Container yard data from the ACT digital twin system. Numerical experiments are conducted to demonstrate the effectiveness of
the proposed approach by comparing it with two other solution algorithms, viz., genetic algorithm (GA) and
particle swarm optimization (PSO). The total energy consumption of two operation strategies (i.e., centralized
and decentralized) are also compared using the proposed digital twin-based approach. With digital twin, the
operational environment and energy consumption are visualized to support optimization and management of
ASCs. Managers and operators can choose an appropriate strategy according to the designated sustainable goal.
* Corresponding author.
E-mail address: mchchen@ntu.edu.sg (C.-H. Chen).
https://doi.org/10.1016/j.jclepro.2022.135782
Received 31 August 2022; Received in revised form 17 December 2022; Accepted 27 December 2022
Available online 28 December 2022
0959-6526/© 2022 Elsevier Ltd. All rights reserved.
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
indispensable presence, is typically used to load, unload and stack research are summarized in Section 6.
containers at a container yard, undertaking the primary activities of
terminal production. The randomness of the arrival of container ships 2. Literature review
and container trucks (CTs), as well as the uncertainty of severe weather
and equipment failures, affect the operations of container yards. Addi 2.1. Scheduling research at container terminals
tionally, an unbalanced load caused by an uneven distribution of all ASC
tasks makes the capacity of some ASCs unable to be effectively utilized. During vessel unloading, Hu et al. (2019) focused on QC and yard
Thus, to further promote sustainable development, it is necessary to truck (YT) scheduling, and containers were allocated to YTs as groups of
optimize container yard operations and improve equipment utilization. clusters. They combined the heuristic algorithm and adaptive genetic
Therefore, this paper proposes to improve the energy consumption of algorithm (GA) to minimize the total travel distances and the makespan,
ASCs that are used to handle containers at the container yard with re in which the experimental results demonstrated the effectiveness of the
gard to sustainable operations. method. Niu et al. (2021) studied the integrated scheduling of QCs and
ASC scheduling was considered as a resource optimization problem. yard trucks (YTs) with the goal of minimizing the service time of vessels
Shu et al. (2015) solved a multi-objective problem that focused on the and the operating costs, respectively. Thus, the bacterial colony opti
ASC loading sequence using an improved genetic algorithm. Lu and mization algorithm was improved for a robust and competitive perfor
Wang (2019) used graph theory to state the ASC scheduling problem, mance. Multi-group comparison experiments were conducted to show
and obtained the minimum operating time with a particle swarm opti the efficiency of the multi-objective algorithm.
mization (PSO) algorithm. In contrast from heuristics algorithms, Regarding vehicle resource allocation, Luo and Wu (2015) integrated
Gharehgozli et al. (2017) developed a simulation model for twin ASC AGV scheduling with QC and yard crane (YC) in a simultaneous loading
operations and discussed a yard design to improve the working effi and unloading scenario. To minimize the berth time of a vessel, a genetic
ciency of ASCs. Various approaches have been used to solve ASC algorithm was adapted to tackle large-size cases. Yue et al. (2021)
scheduling problems in previous studies (Gharehgozli et al., 2015; Hu investigated the QC scheduling problem with AGV scheduling to mini
et al., 2016). A sustainable digitalization measure was taken to monitor mize the ineffective time and delay time by combining the GUROBI
the production process and energy consumption (Ozturk et al., 2018). solver and NSGA III algorithm to obtain QC and AGV scheduling
The proposal and development of Industry 4.0 have been derived from schemes. Chen et al. (2020b) studied AGV and YC scheduling using a
many emerging technologies and concepts, such as digital twin, Internet systematic approach, with which a time-discretized space-time network
of Things, augmented reality, and cloud computing, where the digital was established to observe the impacts caused by traffic congestion and
twin functions were integrated to promote industry transformation probabilistic actions, and decomposed the integer linear programming
(Aheleroff et al., 2021). Digital twin has also been applied to resource model with the alternating direction method of multipliers (ADMM).
optimization in multiple areas, including medicine quality management The optimal space-time scheduling solutions were accordingly obtained
(Lopes et al., 2020), shop-floor smart production(Zhuang et al., 2021) for AGV and YC.
and intelligent maintenance of machines(Xiong et al., 2021). With the YC is an essential crane that is used in the storage yard to stack and
help of digital twin, the practical production or operational conditions retrieve containers. Wang et al. (2020b) used a branch and price algo
could be monitored in real time and be mapped in the virtual models. rithm to address the assignment and scheduling of cranes in a steel en
Based on the synchronization and interaction of physical and virtual terprise, which minimized the total traveling distances and balanced the
objects in the digital twin, reliable decision and optimization solutions workload of cranes. Liu et al. (2022) studied the block relocation
could be obtained. Hence, this paper proposes a digital twin-based problem in the warehouse by improving the mixed integer programming
approach to study the ASC operation problem considering energy model, which could obtain the solutions in a faster and easier way. Guo
consumption. et al. (2021) studied the gantry crane scheduling problem and solved it
The contributions of this paper are summarized as follows: (1) This with a logic-based Benders decomposition (LBBD) methodology. The
paper attempts to apply the digital twin for resource optimization with a starting and ending positions of moving containers were considered to
focus on sustainability at ACT. No research has yet proposed using schedule gantry cranes, and computational results show the competitive
digital twin to address the energy consumption management of re performance of the GUROBI solver. Kim et al. (2021) focused on ASC
sources in ACT production. (2) To promote sustainable development, scheduling strategies and found an optimal solution using a search al
this paper proposes to improve the total energy consumption of ASCs gorithm and simulation.
from the perspective of workload balance rather than traditionally
considering the carbon emissions of equipment. The goal is to minimize 2.2. Optimization considering sustainability at container terminals
the gap in energy consumption across all ASCs used during scheduling.
Although the total energy consumption of ASCs is not decreased, the Although the abovementioned research focused more on high effi
ratio of working and non-working energy consumption of each ASC is ciency, low energy has not been ignored. He et al. (2015) compared two
balanced to improve equipment sustainability. (3) Numerical experi strategies in the scheduling of inter truck (IT), YC and QC, in terms of
ments of different methods are conducted to verify the effectiveness of time savings and energy savings. Experiments with GA-PSO indicated
the proposed digital twin-based approach. The total energy consump that the container terminal operators could choose any one scheduling
tion of the operating plan solved by the proposed approach is also strategy based on the real operating goal because no strategy performed
compared to analyze the performance of the centralized and decen better in all cases. Karakas et al. (2021) introduced the carbon footprint
tralized operational strategies. (4) With the support of digital twin, a into berth allocation, to minimize operation time and carbon emissions
validation of solutions is performed in the virtual container yard to when trucks travel from berths to container blocks. Monte Carlo simu
compare the working and non-working energy consumption of ASCs. lation was used to calculate the truck idling time, and then, a linear
The visualization of operating plan helps achieve its appropriateness for integer programming model was established to select the optimal berth
the practical environment. and container block. Sim (2018) considered the carbon production of a
The remainder of this paper is organized as follows. Relevant liter container terminal sourced from ships, cranes, trucks, and other
ature involving sustainable research and digital twin is reviewed in equipment, and proposed a system dynamics model to calculate the
Section 2. The problem of optimizing the energy consumption of ASCs is emissions during container operation. Chen et al. (2013) discussed the
stated in Section 3, and the digital twin-based approach for operating relationship between truck arrival and emission reduction using
optimization is provided in Section 4. The next section, Section 5, pre queueing theory to simulate the operating process of trucks and estimate
sents the case experiments and results analysis. Conclusions and future emissions. Then, an improved GA-based heuristic was proposed to
2
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
optimize the queueing time and idling emission of trucks. Jiang et al. and a discrete simulation was conducted to evaluate the maintenance
(2019) combined heuristic knowledge and deep Q-learning to help effects. Zhang et al. (2022) proposed an improved multi-fidelity simu
smart robots plan paths and avoid obstacles. The experience data of lation-based optimization (IMFSO) method combined with discrete
robot movements were collected to train the neural network, which was simulation, which was applied in the digital twin floor for aircraft parts
used to explore an optimal path. production.
Wan et al. (2021) focused on the energy consumption of container Granacher et al. (2022) proposed a digital twin supported
ships and analyzed three different emission reduction strategies by decision-making method to design energy systems that considered
simulating ship movements. They concluded that using a shore power complex requirements and subsequent evaluations. The decision-maker
system and increasing QC efficiency was a desirable way to be envi using the digital twin helped in finding more meaningful solutions, as
ronmentally friendly. Facchini et al. (2020) demonstrated the economic discussed in the designed case. Park et al. (2020) combined digital twin
and environmental feasibility of dry ports, which were proposed to and machine learning to optimize the scheduling of an energy storage
reduce the container terminal congestion. Both the operation cost and system, where the charging and discharging operations were well
carbon footprint estimation were used to evaluate the container controlled to minimize the energy cost. Using a digital twin, a practical
handling strategies between the port and the dry port. A simulation was microgrid was implemented in a virtual space to obtain the complexity
performed based on a non-linear programming model and a computa and uncertain data for further effective optimization. You et al. (2022)
tional algorithm. Li et al. (2021) simulated the primary container ac proposed a deep learning and digital twin-based scheduling method in
tivities at the U-type layout container terminal and then analyzed the an integrated energy system (IES) to address uncertainties. Real-time
performance, energy consumption, and operational costs. The case data from the digital twin IES were input to predict the day-ahead
analysis demonstrated the superiority of the new design of automated scheduling using a deep neural network.
container terminals regardless of efficiency, environmental and eco
nomic levels. Chen and Zeng (2021) optimized the scheduling of electric
2.4. Literature summary
rubber-tyred gantry cranes (ERTGs) from a carbon efficiency perspec
tive. In the ERTG scheduling problem, both carbon emissions and task
To summarize, the most related studies of scheduling and digital
delay were considered to minimize the total cost of task groups. Two
twin applications can be classified as shown in Table 1. Sustainability
scheduling strategies were compared to obtain the results that adjusting
research of container terminals has been studied from various types of
the schedule of ERTGs based on real-time changes was better than
energy-saving actions. On the one hand, the transformation of terminal
keeping a carbon-oriented strategy.
operations was accomplished by improving the energy system and the
operating mode to reduce carbon emissions. On the other hand, some
2.3. Digital twin research
emerging designs appeared as a reform of container terminals, such as
the use of new energy equipment and the design of new layouts. These
Digital twin has been widely used in production scheduling, main
ideas were proposed and demonstrated to save energy and reduce
tenance strategies and decision-making support in various industries.
emissions, in which the handling equipment undertook the greater part
Wang et al. (2020a) introduced digital twin into the human-robot
of production and operations. Thus, the scheduling of the handling
interactive welding, where virtual reality was used to develop the dig
equipment should be well optimized for energy saving.
ital twin system and a data-driven method was designed to analyze the
Studies of scheduling at container terminals typically attempted to
welder behaviors generated from trained welders and unskilled welders
achieve the least time and cost required to complete all tasks and the
without any training. Fang et al. (2019) proposed a scheduling method
heuristic algorithms, such as GA and PSO, were used to obtain the so
based on digital twin and used it in job shop production, which reduced
lutions. The digital twin-based approach was proposed in workshop
the deviation caused by some uncertainties and disturbances. Zhang
scheduling to address the uncertainties that occur in the real
et al. (2021) also developed a digital twin-enhanced scheduling method
in a job shop, which involved the prediction of machine availability,
Table 1
detection of uncertain disturbances, and evaluation of scheduling per
Classification of related research issues in the literature.
formances. Wang et al. (2021) used the digital twin framework to
monitor machine conditions. Then, the order scheduling with these Authors Problems Approach
machines was also displayed in a dashboard to provide decision-making Guo et al. (2021) Gantry crane scheduling GUROBI Solver
support for operators and managers. considered moving positions
Negri et al. (2021) proposed a digital twin-based simheuristics Kim et al. (2021) Comparison of ASC scheduling Simulation
strategies
framework for robust scheduling that included an input data module, He et al. (2015) Scheduling of IT, YC and QC to Heuristic algorithm
digital twin module and optimization module. The real-time data of save time or energy
industrial equipment were used to synchronize and simulate the pro Karakas et al. (2021) Berth allocation considered Linear programming
duction in the flowshop, and then GA was used to optimize the job carbon footprint and simulation
Chen et al. (2013) Truck operating considered Heuristic algorithm
scheduling with uncertainty to obtain the minimum makespan. Zhao
emission reduction
et al. (2022) discussed the optimization of cranes in the workshop, Chen and Zeng ERTG scheduling to minimize Branch-and-bound
including how to schedule multiple cranes, and how to determine the (2021) the total cost algorithm
number of cranes with the lowest energy consumption. A digital Fang et al. (2019), Job shop scheduling Digital twin-based
twin-driven scheduling approach was developed, in which GA and the Zhang et al. framework
(2021)
simulation in the virtual crane system were used to evaluate the energy Negri et al. (2021) Uncertain scheduling in Digital twin-based GA
consumption of multi-crane operation. flowshop to minimize the
Yan et al. (2022) integrated a digital twin and a Q-learning algorithm makespan
to achieve dynamic scheduling and preventive maintenance in a job Zhao et al. (2022) Crane scheduling considering Digital twin-based GA
the lowest energy consumption
shop. In the virtual job shop, Q-learning was used to respond to the
Yan et al. (2022) Dynamic scheduling and Digital twin and Q-
operation environment and evaluate the action selections, which pro preventive maintenance learning algorithm
vided the best solution for decision-makers. To optimize maintenance Park et al. (2020), Uncertain scheduling of the Digital twin and
strategies in the mining industry, Savolainen and Urbani (2021) You et al. (2022) energy system machine learning
designed a modeling approach based on digital twin, including two This paper ASC scheduling to minimize the Digital twin and Q-
energy consumption learning
stages. A virtual model was developed to reflect the mine environment,
3
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
3. Problem statement
Notations Implications
Containers, including imported or exported containers, are typically ECm Total energy consumption when ASC m handles container task i.
i
stacked in a container yard before being transported to trucks or vessels. ECmw
i Working energy consumption when ASC m handles container task i.
ASCs are the main handling equipment at the container yard of an ECmnw
i Non-working consumption when ASC m handles container task i.
automated container terminal. CTs transport exported containers to the Dm
i Moving distances of the crane.
m
Hi Lifting height of the crane trolley.
terminal, and then, containers are unloaded by ASCs to be stacked in the
μm Unit energy consumption of the crane required to work.
container yard. Imported containers being unloaded from vessels are ρm Unit energy consumption of the crane trolley required to work.
first stored in the yard and wait for ASCs to handle and load on the CTs. Tiim′ Non-working time of ASC waiting for the next task i .
′
The ASCs, which handle two types of containers, operate independently γm Unit energy consumption of the ASC required for non-working time.
in the container yard, as shown in Fig. 1. However, the arrival time of
CTs is not fixed and may change randomly due to unexpected condi
tions. For example, congestion during rush hours or busy roads directly to interact with the CT. Meanwhile, the crane trolley is lowered to pick
affects the time that CTs arrive at the ACT. Some other conditions may up the container task and is then raised to its original height. The process
cause uncertainties. Then, the ASC operation of handling containers of unloading a container task is similar. Thus, the energy consumption of
associated with CTs becomes passive. When the CT enters the storage ASC working is denoted by Eq. (2). When the ASC waits for the next
container task i , the non-working energy consumption generated from
′
yard, the ASC will be scheduled to load or unload the container. The
container tasks of CTs are handled with ASCs, involving unloading the waiting time is formulated in Eq. (3).
exported containers from vehicles and loading imported containers from To calculate the total energy consumption of ASCs, the storage lo
cations of container tasks, including the stacked bay and tier, are
the yard. The allocation of tasks determines the workload of ASCs and
thus affects the total energy consumption of equipment. required. The storage yard is composed of container blocks that are
divided into many rows, bays and tiers, as shown in Fig. 2. The arrival of
The energy consumption of ASCs includes the consumption when
working and waiting. When loading one container, the ASC lifts the both loaded and unloaded CTs requires different container tasks to be
completed by ASCs. The ASC typically moves from the initial position,
container from the container yard, moves to the truck exchange area,
places the container on the truck, and then releases it. In contrast, the bay zero, to the target bay of the container task and lowers to the target
tier. If no container task is allocated to the ASC, it expends its non-
ASC lifts the container and moves from the exchange area to the
container yard when unloading one container. ASCs keep working to working energy consumption. When the CT arrives at the container
yard later than the expected time, there is an impact on the operation of
perform container tasks that consist of two primary actions, i.e., moving
and lifting. Therefore, the energy consumption of working is related to the ASC, i.e., increasing the waiting time. An ASC working or waiting for
a long time is not conducive to equipment maintenance and sustainable
the moving distance and lifting height of ASCs, and their non-working
energy consumption occurs when there are no current container tasks development. Thus, ASCs should be scheduled to handle container tasks
effectively, balancing the workload, which affects the energy con
that depend on waiting time. The energy consumption calculation of
ASC can thus be described in the following equations. The involved sumption of ASCs.
This paper proposes the problem of operating optimization at ACT,
notations are listed in Table 2.The total energy consumption of ASC
consists of the working and non-working energy consumption, as shown which includes dealing with the uncertain factors that affect the
arrangement and execution of production plans and allocating the re
in Eq. (1). When the ASC loads a container task onto the CT, the crane
needs to move from the starting position to the target position and return sources of the container yard. The allocation of container tasks and
4
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
Fig. 3. Digital twin-based approach for operating optimization at the container yard.
5
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
Table 3
Definitions of notations in the mathematical model.
∑∑ ( ) ∑∑ m m ( m )
min z = xmii′ ⋅ Cim + Tim + xii′ ⋅ γ ⋅ tsi − tami (4)
m∈Mi,i′ ∈N m∈Mi,i′ ∈N
( / / )
Cim = μm ⋅ bi vce + bi vcf (5)
( / )
Tim = ρm ⋅ (H − hi ) / vte + (H − hi ) vtf (6)
∑∑
xmii′ = 1, ∀i ∈ N (7)
m∈M i′ ∈N
∑∑
(8)
′
xmii′ = 1, ∀i ∈ N
m∈M i∈N
(9)
′
xmii′ + xmi′ i ≤ 1, ∀i, i ∈ N, m ∈ M
∑ ∑
(10)
′
/ / /
some CTs do not arrive as planned, affecting ASC scheduling. It will tfim ≥ tsmi + bi vce + bi vcf + (H − hi ) / vte + (H − hi ) vtf (11)
occur that ASCs operate continuously for a long time or wait for a long ( )
(12)
′
tfim ≤ tami′ + P ⋅ 1 − xii′ , ∀i, i ∈ N, m ∈ M m
time. This unbalanced workload distribution has a direct impact on the
total energy consumption of ASCs, which is not beneficial to the main (
tami′ ≤ tfim + P ⋅ 1 − xii′ , ∀i, i ∈ N, m ∈ M m
) ′
(13)
tenance and sustainable use of equipment.
The virtual container yard has the same operation scenario as the tsmi ≥ tami , ∀i ∈ N, m ∈ M (14)
physical yard, so that the simulation of the container allocation and ASC tsmi ≥ ti , ∀i ∈ N, m ∈ M (15)
scheduling uses a reference for the optimization of the operating plan.
The energy consumption of ASCs depends on the workload distribution, (16)
′
xmii′ = {0, 1}, ∀i, i ∈ N, m ∈ M
which makes it necessary to perform ASC scheduling experiments. Some
tsmi , tami ≥ 0, ∀i ∈ N, m ∈ M (17)
uncertain factors disturb the operation of ASCs in the practical envi
ronment, affecting the scheduling performance. A detailed operating
plan is input to simulate the process of ASCs handling container tasks. Notations Definitions
Through the simulation, the working time and energy consumption of
M Number of ASCs, m ∈ M
each ASC are obtained to evaluate the operating plan. Then, the total
N Number of tasks, i ∈ N
distribution of energy consumed by ASCs can be calculated as the basis vce Moving speed of the crane without loading
for optimization. When the tasks are allocated inappropriately to ASCs, vcf Moving speed of the crane with loading
and the energy consumption is unbalanced, the operating plan should be vte Lifting speed of the crane trolley without loading
adjusted to execute in the physical container yard. Therefore, the virtual vtf Lifting speed of the crane trolley with loading
H Initial height of the crane trolley
container yard not only reflects the real environment, but also provides
P A large positive integer.
operational guidance for the physical space. loci Location of task i at the container yard, bi is the distance between the
initial bay and the target bay, and li is the stack height of the container
Cm i Moving energy consumption of the crane
4.2. Mathematical model Tim Lifting energy consumption of the crane trolley
tam i Time of ASC m arriving container task i
tsm Start time of ASC m handling container task i
A mixed integer programming model is developed to optimize ASC i
tfim End time of ASC m handling container task i
scheduling using the proposed digital twin-based approach. The oper xm xm = 1, ASC m handles task i after the task i; xm = 0, otherwise
′
ation environment is complex and dynamic at the ACT because handling ii′ ii′ ii′
consumption. The crane and crane trolley of the ASC move at a constant current task i. Eq. (10) describes the continuity of the container-handling
speed, and the working time can be obtained based on the distances and task, referring to the fact that the ASC completes task i and then begins to
speed. The ASC stays at the initial bay when there is no task operation. handle task i and the next task i′′ . Eq. (11) shows the end time of ASC
′
The container relocation problem is not considered when ASCs perform handling the container task, which includes the processing time of the
container tasks. The parameters and variables involved in the mathe crane moving and the crane trolley lifting to pick up or drop off one task.
matical model are listed in Table 3. Eq. (12) and Eq. (13) eliminate the subtour in the operating paths of the
The objective function provided in Eq. (4) is composed of the ASC. The end time of the current task handled by the ASC cannot be
working energy consumption and the waiting energy consumption of
6
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
earlier than the start time of the next task handled by the same ASC. The scheduling plan. In the Q-learning algorithm, the agent has candidate
start time of the next task is later than the end time of the previous task. selections of the action that are evaluated to obtain the best reward.
Eq. (14) means that the start time of ASC handling container is later than Then, the agent is designated an action and the corresponding reward.
the time of the ASC arriving at the container. Eq. (15) shows that the ASC To obtain a sustainable operating plan, the reward of an ASC and its task
can only start to work when the container arrives at the container yard. actions can be calculated using Eq. (19). The allocation of the task and
Eq. (16) and Eq. (17) define the ranges of variables. ASC depends on the value of energy consumed in the handling activity.
The task information, such as the arrival time of the container and The energy reward of agent m choosing action a at state s is determined
the start time of ASC working, cannot be definitively determined as the by the maximum Q-value that the action is rewarded.
operation environment dynamically changes. Containers may not arrive
ERm (s, a) = maxQm (s, a), 1 ≤ m ≤ M (19)
at the storage yard according to the expected time due to disturbances. m
Moreover, ASCs will not keep waiting for the arrival of unknown tasks In the case of state s, the value obtained by each agent selecting an
and will not finish handling containers as planned. A digital twin-based action is counted with Eq. (20). After selecting and executing the task
approach is proposed in this study to address the uncertainties that may assignment with the highest energy reward value, the highest Q-value is
occur in the container yard. Based on the ACT digital twin system, the updated in each step.
operation data required in the mathematical model can be monitored
and collected from the physical container yard. Then, a machine ERmax (s, a) = maxERm (s, a) = maxQm (s, a) (20)
a m
learning algorithm is employed to obtain the solution with the minimum
energy consumption. The algorithm flow of using Q-learning to find the optimal operation
plan for ASCs is provided in Fig. 5. At the beginning, the Q-value is
initialized. Then, the agent selects an action to execute at the current
4.3. Solution with machine learning algorithm state. In other words, the container is allocated to an ASC for the next
operations according to the arrived tasks and equipment status. After
This section illustrates the machine learning algorithm, which is used performing an action, the agent obtains the reward for its selection,
to obtain the optimal solution in the proposed digital twin-based which also causes an update of the Q-value. The pursuit of the maximum
approach. The optimization objective of the abovementioned mathe Q-value drives the agent to learn to make a better decision. When the
matical model is to minimize the energy consumption of ASCs for all agent stays in the next state, it will take a new action that brings the best
container tasks. According to the problem statement and established reward. The Q-value is then updated with the iteration. Finally, the
model, the container task is allocated to ASC, which requires minimal maximum Q-value indicates that the agent finds the optimal strategy.
energy consumption to promote sustainable development. Hence, it is When using Q-learning algorithm to obtain a decision, the interac
essential to calculate the energy consumed in the activities of ASC tion between agent and environment is essential to update the Q-value.
handling containers. In the proposed resource optimization problem, the With the support of digital twin, the status of ASCs, arrival information
allocation of container tasks and ASCs is directly related to the energy of tasks, and the operation environment can be observed from the
consumption of the handling equipment. The Q-learning algorithm is physical container yard and synchronized in the virtual container yard.
employed to evaluate the selections among ASCs and tasks in the ACT Accordingly, the data required in the Q-learning algorithm can be ob
dynamic operation environment. tained to evaluate the agents and actions. For example, the operation
The main point of Q-learning is to help the agent make decisions and environment of the container yard reflects the status of the handling
gain rewards. The three primary elements of the Q-learning algorithm equipment, which assists the agent in observing the state and choosing
thus include the agent, state and action. The agent will obtain the
reward when it takes an action at the state based on the reward mech
anism. Then, the agent moves to the next state and obtains a new reward
for the action. The action set of the agent is denoted as A. The iterative
process of determining the optimal strategy can be described in Eq. (18),
where the agent executing action a at state s will obtain reward R(s, a),
and α, γ are the learning factor and discount factor, respectively, which
range from 0 to 1. The accumulative reward value of the action is
denoted as Q(s,a). In addition, the ε-greedy strategy is used for agents to
take an action. The parameter ε denotes the probability of choosing an
optimal action, while the value of (1-ε) denotes the probability of
choosing a random action. The parameter values of Q-learning refer to
Chen et al. (2020a).
( )
Q(s, a) = (1 − α) ⋅ Q(s, a) + α⋅ R(s, a) + γ ⋅ max
′
Q(s’, a’) (18)
a ∈A
7
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
the action. The container task information is also related to the action set is input to solve the model. Then, the operating plan of ASCs can be
that the agent would like to execute. Based on the ACT digital twin obtained, as provided in Table 5.
system, the agent is required to perform actions with minimum energy
consumption for sustainability. 5.2.2. Large-scale case results
The large-scale case is designed to be solved with the proposed
5. Case analysis digital twin-based approach. The mathematical model has been verified
in the above section. The Q-learning algorithm is used to find the
This section provides numerical experiments to demonstrate the optimal solution for ASCs. Combined with the simulation in the virtual
effectiveness of the digital twin-based approach for the operating opti container yard, the final solutions of the large-scale case are given in
mization at the container yard. First, the numerical case is designed to Table 6. There are 221 container tasks and 8 ASCs for handling.
conduct the experiment conveniently. Then, the results are obtained to The detailed operating plan of each ASC is described in Fig. 6. The
verify the feasibility of the digital twin-based approach, and solutions location of the red rectangle in the figure indicates the arrival time of the
with different methods are compared to discuss performance. container tasks. The container tasks arrive at the scattered time during
the operating period. The gap between two adjacent red and blue rect
5.1. Case design angles represents the gap between the arrival time of the task and the
start working time of the ASC. When the ASC completes the current task,
The data used in the instance are gathered from a port in China, it will take some time to wait for the next task. In addition, a task
including the performance parameters of equipment and the operating allocated to an ASC cannot arrive within the estimated time, which
information of containers. Dedicated sensors used in the equipment and causes the ASC to wait. Therefore, the non-working energy consumption
container yard collect the status data of equipment and the container of ASCs is generally higher. The width of the blue rectangle in the figure
information of tasks, which is integrated into the port operating system refers to the operation time required for the ASC to handle the task, and
and can be extracted to conduct case experiments in this paper. The different tasks take their own processing time.
moving speed of the ASC crane without loading is 4 m/s, and its loaded
speed is approximately 1.67 m/s. The lifting speed of the crane trolley 5.3. Comparative analysis
without loading is 1.5 m/s, while the loaded speed of the trolley is 0.75
m/s. The maximum lifting height of the crane trolley is 19.75 m. In 5.3.1. Comparison with different methods
addition, the average energy consumption of the crane per unit time is Comparative experiments are conducted with the same case to verify
148 Kw/h, and the average energy consumption of the crane trolley is the effectiveness of the proposed digital twin-based approach using
103 Kw/h. The average energy consumption of ASC per unit time is 80 genetic algorithm (GA) and particle swarm optimization (PSO). Both
Kw/h during a non-working period. These equipment parameters are algorithms are commonly used to solve optimization problems. In this
not unique because they vary with different equipment types. numerical experiment, the algorithm parameters of GA and PSO are
At the container yard, the CTs transport containers to the storage referred to the literature (Han et al., 2019; Lu and Wang, 2019), and six
blocks. Then, ASCs are assigned to discharge containers, which are then ASCs are assigned to handle 98 container tasks. The running time of
stacked at the yard. An empty CT can take the imported container when conducting experiments with the three solutions is provided in Table 7.
leaving the container yard, and all containers that are about to arrive or The experimental results of different solution methods are given in
leave are handled by ASCs at the yard during a period. It is observed Table 8.
from the port that container task assignments occur intensively within 4 Experiments are performed ten times with GA, PSO, and the pro
h, which is thus set as an operating period. Port data of container tasks posed approach, respectively. Their running time is tracked to compare
are partly provided in Table 4. Task information in the experiments is the computational performance of different methods. Obviously, the
incomplete but realistic due to interest. Many storage blocks are present proposed approach obtains the solution with the least time and PSO
in the container yard and are numbered sequentially. Exported con costs less computing time than GA. It indicates that the proposed
tainers are discharged to store at the block, while imported containers approach shows a better performance than the other two algorithms
are loaded onto CTs. Then, the operation type is classified into putting when solving this case.
down or picking up. For example, the given container task 4 stacked at The total working energy consumption of all tasks is 833.17 Kw,
block 42 will be picked from bay 11 and tier 1 at the estimated time.
Experiments are conducted in Python with Intel Core i7-11800H @ 2.30 Table 5
GHz system. Operating plan of ASCs in the small-scale case.
Task ASC Arrival Start Working energy Non-working
5.2. Experimental results time of working consumption of energy
ASC time of ASC (Kw) consumption of
5.2.1. Small-scale case results ASC ASC (Kw)
To validate the established mathematical model, the small-scale case 1 1 12:00:00 12:04:02 8.96 5.38
is solved with GUROBI Solver as the benchmark comparison. Five 2 2 12:00:00 12:15:21 3.63 20.47
3 1 12:08:08 13:06:09 5.47 77.36
container tasks are selected as the small-scale case. The task information
4 2 12:17:12 13:07:35 8.12 67.18
5 1 13:08:46 13:09:12 4.43 0.58
Table 4
In the small-scale case, the non-working energy consumption of ASC handling
Information on the container tasks used in the case.
task 3 and task 4 is larger mainly because the start working time is much later
Number Blocks Estimated arrival time Location Operation type than the arrival time. If the container task is not ready at the estimated time, the
1 38 12:04:02 (30,1) Putting down waiting time and thus non-working energy consumption will increase. The gap
2 40 15:16:29 (11,2) Picking up between the arrival time and the start working time of ASC is the factor that
3 41 15:09:06 (15,2) Picking up affects the non-working energy consumption. The working energy consumption
4 42 14:00:33 (11,1) Picking up of ASC depends on the workload of the task. The ASC spends more energy
5 43 13:07:35 (26,1) Putting down consumption handling the container that is stored at a far location. For task 1,
6 44 13:06:09 (15,3) Picking up the ASC crane moves to the bay that is far away from the initial location. Hence,
7 45 13:09:12 (10,3) Picking up
the working energy consumption of handling task 1 is higher than that of the
8 46 12:15:21 (7,4) Picking up
others.
8
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
It can be found from Table 5 that the total energy consumption of ASC 8 is the lowest, while that of ASC 1 is the highest. ASC 8 spends the lowest working energy consumption and the highest non-working energy
consumption handling the allocated tasks. It means that the tasks are not ready for the handling equipment as the ASC waits for a long time. In contrast, ASC 1 takes the highest working energy consumption and the lowest
consumption of each ASC varies in the three solutions. For the proposed
approach, the total non-working energy consumption of ASCs is the
lowest. In addition, the total non-working energy consumption of PSO is
consumption
Total energy
lower than that of GA. It can be shown that the ASC operating plan
solved with the proposed approach has the best performance among the
591.03
581.11
568.28
543.19
543.33
523.21
523.70
522.70
three methods according to the total energy consumption.
The distribution of energy consumed by ASCs from the three
methods is drawn in Fig. 7. The bar chart shows the working energy
consumption trend of the three methods. The grey bars in Fig. 7 repre
sent the working energy consumption of the proposed approach, and
there is a small gap in the progression. In contrast, the gap trend of the
Waiting energy
consumption
blue bars is the strongest, which are solved with GA. Hence, regarding
the working energy consumption, the difference of each ASC in the
300.00
315.67
329.24
322.11
329.42
358.78
345.73
363.53
proposed approach is the least, followed by that in PSO among the three
methods. Moreover, the line chart shows the trend of non-working en
ergy consumption with the three methods. The yellow and blue lines,
referring to the non-working energy consumption of GA and PSO, show
a similar trend. The green line, that is, the non-working energy con
sumption of the proposed approach, appears relatively flat, which in
Working energy
dicates that the non-working energy consumption of ASCs does not show
consumption
case of five ASCs. When assigning container tasks to ASCs, two opposite
strategies can be followed. In the centralized operation, containers are
allocated to the available ASCs centrally. If the ASC is idle, a task will be
3,12,20,24,27,33,39,47,55,64,71,78,87,97,103,110,118,122,126,132,139,147,154,162,168,176,185,193,198,207,214,221
as much as possible. Then, two strategies are conducted in the case with
the proposed approach, and the energy consumption is given in Table 9.
For the decentralized operation, a penalty factor is added to calculate
7,17,29,38,45,51,59,66,73,80,91,99,112,123,134,141,149,158,169,179,187,191,200,208,216
consumption of ASC per unit time during the non-working period in
creases by 5% if its cumulative waiting time exceeds half an hour. The
setting of the time limit can be determined by the equipment perfor
mance. In summary, when the inactive time of the handling equipment
9,18,31,41,49,61,82,93,101,114,129,142,151,157,171,178,186,188,201,211
introduced, where the average energy consumption of the ASC per unit
time is increased by 10%. When the handling equipment works for a
long time, its energy consumption will grow.
The energy consumption results of ASCs are shown in Table 9. The
idle ratio refers to the rate of non-working energy consumption to
working energy consumption, which shows the distribution of the
workload. The idle ratio of the decentralized operation is lower overall
than that of the centralized operation. The total working energy con
sumption of centralized operation is less than that of decentralized
operation, while the total non-working energy consumption presents the
opposite relationship.
The non-working energy consumption is higher in the centralized
operation, primarily when tasks are arranged centrally for some ASCs
Tasks assigned to ASC
handling and the remaining ASCs remain idle. Even with the penalty
factor added to working energy consumption, the total working energy
consumption of the centralized operation is still lower than that of the
decentralized operation. From the perspective of the total energy con
sumption, the performance of the centralized operation is superior to
that of decentralized operation.
Table 6
The port operator can choose one strategy according to the operation
ASC
9
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
Table 8
Comparison results of three solutions.
GA PSO The proposed approach
Working energy Non-working energy Working energy Non-working energy Working energy Non-working energy
consumption (Kw) consumption (Kw) consumption (Kw) consumption (Kw) consumption (Kw) consumption (Kw)
10
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
Table 9
Energy consumption of ASCs using two strategies.
Centralized operation Decentralized operation
Working energy Non-working energy Idle ratio (W2/ Working energy Non-working energy Idle ratio (W4/
consumption (W1) consumption (W2) W1) consumption (W3) consumption (W4) W3)
11
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
12
Y. Gao et al. Journal of Cleaner Production 385 (2023) 135782
Liu, D., Ge, Y.-E., 2018. Modeling assignment of quay cranes using queueing theory for Tang, J., Liu, G., Pan, Q., 2021. A review on representative swarm intelligence
minimizing CO2 emission at a container terminal. Transport. Res. Transport Environ. algorithms for solving optimization problems: applications and trends. IEEE/CAA J.
61, 140–151. Automatica Sinica 8, 1627–1643.
Liu, S., Liu, S., Lu, C., Zhou, M., Abusorrah, A., 2022. Valid inequality and variable Tsolakis, N., Zissis, D., Papaefthimiou, S., Korfiatis, N., 2022. Towards AI driven
fixation for unrestricted block relocation problems. IEEE Trans. Intell. Transport. environmental sustainability: an application of automated logistics in container port
Syst. terminals. Int. J. Prod. Res. 60, 4508–4528.
Lopes, M.R., Costigliola, A., Pinto, R., Vieira, S., Sousa, J.M.C., 2020. Pharmaceutical Wan, Z., Zhang, T., Sha, M., Guo, W., Jin, Y., Guo, J., Liu, Y., 2021. Evaluation of
quality control laboratory digital twin–A novel governance model for resource emission reduction strategies for berthing containerships: a case study of the Shekou
planning and scheduling. Int. J. Prod. Res. 58, 6553–6567. Container Terminal. J. Clean. Prod. 299, 126820.
Lu, H., Wang, S., 2019. A study on multi-ASC scheduling method of automated container Wang, K.-J., Lee, Y.-H., Angelica, S., 2021. Digital twin design for real-time monitoring–a
terminals based on graph theory. Comput. Ind. Eng. 129, 404–416. case study of die cutting machine. Int. J. Prod. Res. 59, 6471–6485.
Luo, J., Wu, Y., 2015. Modelling of dual-cycle strategy for container storage and vehicle Wang, Q., Jiao, W., Wang, P., Zhang, Y., 2020a. Digital twin for human-robot interactive
scheduling problems at automated container terminals. Transport. Res. E Logist. welding and welder behavior analysis. IEEE/CAA J. Automatica Sinica 8, 334–343.
Transport. Rev. 79, 49–64. Wang, X., Zhou, M., Zhao, Q., Liu, S., Guo, X., Qi, L., 2020b. A branch and price
Negri, E., Pandhare, V., Cattaneo, L., Singh, J., Macchi, M., Lee, J., 2021. Field- algorithm for crane assignment and scheduling in slab yard. IEEE Trans. Autom. Sci.
synchronized Digital Twin framework for production scheduling with uncertainty. Eng. 18, 1122–1133.
J. Intell. Manuf. 32, 1207–1228. Xiong, M., Wang, H., Fu, Q., Xu, Y., 2021. Digital twin–driven aero-engine intelligent
Ng, M., Talley, W.K., 2020. Rail intermodal management at marine container terminals: predictive maintenance. Int. J. Adv. Manuf. Technol. 114, 3751–3761.
loading double stack trains. Transport. Res. C Emerg. Technol. 112, 252–259. Yan, Q., Wang, H., Wu, F., 2022. Digital twin-enabled dynamic scheduling with
Niu, B., Liu, Q., Wang, Z., Tan, L., Li, L., 2021. Multi-objective bacterial colony preventive maintenance using a double-layer Q-learning algorithm. Comput. Oper.
optimization algorithm for integrated container terminal scheduling problem. Nat. Res. 144, 105823.
Comput. 20, 89–104. You, M., Wang, Q., Sun, H., Castro, I., Jiang, J., 2022. Digital twins based day-ahead
Ozturk, M., Jaber, M., Imran, M.A., 2018. Energy-aware smart connectivity for IoT integrated energy system scheduling under load and renewable energy uncertainties.
networks: enabling smart ports. Wireless Commun. Mobile Comput. 2018. Appl. Energy 305, 117899.
Park, H.-A., Byeon, G., Son, W., Jo, H.-C., Kim, J., Kim, S., 2020. Digital twin for Ypsilantis, P., Zuidwijk, R., 2019. Collaborative fleet deployment and routing for
operation of microgrid: optimal scheduling in virtual space of digital twin. Energies sustainable transport. Sustainability 11, 5666.
13, 5504. Yue, L., Fan, H., Ma, M., 2021. Optimizing configuration and scheduling of double 40 ft
Pasha, J., Dulebenets, M.A., Fathollahi-Fard, A.M., Tian, G., Lau, Y.-Y., Singh, P., dual-trolley quay cranes and AGVs for improving container terminal services.
Liang, B., 2021. An integrated optimization method for tactical-level planning in J. Clean. Prod. 292, 126019.
liner shipping with heterogeneous ship fleet and environmental considerations. Adv. Zaerpour, N., Gharehgozli, A., De Koster, R., 2019. Vertical expansion: a solution for
Eng. Inf. 48, 101299. future container terminals. Transport. Sci. 53, 1235–1251.
Pasha, J., Nwodu, A.L., Fathollahi-Fard, A.M., Tian, G., Li, Z., Wang, H., Dulebenets, M. Zhang, M., Tao, F., Nee, A.Y.C., 2021. Digital twin enhanced dynamic job-shop
A., 2022. Exact and metaheuristic algorithms for the vehicle routing problem with a scheduling. J. Manuf. Syst. 58, 146–156.
factory-in-a-box in multi-objective settings. Adv. Eng. Inf. 52, 101623. Zhang, Z., Guan, Z., Gong, Y., Luo, D., Yue, L., 2022. Improved multi-fidelity simulation-
Rabbani, M., Oladzad-Abbasabady, N., Akbarian-Saravi, N., 2022. Ambulance routing in based optimisation: application in a digital twin shop floor. Int. J. Prod. Res. 60,
disaster response considering variable patient condition: NSGA-II and MOPSO 1016–1035.
algorithms. J. Ind. Manag. Optim. 18, 1035. Zhao, N., Fu, Z., Sun, Y., Pu, X., Luo, L., 2022. Digital-twin driven energy-efficient multi-
Savolainen, J., Urbani, M., 2021. Maintenance optimization for a multi-unit system with crane scheduling and crane number selection in workshops. J. Clean. Prod. 336,
digital twin simulation. J. Intell. Manuf. 32, 1953–1973. 130175.
Shu, F., Mi, W., Li, X., Zhao, N., Mi, C., Yang, X., 2015. A double-population genetic Zhuang, C., Miao, T., Liu, J., Xiong, H., 2021. The connotation of digital twin, and the
algorithm for asc loading sequence optimization in automated container terminals. construction and application method of shop-floor digital twin. Robot. Comput.
J. Coast Res. 64–70. Integrated Manuf. 68, 102075.
Sim, J., 2018. A carbon emission evaluation model for a container terminal. J. Clean.
Prod. 186, 526–533.
13