Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO

A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO Purpose – The purpose of this paper is to present an approach for the decentralization of swarm intelligence algorithms that run on computing systems with autonomous components that are connected by a network. The approach is applied to a particle swarm optimization (PSO) algorithm with multiple sub‐swarms. PSO is a nature inspired metaheuristic where a swarm of particles searches for an optimum of a function. A multiple sub‐swarms PSO can be used for example in applications where more than one optimum has to be found. Design/methodology/approach – In the studied scenario the particles of the PSO algorithm correspond to data packets that are sent through the network of the computing system. Each data packet contains among other information the position of the corresponding particle in the search space and its sub‐swarm number. In the proposed decentralized PSO algorithm the application specific tasks, i.e. the function evaluations, are done by the autonomous components of the system. The more general tasks, like the dynamic clustering of data packets, are done by the routers of the network. Findings – Simulation experiments show that the decentralized PSO algorithm can successfully find a set of minimum values for the used test functions. It was also shown that the PSO algorithm works well for different type of networks, like scale‐free network and ring like networks. Originality/value – The proposed decentralization approach is interesting for the design of optimization algorithms that can run on computing systems that use principles of self‐organization and have no central control. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Intelligent Computing and Cybernetics Emerald Publishing

A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO

Download PDF
21 pages

Loading next page...
 
/lp/emerald-publishing/a-decentralization-approach-for-swarm-intelligence-algorithms-in-V1UoSQo6F0
Publisher
Emerald Publishing
Copyright
Copyright © 2008 Emerald Group Publishing Limited. All rights reserved.
ISSN
1756-378X
DOI
10.1108/17563780810857112
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to present an approach for the decentralization of swarm intelligence algorithms that run on computing systems with autonomous components that are connected by a network. The approach is applied to a particle swarm optimization (PSO) algorithm with multiple sub‐swarms. PSO is a nature inspired metaheuristic where a swarm of particles searches for an optimum of a function. A multiple sub‐swarms PSO can be used for example in applications where more than one optimum has to be found. Design/methodology/approach – In the studied scenario the particles of the PSO algorithm correspond to data packets that are sent through the network of the computing system. Each data packet contains among other information the position of the corresponding particle in the search space and its sub‐swarm number. In the proposed decentralized PSO algorithm the application specific tasks, i.e. the function evaluations, are done by the autonomous components of the system. The more general tasks, like the dynamic clustering of data packets, are done by the routers of the network. Findings – Simulation experiments show that the decentralized PSO algorithm can successfully find a set of minimum values for the used test functions. It was also shown that the PSO algorithm works well for different type of networks, like scale‐free network and ring like networks. Originality/value – The proposed decentralization approach is interesting for the design of optimization algorithms that can run on computing systems that use principles of self‐organization and have no central control.

Journal

International Journal of Intelligent Computing and Cybernetics – Emerald Publishing

Published: Mar 28, 2008

Keywords: Programming and algorithm theory; Intelligent networks

References

  • Emergence of scaling in random networks
    Barabasi, A‐L.; Reka, A.
  • Special issue on organic computing
    Bellman, K.L.; Igel, C.; Schmeck, H.; Würtz, R.P.
  • Multi‐swarms, exclusion, and anti‐convergence in dynamic environments
    Blackwell, T.; Branke, J.
  • Multi‐swarm optimization in dynamic environments
    Branke, J.; Blackwell, T.
  • Locating multiple optima using particle swarm optimization
    Brits, R.; Engelbrecht, A.; van den Bergh, F.
  • A data‐clustering algorithm on distributed memory multiprocessors
    Dhillon, I.S.; Modha, D.S.
  • Time dependent vehicle routing problem with a multi ant colony system
    Donati, A.V.; Montemanni, R.; Casagrande, N.; Rizzoli, A.E.; Gambardella, L.M.
  • Ant Colony Optimization
    Dorigo, M.; Stützle, T.
  • Exchange strategies for multiple ant colony system
    Ellabib, I.; Calamai, P.; Basir, O.
  • MACS‐VRPTW: a multiple ant colony system for vehicle routing problems with time windows
    Gambardella, L.M.; Taillard, E.; Agazzi, G.
  • Solving multi‐objective permutation problems with population based ACO
    Guntsch, M.; Middendorf, M.
  • Grid Computing: Making the Global Infrastructure a Reality
    Hey, A.; Fox, G.; Berman, F.
  • Bi‐criterion optimization with multi colony ant algorithms
    Iredi, S.; Merkle, D.; Middendorf, M.
  • Multi‐species particle swarm optimizer for multimodal function optimization
    Iwamatsu, M.
  • Molecular docking with multi‐objective particle swarm optimization
    Janson, S.; Merkle, D.; Middendorf, M.
  • Stereotyping: improving particle swarm performance with cluster analysis
    Kennedy, J.
  • Swarm Intelligence
    Kennedy, J.; Eberhart, R.C.; Shi, Y.
  • A species conserving genetic algorithm for multimodal function optimization
    Li, J.; Balazs, M.E.; Parks, G.T.; Clarkson, P.J.
  • Decentralized packet clustering in router‐based networks
    Merkle, D.; Middendorf, M.; Scheidler, A.
  • Dynamic decentralized packet clustering in networks
    Merkle, D.; Middendorf, M.; Scheidler, A.
  • Genetic algorithms with dynamic niche sharing for multimodal function optimization
    Miller, B.L.; Shaw, M.J.
  • MCPSO: a multi‐swarm cooperative particle swarm optimizer
    Niu, B.; Zhu, Y.; He, X.; Wu, H.
  • A self‐organized grouping (SOG) method for efficient grid resource discovery
    Padmanabhan, A.; Wang, S.; Ghosh, S.; Briggs, R.
  • A particle swarm model for tracking multiple peaks in a dynamic environment using speciation
    Parrott, D.; Li, X.
  • Clustering particles for multimodal function optimization
    Passaro, A.; Starita, A.
  • Organic computing
    Schmeck, H.
  • Using clustering techniques to improve the performance of a multi‐objective particle swarm optimizer
    Toscano‐Pulido, G.; Coello Coello, C.A.
  • The particle swarm optimization algorithm: convergence analysis and parameter selection
    Trelea, I.C.
  • Collective dynamics of ’small‐world’ networks
    Watts, D.J.; Strogatz, S.H.
  • Organic Computing
  • BMPGA: a bi‐objective multi‐population genetic algorithm for multi‐modal function optimization
    Yao, J.; Kharma, N.; Grogono, P.; de Maisonneuve, O.