Particle swarm optimization & gravitational search algorithm in sequential process planning
The purpose of this study is to investigate the application of particle swarm optimization (PSO) and gravitational search algorithm (GSA) in assembly sequence planning problem, to look for the sequence which require the least assembly time. The problem model is an assembly process with 25 parts, whi...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | English |
| منشور في: |
2013
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.utm.my/id/eprint/33817/5/LimTiekYeeMFKE2013.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | The purpose of this study is to investigate the application of particle swarm optimization (PSO) and gravitational search algorithm (GSA) in assembly sequence planning problem, to look for the sequence which require the least assembly time. The problem model is an assembly process with 25 parts, which is a high dimension and also NP-hard problem. The study is focused on the comparison between both algorithms and investigation on which method perform better in term of convergence rate and the ability to escape local solution. In this study, the PSO are improved in term of random mechanism and GSA algorithms are improved in term of algorithm in order to improve convergence rate and overcome weak convergence respectively. The quality of randomness is also discussed. The simulation results show that PSO can find better optimum sequence than GSA does. |
|---|