Full length articleYard crane scheduling problem in a container terminal considering risk caused by uncertainty
Introduction
Accompanied with the slowdown in trade growth, the volume growth of container shipping has been slowed down gradually. Container terminals are facing more challenges, such as fiercer and fiercer competition, attracting freight source, improving the service level, promoting operation efficiency, saving operation cost. The yard crane (YC) is the most important equipment for container yard operation, which can directly impact the entire operation efficiency. YC scheduling is one of the most important operation problems of a container terminal, which mainly refers to the handling sequence and starting service time of each YC for each task group (the concept of task group is referred to the core idea proposed by He et al. [17]. YC scheduling can directly impact the handling efficiency and cost of a container terminal.
As the result of the importance of YC scheduling, the operation efficiency of container terminals is most studied, and a lot of YC scheduling approaches for solely improving the efficiency are developed. To the best of our knowledge, most of the traditional researches on YC scheduling generally consider deterministic environment, where the arriving times and the handling volumes of the task groups are not uncertain. However, YC scheduling must face to various uncertain factors and unknown issues in reality. For example, because of the change of shipping liner's plan and weather reasons, the vessel may arrive at port earlier or later. As the result of handling equipment failure, the total served time of the vessel may be longer. The report of Drewry Shipping Consultants shows that the average arriving time of all ships at East-West route deviated from their estimated arrival time 1.9 days in January and February 2015 [7]. All of the uncertain factors impact the initial schedule. Once the uncertainty occurs, the planners should adjust or reschedule the initial schedule to satisfy the reality. But, this adjustment or rescheduling incur extra cost, and impact the other plans or schedules. If the uncertainty can be considered in the initial schedule, the risk of adjusting schedules will be reduced significantly. Therefore, container terminals need some models and methods for the YC scheduling problem with uncertainty. This paper mainly addresses the YC scheduling problem with uncertain arriving time and uncertain handling volume of task groups, which significantly impact the YC handling sequence . The main contributions of this work are: (1) the extra loss caused by uncertainty is measured, (2) a MIP model is formulated for minimizing the extra loss considering a lot of uncertain scenarios, and (3) a GA embedded three-stage algorithm is developed for obtaining enhanced solution.
The remainder of the paper is organized as follows. Literature review is addressed in Section 2. In Section 3, the YC scheduling problem with uncertain factors is described. In Section 4, the YC scheduling problem with uncertainty is modeled as a mixed integer programming (MIP). A three-stage optimization for solving this problem is proposed in Section 5. Section 6 validates the performance and the effectiveness of the developed model and algorithm by numerical experiments, and the last section concludes this work and gives the future research.
Section snippets
Literature review
Up to now, there are abundant studies focused on the operations of container terminals, such as handling equipment scheduling, storage space allocation, berth allocation and integrated scheduling of multi-resource [31], [30], [8]. Most of these works are devoted to port operation management under deterministic environment, whereas the uncertain factors are involved less. In this section, we mainly review the literatures highly related to port operation management under uncertainty and YC
Description of YC scheduling under uncertainty
YC scheduling problem mainly refers to two decisions: (1) the served sequence for each task group; and (2) the start served time of each task group. In order to reduce computational complexity, the scheduling object is not each container but task group. The construction approach of a task group is referred to the approach proposed by He et al. [17], [18]. Task group means a lot of tasks are belong to the same shipping line or the same carrier at adjacent bays in the same block, which volume
Notation
Parameters i The index of task groups j The index of YCs k The index of customers T The set of all task groups in the planning horizon. Y The set of all YCs. U , where denotes virtual depot. p The loading and unloading speed of each YC (unit: h/move) Vk The task number of Customer k(unit: move). If ,Vk = 0. Sk The needed handling time of Customer k. ak The arriving time of Customer k. If ,ak = 0. dpk The planned ending time of Customer k. If , dpk = 0. tkk′ The moving time between
Overall framework
As aforementioned, the YC scheduling problem under uncertainty is a VRP with high complexity caused by uncertainty. Generally, the large-size VRP with deterministic environment is hard to solve in a short CPU time using exact algorithms or commercial solvers such as ILOG CPLEX, not to mention the YC scheduling problem under uncertainty, especially with a lot of scenarios. Thus a GA-based framework combined with three-stage algorithm is proposed to solving the problem, where the GA is used for
Computational experiments
To validate the effectiveness of the proposed approach, we conduct a series of numerical experiments with different sizes. This section consists of three parts: (1) performance analysis, (2) extra loss analysis and (3) sensitivity analysis. In the performance analysis, the CPU time and solution quality between the proposed method and CPLEX are compared. In the extra loss analysis, we compare the completion delay costs and the extra loss costs between schedules obtained by the proposed model and
Conclusions
Since there are a lot of uncertain factors, such as the changes of shipping liner's plan, changes of weather, handling equipment failure and variations of requested service time, operation plans and schedules may have to be adjusted. We should reduce the adjustment caused by the uncertain factors. This paper addresses YC scheduling problem in a container terminal under uncertainty in reality. A mixed integer programming (MIP) model and three-stage optimization algorithm are proposed to handle
Declarations
The authors declare that they have no competing interests, and the first two authors contributed equally to this work.
Acknowledgement
This work is sponsored by National Natural Science Foundation of China (71602114) and Shanghai Science & Technology Committee Research Project (17040501700, 15590501700).
References (38)
- et al.
An uncertainty-aware AGV assignment algorithm for automated container terminals
Transp. Res. Part E: Logistics Transp. Rev.
(2010) - et al.
Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals
Robotics Autonomous Syst.
(2014) - et al.
Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals
Int. J. Prod. Econ.
(2008) - et al.
Robust berth scheduling at marine container terminals via hierarchical optimization
Comput. Operat. Res.
(2014) - et al.
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
Adv. Eng. Inform.
(2011) - et al.
An exact method for scheduling a yard crane
Eur. J. Operat. Res.
(2014) - et al.
A multi-population algorithm to solve the VRP with stochastic service and travel times
Comput. Indust. Eng.
(2018) - et al.
A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
Eur. J. Operat. Res.
(2010) - et al.
Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption
Adv. Eng. Inform.
(2015) - et al.
Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption
Expert Syst. Appl.
(2015)
Quay crane scheduling with non-interference constraints in port container terminals
Transp. Res. Part E: Logistics Transp. Rev.
Discrete time model and algorithms for container yard crane scheduling
Eur. J. Operat. Res.
Crane scheduling in container yards with inter-crane interference
Eur. J. Operat. Res.
Vehicle routing problem with stochastic travel times including soft time windows and service costs
Comput. Operat. Res.
The time-dependent vehicle routing problem with soft time windows and stochastic travel times
Transp. Res. Part C: Emerging Technol.
Dynamic crane deployment in container storage yards
Transp. Res. Part B: Methodol.
Container yard template planning under uncertain maritime market
Transp. Res. Part E: Logistics Transp. Rev.
Tactical berth allocation under uncertainty
Eur. J. Operat. Res.
A decision model for berth allocation under uncertainty
Eur. J. Operat. Res.
Cited by (55)
A digital twin-based decision support approach for AGV scheduling
2024, Engineering Applications of Artificial IntelligenceRobust multi-equipment scheduling for U-shaped container terminals concerning double-cycling mode and uncertain operation time with cascade effects
2024, Transportation Research Part C: Emerging TechnologiesOptimization on joint scheduling of yard allocation and transfer manpower assignment for automobile RO-RO terminal
2023, Transportation Research Part E: Logistics and Transportation ReviewA new solution approach for the twin yard crane scheduling problem in automated container terminals
2023, Advanced Engineering InformaticsRisk propagation and evolution analysis of multi-level handlings at automated terminals based on double-layer dynamic network model
2022, Physica A: Statistical Mechanics and its ApplicationsQuay crane and yard truck dual-cycle scheduling with mixed storage strategy
2022, Advanced Engineering InformaticsCitation Excerpt :Liang et al. [13] developed a revolutionary loading and unloading method that maximizes the efficiency of the container, subsurface logistics vehicles, and ground-based automatically guided vehicles. He et al. [6] investigated the yard crane scheduling problem considering the uncertainty. Based on empty container yards, Karakaya et al. [11] introduced a series of Markov models based on empty container yards to define the distribution of relocations.