• 제목/요약/키워드: particle swarm optimization algorithm

검색결과 466건 처리시간 0.026초

Topology optimization of nonlinear single layer domes by a new metaheuristic

  • Gholizadeh, Saeed;Barati, Hamed
    • Steel and Composite Structures
    • /
    • 제16권6호
    • /
    • pp.681-701
    • /
    • 2014
  • The main aim of this study is to propose an efficient meta-heuristic algorithm for topology optimization of geometrically nonlinear single layer domes by serially integration of computational advantages of firefly algorithm (FA) and particle swarm optimization (PSO). During the optimization process, the optimum number of rings, the optimum height of crown and tubular section of the member groups are determined considering geometric nonlinear behaviour of the domes. In the proposed algorithm, termed as FA-PSO, in the first stage an optimization process is accomplished using FA to explore the design space then, in the second stage, a local search is performed using PSO around the best solution found by FA. The optimum designs obtained by the proposed algorithm are compared with those reported in the literature and it is demonstrated that the FA-PSO converges to better solutions spending less computational cost emphasizing on the efficiency of the proposed algorithm.

A Looping Population Learning Algorithm for the Makespan/Resource Trade-offs Project Scheduling

  • Fang, Ying-Chieh;Chyu, Chiuh-Cheng
    • Industrial Engineering and Management Systems
    • /
    • 제8권3호
    • /
    • pp.171-180
    • /
    • 2009
  • Population learning algorithm (PLA) is a population-based method that was inspired by the similarities to the phenomenon of social education process in which a diminishing number of individuals enter an increasing number of learning stages. The study aims to develop a framework that repeatedly applying the PLA to solve the discrete resource constrained project scheduling problem with two objectives: minimizing project makespan and renewable resource availability, which are two most common concerns of management when a project is being executed. The PLA looping framework will provide a number of near Pareto optimal schedules for the management to make a choice. Different improvement schemes and learning procedures are applied at different stages of the process. The process gradually becomes more and more sophisticated and time consuming as there are less and less individuals to be taught. An experiment with ProGen generated instances was conducted, and the results demonstrated that the looping framework using PLA outperforms those using genetic local search, particle swarm optimization with local search, scatter search, as well as biased sampling multi-pass algorithm, in terms of several performance measures of proximity. However, the diversity using spread metric does not reveal any significant difference between these five looping algorithms.

Numerical Research on Suppression of Thermally Induced Wavefront Distortion of Solid-state Laser Based on Neural Network

  • Liu, Hang;He, Ping;Wang, Juntao;Wang, Dan;Shang, Jianli
    • Current Optics and Photonics
    • /
    • 제6권5호
    • /
    • pp.479-488
    • /
    • 2022
  • To account for the internal thermal effects of solid-state lasers, a method using a back propagation (BP) neural network integrated with a particle swarm optimization (PSO) algorithm is developed, which is a new wavefront distortion correction technique. In particular, by using a slab laser model, a series of fiber pumped sources are employed to form a controlled array to pump the gain medium, allowing the internal temperature field of the gain medium to be designed by altering the power of each pump source. Furthermore, the BP artificial neural network is employed to construct a nonlinear mapping relationship between the power matrix of the pump array and the thermally induced wavefront aberration. Lastly, the suppression of thermally induced wavefront distortion can be achieved by changing the power matrix of the pump array and obtaining the optimal pump light intensity distribution combined using the PSO algorithm. The minimal beam quality β can be obtained by optimally distributing the pumping light. Compared with the method of designing uniform pumping light into the gain medium, the theoretically computed single pass beam quality β value is optimized from 5.34 to 1.28. In this numerical analysis, experiments are conducted to validate the relationship between the thermally generated wavefront and certain pumping light distributions.

