Scheduling of collaborative operations of yard cranes and yard trucks for export containers using hybrid approaches

Hsu, Hsien-Pin; H, Tai; Wang, Chia–Nan; Chou, Chien-Chang

doi:10.1016/j.aei.2021.101292

Cited by 38 publications

(14 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Problem Objective Function (Minimize) Model Algorithm [11] Twin-crane Interference-free -- [16] Twin-crane Makespan MILP Heuristic [21] Crane + YT Makespan MILP BD [14] AGV + ASC Makespan MCF B and B [13] Twin-crane Makespan MILP ALNS [17] Twin-ASC Makespan MILP GA [22] Multi-crane Delay time + Energy consumption MILP GA + PSO [18] Crane + YT Makespan Analytical GA + PSO [15] Twin-crane Makespan MILP GA + Greedy [3] SM + Crane Crane's movements cost + Penalty cost MIP B and B + CG [23] Crane + YT Makespan MILP DP [4] QC + AGV + Crane Berthing time CP Heuristic [24] Twin-crane Makespan MILP PSO [25] ASC + AGV Makespan MILP GA [26] Twin-crane Makespan MILP Heuristic + DP [2] Dual-ASC Makespan MILP NS [27] Twin-crane ASC and truck waiting time MILP Look-Ahead [20] Twin…”

Section: Literaturementioning

confidence: 99%

“…Most studies attempt to develop a variety of algorithms to solve large-scale problems. We summarize the algorithm in three aspects: (1) Model-based mathematical heuristics, e.g., Branch-and-Bound [14] and Branchand-Cut [2]; (2) neighborhood search-based heuristics, e.g., greedy [15]; and (3) evolutionary algorithms based on swarm optimization, e.g., genetic algorithm [17] and Particle swarm optimization [18]. Inspired by the methods, a Branch-and-Bound and a genetic algorithm are proposed for solving the planned scheme with small-scale and medium-scale instances, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Iterative Re-Optimization Framework for the Dynamic Scheduling of Crossover Yard Cranes with Uncertain Delivery Sequences

Wang

2023

JMSE

View full text Add to dashboard Cite

In yard-crane scheduling problems, as loading operations take priority over unloading, the delivery sequence of unloading from the quaysides to the yard is uncertain. The delivery sequence changes may make crane scheduling more difficult. As a result, the crane operations schedules developed statically become suboptimal or even infeasible. In this paper, we propose a dynamic scheduling problem considering uncertain delivery sequences. A mixed-integer linear program is developed to assign tasks to cranes and minimize the makespan of crane operations. We propose an iterative solution framework in which the schedules are re-optimized whenever the delivery sequence change is revealed. A genetic algorithm is proposed to solve the problem, and a greedy algorithm is designed to re-optimize and update the solution. To make the updated solution take effect as soon as possible, regarding batch-based task assignment, the tasks in the scheduling period are divided into several batches. In this case, the instant requests arising from the delivery sequence change are added to corresponding batch tasks and re-optimized together with the tasks of this batch. In addition, a relaxation model is formulated to derive a lower bound for demonstrating the performance of the proposed algorithm. Experimental results show that the average gap between the algorithm and the lower bound does not exceed 5%. The greedy insertion algorithm can re-optimize the instant requests in time. Therefore, the proposed iterative re-optimization framework is feasible and has the advantages (necessity) of batch-based task assignment.

show abstract

Section: Literaturementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Iterative Re-Optimization Framework for the Dynamic Scheduling of Crossover Yard Cranes with Uncertain Delivery Sequences

Wang

2023

JMSE

View full text Add to dashboard Cite

show abstract

“…A Lagrangian relaxation and subgradient optimization procedure-based heuristic were proposed. The [13] developed integrated scheduling for YC and YT in the handle of export containers collaboratively in the yard side area of a container terminal. However, this study neglected QCs and the VSP constraints in the seaside area.…”

Section: Related Studiesmentioning

confidence: 99%

“…The [44] extended the [13] to further consider the QC operations as a whole, in addition to taking the VSP constrain into consideration. However, this study and many of the past studies, including the [13], have neglected either import or export containers whose operations are found can also affect the whole operations in a container terminal. Both operations of inbound and outbound containers should be equally esteemed.…”

Section: Related Studiesmentioning

confidence: 99%

Heuristic/Metaheuristic-Based Simulation Optimization Approaches for Integrated Scheduling of Yard Crane, Yard Truck, and Quay Crane Considering Import and Export Containers

Hsu¹,

Chou

Wang³

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

Yard cranes (YCs), yard trucks (YTs), and quay cranes (QCs) are the main material handling equipment (MHE) used to fulfill Yard Storage Plan (YSP) and Vessel Stowage plan (VSP) in a traditional container terminal. However, previous studies have often considered part of these MHE, with either import or export containers being neglected simultaneously. Such studies at most can only achieve local optimality which in a worst-case scenario can cause bottleneck(s) in the downstream operations. In addition, it is noted that the YSP, VSP, and their constraints have been often neglected in previous studies. Such negligence can cause operational problems. To best operate a container terminal, it needs to address the above issues. Our literature review shows that exact methods have difficulty solving a problem of big size to optimality due to NP-hard, thus alternative approaches are still required. Simulation-based optimization approaches are found with the potential to deal with container terminal problems. However, software for the integration of simulation and optimization effectively is found unavailable. In this research, different simulation-based optimization approaches, based on a simulation-based optimization framework (HSBOF), have been developed. These approaches help to schedule YCs, YTs, and QCs in handling both import and export containers for a ship in a traditional container terminal, taking YSP, VSP, and their constraints into consideration. Various heuristics/metaheuristics have been employed in the HSBOF as a sequencing method to arrange alternative operational sequences of containers. The results show that the Simulation(ISFLA) has the best performance.

show abstract

“…However further studies were recommended on the topic in order to guarantee a near global optimization of the entire process. Hsu et al [12] also noted that optimizing collaborative operations for yard cranes (YCs) and yard trucks (YTs) is vital to the overall performance of a container terminal. The research suggested that a hybrid approach is found with the potential to outperform pure methods.…”

Section: Literature Reviewmentioning

confidence: 99%

Quay-Yard operation analysis of port container terminals in Nigeria

Achebe¹,

Nwoguh²,

Ononiwu³

et al. 2022

Nig. J. Tech.

View full text Add to dashboard Cite

This paper presents significant measures to tackling berth occupancy and quay-yard operation problems. Case study was conducted on a port container terminal in Nigeria confidentially identified as ‘Port A’ in this paper. Hungarian assignment algorithm was used to reduce the total travel time of the yard trucks from an average of 6.4 minutes to 3.5minutes, while M/M/c/K queuing model was applied in scheduling the quay crane assignments. Results showed tremendous increase in quay crane rate, berth capacity and improved berth utilization. Also, for the reach stacker, the crane rate can be improved to 30 TEUs/hr at berth occupancy below 0.40 with TEUs factor of 1.4. These results imply that for Nigeria terminals operating with reach stacker crane, it is possible to improve the berth capacity without affecting the berth utilization of the terminal.

show abstract

Scheduling of collaborative operations of yard cranes and yard trucks for export containers using hybrid approaches

Cited by 38 publications

References 32 publications

An Iterative Re-Optimization Framework for the Dynamic Scheduling of Crossover Yard Cranes with Uncertain Delivery Sequences

An Iterative Re-Optimization Framework for the Dynamic Scheduling of Crossover Yard Cranes with Uncertain Delivery Sequences

Heuristic/Metaheuristic-Based Simulation Optimization Approaches for Integrated Scheduling of Yard Crane, Yard Truck, and Quay Crane Considering Import and Export Containers

Quay-Yard operation analysis of port container terminals in Nigeria

Contact Info

Product

Resources

About