• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.645-660
• /
• 1997

An application of the genetic algorithm(GA) to the loading sequencing problem in port container terminals is presented in this paper. The efficiency of loading operations in port container terminals is highly dependent on the loading sequence of export containers. In order to sequence the loading operation, we hove to determine the route of each container handling equipment (transfer crane or straddle carried in the yard during the loading operation. The route of a container handling equipment is determined in a way of minimizing the total container handling time. An encoding method is developed which keeps intermediate solutions feasible and speeds up the evolution process. We determine the sequence of each individual container which the container handling equipment picks up at each yard-bay as well as the visiting sequence of yard-bays of the equipment during the loading operation. A numerical experiment is carried out to evaluate the performance of the algorithm developed.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.167-174
• /
• 1998

Recently several researches of high speed container ship and loading system are mainly accomplished in U.S.A. and Japan. Its shipping service is not realized but it is realized in near future. To effective use of the feature and efficiency of them, quay, loading/unloading. yard operation system, port management system and connection transport system must be well integrated and operated. Specially, loading /unloading speed of container crane is important for making effective use of them. To speed up loading/unloading system, RO-RO and LO-LO methods that are mostly exclusive system are studied on the container crane with special structure and mechanism to handle individual container or bundle of containers. In this paper these methods are shown. When new high speed loading system of container is desighed, the realistic constrains must be considered.

• 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 the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.201-208
• /
• 2005

Recently, the container terminal requires the study of method to increase efficiency through change of its operation method. Loading plan is a very important part to increase the efficiency of container terminal. Loading Plan is largely divided into two cases, deciding loading location and loading scheduling and this Paper proposes a more efficient method of container loading scheduling. Container loading scheduling is a problem of combination optimization to consider several items of loading location and operation equipments. etc. An existing method of cluster composition that decides the order of container loading scheduling has a restriction to increase the efficiency of work owing to rehandling problem. Therefore, we Propose a more efficient method of container loading scheduling which composes containers with identical attribution, based on ship loading list and yard map, into stack units of cluster, applying to hierarchical clustering method, and defines the restriction of working order. In this process, we can see a possible working path among clusters by defining the restriction of working order and search efficiency will be increased because of restricted search for working path.

• Journal of Intelligence and Information Systems
• /
• v.29 no.4
• /
• pp.375-393
• /
• 2023

The demand for Less than Container Load (LCL) has been on the rise due to the growing need for various small-scale production items and the expansion of the e-commerce market. Consequently, more companies in the International Freight Forwarder are now handling LCL. Given the variety in cargo sizes and the diverse interests of stakeholders, there's a growing need for a container loading algorithm that optimizes space efficiency. However, due to the nature of the current situation in which a cargo loading plan is established in advance and delivered to the Container Freight Station (CFS), there is a limitation that variables that can be identified at industrial sites cannot be reflected in the loading plan. Therefore, this study proposes a container loading methodology that makes it easy to modify the loading plan at industrial sites. By allowing the characteristics of cargo and the status of the container to be considered, the requirements of the industrial site were reflected, and the three-dimensional space was manipulated into a two-dimensional planar layer to establish a loading plan to reduce time complexity. Through the methodology presented in this study, it is possible to increase the consistency of the quality of the container loading methodology and contribute to the automation of the loading plan.

• International Journal of Ocean System Engineering
• /
• v.2 no.3
• /
• pp.170-175
• /
• 2012

Currently, most logistics use containers. The construction of new port and high speed medium size container ship for the transportation of merchandise have become very important. The problem of ship stability is also important because of its direct influence on the loss of human life, ships, and merchandise. The stability of a container ship during its operation is not a large problem because it is well considered in the design process. However, the assessment of ship stability during container loading/unloading in port still depends on the expertise of experienced personnel. In this paper, a model based simulation system is introduced, which is able to assess ship stability during container loading/unloading, using ENVISION, a general purpose simulation system.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.242-248
• /
• 2003

In this paper, we propose a new heuristic solution for 3D container packing problem for the variable size and the variable kind of freights. First we consider the total cost of container charges, i.e., loading, transportation and handling charges, where the priority of each frights are dealt. By minimizing the total cost of container charges, the kinds of container and its number can be decided automatically. From these factors, we con determine the position in the container and the loading sequence into the container. Finally, by equivalence of freight's weight in container, we can prevent the freight's damage on the handling.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• 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 Navigation and Port Research
• /
• v.28 no.6
• /
• pp.531-539
• /
• 2004

In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight. Frist of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified The types of containers and its number to be loaded am be selected automatically by minimizing the total cost of container charge. Maximization of loading space am be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be packing into the container. In container packing simulation, we can verify that the proposed heuristic algorithm indicates more efficiency space utilization and shows the possibility of using on commercial business.