A novel binary particle swarm optimization

Mojtaba Ahmadieh Khanesar; Mohammad Teshnehlab; Mahdi Aliyari Shoorehdeli

doi:10.1109/MED.2007.4433821

A novel binary particle swarm optimization

Mojtaba Ahmadieh Khanesar, Mohammad Teshnehlab, Mahdi Aliyari Shoorehdeli

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.

Original language	English
Title of host publication	2007 Mediterranean Conference on Control and Automation, MED
Publication date	2007
Article number	4433821
ISBN (Print)	142441282X, 9781424412822
DOIs	https://doi.org/10.1109/MED.2007.4433821
Publication status	Published - 2007
Externally published	Yes
Event	2007 Mediterranean Conference on Control and Automation, MED - Athens, Greece Duration: 27 Jul 2007 → 29 Jul 2007

Conference

Conference	2007 Mediterranean Conference on Control and Automation, MED
Country	Greece
City	Athens
Period	27/07/2007 → 29/07/2007

Keywords

Binary particle swarm optimization
Computational intelligence
Discrete optimization

Access to Document

10.1109/MED.2007.4433821

Fingerprint Dive into the research topics of 'A novel binary particle swarm optimization'. Together they form a unique fingerprint.

Cite this

@inproceedings{4a91f47e31a544ecb981bd52981e80c5,

title = "A novel binary particle swarm optimization",

abstract = "Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.",

keywords = "Binary particle swarm optimization, Computational intelligence, Discrete optimization",

author = "Khanesar, {Mojtaba Ahmadieh} and Mohammad Teshnehlab and Shoorehdeli, {Mahdi Aliyari}",

year = "2007",

doi = "10.1109/MED.2007.4433821",

language = "English",

isbn = "142441282X",

booktitle = "2007 Mediterranean Conference on Control and Automation, MED",

note = "2007 Mediterranean Conference on Control and Automation, MED ; Conference date: 27-07-2007 Through 29-07-2007",

}

TY - GEN

T1 - A novel binary particle swarm optimization

AU - Khanesar, Mojtaba Ahmadieh

AU - Teshnehlab, Mohammad

AU - Shoorehdeli, Mahdi Aliyari

PY - 2007

Y1 - 2007

N2 - Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.

AB - Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.

KW - Binary particle swarm optimization

KW - Computational intelligence

KW - Discrete optimization

U2 - 10.1109/MED.2007.4433821

DO - 10.1109/MED.2007.4433821

M3 - Article in proceedings

AN - SCOPUS:50249096788

SN - 142441282X

SN - 9781424412822

BT - 2007 Mediterranean Conference on Control and Automation, MED

T2 - 2007 Mediterranean Conference on Control and Automation, MED

Y2 - 27 July 2007 through 29 July 2007

ER -