• Title/Summary/Keyword: improved artificial bee colony algorithm

Search Result 10, Processing Time 0.027 seconds

A hybrid algorithm for classifying rock joints based on improved artificial bee colony and fuzzy C-means clustering algorithm

  • Ji, Duofa;Lei, Weidong;Chen, Wenqin
    • Geomechanics and Engineering
    • /
    • v.31 no.4
    • /
    • pp.353-364
    • /
    • 2022
  • This study presents a hybrid algorithm for classifying the rock joints, where the improved artificial bee colony (IABC) and the fuzzy C-means (FCM) clustering algorithms are incorporated to take advantage of the artificial bee colony (ABC) algorithm by tuning the FCM clustering algorithm to obtain the more reasonable and stable result. A coefficient is proposed to reduce the amount of blind random searches and speed up convergence, thus achieving the goals of optimizing and improving the ABC algorithm. The results from the IABC algorithm are used as initial parameters in FCM to avoid falling to the local optimum in the local search, thus obtaining stable classifying results. Two validity indices are adopted to verify the rationality and practicability of the IABC-FCM algorithm in classifying the rock joints, and the optimal amount of joint sets is obtained based on the two validity indices. Two illustrative examples, i.e., the simulated rock joints data and the field-survey rock joints data, are used in the verification to check the feasibility and practicability in rock engineering for the proposed algorithm. The results show that the IABC-FCM algorithm could be applicable in classifying the rock joint sets.

An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search

  • Huang, He;Zhu, Min;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.433-439
    • /
    • 2019
  • Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.

Improvement of Topology Algorithm's Convergence Rate Using Chaotic Map (카오틱 맵을 이용한 위상 최적화 알고리즘의 수렴속도 향상)

  • Kim, Yong-Ho;Kim, Gi-Chul;Lee, Jae-Hwan;Jang, Hyo-Jae;Han, Seog-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.23 no.3
    • /
    • pp.279-283
    • /
    • 2014
  • Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

An Improved Phase-Shifted Carrier Pulse Width Modulation Based on the Artificial Bee Colony Algorithm for Cascaded H-Bridge Multilevel Inverters

  • Cai, Xinjian;Wu, Zhenxing;Li, Quanfeng;Wang, Shuxiu
    • Journal of Power Electronics
    • /
    • v.16 no.2
    • /
    • pp.512-521
    • /
    • 2016
  • Cascaded H-bridge multilevel (CHBML) inverters usually include a large number of isolated dc-voltage sources. Some faults in the dc-voltage sources result in unequal cell dc voltages. Unfortunately, the conventional phase-shifted carrier (PSC) PWM method that is widely used for CHBML inverters cannot eliminate low frequency sideband harmonics when the cell dc voltages are not equal. This paper analyzes the principle of sideband harmonic elimination, and proposes an improved PSCPWM that can eliminate low frequency sideband harmonics under the condition of unequal dc voltages. In order to calculate the carrier phases, it is necessary to solve transcendental equations for low frequency sideband harmonic elimination. Therefore, an approach based on the artificial bee colony (ABC) algorithm is presented in this paper. The proposed PSCPWM method enhances the reliability of CHBML inverters. The proposed PSCPWM is not limited to CHBML inverters. It can also be applied to other types of multilevel inverters. Simulation and experimental result obtained from a prototype CHBML inverter verify the theoretical analysis and the achievements made in this paper.

A Hybrid Search Method Based on the Artificial Bee Colony Algorithm (인공벌 군집 알고리즘을 기반으로 한 복합탐색법)

  • Lee, Su-Hang;Kim, Il-Hyun;Kim, Yong-Ho;Han, Seog-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.23 no.3
    • /
    • pp.213-217
    • /
    • 2014
  • A hybrid search method based on the artificial bee colony algorithm (ABCA) with harmony search (HS) is suggested for finding a global solution in the field of optimization. Three cases of the suggested algorithm were examined for improving the accuracy and convergence rate. The results showed that the case in which the harmony search was implemented with the onlooker phase in ABCA was the best among the three cases. Although the total computation time of the best case is a little bit longer than the original ABCA under the prescribed conditions, the global solution improved and the convergence rate was slightly faster than those of the ABCA. It is concluded that the suggested algorithm improves the accuracy and convergence rate, and it is expected that it can effectively be applied to optimization problems with many design variables and local solutions.

