• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.22-37
• /
• 2004

An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are applied in selecting loading positions and boxes to be loaded, so that the volume utilization is maximized. Several loading constraints such as box orientation, stack priority, stack stability, and container stability are also incorporated into the algorithm. In general, our computational results based on randomly generated data and problems from the literature suggest that the proposed heuristic provides a good solution in a reasonable amount of computational time.

• Journal of Korea Multimedia Society
• /
• v.21 no.4
• /
• pp.513-526
• /
• 2018

Container load problems are conventional issues in history. Loading cylindrical or rectangle packages in restricted space is required to be efficient to minimize remaining area. Many people have depended on experience or known simple algorithms for a long time. Recently systematic algorithms are published over the world with developed computer technology. Maximal rectangles algorithm is well known to load arbitrary rectangles in a larger rectangle container with the organized manners. However, this algorithm has significant drawbacks, which are influenced by orientation of input load. We propose post-selective method to complement these orientation effects, which is found out to improve the loading efficiency.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.156-165
• /
• 2005

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper, This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

• Journal of Ocean Engineering and Technology
• /
• v.13 no.2 s.32
• /
• pp.18-25
• /
• 1999

Western coastal ports of Korea experience severe tidal range with up to 9.7 meter between high and low tides. The significant water level variation implicates many operational difficulties during loading and un-loading from cargo ships. To overcome problems due to tide and to secure the continuous loading operation, a new loading system for container cargo called "container pallet system" is developed and introduced in the paper. Three types of structure forms, offshore structural deck, double bottom structural form and the mixed form, are inverstigated with MSC/NASTRAN software. The results prove that the mixed type structure with truss enforcement is found to be the most appropriate for the region.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.3
• /
• pp.143-157
• /
• 2006

The purpose of this thesis is to develop a heuristic algorithm evaluating the layout to maximize number of boxes when a single-box-type is packed into a container. Actually because three-dimensional problems are involved in NP-complete, much study has been focused on heuristic algorithms. The basic concept of this study is as follows. The problem is solved as palletizing problems with each side of the container respectively. By using the height of boxes, the problem is extended to a three-dimensional problem. Consequently, through this thesis, we can get good solution and the result is displayed by three-dimensional computer graphic.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.5
• /
• pp.362-368
• /
• 2014

Container vessel sizes have constantly increased over the past two decades. With increasing ship sizes and higher container loading capacities, the adoption of lashing bridges has also increased. Today's lashing bridge designs range from 1st tier to 3rd tier lashing bridges. Container securing program of the past which is based on two lashing rods and 1st tier lashing bridge has to be improved to be suitable for the present time. The equilibrium equations in this study are established to cover the application of 3~4 lashing rods and 2nd~3rd tier lashing bridges. In addition developed program is improved to be able to calculate the reaction forces and optimum arrangement under the external lashing. An optimization algorithm which is suitable for the container securing problems involved the equality constraint has been also adopted in this study.

• Industrial Engineering and Management Systems
• /
• v.11 no.1
• /
• pp.103-113
• /
• 2012

A yard in a container terminal is a temporary storage space before containers are loaded onto the target vessel or delivered to consignees. For improving the utilization of the space in the yard and the efficiency of loading and discharging operations, it is important that operation plans must be carefully constructed in advance. A heuristic method is suggested to solve operation space planning problems considering workloads on handling equipment as well as space availabilities. The operation plans in this paper includes quay crane (QC) schedules and space plans for multiple vessels considering the workload in the container yard of container terminals. This paper evaluates the effectiveness of a space planning method and the performance of a new QC scheduling method using a simulation model.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.17-29
• /
• 2010

A container terminal productivity is maximized by a minimized time for processing containers. So, we have been elevated the container terminal productivity through an improvement of computing system, but there are a limitation because of problems for transportation management and method. A Y/T(Yard Tractor), which is a representative transportation, is able to do only one process, loading or unloading, at one time. So if the Y/T can do loading and unloading step by step at a same time, the processing time would be shortened. In this paper, we proposed an effective operating process of Y/T(Yard Tractor) Multi-Cycle System by applying RTLS(Real Time Location System) to Y/T(Yard Tractor) in order to improve the process of loading and unloading at the container terminal. For this, we described Multi-Cycle System. This system consists of a real time location of Y/T based on RTLS, an indicating of Y/T location in real time with GIS technology, and an algorithm(Dijkstra's algorithm) of the shortest distance. And we used the system in container terminal process and could improve the container terminal productivity. As the result of simulation for the proposed system in this paper, we could verify that 9% of driving distance was reduced compared with the existing rate and 19% of driving distance was reduced compared with the maximum rate. Consequently, we could find out the container performance is maximized.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.1
• /
• pp.27-36
• /
• 2012

The mobile harbor is a new concept system to solve the problems of a port. These problems are that container ships cannot be anchored at the dock because they have become larger or the waiting times of anchoring the ships are increased due to heavy container traffic. A new system is designed to carry out the loading and unloading of containers between the mobile harbor and the container ship using the mobile harbor crane at sea. The crane plays an important role when transferring the containers. In this research, various types of the mobile harbor crane are proposed and structural optimization for each type of the crane is carried out. The loading conditions consider the rolling and pitching conditions of the unstable sea state and the wind force are considered. The constraints are mainly the regulations made by the Korean Register of Shipping. The structure of the crane is optimized to minimize the mass while various constraints are satisfied.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1095-1101
• /
• 2020

Vessels or aircraft should be loaded with containers or cargo to maintain weight balance in order to be stable when navigating the route. The container loading algorithm is known as the NP problem and several heuristic methods have been studied. Containers can be characterized by the uniform volume and weight, which makes it easier to find an optimal loading method. In this paper, we propose an algorithm for weight balance when the volume and weight of an object are uniform. It is assumed that the loading space has a special structure of m * n mesh (where m and n are both odd). In this case, we designed a greedy algorithm and proved that the algorithm is optimal in that it can always find a loading position that maintains a weight balance regardless of the number of objects. Our algorithm can be used in many engineering problems, such as loading algorithms and load balancing problems.