A Quay Crane System that Self-recovers from Random Shocks
نویسندگان
چکیده
The main challenge for a container terminal is to maximize its throughput using limited resources subject to various operational constraints under uncertainty. Traditional methods try to achieve this through an optimized plan by solving a quay crane scheduling problem; but the plan may become obsolete or infeasible after shocks (changes in the system due to uncertainty). To respond to shocks these methods require frequent re-planning, which increases the operations cost. We propose a new method to counter this. Instead of creating plans, we develop an operating protocol to respond to shocks without re-planning. Under this protocol, each quay crane along a berth follows simple rules to serve vessels that arrive continuously in time. If the system is configured properly, it always spontaneously recovers to its efficient form after a random shock. The average throughput of the system operating on its efficient form is very near its full capacity if the crane travel time per bay is relatively short. This self-recovery is robust even under a sequence of shocks as the system persistently restores its throughput after each shock. Most importantly, this is accomplished without complex computation.
منابع مشابه
Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm
Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...
متن کاملQuay Crane Allocation of Container Terminal Based on Cluster Analysis
Quay crane allocation is one of the most important scheduling plans in the container terminal. A large of production data is stored in the database of the terminal. This paper utilizes the method of data mining to analyze the problem of quay crane allocation by using these data. From the mining, valuable information has been gotten from the database. The paper chooses the fuzzy cmeans cluster a...
متن کاملA Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملA Biased Random-Key Genetic Algorithm for the Berth Allocation and Quay Crane Assignment Problem
Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pro...
متن کاملQuay crane scheduling with non-interference constraints in port container terminals
The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Com...
متن کامل