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...
保存先:
主要な著者: | , , , |
---|---|
フォーマット: | Conference or Workshop Item |
出版事項: |
2011
|
オンライン・アクセス: | http://eprints.utm.my/id/eprint/45464/ https://www.researchgate.net/publication/240917767_A_Binary_Particle_Swarm_Optimization_Approach_to_Optimize_Assembly_Sequence_Planning |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
このレコードへの初めてのコメントを付けませんか!