• Title, Summary, Keyword: Dynamic Programming

Search Result 895, Processing Time 0.055 seconds

An Efficient Method for Multiple Sequence Alignment using Subalignment Refinement (부분서열정렬 개선 기법을 사용한 효율적인 복수서열정렬에 관한 알고리즘)

  • Kim, Jin;Jung, Woo-Cheol;Uhmn, Saang-Yong
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.803-811
    • /
    • 2003
  • Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However, dynamic programming cannot be applied to certain cost function due to its drawback and cannot be used to produce optimal multiple sequence alignment. We propose sub-alignment refinement algorithm to overcome the problem of dynamic programming. Also we show proposed algorithm can solve the problem of dynamic programming efficiently.

A Study of Multiple Dynamic Programming (Multiple dynamic programming에 관한 연구)

  • Young Moon park
    • 전기의세계
    • /
    • v.21 no.1
    • /
    • pp.13-16
    • /
    • 1972
  • Dynamic Programming is regarded as a very powerful tool for solving nonlinear optimization problem subject to a number of constraints of state and control variables, but has definite disadvantages that it requires much more computing time and consumes much more memory spaces than other technigues. In order to eliminate the above-mentioned demerits, this paper suggests a news technique called Multiple Dynamic Programming. The underlying principles are based on the concept of multiple passes that, instead of forming fin lattices in time-state plane as adopted in the conventional Dynamic Programming, the Multiple Dynamic Programming constitutes, at the first pass, coarse lattices in the feasible domain of time-state plane and determines the optimal state trajectory by the usual method of Dynamic Programming, and at the second pass again constitutes finer lattices in the narrower domain surrounded by both the upperand lower edges next to the lattice edges through which the first pass optimal trajectory passes and determines the more accurate optimal trajectory of state, and then at the third pass repeats the same processes, and so on. The suggested technique insures remarkable curtailment in amounts of computer memory spaces and conputing time, and its applicability has been demonstrated by a case study on the hydro-thermal power coordination in Korean power system.

  • PDF

An effcient algorithm for multiple sequence alignment (복수 염기서열 정렬을 위한 한 유용성 알고리즘)

  • Kim, Jin;Song, Min-Dong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.51-53
    • /
    • 1998
  • 3개 이상의 DNA 혹은 단백질의 염기서열을 정렬하는 복수 염기서열 정렬(multiple sequence alignment)방법은 염기서열들 사이의 진화관계, gene regulation, 단백질의 구조와 기능에 관한 연구에 필수적인 도구이다. 복수 염기서열 정렬문제는 NP-complete 문제군에 속하며, 이 문제를 해결하기 위하여 가장 유용하게 사용되는 알고리즘으로는 dynamic programming이 있다. Dynamic programming은 주어진 입력 염기서열 군들에 대한 최적의 정렬을 생산할 수 있다. 그러나 dynamic programming의 단점은 오랜 실행시간이 요구되며, 때로는 dynamic programming의 속성 때문에 이 알고리즘을 사용하여도 주어진 입력 염기서열 군들에 대한 최적의 정렬을 얻어내지 못하는 경우가 있다. 본 연구에서는 이러한 dynamic programming의 문제를 해결하기 위하여 genetic algorithm을 복수 염기서열 정렬문제에 적용하였다. 본 논문에서는 genetic algorithm의 design과 적용방법을 기술하였다. 본 연구에서 제안된 genetic algorithm을 사용하여 dynamic programming의 단점이었던 오랜 실행시간을 줄일 수 있었으며, dynamic programming이 제공하지 못하는 최적의 염기서열 정렬을 제공할 수 있었다.

  • PDF

Determination of Work Schedule Type by Dynamic Programming (동적계획모형을 이용한 근무형태 결정)

  • 김중순;안봉근;손달호
    • Korean Management Science Review
    • /
    • v.20 no.2
    • /
    • pp.33-43
    • /
    • 2003
  • In this paper we applied dynamic programming to determining work schedule type. In dynamic programming formulation, each day during a planning horizon represents a stage for which a decision is made. The alternatives are given by work schedule types that combine regular time, overtime, additional shift, and so on. In this case, their associated return function is labor cost. The state is defined as the amount of work time allocated to stage 1, stage 2,…, and current stage. A case study for a real manufacturing company was performed to apply dynamic programming to scheduling daily work hours during a week. The case study showed that total cost of our solution derived from dynamic programming decreased by about 6% as compared with the solution obtained from the previous method.

Approximate Dynamic Programming Strategies and Their Applicability for Process Control: A Review and Future Directions

  • Lee, Jong-Min;Lee, Jay H.
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.3
    • /
    • pp.263-278
    • /
    • 2004
  • This paper reviews dynamic programming (DP), surveys approximate solution methods for it, and considers their applicability to process control problems. Reinforcement Learning (RL) and Neuro-Dynamic Programming (NDP), which can be viewed as approximate DP techniques, are already established techniques for solving difficult multi-stage decision problems in the fields of operations research, computer science, and robotics. Owing to the significant disparity of problem formulations and objective, however, the algorithms and techniques available from these fields are not directly applicable to process control problems, and reformulations based on accurate understanding of these techniques are needed. We categorize the currently available approximate solution techniques fur dynamic programming and identify those most suitable for process control problems. Several open issues are also identified and discussed.

