Preview

Overview of Algorithms for Swarm Intelligence

Best Essays
Open Document
Open Document
4410 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Overview of Algorithms for Swarm Intelligence
Overview of Algorithms for Swarm Intelligence
Shu-Chuan Chu1, Hsiang-Cheh Huang2, John F. Roddick1, and Jeng-Shyang Pan3
1

School of Computer Science, Engineering and Mathematics,
Flinders University of South Australia, Australia
2
National University of Kaohsiung, 700 University Road, Kaohsiung 811, Taiwan, R.O.C.
3
National Kaohsiung University of Applied Sciences, 415 Chien-Kung Road,
Kaohsiung 807, Taiwan, R.O.C.

Abstract. Swarm intelligence (SI) is based on collective behavior of selforganized systems. Typical swarm intelligence schemes include Particle Swarm
Optimization (PSO), Ant Colony System (ACS), Stochastic Diffusion Search
(SDS), Bacteria Foraging (BF), the Artificial Bee Colony (ABC), and so on.
Besides the applications to conventional optimization problems, SI can be used in controlling robots and unmanned vehicles, predicting social behaviors, enhancing the telecommunication and computer networks, etc. Indeed, the use of swarm optimization can be applied to a variety of fields in engineering and social sciences. In this paper, we review some popular algorithms in the field of swarm intelligence for problems of optimization. The overview and experiments of PSO, ACS, and ABC are given. Enhanced versions of these are also introduced. In addition, some comparisons are made between these algorithms.
Keywords. Swarm intelligence (SI), Particle Swarm Optimization (PSO), Ant
Colony System (ACS), Artificial Bee Colony (ABC).

1

Introduction

People learn a lot from Mother Nature. Applying the analogy to biological systems with lots of individuals, or swarms, we are able to handle the challenges in the algorithm and application with optimization techniques. In this paper, we focus on the overview of several popular swarm intelligence algorithms, pointing out their concepts, and proposing some enhancements of the algorithms with the results of our research group.
Swarm intelligence, according to [1], is the emergent collective



References: 2. Bonabeau, E.: Swarm Intelligence. In: O’Reilly Emerging Technology Conference (2003) Overview of Algorithms for Swarm Intelligence IEEE Press, New York (1995) 4 6. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F., Bourgine, P. (eds.) First Eur. Conference Artificial Life, pp. 134–142 (1991) 7 53–66 (1997) 9 Information Sciences 167, 63–76 (2004) 10 11. Passino, K.M.: Biomimicry of Bacterial Foraging for Distributed Optimization and Control. IEEE Control Systems Magazine 22, 52–67 (2002) 12 PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854–858. Springer, Heidelberg (2006) 13 16. Tsai, P.W., Luo, R., Pan, S.T., Pan, J.S., Liao, B.Y.: Artificial Bee Colony with Forwardcommunication Strategy. ICIC Express Letters 4, 1–6 (2010)

