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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|