• Title/Summary/Keyword: near-optimal

Search Result 966, Processing Time 0.023 seconds

Two Echelon Inventory System With Stochastic Demand (확률적 수요를 가지는 2단계 재고 시스템)

  • 최규탁;김정자
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.15 no.26
    • /
    • pp.99-109
    • /
    • 1992
  • This paper presents a cost model of the system which is managed under a continuous review (Q,r) policy at each retailer and peridic review (R,T) policy at the central warehouse. An iterative procedure is performed to find the optimal or near-optimal' solution for the policy parameters at each retailers and a central warehouse in this study.

  • PDF

Man-machine control system analysis (Man-Machine 제어시스템 분석)

  • 이상훈;최중락;김영수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10b
    • /
    • pp.394-397
    • /
    • 1987
  • This paper presents an analysis of the man-machine control system. A man-machine system depends on the performance of a human operator for proper operation. The analysis method is based upon the assumption that human operator will act in a near optimal controller. Optimal control theory and its associated state space representation is used as the basis for the analytic procedure. The computer simulation for a given plant shows that plant parameters have limited range by the human operator.

  • PDF

The Analysis of the Optimal Control Problem for the System with the Generalized State Space Model (일반화된 상태모델로 주어진 시스템의 최적제어문제 해석)

  • Lee, Kwae-Hi
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.33 no.12
    • /
    • pp.491-496
    • /
    • 1984
  • The optimal control and filtering problems for the systems with the generalized state space model are considered and the generalized Riccati equation is derived. Also the algorithm for the solution of the generalized algebraic Riccati equation is developed and it is shown that the algotithm can be applied to the case where the matrix R is singular or near singular.

  • PDF

A design of binary decision tree using genetic algorithms and its application to the alphabetic charcter (유전 알고리즘을 이용한 이진 결정 트리의 설계와 영문자 인식에의 응용)

  • 정순원;김경민;박귀태
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.218-223
    • /
    • 1995
  • A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature or feature subset among all the available features is selected based on fitness function in genetic algorithm which is inversely proportional to classification error, balance between cluster, number of feature used. The proposed design scheme is applied to the handwtitten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

  • PDF

Optimal proportioning of concrete aggregates using a self-adaptive genetic algorithm

  • Amirjanov, Adil;Sobol, Konstantin
    • Computers and Concrete
    • /
    • v.2 no.5
    • /
    • pp.411-421
    • /
    • 2005
  • A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.

Effect of Degradation Processes on Optimal Remediation Design Sorption and First-Order Decay Rate

  • Park, Dong-Kyu;Ko, Nak-Youl;Lee, Kang-Kun
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2004.04a
    • /
    • pp.503-508
    • /
    • 2004
  • Optimal remediation design using the pump and treat(P&T) method and natural attenuation was accomplished in consideration for degradation processes, such as sorption and first-order decay rate. Variation of both sorption and first-order decay rate has influence on design of optimal remediation application. When sorption effect increases, the more pumping rate and pumping wells are required. The location of operated wells is on the centerline of contaminant plume and wells near hot spot are mainly operated when sorption effect increases. The higher of first-order decay rate, the less pumping rate is required. These results show that the degradation processes have to be considered as one of the essential factors for optimal remediation design.

  • PDF

Determining Optimal Installed Capacity and the Interconnected Bus of Renewable Energy Sources Considering the Cost of Energy Not Supplied (정전비용을 고려한 신재생에너지원의 최적 연계 용량 및 연계 위치 결정에 관한 연구)

  • Kim, Sung-Yul;Lee, Sung-Hun;Kim, Jin-O
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.10
    • /
    • pp.1393-1398
    • /
    • 2012
  • Due to environmental regulation and technical improvements, renewable energy sources (RES) are increasingly penetrated and operated in power systems. Clean energy technologies have become cost-competitive with conventional power systems, and in the near future, the generation cost of RES is expected to approach grid parity. In this situation, it should be considered an extraordinarily important issue to be maximized resulting in utilization of RES as well as to develop technologies for efficiency improvement of RES. Therefore, in this paper, the method for determining an optimal installed capacity and interconnected location of RES is proposed in order to minimize the cost of energy not supplied, which can contribute to improve distribution reliability.

타부탐색(Tabu Search)의 확장모델을 이용한 '외판원 문제(Traveling Salesman Problem)' 풀기

  • 고일상
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.10a
    • /
    • pp.135-138
    • /
    • 1996
  • In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

  • PDF

Optimal Microgrid Operation Considering Fuel Cell and Combined Heat and Power Generation (연료전지와 열병합 발전을 고려한 마이크로그리드의 최적 운용)

  • Lee, Ji-Hye;Lee, Byung Ha
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.5
    • /
    • pp.596-603
    • /
    • 2013
  • The increase of distributed power generation is closely related to interest in microgird including renuable energy sources such as photovoltaic (PV) systems and fuel cell. By the growing interest of microgrid all over the world, many studies on microgrid operation are being carried out. Especially operation technique which is core technology of microgrid is to supply heat and electricity energy simultaneously. Optimal microgrid scheduling can be established by considering CHP (Combined Heat and Power) generation because it produce both heat and electricity energy and its total efficiency is high. For this reason, CHP generation in microgrid is being spotlighted. In the near future, wide application of microgrid is also anticipated. This paper proposes a mathematical model for optimal operation of microgrid considering both heat and power. To validate the proposed model, the case study is performed and its results are analyzed.

New Fictitious Play Procedure For Solving Blotto Games (Blotto 게임을 풀기위한 새로운 근사해법 절차)

  • Lee, Jea-Yeong;Lee, Moon-Gul
    • Journal of the military operations research society of Korea
    • /
    • v.31 no.1
    • /
    • pp.107-121
    • /
    • 2005
  • In this study, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP converges to an optimal solution, and it may be the only realistic approach to solve large games. The algorithm uses dynamic programming (DP) to solve FP subproblems. Efficiency is obtained by limiting the growth of the DP state space. Blotto games are frequently used to solve simple missile defense problems. While it may be unlikely that the models presented in this paper can be used directly to solve realistic offense and defense problems, it is hoped that they will provide insight into the basic structure of optimal and near-optimal solutions to these important, large games, and provide a foundation for solution of more realistic, and more complex, problem