• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.519-528
• /
• 2003

Container terminals need decisions in the course of daily-24 hour and 365 day - operations, and all these decisions are inter-related. The ultimate goal of Decision Support System is to minimize ship loading/unloading time, resources used to handle the workload, and congestion on the roads inside the terminal. It is also to make the best possible use of the storage space available. Therefore, the necessity of decision support tools are emphasized to enhance the operational efficiency of container shipping terminals more, because of limits and complexity of these decisions. So, in thia paper, we draw evaluation items for Decision Support Systems and suggest optimization strategy of evaluation items which have the greatest influence on Decision Support system, that is, yard stacking allocation, RTGC deployment among blocks, and YT allocation to QCs. We also estimate the efficiency of Decision Support System design by simulation using G2 language, comparing ship loading/unloading time.

• Aerospace Engineering and Technology
• /
• v.12 no.2
• /
• pp.57-63
• /
• 2013

The mission of a lot of satellites on geostationary orbit is the communication and/or the broadcasting. These satellites need a big power, so these have a large solar array. Recently, the new satellite for Earth environment monitoring is developing on geostationary orbit. The payload of Earth monitoring satellite requires better thermal condition on detector. Therefore this satellite uses a boom for the attitude stability instead of rejecting one-side solar array as a heat source. The other hand, it uses some momentum wheels being a more momentum capacity to control the large disturbance by solar pressure due to the asymmetric solar array configuration. In this paper, the analysis on the wheel allocation and the wheel off-loading for COMS is summarized and the results are verified by telemetry of COMS. COMS has no boom and a perfectly asymmetric solar array configuration, and it is operating well on geostationary orbit.

• Journal of the Korean Institute of Navigation
• /
• v.8 no.1
• /
• pp.1-16
• /
• 1984

The economical property of a shipping enterprise, as well as other transportation industries, is determined by the difference between the freight earned and expense paid. This study can be regarded as a division of optimizing ship allocation to routes under the integrated port transport system. Fleet planning and scheduling require complicated allocations of cargoes to ships and ships to routes in order to optimize the given criterion function for a given forecast period. This paper deals with the optimum ship allocation problem minimizing the operating cost of ships in a shipping company. Optimum fleet operating for a shipping enterprise is very important, since the marine transportation is a form of large quantity transport requiring long-term period, and there is a strong possibility to bring about large amount of loss in operation resulting from a faulty ship allocation. Where there are more than one loading and discharging ports, and a variety of ship's ability in speed, capacity, operating cost etc., and when the amount of commodities to be transported between the ports has been determined, then the ship's schedule minimizing the operating cost while satisfying the transport demand within the predetermined period will be made up. First of all a formula of ship allocation problems will be established and then will be constructed to solve an example by the Integer Programming application after consideration of the ship's ability, supply and demand of commodity, amount of commodity to be transported, operating costs of each ship etc. This study will give good information on deciding intention for a ship oprator or owner to meet the computerization current with shiping management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1302-1310
• /
• 1997

In this paper, we propose a dynamic code allocation strategy using voice activity detection and evaluate the performance of a dynamic code allocation strategy using voice activeity detection in DS-CDMA system. Proposed method allocates code to mobile terminal according to the residual capacity computed by SIR in the base station. In hot spot traffic loading cell, we find that the performance of proposed method is better than that of a fixed code assignment strategy using voice activity detection. Also, we find that the proposed method provide much improvement in blocking probability against the dynamic code assignment strategy withoug voice activity detection.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.4
• /
• pp.41-48
• /
• 1993

Prime advantage of flexible manufacturing systems(FMS) is a flexibility. Flexibility is expected to prolong the service life of a manufacturing facility and enable it to respond quickly and economically to dynamic market change. The FMS loading decision is concerned with the allocation of operations and tools to machines subject to technological and capacity constraints of the system. Modern FMS loading problem has the multiple objectives such as processing cost, time and work load balance. We propose multi-objectives which could be used to formulate the loading/routeing problem and sequencing decision which should be adopted for each part type in order to maximize the machine flexibility by Hamming distance matrix based on Incidance matrix. Finally, a numerical example is provided to illustrate the proposed model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.65-75
• /
• 1989

