Skip to main content

Designing a Near Optimal Solution via Simulated Annealing for Dimensional Chain Assembly

  • Conference paper
  • First Online:
Frontier Computing (FC 2019)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 551))

Included in the following conference series:

  • 85 Accesses

Abstract

To assembly products from some workpiece, the assemblies have to calculate the assemble plan in advance. However, the workpiece of different parts result in the product sizes, and calculating the assembly plan efficiently to assemble the products what fit the requirements is necessary. In this paper, we first define the dimensional chain assembly (DCA) problem, and propose a simulated annealing-based algorithm to calculate the assembly plan. We find out the threshold of the maximum iterations and the balance between the solution quality and the computational efficiency.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Cao, Y., Liu, T., Yang, J.: A comprehensive review of tolerance analysis models. Int. J. Adv. Manuf. Technol. 97(5–8), 3055–3085 (2018)

    Article  Google Scholar 

  2. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.M.T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  3. Kennedy, J., Eberhart, R.: Particle swarm optimization (PSO). In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  4. Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on IEEE Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1470–1477 (1999)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by National Chin-Yi University of Technology Taiwan under Grant no. NCUT 19-R-CC-008. The authors would like to thank reviewers for their insightful comments which helped to significantly improve the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen-Kun Tsung .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tsung, CK., Huang, HY., Yang, SH., Tsou, PN., Tsai, MC., Huang, YP. (2020). Designing a Near Optimal Solution via Simulated Annealing for Dimensional Chain Assembly. In: Hung, J., Yen, N., Chang, JW. (eds) Frontier Computing. FC 2019. Lecture Notes in Electrical Engineering, vol 551. Springer, Singapore. https://doi.org/10.1007/978-981-15-3250-4_39

Download citation

Publish with us

Policies and ethics