Energy Management Strategy of Hybrid Electric Vehicle Using Battery State of Charge Trajectory Information

  • Lee, Heeyun;Jeong, Jongryeol;Park, Yeong-il;Cha, Suk Won
    • International Journal of Precision Engineering and Manufacturing-Green Technology
    • /
    • v.4 no.1
    • /
    • pp.79-86
    • /
    • 2017
  • This paper presents a new energy management control strategy of a hybrid electric vehicle, using dynamic programming with preview driving cycle information. Dynamic programming is a promising solution for energy management problem of the hybrid electric vehicle, yet global optimality can only be achieved with preview driving cycle information due to its non-causal property. As recent driving cycle prediction algorithms facilitate the use of preview driving cycle information, rule-based energy management strategy of the hybrid electric vehicle using dynamic programming optimization is presented in this study, under the assumption that the preview driving cycle information is already given. The strategy is composed of dynamic programming calculation and the rule-based control strategy using that calculation. Dynamic programming analyzes optimal control and battery state of charge trajectory in accordance with the vehicle travel distance, with given predicted driving cycle information. The proposed rule-based strategy distributes vehicle's demand power into the engine and the electric motor, to follow target battery state of charge trajectory acquired from dynamic programming. To validate the control strategy, simulation is conducted on various standard driving cycles. The energy management strategy shows improved fuel economy performance for diverse driving cycles.

A Study on the Dynamic Programming for Control (제어를 위한 동적 프로그래밍에 관한 연구)

  • Cho, Hyang-Duck;Kim, Woo-Shik
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • /
    • pp.556-559
    • /
    • 2007
  • The notion of linearity is fundamental in science and engineering. Much of system and control theory is based on the analysis of linear system, which does not care whether it is nonlinear and complex. The dynamic programming is one of concerned technology when users are interested in choosing best choice from system operation for nonlinear or dynamic system‘s performance and control problem. In this paper, we will introduce the dynamic programming which is based on discrete system. When the discrete system is constructed with discrete state, transfer between states, and the event to induct transfer, the discrete system can describe the system operation as dynamic situation or symbolically at the logical point of view. We will introduce technologies which are related with controllable of Controlled Markov Chain as shown example of simple game. The dynamic programming will be able to apply to optimal control part which has adaptable performance in the discrete system.

  • PDF

An Application of Dynamic Programming to the Selection of Optimal Production Lengths Based on the Minimum Cutting Loss (최소절단손실(最小切斷損失)에 의한 최적생산(最適生産)길이의 선정(選定)에 대한 동적계획법응용(動的計劃法應用))

  • Jo, Gyu-Gap
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.4 no.2
    • /
    • pp.77-81
    • /
    • 1978
  • The assortment problem with deterministic demand has been formulated so that a dynamic programming can be applied to find optimal production lengths that will minimize the sum of cutting losses. The original minimization problem can be reformulated as the maximization problem with a different objective function. This problem can be solved by the dynamic programming technique. A numerical example illustrates this approach. The ratio of computation amount of emumeration method to that of this dynamic programming is approximately n to 1.

  • PDF

Design and Implementation of the Systolic Array for Dynamic Programming

  • Lee, Jae-Jin;Tien, David;Song, Gi-Yong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.3
    • /
    • pp.61-67
    • /
    • 2003
  • We propose a systolic array for dynamic programming which is a technique for solving combinatorial optimization problems. We derive a systolic array for single source shortest path Problem, SA SSSP, and then show that the systolic array serves as dynamic Programming systolic array which is applicable to any dynamic programming problem by developing a systolic array for 0 1 knapsack problem, SA 01KS, with SA SSSP for a basis. In this paper, each of SA SSSP and SA 01KS is modeled and simulated in RT level using VHDL, then synthesized to a schematic and finally implemented to a layout using the cell library based on 0.35${\mu}{\textrm}{m}$ 1 poly 4 metal CMOS technology.

  • PDF

Development of Unit Commitment Methodology Considering Direct Load Control by 3-Dimensional Dynamic Programming (3차원 동적계획법에 의한 직접부하제어를 고려한 기동정지계획 방법론의 개발)

  • Lee, Buhm;Kim, Yong-Ha;Choi, Sang-Kyu;Kim, Hyeong-Jung
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.12
    • /
    • pp.591-596
    • /
    • 2002
  • This Paper Presents a new methodology for Direct Load Control(DLC) and Unit Commitment. To consider economical effect of DLC, we developed 3-Dimensional dynamic programming which can combine unit commitment and DLC. Traditional dynamic programming has 2-Dimensional which consist of state and stage, but newly developed dynamic programming has DLC state, U.C. state, and stage. As a result, economical DLC and unit commitment schedule of the power system is possible. This method is applied to the test system, and the usefulness of the method is verified.