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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , |
|---|---|
| Format: | Artikel |
| Diterbitkan: |
2012
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/46648/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!