Selection of controller using improved Artificial Bee Colony algorithm based on Apriori algorithm in SDN environment (SDN 환경에서 Apriori 알고리즘 기반의 향상된 인공벌 군집(ABC) 알고리즘을 이용한 컨트롤러 선택)

  • Yoo, Seung-Eon;Lim, Hwan-Hee;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.01a
    • /
    • pp.39-40
    • /
    • 2019
  • 본 논문에서는 연관규칙 마이닝 알고리즘인 Apriori 알고리즘을 기반으로 향상된 인공벌 군집 알고리즘(ABC algorihtm)을 적용하여 SDN 환경에서 분산된 컨트롤러를 선택하는 모델을 제안하였다. 이를 통해 자주 사용되는 컨트롤러를 우선적으로 선택함으로써 향상된 컨트롤러 선택을 목표로 한다.

  • PDF

Application of an Optimized Support Vector Regression Algorithm in Short-Term Traffic Flow Prediction

  • Ruibo, Ai;Cheng, Li;Na, Li
    • Journal of Information Processing Systems
    • /
    • v.18 no.6
    • /
    • pp.719-728
    • /
    • 2022
  • The prediction of short-term traffic flow is the theoretical basis of intelligent transportation as well as the key technology in traffic flow induction systems. The research on short-term traffic flow prediction has showed the considerable social value. At present, the support vector regression (SVR) intelligent prediction model that is suitable for small samples has been applied in this domain. Aiming at parameter selection difficulty and prediction accuracy improvement, the artificial bee colony (ABC) is adopted in optimizing SVR parameters, which is referred to as the ABC-SVR algorithm in the paper. The simulation experiments are carried out by comparing the ABC-SVR algorithm with SVR algorithm, and the feasibility of the proposed ABC-SVR algorithm is verified by result analysis. Continuously, the simulation experiments are carried out by comparing the ABC-SVR algorithm with particle swarm optimization SVR (PSO-SVR) algorithm and genetic optimization SVR (GA-SVR) algorithm, and a better optimization effect has been attained by simulation experiments and verified by statistical test. Simultaneously, the simulation experiments are carried out by comparing the ABC-SVR algorithm and wavelet neural network time series (WNN-TS) algorithm, and the prediction accuracy of the proposed ABC-SVR algorithm is improved and satisfactory prediction effects have been obtained.

Improved Artificial Bee Clustering (ABC) Algorithm for Solving Consistency Problems in SDN Distributed Controllers (SDN 분산 컨트롤러에서 일관성 문제 해결을 위한 향상된 인공벌 군집(ABC) 알고리즘)

  • Yoo, Seung-Eon;Lym, Hwan-Hee;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2018.07a
    • /
    • pp.145-146
    • /
    • 2018
  • 중앙 집중적인 단일 컨트롤러를 이용할 경우 메시지 과부하로 인해 응답이 지연될 수 있으므로 스위치들이 기존의 컨트롤러를 대신하여 새로운 컨트롤러와 연결되어 트래픽을 처리하는 다중 컨트롤러가 효율적이다. 본 논문에서는 SDN 분산 컨트롤러에서 일관성 문제를 해결하기 위해 우선순위에 기반을 둔 향상된 인공벌 군집(ABC) 알고리즘을 제안한다.

  • PDF

Constrained Relay Node Deployment using an improved multi-objective Artificial Bee Colony in Wireless Sensor Networks

  • Yu, Wenjie;Li, Xunbo;Li, Xiang;Zeng, Zhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2889-2909
    • /
    • 2017
  • Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

Structural damage identification with output-only measurements using modified Jaya algorithm and Tikhonov regularization method

  • Guangcai Zhang;Chunfeng Wan;Liyu Xie;Songtao Xue
    • Smart Structures and Systems
    • /
    • v.31 no.3
    • /
    • pp.229-245
    • /
    • 2023
  • The absence of excitation measurements may pose a big challenge in the application of structural damage identification owing to the fact that substantial effort is needed to reconstruct or identify unknown input force. To address this issue, in this paper, an iterative strategy, a synergy of Tikhonov regularization method for force identification and modified Jaya algorithm (M-Jaya) for stiffness parameter identification, is developed for damage identification with partial output-only responses. On the one hand, the probabilistic clustering learning technique and nonlinear updating equation are introduced to improve the performance of standard Jaya algorithm. On the other hand, to deal with the difficulty of selection the appropriate regularization parameters in traditional Tikhonov regularization, an improved L-curve method based on B-spline interpolation function is presented. The applicability and effectiveness of the iterative strategy for simultaneous identification of structural damages and unknown input excitation is validated by numerical simulation on a 21-bar truss structure subjected to ambient excitation under noise free and contaminated measurements cases, as well as a series of experimental tests on a five-floor steel frame structure excited by sinusoidal force. The results from these numerical and experimental studies demonstrate that the proposed identification strategy can accurately and effectively identify damage locations and extents without the requirement of force measurements. The proposed M-Jaya algorithm provides more satisfactory performance than genetic algorithm, Gaussian bare-bones artificial bee colony and Jaya algorithm.