적응적 파라미터 제어를 이용하는 스웜 기반의 강인한 객체 추적 알고리즘 (Swarm Based Robust Object Tracking Algorithm Using Adaptive Parameter Control)

  • 배창석
    • 한국차세대컴퓨팅학회논문지
    • /
    • 제13권5호
    • /
    • pp.39-50
    • /
    • 2017
  • 이동 객체에 대한 추적 기술은 최근 중요성이 강조되고 있는 동영상 이해에서 가장 핵심적인 기술의 하나라 할 수 있다. 하지만, 동영상이 가지는 조명의 불안정, 객체의 크기나 형태 변화, 카메라 움직임, 그리고 중첩 등으로 인해 동영상 내의 이동 객체 추적은 많은 어려움을 가지고 있다. 객체 추적의 가장 대표적인 종래의 방법인 칼만 필터와 파티클 필터의 문제점을 개선하는 방법으로 스웜 기반의 방법이 제안되어 있으나 동적으로 변화하는 이동 객체의 특징을 반영하는 개선된 알고리즘이 요구된다. 본 논문에서는 이러한 특징을 반영하여 파티클 스웜 최적화 방법에서 사용되는 파라미터 중 가중치 값을 동적으로 변화하는 적응적 파라미터 제어 방법을 제안한다. 각 파티클을 특성에 따라 3가지 종류로 구분하고 각각 서로 다른 가중치 값을 부여하는 방식으로 객체 추적의 성능을 개선할 수 있다. 제안된 알고리즘의 적용 결과 중첩 또는 예측하기 어려운 움직임 등과 같은 객체의 비선형적인 움직임이 있는 동영상에 대해 기존 파티클 스웜 방식에 비해 현저한 성능 개선을 보이는 것을 확인할 수 있었다.

입자군집 최적화를 이용한 SVM 기반 다항식 뉴럴 네트워크 분류기 설계 (Design of SVM-Based Polynomial Neural Networks Classifier Using Particle Swarm Optimization)

  • 노석범;오성권
    • 전기학회논문지
    • /
    • 제67권8호
    • /
    • pp.1071-1079
    • /
    • 2018
  • In this study, the design methodology as well as network architecture of Support Vector Machine based Polynomial Neural Network, which is a kind of the dynamically generated neural networks, is introduced. The Support Vector Machine based polynomial neural networks is given as a novel network architecture redesigned with the aid of polynomial neural networks and Support Vector Machine. The generic polynomial neural networks, whose nodes are made of polynomials, are dynamically generated in each layer-wise. The individual nodes of the support vector machine based polynomial neural networks is constructed as a support vector machine, and the nodes as well as layers of the support vector machine based polynomial neural networks are dynamically generated as like the generation process of the generic polynomial neural networks. Support vector machine is well known as a sort of robust pattern classifiers. In addition, in order to enhance the structural flexibility as well as the classification performance of the proposed classifier, multi-objective particle swarm optimization is used. In other words, the optimization algorithm leads to sequentially successive generation of each layer of support vector based polynomial neural networks. The bench mark data sets are used to demonstrate the pattern classification performance of the proposed classifiers through the comparison of the generalization ability of the proposed classifier with some already studied classifiers.

입자 군집 최적화를 이용한 FCM 기반 퍼지 모델의 동정 방법론 (Identification Methodology of FCM-based Fuzzy Model Using Particle Swarm Optimization)

  • 오성권;김욱동;박호성;손명희
    • 전기학회논문지
    • /
    • 제60권1호
    • /
    • pp.184-192
    • /
    • 2011
  • In this study, we introduce a identification methodology for FCM-based fuzzy model. The two underlying design mechanisms of such networks involve Fuzzy C-Means (FCM) clustering method and Particle Swarm Optimization(PSO). The proposed algorithm is based on FCM clustering method for efficient processing of data and the optimization of model was carried out using PSO. The premise part of fuzzy rules does not construct as any fixed membership functions such as triangular, gaussian, ellipsoidal because we build up the premise part of fuzzy rules using FCM. As a result, the proposed model can lead to the compact architecture of network. In this study, as the consequence part of fuzzy rules, we are able to use four types of polynomials such as simplified, linear, quadratic, modified quadratic. In addition, a Weighted Least Square Estimation to estimate the coefficients of polynomials, which are the consequent parts of fuzzy model, can decouple each fuzzy rule from the other fuzzy rules. Therefore, a local learning capability and an interpretability of the proposed fuzzy model are improved. Also, the parameters of the proposed fuzzy model such as a fuzzification coefficient of FCM clustering, the number of clusters of FCM clustering, and the polynomial type of the consequent part of fuzzy rules are adjusted using PSO. The proposed model is illustrated with the use of Automobile Miles per Gallon(MPG) and Boston housing called Machine Learning dataset. A comparative analysis reveals that the proposed FCM-based fuzzy model exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

