Skip to main content

A Research on Bending Process Planning Based on Improved Particle Swarm Optimization

  • Conference paper
  • First Online:
Intelligent Robotics and Applications (ICIRA 2021)

Abstract

In order to ensure the accuracy and efficiency of sheet metal bending, a more efficient bending process planning algorithm is required. First of all, under the premise of comprehensively considering interference discrimination and efficiency guarantee, this paper establishes the fitness function of the process planning problem, and converts the process of selecting the optimal process into a problem of solving the optimal solution of the function. Then, since Particle Swarm optimization is easy to fall into the local optimal solution, an improved algorithm is proposed to solve the optimal process. Finally, the optimal bending process of sheet metal parts with different complexity is solved by experiments. The results show that the improved algorithm can calculate the optimal or nearly optimal results within a reasonable time range when there are more bending steps.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wagner, S., Sathe, M., Schenk, O.: Optimization for process plans in sheet metal forming. Int. J. Adv. Manuf. Technol. 71(5–8), 973–982 (2013)

    Article  Google Scholar 

  2. Raj Prasanth, D., Shunmugam, M.S.: Geometry-based bend feasibility matrix for bend sequence planning of sheet metal parts. Int. J. Comput. Integr. Manuf. 33(5), 1–16 (2020)

    Google Scholar 

  3. Lin, A.C., Chen, C.F.: Sequence planning and tool selection for bending processes of 2.5D sheet metals. Adv. Mech. Eng. 6, 1–28 (2014)

    Google Scholar 

  4. Salem, A.A., Abdelmaguid, T.F., Wifi, A.S., Elmokadem, A.: Towards an efficient process planning of the V-bending process: an enhanced automated feature recognition system. Int. J. Adv. Manuf. Technol. 91(9–12), 4163–4181 (2017)

    Article  Google Scholar 

  5. Faraz, Z., et al.: Sheet-metal bend sequence planning subjected to process and material variations. Int. J. Adv. Manuf. Technol. 88(1–4), 815–826 (2016)

    Article  Google Scholar 

  6. Panghal, D., et al.: An automatic system for deciding bend sequence of bending parts. Adv. Mater. Process. Technol. 1, 1–2 (2015)

    Google Scholar 

  7. Farsi, M.A., Arezoo, B.: Development of a new method to determine bending sequence in progressive dies. Int. J. Adv. Manuf. Technol. 43(1), 52–60 (2009)

    Google Scholar 

  8. Dahmane, S.A., et al.: Determination of the optimal path of three axes robot using genetic algorithm. Int. J. Eng. Res. Africa 44, 125–149 (2019)

    Google Scholar 

  9. Yao, F., et al.: Multi-mobile robots and multi-trips feeding scheduling problem in smart manufacturing system: an improved hybrid genetic algorithm. Int. J. Adv. Robot. Syst. 16(4), (2019).

    Google Scholar 

  10. Peng Chen, et al.: Hybrid chaos-based particle swarm optimization-ant colony optimization algorithm with asynchronous pheromone updating strategy for path planning of landfill inspection robots. International Journal of Advanced Robotic Systems16(4), 172988141986812 (2019)

    Google Scholar 

  11. Tang, B., et al.: Multi-robot path planning using an improved self-adaptive particle swarm optimization. Int. J. Adv. Robot. Syst. 17(5), 172988142093615 (2020)

    Google Scholar 

  12. Kannan, T.R., Shunmugam, M.S.: Planner for sheet metal components to obtain optimal bend sequence using a genetic algorithm. Int. J. Comput. Integr. Manuf. 21(7), 790–802 (2008)

    Article  Google Scholar 

  13. Park, H.S., Anh, T.V.: Optimization of bending sequence in roll forming using neural network and genetic algorithm. J. Mech. Sci. Technol. 25(8), 2127–2136 (2011)

    Article  Google Scholar 

  14. Muthiah, A., Rajkumar, R.: A comparison of artificial bee colony algorithm and genetic algorithm to minimize the makespan for job shop scheduling. Procedia Eng. 97, 1745–1754 (2014)

    Article  Google Scholar 

  15. Jordehi, A.R.: Enhanced leader PSO (ELPSO): a new PSO variant for solving global optimisation problems. Appl. Soft Comput. J. 26, 401–417 (2014)

    Article  Google Scholar 

Download references

Acknowledgment

This research is supported by the National Natural Science Foundation of China (51775284), the Primary Research & Development Plan of Jiangsu Province (BE2018734), the Natural Science Foundation of Jiangsu Province (BK20201379), and Six Talent Peaks Project in Jiangsu Province (JY-081).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sen, Y., Ma, K., Yi, Z., Xu, F. (2021). A Research on Bending Process Planning Based on Improved Particle Swarm Optimization. In: Liu, XJ., Nie, Z., Yu, J., Xie, F., Song, R. (eds) Intelligent Robotics and Applications. ICIRA 2021. Lecture Notes in Computer Science(), vol 13013. Springer, Cham. https://doi.org/10.1007/978-3-030-89095-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89095-7_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89094-0

  • Online ISBN: 978-3-030-89095-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics