An improved discrete particle swarm optimization based on cooperative swarms

Yiheng Xu; Qiangwei Wang; Jinglu Hu

doi:10.1109/WIIAT.2008.103

An improved discrete particle swarm optimization based on cooperative swarms

Yiheng Xu^*, Qiangwei Wang, Jinglu Hu

^*Corresponding author for this work

Graduate School of Information, Production and Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 Citations (Scopus)

Abstract

The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an improved DPSO based on cooperative swarms, which partition the search space into lower dimensional subspaces. The k-means split scheme and regular split scheme are applied to split the solution vector into swarms. Then the swarms optimize the different components of the solution vector cooperatively. Some strategies are further used to improve the accuracy and convergence. Application of the proposed cooperative swarms based DPSO (CDPSO) on the traveling salesman problem (TSP) shows a significant improvement over conventional DPSOs.

Original language	English
Title of host publication	Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
Pages	79-82
Number of pages	4
DOIs	https://doi.org/10.1109/WIIAT.2008.103
Publication status	Published - 2008 Dec 1
Event	2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 - Sydney, NSW, Australia Duration: 2008 Dec 9 → 2008 Dec 12

Publication series

Name	Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

Conference

Conference	2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
Country/Territory	Australia
City	Sydney, NSW
Period	08/12/9 → 08/12/12

ASJC Scopus subject areas

Artificial Intelligence
Software

Access to Document

10.1109/WIIAT.2008.103

Cite this

Xu, Y., Wang, Q., & Hu, J. (2008). An improved discrete particle swarm optimization based on cooperative swarms. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 (pp. 79-82). [4740600] (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008). https://doi.org/10.1109/WIIAT.2008.103

An improved discrete particle swarm optimization based on cooperative swarms. / Xu, Yiheng; Wang, Qiangwei; Hu, Jinglu.
Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. p. 79-82 4740600 (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Xu, Y, Wang, Q & Hu, J 2008, An improved discrete particle swarm optimization based on cooperative swarms. in Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008., 4740600, Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008, pp. 79-82, 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008, Sydney, NSW, Australia, 08/12/9. https://doi.org/10.1109/WIIAT.2008.103

@inproceedings{b0392b7d8c364aefae5c7c9ca8c3b929,

title = "An improved discrete particle swarm optimization based on cooperative swarms",

abstract = "The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an improved DPSO based on cooperative swarms, which partition the search space into lower dimensional subspaces. The k-means split scheme and regular split scheme are applied to split the solution vector into swarms. Then the swarms optimize the different components of the solution vector cooperatively. Some strategies are further used to improve the accuracy and convergence. Application of the proposed cooperative swarms based DPSO (CDPSO) on the traveling salesman problem (TSP) shows a significant improvement over conventional DPSOs.",

author = "Yiheng Xu and Qiangwei Wang and Jinglu Hu",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/WIIAT.2008.103",

language = "English",

isbn = "9780769534961",

series = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",

pages = "79--82",

booktitle = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",

note = "2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 ; Conference date: 09-12-2008 Through 12-12-2008",

}

TY - GEN

T1 - An improved discrete particle swarm optimization based on cooperative swarms

AU - Xu, Yiheng

AU - Wang, Qiangwei

AU - Hu, Jinglu

PY - 2008/12/1

Y1 - 2008/12/1

N2 - The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an improved DPSO based on cooperative swarms, which partition the search space into lower dimensional subspaces. The k-means split scheme and regular split scheme are applied to split the solution vector into swarms. Then the swarms optimize the different components of the solution vector cooperatively. Some strategies are further used to improve the accuracy and convergence. Application of the proposed cooperative swarms based DPSO (CDPSO) on the traveling salesman problem (TSP) shows a significant improvement over conventional DPSOs.

AB - The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an improved DPSO based on cooperative swarms, which partition the search space into lower dimensional subspaces. The k-means split scheme and regular split scheme are applied to split the solution vector into swarms. Then the swarms optimize the different components of the solution vector cooperatively. Some strategies are further used to improve the accuracy and convergence. Application of the proposed cooperative swarms based DPSO (CDPSO) on the traveling salesman problem (TSP) shows a significant improvement over conventional DPSOs.

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

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

U2 - 10.1109/WIIAT.2008.103

DO - 10.1109/WIIAT.2008.103

M3 - Conference contribution

AN - SCOPUS:62949224160

SN - 9780769534961

T3 - Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

SP - 79

EP - 82

BT - Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

T2 - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

Y2 - 9 December 2008 through 12 December 2008

ER -

An improved discrete particle swarm optimization based on cooperative swarms

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this