A new cooperative approach to discrete particle swarm optimization

Yiheng Xu, Takayuki Furuzuki, Kotaro Hirasawa, Xiaohong Pang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal (or near optimal) solutions for numerical and qualitative problems. Recently, a new variation on the traditional PSO algorithm, called cooperative particle swarm optimization (CPSO), has been proposed, employing cooperative behavior to significantly improve the performance of the original algorithm. However, a standard CPSO is focused only on continuous problems. In this paper, we present a new approach based on the CPSO to solve combination optimization problems by introducing dynamic splitting schemes. Reverse operation and simulated annealing techniques are further used to prevent the algorithm from being trapped in local minima. Finally, Traveling salesman problem (TSP) is applied to show the effectiveness of the proposed PSO.

Original languageEnglish
Title of host publicationProceedings of the SICE Annual Conference
Pages1311-1316
Number of pages6
DOIs
Publication statusPublished - 2007
EventSICE(Society of Instrument and Control Engineers)Annual Conference, SICE 2007 - Takamatsu
Duration: 2007 Sep 172007 Sep 20

Other

OtherSICE(Society of Instrument and Control Engineers)Annual Conference, SICE 2007
CityTakamatsu
Period07/9/1707/9/20

Fingerprint

Particle swarm optimization (PSO)
Traveling salesman problem
Simulated annealing
Evolutionary algorithms

Keywords

  • Cooperative swarm
  • Dynamic splitting
  • Particle swarm optimization
  • Traveling salesman problem

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Xu, Y., Furuzuki, T., Hirasawa, K., & Pang, X. (2007). A new cooperative approach to discrete particle swarm optimization. In Proceedings of the SICE Annual Conference (pp. 1311-1316). [4421186] https://doi.org/10.1109/SICE.2007.4421186

A new cooperative approach to discrete particle swarm optimization. / Xu, Yiheng; Furuzuki, Takayuki; Hirasawa, Kotaro; Pang, Xiaohong.

Proceedings of the SICE Annual Conference. 2007. p. 1311-1316 4421186.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xu, Y, Furuzuki, T, Hirasawa, K & Pang, X 2007, A new cooperative approach to discrete particle swarm optimization. in Proceedings of the SICE Annual Conference., 4421186, pp. 1311-1316, SICE(Society of Instrument and Control Engineers)Annual Conference, SICE 2007, Takamatsu, 07/9/17. https://doi.org/10.1109/SICE.2007.4421186
Xu Y, Furuzuki T, Hirasawa K, Pang X. A new cooperative approach to discrete particle swarm optimization. In Proceedings of the SICE Annual Conference. 2007. p. 1311-1316. 4421186 https://doi.org/10.1109/SICE.2007.4421186
Xu, Yiheng ; Furuzuki, Takayuki ; Hirasawa, Kotaro ; Pang, Xiaohong. / A new cooperative approach to discrete particle swarm optimization. Proceedings of the SICE Annual Conference. 2007. pp. 1311-1316
@inproceedings{322a4fe8969a40c683494c099fde45bf,
title = "A new cooperative approach to discrete particle swarm optimization",
abstract = "Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal (or near optimal) solutions for numerical and qualitative problems. Recently, a new variation on the traditional PSO algorithm, called cooperative particle swarm optimization (CPSO), has been proposed, employing cooperative behavior to significantly improve the performance of the original algorithm. However, a standard CPSO is focused only on continuous problems. In this paper, we present a new approach based on the CPSO to solve combination optimization problems by introducing dynamic splitting schemes. Reverse operation and simulated annealing techniques are further used to prevent the algorithm from being trapped in local minima. Finally, Traveling salesman problem (TSP) is applied to show the effectiveness of the proposed PSO.",
keywords = "Cooperative swarm, Dynamic splitting, Particle swarm optimization, Traveling salesman problem",
author = "Yiheng Xu and Takayuki Furuzuki and Kotaro Hirasawa and Xiaohong Pang",
year = "2007",
doi = "10.1109/SICE.2007.4421186",
language = "English",
isbn = "4907764286",
pages = "1311--1316",
booktitle = "Proceedings of the SICE Annual Conference",

}

TY - GEN

T1 - A new cooperative approach to discrete particle swarm optimization

AU - Xu, Yiheng

AU - Furuzuki, Takayuki

AU - Hirasawa, Kotaro

AU - Pang, Xiaohong

PY - 2007

Y1 - 2007

N2 - Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal (or near optimal) solutions for numerical and qualitative problems. Recently, a new variation on the traditional PSO algorithm, called cooperative particle swarm optimization (CPSO), has been proposed, employing cooperative behavior to significantly improve the performance of the original algorithm. However, a standard CPSO is focused only on continuous problems. In this paper, we present a new approach based on the CPSO to solve combination optimization problems by introducing dynamic splitting schemes. Reverse operation and simulated annealing techniques are further used to prevent the algorithm from being trapped in local minima. Finally, Traveling salesman problem (TSP) is applied to show the effectiveness of the proposed PSO.

AB - Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal (or near optimal) solutions for numerical and qualitative problems. Recently, a new variation on the traditional PSO algorithm, called cooperative particle swarm optimization (CPSO), has been proposed, employing cooperative behavior to significantly improve the performance of the original algorithm. However, a standard CPSO is focused only on continuous problems. In this paper, we present a new approach based on the CPSO to solve combination optimization problems by introducing dynamic splitting schemes. Reverse operation and simulated annealing techniques are further used to prevent the algorithm from being trapped in local minima. Finally, Traveling salesman problem (TSP) is applied to show the effectiveness of the proposed PSO.

KW - Cooperative swarm

KW - Dynamic splitting

KW - Particle swarm optimization

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=50249134982&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249134982&partnerID=8YFLogxK

U2 - 10.1109/SICE.2007.4421186

DO - 10.1109/SICE.2007.4421186

M3 - Conference contribution

AN - SCOPUS:50249134982

SN - 4907764286

SN - 9784907764289

SP - 1311

EP - 1316

BT - Proceedings of the SICE Annual Conference

ER -