• 정보처리학회논문지A
• /
• 제10A권5호
• /
• pp.519-528
• /
• 2003

컨테이너 터미널에서느 매일 24시간, 365일 운영하는 데에 있어서 다양한 의사결정을 필요로 하며, 이 모든 의사결정들은 상호 관계를 가지게 된다. 이러한 의사결정의 궁극적인 목표는 선박 작업시간, 작업 처리를 위해 사용되는 자원들, 터미널 내부 도로의 혼잡도 등을 최소화하는 것이다. 또한 필요한 저장 공간을 효율적으로 이용하는 것이다. 따라서 컨테이너 터미널의 운용 효율을 더 한층 강화하기 위해서는 이러한 의사결정의 범위와 복잡성이 더해지게 되어 의사결정 도구의 필요성이 강조될 수 밖에 없다. 이 논문은 이러한 목적을 위해 의사결정시스템을 위한 평가요소들을 도출하고, 의사결정시스템 설계에 가장 큰 영향을 주는 평가요소, 즉 야드장치장 배경, RTGC 배정, QC당 YT 배정의 최적화 전략을 제안한다. 그리고 G2 언어를 상요한 시뮬레이션에 의해 의사결정시스템 설계의 효율성을 선박작업시간 비교를 통하여 평가한다.

• 항공우주기술
• /
• 제12권2호
• /
• pp.57-63
• /
• 2013

정지궤도에서 운용되는 많은 위성들이 통신방송을 목적으로 하고 있기 때문에 전력 요구량이 크고 이에 따라 대용량의 태양전지판이 필요하다. 최근에는 정지궤도에 통신방송 이외에 기상을 비롯한 지구환경 관측을 목적으로 하는 위성들이 개발되는 추세이다. 이러한 관측 위성의 탑재체는 감지기의 열환경 조건이 매우 중요하기 때문에 열원으로 작용되는 태양전지판을 제거하고 대신에 자세 안정도를 확보하기 위해 붐을 사용한다. 다른 방법으로 모멘텀 용량이 큰 휠을 장착하여 비대칭 태양전지판 형상으로 인해 태양에 의한 외란을 휠이 흡수하는 자세제어 방식을 사용하고 있다. 본 논문에서는 완벽한 비대칭 태양전지판 형상의 천리안위성에서 사용하고 있는 휠배치와 그에 적합한 휠모멘텀조정에 관하여 분석하고 현재 운용되고 있는 텔레메트리를 통해 그 결과를 검증하였다.

• 한국항해학회지
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제22권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.

• 한국경영과학회지
• /
• 제29권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.

• 대한산업공학회지
• /
• 제19권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.

• 대한산업공학회지
• /
• 제15권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
• /
• 제10권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.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• 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%.

• 대한교통학회지
• /
• 제23권5호
• /
• pp.157-167
• /
• 2005

서울시 통합대중교통체계개편에 의한 준공영제 및 거리비례오금제의 시행으로 대중교통 수입금정산문제가 한국철도공사, 서울지하철공사, 서울특별시도시철도공사, 인천지하철공사의 기존도시철도운영기관의 수입금 배분 문제가 내재된 상태에서 버스와 도시철도의 수단간 배분문제까지 포함하는 복잡한 문제로 전개되었다. 또한 추가로 계획되고 있는 민자노선, 지자체의 경전철 도입계획으로 향후 대중교통수입금 정산은 보다 다양한 운영기관 및 지역의 협상문제로서 매우 복잡하게 전개될 것으로 예상되고 있다. 본 연구는 대중교통운영기관의 수입금 배정의 기본접근모형을 제시하는 것으로, 운영기관이 통합대중교통망에서의 승객수송에 기여한 정도를 파악하는 것을 핵심으로 하고 있다. 이를 위해 향후 전자지불시스템이 완비되었을 상황을 가정하여 이때에서 환승구간 때문에 승객의 통행행태가 파악되지 않는 수도권 도시철도로 한정하여 역간의 (복수의) 통행경로를 파악하고 수요를 배정하여 운영기관의 인-Km등의 기여도를 계산하는 방안을 제안하다. 본 연구의 주요내용을 요약하면 다음과 같다. 1. 도시철도의 승객의 환승행태를 반영한 일반화 비용. 2. 역간 유사경로결정을 위한 K경로알고리즘. 3. 유사경로에 수요배정모형.