• 제목/요약/키워드: Realistic Problem

검색결과 546건 처리시간 0.034초

Fuzzy 계확법의 해법일반화에 관한 연구 (A Study on the Extension of Fuzzy Programming Solution Method)

  • 양태용;김현준
    • 한국경영과학회지
    • /
    • 제11권1호
    • /
    • pp.36-43
    • /
    • 1986
  • In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.

  • PDF

ATTITUDE AND CONFIGURATION CONTROL OF FLEXIBLE MULTI-BODY SPACECRAFT

  • Choi, Sung-Ki;Jone, E.;Cochran, Jr.
    • Journal of Astronomy and Space Sciences
    • /
    • 제19권2호
    • /
    • pp.107-122
    • /
    • 2002
  • Multi-body spacecraft attitude and configuration control formulations based on the use of collaborative control theory are considered. The control formulations are based on two-player, nonzero-sum, differential game theory applied using a Nash strategy. It is desired that the control laws allow different components of the multi-body system to perform different tasks. For example, it may be desired that one body points toward a fixed star while another body in the system slews to track another satellite. Although similar to the linear quadratic regulator formulation, the collaborative control formulation contains a number of additional design parameters because the problem is formulated as two control problems coupled together. The use of the freedom of the partitioning of the total problem into two coupled control problems and the selection of the elements of the cross-coupling matrices are specific problems ad-dressed in this paper. Examples are used to show that significant improvement in performance, as measured by realistic criteria, of collaborative control over conventional linear quadratic regulator control can be achieved by using proposed design guidelines.

A Practical Network Design for VoD Services

  • Lee, Hoon
    • 한국통신학회논문지
    • /
    • 제34권3B호
    • /
    • pp.225-234
    • /
    • 2009
  • Recently IPTV service is penetrating to the ordinary home users very swiftly. One of the first phase of IPTV service is considered to be VoD, and a nationwide availability of the VoD service imposes tremendous pressure to the network resource due to its requirements for the broad bandwidth, the inherent nature of unicast technology, and the large scalability, etc. This work suggests a novel and practical method to the design of network resource for the VoD service. Especially, we explore the distributed content storage problem that takes into account the popularity of the video contents and its corresponding link dimensioning problem that takes into account the grade of service for the flow level quality of service about the VoD service. By assuming a realistic topology for the nationwide IP backbone network of Korea, which is a typical tree topology, we suggest an analytic method for the design of VoD service.

다목적을 고려한 FMS작업할당/경로선정과 분배규칙에 관한 연구 (A loading and sequencing problem in a random FMS)

  • 장영기;조재용
    • 산업경영시스템학회지
    • /
    • 제19권37호
    • /
    • pp.201-210
    • /
    • 1996
  • Although FMS implementation in Korea is not yet mature, the worldwide empirical data shows the diffusion of FMS is inevitable in near future. As the reletionships between the high capital cost and the relative benefits and advantages are complex to analyse, it is rather beneficial to prepare the effective operation strategies which exploit the FMS flexibility, such as machine loading with alternative routing and dispatching rules. This paper shows the formulation applying a goal programming model for the loading problem with objectives of minimizing the production cost and maximizing the machine utilization, including constraints such as machine tool capacity and demands, etc. A realistic random FMS model is developed for illustration. Since loading and dispatching are a composite of two interdependent tasks, simulation is made to investigate the interactions between the two.

  • PDF

원자로 기기 열수력 해석 코드에서 붕소 수송 방정식의 구현 (THE IMPLEMENTATION OF BORON TRANSPORT EQUATION INTO A REACTOR COMPONENT ANLAYSIS CODE)

  • 박익규;이승욱;윤한영
    • 한국전산유체공학회지
    • /
    • 제18권4호
    • /
    • pp.53-60
    • /
    • 2013
  • The boron transport model has been implemented into the CUPID code to simulate the boron transport phenomena of the PWR. The boron concentration conservation was confirmed through a simulation of a conceptual boron transport problem in which water with a constant inlet boron concentration injected into an inlet of the 2-dimensional vertical flow tube. The step wise boron transport problem showed that the numerical diffusion of the boron concentration can be reduced by the second order convection scheme. In order to assess the adaptability of the developed boron transport model to the realistic situation, the ROCOM test was simulated by using the CUPID implemented with the boron transportation.

