A binary particle swarm optimization approach to optimize assembly sequence planning
This paper presents an approach of applying Binary Particle Swarm Optimization (BPSO) algorithm to an assembly sequence-planning (ASP) problem. Permutation encoding of sequences is used to represent particles, then those particles are strictly subjected to a precedence constraint matrix at which onl...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , , , , |
|---|---|
| Format: | Artikel |
| Diterbitkan: |
2012
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/46466/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!