• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.361-368
• /
• 2010

It is general that mostly congested sections of national backbone networks have been improved based on the national network expansion plan. However, in case of intermodal terminals which are origins of logistics, it is still so congested that travel time between origin and destination is long. Therefore, intermodal transportation systems plan of major intermodal terminals for the intermodal connector networks between intermodal terminal and national backbone network or intermodal terminal was established. With the limitation of priority methodology applying to intermodal connector facility under existing methodology, this study suggests an improved priority methodology. This study includes characteristics of terminal on the hierarchical structure and assessment list, but it does not concentrate on the specific terminal type through survey. To avoid a certain concentration, budget constraint for each terminal type was considered ahead of priority. Finally priority methodology was developed with two-step assessment under consideration that specific terminal is not involved in intermodal connector facility project. As a result of calculating weights by survey, effects such as d/c and accessibility fluctuations index through project implementation gain high weight, and degree of region underdevelopment gets next. Although the methodology in this study could not yields the priority by assessment list, it will be useful for setting the direction on policy related to intermodal connector facility projects.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.145-170
• /
• 2005

This paper presents scheduling models for dispatching vehicles to accomplish a sequence of container jobs at the container terminal, in which the starting times as well as the order of vehicles for carrying out these jobs need to be determined. To deal with this scheduling problem, three mixed 0-1 integer programming models, Model 1, Model 2 and Model 3 are provided. We present interesting techniques to reformulate the two mixed integer programming models, Model 1 and Model 2, as pure 0-1 integer programming problems with simple constraint sets and present a lower bound for the optimal value of Model 1. Model 3 is a complicated mixed integer programming model because it involves a set of non-smooth constraints, but it can be proved that its solutions may be obtained by the so-called greedy algorithm. We present numerical results showing that Model 3 is the best among these three models and the greedy algorithm is capable of solving large scale problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.1
• /
• pp.21-32
• /
• 1985

Presented in this paper is a procedure of developing graphical simulation software for planning robot welding processes. Welding is by far the highest application area for industrial robots, and it has been in great need of such a simulator in designing robot work cells, in justifying the economics of robot welding and in planning robotized welding operations. The model of a robot welding cell consists of four components: They are an welding structure which is a collection of plates to be welded, a positioner to hold the welding structure, a robot with a weld torch, and a set of welding lines (in case of arc welding). Welding structure is modeled by using the reference plane concept and is represented as boundary file which is widely used in solid modeling. Robot itself is modeled as a kinematic linkage system. Also included in the model are such technical constraints as weaving patterns and inclination allowances for each weld joint type. An interactive means is provided to input the welding structure and welding lines on a graphics terminal. Upon completion of input, the program displays the welding structure and welding lines and calculates the center of mass which is used in determining positioner configurations. For a given positioner and robot configuration, the welding line segments that can be covered by the robot are identified, enabling to calculate the robot weld ratio and cycle time. The program is written in FORTRAN for a VAX computer with a Tektronix 4114 graphic terminal.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.90-95
• /
• 2022

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.11
• /
• pp.973-980
• /
• 2016

An air traffic management (ATM) has been studied in a variety of fields to utilize an air traffic capacity efficiently and solve a congested air traffic situation due to an increment of an air traffic demand. In this paper, an air traffic management, which is related with controlling and determining the sequencing of an aircraft approaching to an airport, in terminal control area is studied. This paper focuses on scheduling algorithms with a given problem for the air traffic management with operational constraints, such as a space separation, an overtaking on the same air-route, and a route merge point (a scheduling point). For a real-time calculation, the presented algorithms focus on dispatching heuristic rules which are able to assign tasks in a fast time period with an adequate performance, which can be demonstrated as a proper and realistic scheduling algorithm. A simulation result is presented to illustrate the validity and applicability of the proposed algorithm. Each scheduling rule is analyzed on the same static and dynamic air traffic flow scenario with the ATM Monte-Carlo simulation.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.385-386
• /
• 2022

Currently, global developed countries in shipping and logistics establish smart ports by introducing various digital technologies such as automated terminals and sharing platforms. This means that the importance of efficiency throughout the port by improving resource utilization efficiency and minimizing work idle time is increasing. Therefore, this study proposes a yard truck dispatching method of improving resource utilization efficiency. And we analyze the problems of the existing dispatching rules and develop Y/T dispatching algorithm that comprehensively considers related constraints. In addition, the simulation takes into account the terminal congestion based on the operation data of the Busan New Port, it is conducted using the existing dispatch method and developed Y/T dispatching algorithm. And the operational effects of analysis result are evaluated.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.31-34
• /
• 2004

In wireless communication systems, low-power metrics is becoming a burdensome problem in the portable terminal design, because of portability constraints. This paper presents design architecture of a low-power partial correlation Digital Matched Filter for the IMT-2000 communication systems. The proposed approach focuses on efficient circuit size, power dissipation, maintaining the operating throughput. The proposed architecture was verified by using Xilinx FPGA.