Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
The majority of Combinatorial Optimization Problems (COPs) are defined in the discrete space. Hence, proposing an efficient algorithm to solve the problems has become an attractive subject in recent years. In this paper, a meta-heuristic algorithm based on Binary Particle Swarm Algorithm (BPSO) and...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer Science+Business Media New York
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/46648/ http://dx.doi.org/10.1007/s10898-012-0006-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|