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 | |
Publication status | Published - 2007 |
Externally published | Yes |
Event | 2007 IEEE Mediterranean Conference on Control and Automation - Divani Caravel Hotel, Athens, Greece Duration: 27 Jun 2007 → 29 Jun 2007 Conference number: 15 https://ieeexplore.ieee.org/xpl/conhome/4433643/proceeding |
Conference
Conference | 2007 IEEE Mediterranean Conference on Control and Automation |
---|---|
Number | 15 |
Location | Divani Caravel Hotel |
Country/Territory | Greece |
City | Athens |
Period | 27/06/2007 → 29/06/2007 |
Internet address |
Keywords
- Binary particle swarm optimization
- Computational intelligence
- Discrete optimization