• 제목/요약/키워드: Optimal solution

검색결과 3,682건 처리시간 0.03초

최적 부하절체 알고리듬을 적용한 연속조류계산의 향상 (Improvement of Continuation Power Flow System Applying the Optimal Load Shedding Algorithm)

  • 송화창;이병준;권세혁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 C
    • /
    • pp.899-901
    • /
    • 1998
  • Continuation power flow is a tool that can trace the path of the solution from the base stable solution. However, the base stable solution cannot be calculated when the initial system load is too large to operate at a stable operating point. This case is called as unsolvable case. This paper presents implementation of the optimal load shedding algorithm on continuation power flow. It performs steady-state analysis of power systems at unsolvable case that can occur in contingency analysis. Numerical simulation on 20-bus test system demonstrates that the continuation power flow applying the optimal load shedding algorithm is robust at solvable and unsolvable cases.

  • PDF

Polynomial Time Algorithm for Satellite Communications Scheduling Problem with Capacity Constrainted Transponder

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권6호
    • /
    • pp.47-53
    • /
    • 2016
  • This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

Economic Power Dispatch with Discontinuous Fuel Cost Functions using Improved Parallel PSO

  • Mahdad, Belkacem;Bouktir, T.;Srairi, K.;Benbouzid, M.EL.
    • Journal of Electrical Engineering and Technology
    • /
    • 제5권1호
    • /
    • pp.45-53
    • /
    • 2010
  • This paper presents an improved parallel particle swarm optimization approach (IPPSO) based decomposed network for economic power dispatch with discontinuous fuel cost functions. The range of partial power demand corresponding to the partial output powers near the global optimal solution is determined by a flexible decomposed network strategy and then the final optimal solution is obtained by parallel Particle Swarm Optimization. The proposed approach tested on 6 generating units with smooth cost function, and to 26-bus (6 generating units) with consideration of prohibited zone effect, the simulation results compared with recent global optimization methods (Bee-OPF, GA, MTS, SA, PSO). From the different case studies, it is observed that the proposed approach provides qualitative solution with less computational time compared to various methods available in the literature survey.

Non-iterative Bit Loading Algorithm for OFDM in Independent and Correlated fading

  • Manry, John W.;Nagaraj, Santosh
    • 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.

An Algorithm for Portfolio Selection Model

  • Kim, Yong-Chan;Shin, Ki-Young;Kim, Jong-Soo
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.65-68
    • /
    • 2000
  • The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

  • PDF

Minimum-Energy Spacecraft Intercept on Non-coplanar Elliptical Orbits Using Genetic Algorithms

  • Oghim, Snyoll;Lee, Chang-Yull;Leeghim, Henzeh
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제18권4호
    • /
    • pp.729-739
    • /
    • 2017
  • The objective of this study was to optimize minimum-energy impulsive spacecraft intercept using genetic algorithms. A mathematical model was established on two-body system based on f and g solution and universal variable to address spacecraft intercept problem for non-coplanar elliptical orbits. This nonlinear problem includes many local optima due to discontinuity and strong nonlinearity. In addition, since it does not provide a closed-form solution, it must be solved using a numerical method. Therefore, the initial guess is that a very sensitive factor is needed to obtain globally optimal values. Genetic algorithms are effective for solving these kinds of optimization problems due to inherent properties of random search algorithms. The main goal of this paper was to find minimum energy solution for orbit transfer problem. The numerical solution using initial values evaluated by the genetic algorithm matched with results of Hohmann transfer. Such optimal solution for unrestricted arbitrary elliptic orbits using universal variables provides flexibility to solve orbit transfer problems.

기동정지계획을 위한 경제급전 알고리즘 (Economic Dispatch Algorithm for Unit Commitment)

  • 박정도;이용훈;김구한;문영현
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1506-1509
    • /
    • 1999
  • This paper presents a new economic dispatch algorithm to improve the unit commitment solution while guaranteeing the near optimal solution without reducing calculation speed. The conventional economic dispatch algorithms have the problem that it is not applicable to the unit commitment formulation due to the frequent on/off state changes of units during the unit commitment calculation. Therefore, piecewise linear iterative method have generally been used for economic dispatch algorithm for unit commitment. In that method, the approximation of the generator cost function makes it hard to obtain the optimal economic dispatch solution. In this case, the solution can be improved by introducing a inverse of the incremental cost function. The proposed method is tested with sample system. The results are compared with the conventional piecewise linear iterative method. It is shown that the proposed algorithm yields more accurate and economical solution without calculation speed reduction.

  • PDF

