• Title/Summary/Keyword: flexible search algorithm

Search Result 60, Processing Time 0.022 seconds

Active Distribution System Planning for Low-carbon Objective using Cuckoo Search Algorithm

  • Zeng, Bo;Zhang, Jianhua;Zhang, Yuying;Yang, Xu;Dong, Jun;Liu, Wenxia
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.433-440
    • /
    • 2014
  • In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

On-line Recognition of Cursive Korean Characters Based on Hidden Markov Model and Level Building (은닉 마르코프 모델과 레벨 빌딩 알고리즘을 이용한 흘림체 한글의 온라인 인식)

  • Kim, Sang-Gyun;Kim, Gyeong-Hyeon;Lee, Jong-Guk;Lee, Jae-Uk;Kim, Hang-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1281-1293
    • /
    • 1996
  • In this paper, we propose a novel recognition model of on-line cursive Korean characters using HMM(Hidden Markov Model) and level building algorithm. The model is constructed as a form of recognition network with HMM for graphemes and Korean combination rules. Though the network is so flexible as to accomodate variability of input patterns, it has a problem of recognition speed caused by 11, 172 search paths. To settle the problem, we modify the level building algorithm to be adapted directly to the Korean combination rules and apply it to the model. The modified algorithm is efficient network search procedure time complexity of which depends on the number of HMMs for each grapheme, not the number of paths in the extensive recognition network. A test with 15, 000 hand written characters shows recognition rat 90% and speed of 0.72 second per character.

  • PDF

A Design of Optimal PI Controller of SVC System using Genetic Algorithms (유전 알고리즘을 이용한 SVC 계통의 최적 PI 제어기 설계)

  • Jeong, Hyeong-Hwan;Heo, Dong-Ryeol;Wang, Yong-Pil;Han, Gil-Man;Kim, Hae-Jae
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.5
    • /
    • pp.212-219
    • /
    • 2000
  • This paper deals with a systematic approach to GA-PI controller design for static VAR compensator(SVC) using genetic algorithms(GAs) which are search algorithms based on the mechanics of natural of natural selection and natural genetics, to improve system stability. A SVC, one of the Flexible AC Transmission System(FACTS), constructed by a fixed capacitor(FC) and a thyristor controlled reactor(TCR), is designed and implemented to improve the damping of a synchronous generator, as well as controlling the system voltage. To verify the robustness of the proposed method, considered dynamic response of generator used deviation and generator terminal voltage by applying a power fluctuation and three-phase fault at heavy load, normal load and light load. Thus, we proved usefulness of GA-PI controller design to improve the stability of single machine-infinite bus with SVC system.

  • PDF

Optimal Location of FACTS Devices Using Adaptive Particle Swarm Optimization Hybrid with Simulated Annealing

  • Ajami, Ali;Aghajani, Gh.;Pourmahmood, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.179-190
    • /
    • 2010
  • This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

A Study on Designing the System of Vital and Environmental Sensor for Future Soldier System (미래병사 생체환경센서 시스템 설계에 관한 연구)

  • Kim, Hyun-Jun;Chae, Je-Wook;Choe, Eui-Jung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.3
    • /
    • pp.233-239
    • /
    • 2013
  • This paper includes the algorithm of eliminating noise, the processing technique of sensor and the results of designing vital and environmental sensor, one of the survivability subsystem of Future Soldier System. In this paper, we propose the adaptive filtering, moving noise removal in order to detect signals stabilized. And these help that we get bio-signals the ECG calculating methods such as search back and ensemble method. It is made up the vital and environmental sensor including the flexible sensor. In that sense, this study can be applied when it is planned the modular type Future Soldier System.

Design Methodology of Preform for Reducing Tool Wear in Cold Forging (냉간 단조 금형의 마멸 감소를 위한 예비성형체 설계방법)

  • 이진호;김태형;김병민
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.4
    • /
    • pp.118-124
    • /
    • 1998
  • The die wear is one of the main factors affecting die accuracy and tool lifetime. It is desired to reduce die wear by developing simulation method to predict wear based on process variables, and then optimizing the process. Therefore, this paper describes methodology of preform design for minimizing wear of finisher die in multi-stage cold forging processes. The finite element method is combined with the routine of wear prediction. The cold forging process is analyzed using developed simulation method. In order to obtain preform to minimize die wear, the Flexible Polyhedron Search(FPS) algorithm is used. The optimal preform shape is found from iterative deformation analysis and wear calculation.

  • PDF

