S-C Chu

Bio: S-C Chu is an academic researcher. The author has contributed to research in topics: Centroid & Cluster analysis. The author has an hindex of 3, co-authored 6 publications receiving 250 citations.

Enhanced artificial bee colony optimization

Abstract: An enhanced Artificial Bee Colony (ABC) optimization algorithm, which is called the Interactive Artificial Bee Colony (IABC) optimization, for numerical optimiza- tion problems, is proposed in this paper. The onlooker bee is designed to move straightly to the picked coordinate indicated by the employed bee and evaluates the fitness values near it in the original Artificial Bee Colony algorithm in order to reduce the computa- tional complexity. Hence, the exploration capacity of the ABC is constrained in a zone. Based on the framework of the ABC, the IABC introduces the concept of universal grav- itation into the consideration of the affection between employed bees and the onlooker bees. By assigning different values of the control parameter, the universal gravitation should be involved for the IABC when there are various quantities of employed bees and the single onlooker bee. Therefore, the exploration ability is redeemed about on average in the IABC. Five benchmark functions are simulated in the experiments in order to com- pare the accuracy/quality of the IABC, the ABC and the PSO. The experimental results manifest the superiority in accuracy of the proposed IABC to other methods.

A tutorial on meta-heuristics for optimization

Abstract: Nature has inspired computing and engineering researchers in many different ways. Natural processes have been emulated through a variety of techniques including genetic algorithms, ant systems and particle swarm optimization, as computational models for optimization. In this chapter, we discuss these meta-heuristics from a practitioner’s point of view, emphasizing the fundamental ideas and their implementations. After presenting the underlying philosophy and algorithms, detailed implementations are given, followed by some discussion of alternatives.

An Incremental Multi-Centroid, Multi-Run Sampling Scheme for k-medoids-based algorithms

Abstract: Data clustering has become an important task for discovering significant patterns and characteristics in large spatial databases. The Mufti- Centroid, Multi-Run Sampling Scheme (MCMRS) has been shown to be effective in improving the k-medoids-based clustering algorit hms in our previous work. In this paper, a more advanced sampling scheme termed Incremental MultiCentrozd, Multi-Run Sampling Scheme (IMCMRS) is proposed for k-medoidsbased clustering algorithms. Experimental results demonstrate the proposed scheme can not only reduce by more than 80’ZOcomputation time but also reduce the average distance per object compared with CLARA and CLARANS. IMCMRS is also superior to MCMRS.

A comprehensive survey: artificial bee colony (ABC) algorithm and applications

Abstract: Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and self-organized swarms. The well known examples for these swarms are bird flocks, fish schools and the colony of social insects such as termites, ants and bees. In 1990s, especially two approaches based on ant colony and on fish schooling/bird flocking introduced have highly attracted the interest of researchers. Although the self-organization features are required by SI are strongly and clearly seen in honey bee colonies, unfortunately the researchers have recently started to be interested in the behaviour of these swarm systems to describe new intelligent approaches, especially from the beginning of 2000s. During a decade, several algorithms have been developed depending on different intelligent behaviours of honey bee swarms. Among those, artificial bee colony (ABC) is the one which has been most widely studied on and applied to solve the real world problems, so far. Day by day the number of researchers being interested in ABC algorithm increases rapidly. This work presents a comprehensive survey of the advances with ABC and its applications. It is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

Honey bee behavior inspired load balancing of tasks in cloud computing environments

Abstract: Scheduling of tasks in cloud computing is an NP-hard optimization problem. Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing (HBB-LB), which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue.

A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning

Abstract: The artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, ABC has an insufficiency regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose an improved ABC method called as CABC where a modified search equation is applied to generate a candidate solution to improve the search ability of ABC. Furthermore, we use the orthogonal experimental design (OED) to form an orthogonal learning (OL) strategy for variant ABCs to discover more useful information from the search experiences. Owing to OED's good character of sampling a small number of well representative combinations for testing, the OL strategy can construct a more promising and efficient candidate solution. In this paper, the OL strategy is applied to three versions of ABC, i.e., the standard ABC, global-best-guided ABC (GABC), and CABC, which yields OABC, OGABC, and OCABC, respectively. The experimental results on a set of 22 benchmark functions demonstrate the effectiveness and efficiency of the modified search equation and the OL strategy. The comparisons with some other ABCs and several state-of-the-art algorithms show that the proposed algorithms significantly improve the performance of ABC. Moreover, OCABC offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all the test functions.