3-자유도 헬리콥터 시스템의 입자군집최적화 기법을 이용한 시스템 식별 (A Study on Identification using Particle Swarm Optimization for 3-DOF Helicopter System)

  • 이호운;김태우;김태형
    • 한국지능시스템학회논문지
    • /
    • 제25권2호
    • /
    • pp.105-110
    • /
    • 2015
  • 본 연구는 Quanser사의 3-자유도 헬리콥터 시스템에 대한 종래의 선형 수리 모델을 개선한 수리 모델을 제안하고, 실험을 통해 제안된 수리 모델을 기반으로 설계된 제어기의 제어 성능을 종래의 수리 모델을 기반으로 설계된 제어기의 제어 성능과 비교함으로써 그 타당성을 검증한다. 이에 대한 연구 진행 과정은 다음과 같다. 첫째, 3-자유도 헬리콥터 시스템의 동 특성을 분석하고, 종래의 선형 수리 모델을 구축한다. 둘째, 종래의 수리 모델의 구축을 위해 수행된 선형화 과정에서 제거된 비선형적 요소들을 파악한다. 그리고 이 제거된 비선형적 요소들에 대응하는 파라미터들을 추가하여 개선된 수리 모델을 구축한다. 이 때, 수리 모델을 구축하기 위해 메타 휴리스틱 전역 최적화 기법인 입자군집최적화 알고리즘을 이용한다. 마지막으로, 제안된 모델을 기반으로 제어기를 설계하고, 이를 종래의 수리 모델을 기반으로 설계된 제어기의 제어 성능을 비교하여 제안된 수리 모델의 타당성을 검증한다.

Practical Swarm Optimization based Fault-Tolerance Algorithm for the Internet of Things

  • Luo, Shiliang;Cheng, Lianglun;Ren, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.735-748
    • /
    • 2014
  • The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

Practical Swarm Optimization based Fault-Tolerance Algorithm for the Internet of Things

  • Luo, Shiliang;Cheng, Lianglun;Ren, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1178-1191
    • /
    • 2014
  • The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

Robust Person Identification Using Optimal Reliability in Audio-Visual Information Fusion

  • Tariquzzaman, Md.;Kim, Jin-Young;Na, Seung-You;Choi, Seung-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • 제28권3E호
    • /
    • pp.109-117
    • /
    • 2009
  • Identity recognition in real environment with a reliable mode is a key issue in human computer interaction (HCI). In this paper, we present a robust person identification system considering score-based optimal reliability measure of audio-visual modalities. We propose an extension of the modified reliability function by introducing optimizing parameters for both of audio and visual modalities. For degradation of visual signals, we have applied JPEG compression to test images. In addition, for creating mismatch in between enrollment and test session, acoustic Babble noises and artificial illumination have been added to test audio and visual signals, respectively. Local PCA has been used on both modalities to reduce the dimension of feature vector. We have applied a swarm intelligence algorithm, i.e., particle swarm optimization for optimizing the modified convection function's optimizing parameters. The overall person identification experiments are performed using VidTimit DB. Experimental results show that our proposed optimal reliability measures have effectively enhanced the identification accuracy of 7.73% and 8.18% at different illumination direction to visual signal and consequent Babble noises to audio signal, respectively, in comparison with the best classifier system in the fusion system and maintained the modality reliability statistics in terms of its performance; it thus verified the consistency of the proposed extension.