• Journal of Navigation and Port Research
• /
• v.31 no.6
• /
• pp.531-536
• /
• 2007

In this paper we present an interpolation-LQ control technique which tunes continuously the controller gain by interpolating the gains of sub-LQ controllers. The proposed controller design technique is applied to the container crane system for simulations. Several cases of simulations are carried out in order to prove the control effectiveness and robustness. The simulation results of the proposed controller are compared with those of LQ controllers. The results showed better control performance than those of LQ controllers.

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.482-483
• /
• 2014

In this paper, an electric yard tractor (YT) with furtive charging system is investigated. YT is one of pollution sources in container terminals. The furtive charging system does not impose difficulties on YT day-schedule because charging is performed when a YT is waiting under RTGC (Rubber Type Gantry crane) or Quay-wall crane.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.1-14
• /
• 2000

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.117-125
• /
• 2004

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.263-268
• /
• 2005

Nowadays, the vessel size is tending to be bigger and bigger, so port facilities are following this trend, which has been shown inthe competition of Hub-Port among the main ports such as Port of Busan and Port of Shanghai. But there are limited numbers of large container vessels and $70\%$ of the call ships at Busan port are middle and small sized ships which are less than 20,000ton. So we need to consider the handling facilities for these sized ships, but it has disregarded. In this paper, we estimate the optimum level of crane and labor according to vessel's size by container handling cost value reflecting size of vessel; size and number of crane and labor structure.

• Journal of Navigation and Port Research
• /
• v.31 no.10
• /
• pp.869-877
• /
• 2007

This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.

• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.837-844
• /
• 2008

In an automated container terminal, various factors affect the operation of container handling equipment such as quay cranes and AGVs, and thus calculating the exact operation time is nearly infeasible. This uncertainty makes it difficult to dispatch AGVs well. In this paper, we propose a simulation-based AGV dispatching algorithm When dispatching an AGV to an operation, the proposed algorithm conducts multiple stochastic simulation for the succeeding AGV operations for the predetermined period to collect stochastic samples of the result of the dispatching. In the stochastic simulation, the uncertainty of crane operations is represented as a simple probability distribution and the operation time of a crane is determined according to this. A dispatching option is evaluated by the total delay time of quay cranes which is estimated by averaging the quay crane delay of each simulation In order to collect a sufficient number of samples that guarantee the credibility of the evaluation, we devised a high-speed simulator that simulates AGV operation The effectiveness of the proposed algorithm is validated by simulation experiments.

• Journal of Navigation and Port Research
• /
• v.32 no.6
• /
• pp.459-464
• /
• 2008

In this paper, we present the model-based fuzzy controller for container cranes which effectively performs set-point tracking control of trolley and anti-swaying control under system parameter and disturbance changes. The first part of this paper focuses on the development of Takagi-Sugeno (T-S) fuzzy modeling in a nonlinear container crane system. Parameters of the membership functions are adjusted by a RCGA to have same dynamic characteristics with nonlinear model of a container crane. In the second part, we present a design methodology of the model-based fuzzy controller. Sub-controllers are designed using LQ control theory for each subsystem in fuzzy model and then the proposed controller is performed with the combination of these sub-controllers by fuzzy IF-THEN rules. In the results of simulation, the fuzzy model showed almost similar dynamic characteristics compared to the outputs of the nonlinear container crane model. Also, the model-based fuzzy controller showed not only the fast settling time for the change in parameter and disturbance, but also stable and robust control performances without any steady-state error.

• Management Science and Financial Engineering
• /
• v.6 no.2
• /
• pp.47-67
• /
• 2000

It is discussed how to assign delivery tasks to automated guided vehicles (AGVs) for multiple container cranes in automated container terminals. The primary goal of dispatching AGVs is to complete all the lading and discharging operations as early as possible, and the secondary goal is to minimize the total travel distance of AGVs. It is assumed that AGVs are not dedicated to a specific container crane but shared among multiple cranes. A mathematical formulation is developed and a heuristic algorithm is suggested to obtain a near optimal solution with a reasonable amount of computational time. The single-cycle and the dual-cycle operations in both the seaside and the landside operations are analyzed. The effects of pooling AGVs for multiple container cranes on the performance of an entire AGV system are also analyze through a numerical experiment.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.10a
• /
• pp.82-83
• /
• 2012

To achieve higher customer service, the operational efficiency of container terminal is important. So, to improve loading/unloading speed and reduce the time spending of berth, efficient ship planning is performed in advance. But, the condition of container terminal can be changed frequently and the pre-planning is not enough to operate container terminal sufficiently, so that we need real-time planning. This paper aims to define the problem of job reallocation of quay crane to minimize total operation time, and find the solution.