THE CONVERGENCE OF FINITE ELEMENT GALERKIN SOLUTION FOR THE ROSENEAU EQUATION

  • Lee, H. Y.
    • Journal of applied mathematics & informatics
    • /
    • 제5권1호
    • /
    • pp.171-180
    • /
    • 1998
  • In this paper we analyze the convergence of the semidis-crete solution of the Roseneau equation. We introduce the auxiliary projection of the solution and derive the optimal convergence of the semidiscrete solution as well as the auxiliary projection in L2 normed space.

공병 장비의 최적할당을 위한 수리모형 및 휴리스틱 알고리즘 (Mathematical model and heuristic for the assignment of military engineering equipments in ROK army)

  • 박종복;안남수
    • 한국산학기술학회논문지
    • /
    • 제21권4호
    • /
    • pp.138-144
    • /
    • 2020
  • 육군의 공병은 여러 장비를 이용하여 다양한 작전을 수행 중이며, 대표적인 군사작전 분야로는 포병 진지구축지원이 있다. 포병은 아군의 후방에서 화력으로 적의 중심을 타격하는 임무를 수행하며, 이때 사격 위치 노출 방지를 위해 한 진지에서 여러 차례 사격 후 진지를 반드시 이동해야 함에 따라 제한된 수의 장비를 효율적으로 운용하여 다수의 진지를 신속히 구축하는 것이 필요하다. 본 연구에서는 진지 구축시 제약조건을 반영하여, 공병장비-팀(작업)-진지간 최적할당이 가능한 수리모형과 휴리스틱 알고리즘을 제시하고 이에 대한 실험결과를 제시하고자 한다. 본 논문에서 제안한 최적화 수리모형은 작은 크기의 문제에서는 최적해를 도출하나, 실제 공병대대 및 여단 규모의 장비배치 문제에서는 최적해 도출에 장시간이 소요되는 한계가 존재함에 따라, 수리모형 기반의 휴리스틱 역시 제안하였다. 해당 휴리스틱은 1단계에서 수리 모형의 일부 변수의 정수제약 조건을 완화하고 할당에 대한 최적해를 구하고, 해당 해를 원 수리모형에 추가하여 최종 해를 구하는 형태로 설계하였다. 이러한 휴리스틱은 최적해의 도출은 보장하지는 못하나 문제의 크기가 커져도 빠른 시간에 해를 도출할 수 있었다.

고도 다목적 문제에서의 의사 결정을 위한 이중 최적화 접근법 (A Two-tier Optimization Approach for Decision Making in Many-objective Problems)

  • 이기백
    • 한국콘텐츠학회논문지
    • /
    • 제15권7호
    • /
    • pp.21-29
    • /
    • 2015
  • 본 논문은 목적이 네 개 이상인 고도 다목적 문제(many-objective problem)에서의 의사 결정을 위한 새로운 이중(two-tier) 최적화 접근법을 제안한다. 목적의 개수가 증가할수록, 특히 네 개 이상부터는, 전체해(solution) 중에서 파레도 최적해(Parero-optimal solution)가 차지하는 비율이 기하급수적으로 증가한다. 그래서 일반 다목적 문제와는 달리, 의사 결정을 하는데 단순히 파레토 최적 해만을 찾는 것으로는 충분하지 않고, 찾은 파레토 최적 해들 중에서도 상대적으로 좀 더 선호하는 해들을 가려내는 것이 필요하다. 제안하는 접근법에서는 추가적인 최적화 단계를 추가함으로써 사용자의 선호도를 균형있게 반영하는 방향으로 파레토 최적해들을 찾는다. 이러한 2차 최적화는 관련된 2차 목적들을 수반하게 되는데, 2차 목적으로는 광역평가값과 혼잡 거리를 사용하였다. 광역평가값과 혼잡 거리는 각각 사용자의 선호도와 다양성을 대변하는 척도이다. 제안한 접근법의 우수성을 보이기 위해서는 잘 알려진 검증 함수들을 활용하는데, 같은 함수에 대해 제안한 접근법을 적용한 경우와 적용하지 않은 경우의 결과를 비교한다. 제안한 접근법을 적용함으로써 기존보다 사용자의 선호도를 잘 반영하면서 동시에 우수하고 다양한 의사 선택이 가능하다.