NDLI: A relationship between network topology and search performance of PSO

Content Provider	IEEE Xplore Digital Library
Author	Tsujimoto, T. Shindo, T. Kimura, T. Jin'no, K.
Copyright Year	2012
Description	Author affiliation: Dept. Electrical and Electronics Eng., Nippon Institute of Technology, Japan (Tsujimoto, T.; Shindo, T.; Kimura, T.; Jin'no, K.)
Abstract	Particle swarm optimization (abbr. PSO) is one of the most effective optimization algorithms. The PSO contains many control parameters, therefore, the performance of the searching ability of the PSO is significantly alternated. In order to analyze the dynamics of such PSO system rigorously, we have analyzed a deterministic PSO (abbr. D-PSO) systems which does not contain any stochastic factors, and its coordinate of the phase space is normalized. The found global best information influences the dynamics. This situation can be regarded as the full-connection state. On the other hand, there is the case where the best information in a limited population. Such information is called as lbest. How to get the lbest information from any population is equivalent to a network structure. Such network structure influences the performance of searching ability. In order to clarify a relationship between network structures of the PSO and its performance, we pay attention to the degree and the average distance used in graph theory. We consider the two cases where the D-PSO has an extended cycle structure and a Small World network structure. Our numerical simulation results indicates the searching performance of the D-PSO is depended on the average distance of the node. Especially, the long average distance exerts the search performance on the D-PSO. We confirm that the search performance properties of the D-PSO and the conventional stochastic PSO are completely different to the average distance. The search performance of the D-PSO is improved according to the average distance. On the other hand, the search performance of the conventional stochastic PSO is deteriorated according to the average distance. We consider that the slow transmission of the beneficial information leads to the diversification of the particles of the D-PSO. Also, we clarify the small perturbation of the random range of the stochastic PSO is important.
Starting Page	1
Ending Page	6
File Size	1085360
Page Count	6
File Format	PDF
ISBN	9781467315104
e-ISBN	9781467315098
e-ISBN	9781467315081
DOI	10.1109/CEC.2012.6256536
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-10
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Eigenvalues and eigenfunctions Numerical simulation Graph theory Numerical models Optimization Acceleration Stochastic systems diversity PSO deterministic complex network small world graph theory average distance stochastic factor perturbation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The neighborhood of canonical deterministic PSO

Particle swarm optimization with switched topology and deterministic parameters

Analysis of dynamical characteristic of canonical deterministic PSO

Synchronization in weighted NW small world network

Moment-based analysis of synchronization in small-world networks of oscillators

Cayley graphs as models of deterministic small-world networks (2006)

Distributed average consensus with increased convergence rate

Synchronizability Optimization for Tree-structured Deterministic Small-world Network with Modified Simulated Annealing Algorithm

Complex networks: Deterministic models

A relationship between network topology and search performance of PSO

Similar Documents

The neighborhood of canonical deterministic PSO

Particle swarm optimization with switched topology and deterministic parameters

Analysis of dynamical characteristic of canonical deterministic PSO

Synchronization in weighted NW small world network

Moment-based analysis of synchronization in small-world networks of oscillators

Cayley graphs as models of deterministic small-world networks (2006)

Distributed average consensus with increased convergence rate

Synchronizability Optimization for Tree-structured Deterministic Small-world Network with Modified Simulated Annealing Algorithm

Complex networks: Deterministic models

A relationship between network topology and search performance of PSO