You May Also Find These Documents Helpful

  • Good Essays

    This figure assumes that the main reference set, covers the indicated circle of sections A, B, C. The solution 1 is created from a convex combination of reference solutions A, B that is added to the reference set as the only solution. In a similar way, combining of convex and non-convex reference of new and original solutions are created points 2, 3 and 4. The complete reference set are including 7 solutions (members) that is shown in the figure above. In genetic algorithm, two solutions are selected randomly from the population and a crossover operator used for the production of one or more children. GA are including a sample population of 100 elements that are selected randomly to create crossover. But in scatter search, two or more of the reference set in a systematic approach in order to produce new…

    • 623 Words
    • 3 Pages
    Good Essays
  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    LYT2 Task2

    • 4061 Words
    • 12 Pages

    Stein, S. S., Gerding, E. H., Rogers, A. C., Larson, K. K., & Jennings, N. R. (2011). Algorithms…

    • 4061 Words
    • 12 Pages
    Satisfactory Essays
  • Powerful Essays

    4. Clustering techniques involves optimization this is because we want to create group that have maximum similarity among members within each group……

    • 2021 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    Many researchers have been done but the current research focus has led to the invention of many optimization issues and finding of many new solution approaches. In broad sense, Optimization issues basically include logistics, disease diagnosis, and preventive care of patients, service planning and resource scheduling.…

    • 523 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    The search starts with creating a random population of grey wolves (candidate solutions) in the GWO algorithm. During the iterations, α, β, and δ estimate the probable position of the prey. Then Each candidate solution updates its position from the prey accordingly. The parameter a is decreased from 2 to 0 in order to emphasize exploration and exploitation, respectively. Candidate solutions diverge from the prey if |A| > 1 and converge towards the prey if |A| < 1. Finally, the GWO algorithm is terminated by the satisfaction of an end…

    • 575 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Swarm of bees Ant colony as swarm of ants Flock of birds as swarm of birds Traffic as swarm of cars Immune system as swarm of cells and molecules ...…

    • 1374 Words
    • 6 Pages
    Good Essays
  • Powerful Essays

    The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult,[1] a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.…

    • 5667 Words
    • 23 Pages
    Powerful Essays
  • Satisfactory Essays

    Title Page i Declaration ii Certificate iii Acknowledgement iv Abstract v Tables and Figures vi CHAPTER 1: INTRODUCTION 1.1 Motivation 1 1.2 Problem Statement 2 1.3 Problem Objective and Scope 2 1.4 Outline 3 CHAPTER 2: ANT COLONY 3.1 Introduction 5 3.2 Ant Colony Optimization 6 3.3 Network Model of Sensor Network 7…

    • 692 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    cluster analysis

    • 3230 Words
    • 13 Pages

    Cluster analysis itself is not one specific algorithm, but the general task to be solved. It can be achieved by various algorithms that differ significantly in their notion of what constitutes a cluster and how to efficiently find them. Popular notions of clusters include groups with small distances among the cluster members, dense areas of the data space, intervals or particular statistical distributions. Clustering can therefore be formulated as a multi-objective optimization problem. The appropriate clustering algorithm and…

    • 3230 Words
    • 13 Pages
    Powerful Essays
  • Powerful Essays

    EuroGP 2002: Proceedings of the 5th European Conference on Genetic Programming; Kinsdale, Ireland, April 3-5, 2002.…

    • 12997 Words
    • 52 Pages
    Powerful Essays
  • Good Essays

    The dynamic programming (Wood/Wollenberg) approach can be very effective for a small pool of generators. Generators are combined through strict priority and these combinations will be the only ones available through out the approach. For a single iteration, UC is performed first for every combination of the available generators without any constraints. Generator limits and minimum up and down times are then observed and unfeasible combinations are removed. Of the remaining combinations, ED is performed. Each combination is checked and evaluated for optimal solution which is minimizing all cost and committing to the load. The computation time of this approach is fast, but can slow down rapidly if the generator pool grows dramatically; as a generator is added to the pool more combinations need to be evaluated. Ramp rates and spinning reserves are not presented in this approach but would be great addition to the problem. These constraints could be easily integrated to the approach but are left out to make the computation simple.…

    • 866 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Travelling Salesman Problem

    • 3162 Words
    • 13 Pages

    Rina Refianti dan A.Benny Mutiara Jurusan Teknik Informatika, Universitas Gunadarma Abstraksi Ant Colony System (ACS) adalah sebuah metodologi yang dihasilkan melalui pengamatan terhadap semut. Di dalam ACS terdapat sejumlah semut buatan, dinamai ants, yang berfungsi sebagai agent yang ditugaskan untuk mencari solusi terhadap suatu masalah optimisasi. ACS telah diterapkan dalam berbagai bidang, salah satunya adalah untuk mencari solusi optimal pada Traveling Salesman Problem (TSP). Dengan memberikan sejumlah n kota, TSP dapat didefinisikan sebagai suatu permasalahan dalam menemukan jalur terpendek dengan mengunjungi setiap kota yang ada hanya sekali. ACS telah diuji dan dibandingkan dengan metodologi yang lain untuk membuktikan keoptimalannya tersebut. Dan hal inilah yang menjadi dasar bagi penulis dalam melakukan penelitian terhadap ACS, yaitu untuk membuktikan keoptimalannya tersebut. Penelitian ini dilakukan dengan mengimplementasikan ACS ke dalam bentuk kode-kode program berbahasa Java. Kemudian dilakukan percobaan untuk membandingkan antara ACS dengan metodologi lainnya yang juga meng-implementasikan agent di dalamnya. Dari hasil percobaan diketahui bahwa secara garis besar ACS terbukti merupakan metodologi yang paling optimal dalam menemukan jalur terpendek. Dan penelitian ini telah berhasil membuktikan keoptimalan dari ACS dalam menemukan solusi terhadap TSP. Keyword: Genetic Algorithm, Ant System, Software Agent, Pheromone, state transition rule 1. Pengantar Salah rekayasa satu paradigma lunak baru dalam dapat dihindari akan dibutuhkannya lebih dari satu agent, seiring dengan semakin kompleksnya tugas yang dikerjakan oleh sistem tersebut. Paradigma pengembangan sistem di mana dalam suatu komunitas terdapat beberapa agent yang saling berinteraksi, bernegosiasi, dan berkoordinasi satu sama lain dalam menjalankan pekerjaan disebut dengan Multi Agent System (MAS) [Romi]. Colony M. Dan…

    • 3162 Words
    • 13 Pages
    Good Essays
  • Good Essays

    7,200 seconds for each instance. When running instances with CPLEX it was possible to obtain results to measure the quality of the RAS metaheuristic solution. RAS was developed in C language and run on the same computer described before with a runtime limited to 7,200 seconds. RAS metaheuristic was run 10 times for each analyzed instance to obtain the deviation from the best solution found.…

    • 1753 Words
    • 8 Pages
    Good Essays
  • Good Essays

    Every particle in the algorithm acts as a point in the N-dimensional space. Each particle keeps the information in the solution space for each iteration and the best solution is calculated, that has obtained by that particle is called personal best (pbest). This solution is obtained according to the personal experiences of each particle vector. Another best value that is tracked by the PSO is in the neighborhood of that particle and this value is called gbest among all pbests.…

    • 989 Words
    • 4 Pages
    Good Essays

Related Topics