Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An assembly sequence planning approach with a discrete particle swarm optimization algorithm

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, a discrete particle swarm optimization (DPSO) algorithm is proposed to solve the assembly sequence planning (ASP) problem. To make the DPSO algorithm effective for solving ASP, some key technologies including a special coding method of the position and velocity of particles and corresponding operators for updating the position and velocity of particles are proposed and defined. The evolution performance of the DPSO algorithm with different setting of control parameters is investigated, and the performance of the proposed DPSO algorithm to solve ASP is verified through a case study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bonneville F, Perrard C, Henrioud, JM (1995) A genetic algorithm to generate and evaluate assembly plans. IEEE Symposium on Emerging Technology and Factory Automation, Paris, France, vol 2, pp 231–239

  2. Lazzerini B, Marcelloni F (2000) A genetic algorithm for generating optimal assembly plans. Artif Intell Eng 14:319–329

    Article  Google Scholar 

  3. Guan Q, Liu JH, Zhong YF (2002) A concurrent hierarchical evolution approach to assembly process. Int J Prod Res 40(14):3357–3374

    Article  MATH  Google Scholar 

  4. Ong SK, Ding J, Nee AYC (2002) Hybrid GA and SA dynamic set-up planning optimization. Int J Prod Res 40(18):4697–4719

    Article  MATH  Google Scholar 

  5. Milner JM, Graves SC, Whitney DE (1994) Using simulated annealing to select least-cost assembly sequences. Proc IEEE Conference on Robotics and Automation, San Diego, CA, USA, pp 2058–2063

  6. Wang JF, Liu JH, Zhong YF (2005) A novel ant colony algorithm for assembly sequence planning. Int J Adv Manuf Technol 25:1137–1143

    Article  Google Scholar 

  7. Failli F, Dini G (2000) Ant colony systems in assembly planning: a new approach to sequence detection and optimization. Proceedings of the 2nd CIRP International Seminar on Intelligent Computation in Manufacturing Engineering, Capri, Italy, pp 227–232

  8. Zhan ZH, Zhang J (2009) Discrete Particle Swarm Optimization for Multiple Destination Routing Problems. Applications of Evolutionary Computing, EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG, Tubingen, Germany, pp 117–122

  9. Chen YM, Lin CT (2007) A particle swarm optimization approach to optimize component placement in printed circuit board assembly. Int J Adv Manuf Technol 35:610–620

    Article  Google Scholar 

  10. Rameshkumar K, Suresh RK, Mohanasundaram KM (2005) Discrete Particle Swarm optimization (DPSO) Algorithm for permutation flowshop scheduling to minimize makespan. First International Conference on Natural Computation, ICNC 2005, Changsha, China, pp 572–581

  11. Liu B, Wang L, Jin YH (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern Part B Cybern 37(1):18–27

    Article  Google Scholar 

  12. Shen B, Yao M, Yi WS (2006) Heuristic information based improved fuzzy discrete PSO method for solving TSP. 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, pp 859–863

  13. Shuang B, Chen JP, Li ZB (2008) Microrobot based micro-assembly sequence planning with hybrid ant colony algorithm. Int J Adv Manuf Technol 38:1227–1235

    Article  Google Scholar 

  14. Wang M, Ye BL (2008) Assembly planning based on a particle swarm optimization algorithm. Dual Use Technol Prod 1:44–45 (in Chinese)

    Google Scholar 

  15. Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp 1942–1948

  16. Lu C, Wong YS, Fuh JYH (2006) An enhanced assembly planning approach using a multi-objective genetic algorithm. Proc Inst Mech Eng Part B J Eng Manuf 220(2):255–272

    Article  Google Scholar 

  17. Dini G, Santochi M (1992) Automated sequencing and subassembly detection in assembly planning. CIRP Ann 41(1):1–4

    Article  Google Scholar 

  18. Wang L, Liu B (2008) Particle swarm optimization and scheduling algorithms. Tsinghua University Press, Beijing, in Chinese

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechatronics Engineering, University of Electronic Science and Technology of China, Chengdu, China

    HongGuang Lv & Cong Lu

  2. State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an, China

    Cong Lu

Authors
  1. HongGuang Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cong Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lv, H., Lu, C. An assembly sequence planning approach with a discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 50, 761–770 (2010). https://doi.org/10.1007/s00170-010-2519-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2519-4

Keywords

Search

Navigation