Abstract
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 only the feasible sequences will be iterated in the process. An archive is used in storing the feasible sequences and a swap mechanism is used to identify the feasible sequences for iteration. As the nature of assembly sequence planning is a discrete type of problem Binary PSO technique is used.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
