• Title/Summary/Keyword: sequence branch algorithm

Search Result 34, Processing Time 0.022 seconds

An Improved Service Restoration Algorithm under Consideration of Abnormal Conditions in Distribution Automation Systems

  • Cho, Namhun;Kim, Insung;Lee, Sungwoo
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.1 no.1
    • /
    • pp.47-54
    • /
    • 2015
  • The most important function in distribution automation system (DAS) is the service restoration. KEPCO's current service restoration provides a very effective restoration service. However, it has been developed without the consideration of unexpected abnormal conditions that may occur while processing the sequence of switching operations. The objective of this paper is to provide practical service restoration schemes under consideration of abnormal conditions. The proposed service restoration schemes have been integrated to a branch office (B/O) in KEPCO. The proposed method strongly supports the conventional service restoration and adds to its value.

Optimization Algorithm of Gantry Route Problem for Odd-type Surface Mount Device (이형 부품 표면실장기에 대한 겐트리 경로 문제의 최적 알고리즘)

  • Jeong, Jaewook;Tae, Hyunchul
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.67-75
    • /
    • 2020
  • This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

Structural system reliability-based design optimization considering fatigue limit state

  • Nophi Ian D. Biton;Young-Joo Lee
    • Smart Structures and Systems
    • /
    • v.33 no.3
    • /
    • pp.177-188
    • /
    • 2024
  • The fatigue-induced sequential failure of a structure having structural redundancy requires system-level analysis to account for stress redistribution. System reliability-based design optimization (SRBDO) for preventing fatigue-initiated structural failure is numerically costly owing to the inclusion of probabilistic constraints. This study incorporates the Branch-and-Bound method employing system reliability Bounds (termed the B3 method), a failure-path structural system reliability analysis approach, with a metaheuristic optimization algorithm, namely grey wolf optimization (GWO), to obtain the optimal design of structures under fatigue-induced system failure. To further improve the efficiency of this new optimization framework, an additional bounding rule is proposed in the context of SRBDO against fatigue using the B3 method. To demonstrate the proposed method, it is applied to complex problems, a multilayer Daniels system and a three-dimensional tripod jacket structure. The system failure probability of the optimal design is confirmed to be below the target threshold and verified using Monte Carlo simulation. At earlier stages of the optimization, a smaller number of limit-state function evaluation is required, which increases the efficiency. In addition, the proposed method can allocate limited materials throughout the structure optimally so that the optimally-designed structure has a relatively large number of failure paths with similar failure probability.

PRML detection using the patterns of run-length limited codes (런-길이 제한 코드의 패턴을 이용한 PRML 검출 방법)

  • Lee Joo hyun;Lee Jae jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.77-82
    • /
    • 2005
  • Partial response maximum likelihood (PRML) detection using the Viterbi algorithm involves the calculation of likelihood metrics that determine the most likely sequence of decoded data. In general, it is assumed that branches at each node in the trellis diagram have same probabilities. If modulation code with minimum and maximum run-length constraints is used, the occurrence ratio (Ro) of each particular pattern is different, and therefore the assumption is not true. We present a calculation scheme of the likelihood metrics for the PRML detection using the occurrence ratio. In simulation, we have tested the two (1,7) run-length-limited codes and calculated the occurrence ratios as the orders of PR targets are changed. We can identify that the PRML detections using the occurrence ratio provide more than about 0.5dB gain compared to conventional PRML detections at 10/sup -5/ BER in high-density magnetic recording and optical recording channels.