This study complements the previous studies on workload distribution problems in Flexible Manufacturing Systems. Specifically, we consider the problem in two perspectives, the long-range policy and the short and medium-term planning and control. The long-term loading policy focusses on identifying the optimal loading of the system characterized by either balanced loading or unique unbalanced loading for which a steepest ascent method is developed. These results are then applied to study the optimal medium and short-term planning and control problems, for which a truncated dynamic programming method is developed in order to obtain the optimal allocation of the given operation mix of part types to work stations.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.163-175
• /
• 2014

This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was proposed. It was also based on ordered sub-carrier selection. We compared both of these algorithms to an optimal bit-loading solution to determine their effectiveness in a correlated fading environment. The correlated fading was simulated using the JTC channel models. Our intent was not to create an optimal solution, but to create a low complexity solution that can be used in a wireless environment in which the channel conditions change rapidly and that require a simple algorithm for fast bit loading.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.263-268
• /
• 2001

In this paper, we present a new heuristic algorithm fur buffer allocation in FMS (Flexible Manufacturing System). It is conducted by using a genetic algorithm and simulation. First, we model the system by using a simulation software, \"Arena\". Then, we apply a genetic algorithm to achieve an optimal solution. VBA blocks, which are kinds of add-in functions in Arena, are used to connect Arena with the genetic algorithm. The system being modeled has seven workstations, one loading/unloading station, and three AGVs (Automated Guided Vehicle). Also it contains three products, which each have their own machining order and processing times. We experimented with two kinds of buffer allocation problems with a proposed heuristic algorithm, and we will suggest a simple heuristic approach based on processing times and workloads to validate our proposed algorithm. The first experiment is to find a buffer profile to achieve the maximum throughput using a finite number of buffers. The second experiment is to find the minimum number of buffers to achieve the desired throughput. End of this paper, we compare the result of a proposed algorithm with the result of a simple buffer allocation heuristic based on processing times and workloads. We show that the proposed algorithm increase the throughput by 7.2%.t by 7.2%.

• Journal of Korean Society of Transportation
• /
• v.23 no.5 s.83
• /
• pp.157-167
• /
• 2005

Seoul metropolitan public transport reform results in the introduction of the semi-public operation and distance-based fare policies. With implementation of these policies, public transport revenue allocation has been (will be) evolved very complicated because the existing revenue allocation issues have not only been clearly solved, which is generated by the combined relationship among Korea Railroad Corporation (KRC). Seoul Metropolitan Subway Corporation (SMSC). Seoul Metropolitan Rapid Transit Corporation (SMRTC), and Incheon Rapid Transit Corporation (IRTC), but also the revenue allocation problem between bus and urban railroad-related organizations need to be considered in this combined framework. On top of that. based on the future plans such as the private sector's railroad construction plan(s), the light rail transit construction plans of several local governments and the join of remained bus lines of Seoul metropolitan areas, it is understood that the revenue allocation among public transport operating organization will become one of main issues of operation organization as well as local and central governments. As a basic approach for revenue allocation of public transport operation organizations, the purpose of this paper is to propose an integrated model applicable to estimate degree of service contribution in passenger carriage in the combined public transport network. With a hypothesis that the complete electronic card system is deployed, this paper supposes every passenger's loading and alighting stations is recordable. Thereby, this paper limits research scope as to Seoul metropolitan railroad area since used route(s) between origin and destination stations can not be traceded because transfer stations each passenger path through is not recorded. Each model proposed in the paper is as follows: 1. a generalized cost reflecting passenger's transfer behavior; 2.a K path model for determining similar routes between O-D; 3.an assignment model for loading O-D trips onto the detected similar routes using Logit Model.