• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.165-177
• /
• 2010

This paper discusses a method for pricing the storage of inbound containers in a container yard. The pricing structure is characterized by a free-time-limit and a storage price for the storage time that extends beyond the free-time-limit. A cost model is developed from the viewpoint of a public terminal operator as well as a private terminal operator. Unlike a previous study on this issue, this study assumes that the retrieval times follow a discrete probability distribution, which is more realistic than the previous study. A solution procedure is suggested and illustrated by using numerical examples.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.442-450
• /
• 2005

One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy. in which outbound containers and inbound containers are mixed in the same block. and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other. The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

• IE interfaces
• /
• v.14 no.3
• /
• pp.255-262
• /
• 2001

Containerization of cargo transportation has been norm in the word wide maritime services, but containerized trades are typically unbalanced in terms of the number of inbound and outbound containers. Therefore it is critical for shipping companies to find operating policy such as the repositioning of empty containers or replenishing of short-term leasing containers from leasing companies to satisfy the freighter's demands of containers. This paper develops a simulation model using ARENA to establish shipping company's operational policy to relocate and replenish empty containers. Furthermore, this study proposes simple and heuristic empty container repositioning rules to minimize the relevant cost in terms of leasing, repositioning, and inventory holding costs.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.125-137
• /
• 2006

One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy, in which outbound containers and inbound containers are mixed in the same block, and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1246-1250
• /
• 2011

This paper considers the container storage problem determining storage position of inbound containers in a container yard at a rail freight terminal. The objective of the problem is to minimize the total number of rehandles when storing/retrieving containers onto/from stacks in the yard. Rehandle implies the temporary removal from and placement back onto the stack to retrieval a target container. In order to solve the problem, we formulate the problem as a binary integer program.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.276-287
• /
• 2012

Determining storage locations of containers is an important issue for efficient operation of container terminals. This study assumes a storage yard with a horizontal layout in which blocks are laid out in parallel to the quay and trucks enter at the side of a block to deliver (receive) a container to (from) the yard crane. Various storage rules for determining storage locations of containers are introduced. Simulation studies are conducted for evaluating various rules. The following guidelines are derived from the result of our simulation study: when designing a block, consider a block configuration in which the longest gantry and the longest trolley travel times of rail-mounted gantry cranes (RMGCs) are similar; do not restrict the types of containers that can be stored in a storage area; if different roles are to be assigned to different storage areas, one possible way is to divide a bay into two areas so that some rows in the bay are allocated to inbound containers while the other rows in the same bay are allocated to outbound containers; reserve the space in bay unit for a high productivity of RMGCs but reserve the space in stack unit when the storage space is not enough; when the storage space is not sufficient, allocate storage location in a way of starting from the end and ending at the middle of a block; for reducing the travel distance of internal trucks, provide a higher priority to a block nearer to the berthing position of the corresponding vessel.

• Journal of Korean Port Research
• /
• v.13 no.2
• /
• pp.255-266
• /
• 1999

The purpose of this paper is to describe the design of the decision support system for container terminal ship planning and to introduce the implemented system. The ship planning in container terminals consists of three major decision processes -the working schedule of gantry cranes the discharging sequence of inbound containers the loading position and sequence of outbound containers. For making these decision the proposed system can provide two ship planning modes the interactive planning mode with user-friendly GUI and the automated planning made. To implement the automated planning routine we acquired the planning rules from the expert planner in container terminals and developed an expert system based on the rules. Finally we evaluated the system developed and the potential for commercialization by using container terminal data.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.203-208
• /
• 2004

The objective of this study is to analyze the efficiency of marshalling work using ATC(automated transfer crane) for ACT(automated container terminal). It is important fact to assignment of containers, because the character of ACT which block layout is vertical for berth and there are four other works which are inbound, oubound, loading and unloading in one block. And then there is need which assignment of containers with remarshaling work using ATCs in one block. Therefore, we analyze the efficiency of remarshaling work using simulation and suggest the assignment methodology of containers in yard

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.288-298
• /
• 2012

Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.233-242
• /
• 2015

This paper analyzes a multi-product inbound lot-sizing and outbound dispatching problem with multi-vehicle types in a third-party logistics distribution center. The product must be delivered to the customers within the delivery time window and backlogging is not allowed. Replenishing orders are shipped by several types of vehicles with two types of the freight costs, i.e., uniform and decreasing, are considered. The objective of this study is to determine the lot-size and dispatching schedules to minimize the total cost with the sum of inbound and outbound transportation and inventory costs over the entire time horizon. In this study, we mathematically derive a mixed-integer programming model and propose a genetic algorithm (GA1) based on a local search heuristic algorithm to solve large-scale problems. In addition, we suggest a new genetic algorithm (GA2) with an adjusting algorithm to improve the performance of GA1. The basic mechanism of the GA2 is to provide an unidirectional partial move of products to available containers in the previous period. Finally, we analyze the results of GA1 and GA2 by evaluate the relative performance using the gap between the objective values of CPLEX and the each algorithm.