동적 Job Shop 일정계획을 위한 유전 알고리즘 (A Genetic Algorithm for Dynamic Job Shop Scheduling)

  • 박병주;최형림;김현수;이상완
    • 한국경영과학회지
    • /
    • 제27권2호
    • /
    • pp.97-109
    • /
    • 2002
  • Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

다중사용자 OFDM 광대역 무선인터넷 시스템의 자원할당 방법 (Resouce Allocation for Multiuser OFDM Systems)

  • 정용주;백천현;김후곤
    • 한국경영과학회지
    • /
    • 제32권3호
    • /
    • pp.33-46
    • /
    • 2007
  • This study deals with the adaptive multiuser OFDM (Orthogonal Frequency Division Multiplexing) system which adjusts the resource allocation according to the environmental changes in such as wireless and quality of service required by users. The resource allocation includes subcarrier assignment to users, modulation method and power used for subcarriers. We first develop a general optimization model which maximizes data throughput while satisfying data rates required by users and total power constraints. Based on the property that this problem has the 0 duality gap, we apply the subgradient dual optimization method which obtains the solution of the dual problem by iteration of simple calculations. Extensive experiments with realistic data have shown that the subgradient dual method is applicable to the real world system, and can be used as a dynamic resource allocation mechanism.

Satellite Overquenching Problem

  • Yi, Suk-Young;Kimm, Tay-Sun
    • 한국우주과학회:학술대회논문집(한국우주과학회보)
    • /
    • 한국우주과학회 2009년도 한국우주과학회보 제18권2호
    • /
    • pp.34.3-34.3
    • /
    • 2009
  • We have investigated the recent star formation history of the nearby galaxies using the SDSS optical and Galex UV data. To everyone's surprise, we found that roughly 30 percent of elliptical galaxies had a residual star formation in the last billion years, suggesting that residual star formation has been common even in ellipticals. Galaxy evolution models based on semi-analytic prescriptions including AGN feedback reasonably reproduce the star formation properties of elliptical galaxies. However, we found that the current galaxy models miserably fail to reproduce the star formation properties of satellite disc galaxies in cluster environments. Satellite disc galaxies in models are overly star-formation quenched in comparison to observation. Detailed investigations led us to conclude that this is due to the use of inaccurate prescriptions for the gas content evolution in the model. I present a solution to the problem by adopting more realistic physical prescriptions.

  • PDF

An empirical study on the material distribution decision making

  • Ko, Je-Suk
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권2호
    • /
    • pp.355-361
    • /
    • 2010
  • This paper addresses a mathematical approach to decision making in a real-world material distribution situation. The problem is characterized by a low-volume and highly-varied mix of products, therefore there is a lot of material movement between the facilities. This study focuses especially on the transportation scheduler with a tool that can be used to quantitatively analyze the volume of material moved, the type of truck to be used, production schedules, and due dates. In this research, we have developed a mixed integer programming problem using the minimum cost, multiperiod, multi-commodity network flow approach that minimizes the overall material movement costs. The results suggest that the optimization approach provides a set of feasible solution routes with the objective of reducing the overall fleet cost.

AND/OR 그래프를 이용한 공정계획과 일정계획의 통합에 관한 연구 (A Study on Integration of Process Planning and Scheduling Using AND/OR Graph)

  • 김기동;정한일;정대영;박진우
    • 대한산업공학회지
    • /
    • 제23권2호
    • /
    • pp.323-341
    • /
    • 1997
  • Traditionally, the Process Planning problems and the Scheduling problems have been considered as independent ones. However, we can take much advantages by solving the two problems simultaneously. In this paper, we deal with the enlarged problem that takes into account both the process planning and the scheduling problems. And we present a solution algorithm for the problem assuming that the given process plan data is represented by AND/OR graph. A mathematical model(mixed ILP model) whose objective is the minimization of the makespan, is formulated. We found that we can get the optimal solutions of the small-size problems within reasonable time limits, but not the large-size problems. So we devised an algorithm based on the decomposition strategy to solve the large-scale problems (realistic problems) within practical time limits.

  • PDF