Realization of Image Processing Algorithms for Object Recognition Applicable to Packaging Inspection Processes (제품 포장라인 검사에 적용 가능한 객체 인식 영상처리 알고리즘 구현)

  • Kim, Tae-Gyu;Lee, Chang-Ho;An, Ho-Gyun;Yoon, Tae-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.213-215
    • /
    • 2009
  • Using the object recognition processing on the captured images, we can inspect whether a packaging process is performed correctly in real time. So we realized the functions that acquire an image of each state of the packaging process using a camera, extract each object in the image, and inspect the packaging process using the extracted object data. In case an object shape is solid, for object search, a shape-based matching algorithm was used which searches the object utilizing the informations on the shape. In case an object shape is not solid, and Is flexible, gray-level difference of the pixels in the limited image region including the object was used to recognize the object.

  • PDF

Optimal Scheduling of Multi-product Batch Process for Common Intermediate Storage Policy; A Model for Batch Process Automation (다품종용 회분식 공정에서의 중간 저장 탱크 공유를 위한 최적 생산계획 ; 회분식 조업의 자동화 모델)

  • 정재학;이인범;양대륙;장근수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.303-308
    • /
    • 1992
  • In this study, we propose a shared storage system which is more efficient policy than MIS(Mixed Intermediate Storage) policy for relatively rare storage system and can be called CIS(Common Intermediate Storage) policy. Using this strategy, we develop a new completion time algorithm and apply it to two kinds of optimal or near optimal scheduling method; combinatorial search and simulated annealing method. We also extend this strategy to other storage policy, for example MIS policy, with PLC(Programmable Logic Controller) logic and on/off action of electronic valves. It thus can be accepted as a basic form of FMS(Flexible Manufacturing System) for operating various storage policies. Finally we suggest the interlocking block to compansate for the shortcoming of CIS policy, i.e, complication of operation and safety, resulting in a basic batch process automation mode.

  • PDF

Fitness Sharing Particle Swarm Optimization Approach to FACTS Installation for Transmission System Loadability Enhancement

  • Chang, Ya-Chin
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.1
    • /
    • pp.31-39
    • /
    • 2013
  • Proper installation of Flexible AC Transmission Systems (FACTS) devices in existing transmission networks can enable power systems to accommodate more power transfer with less network expansion cost. The problem to maximize transmission system loadability by determining optimal locations and settings for installations of two types of FACTS devices, namely static var compensator (SVC) and thyristor controlled series compensator (TCSC), is formulated as a mixed discrete-continuous nonlinear optimization problem (MDCP). For solving the MDCP, in the paper, the proposed method with fitness sharing technique involved in the updating process of the particle swarm optimization (PSO) algorithm, can diversify the particles over the search regions as much as possible, making it possible to achieve the optimal solution with a big probability. The modified IEEE-14 bus network and a practical power system are used to validate the proposed method.

A Study on Clustering and Identifying Gene Sequences using Suffix Tree Clustering Method and BLAST (서픽스트리 클러스터링 방법과 블라스트를 통합한 유전자 서열의 클러스터링과 기능검색에 관한 연구)

  • Han, Sang-Il;Lee, Sung-Gun;Kim, Kyung-Hoon;Lee, Ju-Yeong;Kim, Young-Han;Hwang, Kyu-Suk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.10
    • /
    • pp.851-856
    • /
    • 2005
  • The DNA and protein data of diverse species have been daily discovered and deposited in the public archives according to each established format. Database systems in the public archives provide not only an easy-to-use, flexible interface to the public, but also in silico analysis tools of unidentified sequence data. Of such in silico analysis tools, multiple sequence alignment [1] methods relying on pairwise alignment and Smith-Waterman algorithm [2] enable us to identify unknown DNA, protein sequences or phylogenetic relation among several species. However, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST was combined with a clustering tool. Our clustering and annotating tool is summarized as the following steps: (1) construction of suffix tree; (2) masking of cross-matching pairs; (3) clustering of gene sequences and (4) annotating gene clusters by BLAST search. The system was successfully evaluated with 22 gene sequences in the pyrubate pathway of bacteria, clustering 7 clusters and finding out representative common subsequences of each cluster