Skip to main content

Ant Colony Optimization to Improve Precision of Complex Assembly

  • Conference paper
Advanced Research on Computer Science and Information Engineering (CSIE 2011)

Abstract

An assembly consists of two or more mating parts. The quality of the assembly is mainly based on the quality of mating parts. The mating parts may be manufactured using different machines and processes with different standard deviations. Therefore, the dimensional distributions of the mating parts are not similar. This results in clearance between the mating parts. To obtain high precision assemblies, clearance variation has to be reduced. Selective assembly helps to reduce this clearance variation. In this paper, appropriate selective group combination for assembling the mating parts is obtained using an ant colony optimization (ACO). The combination obtained has resulted in an appreciable reduction in clearance variations.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kannan, S.M., Jayabalan, V.: A new grouping method for minimizing the surplus parts in selective assembly. Qual. Eng. 14(1), 67–75 (2001a)

    Article  Google Scholar 

  2. Kannan, S.M., Jayabalan, V.: A new grouping method to minimize surplus parts in selective assembly for complex assemblies. Int. J. Prod. Res. 39(9), 1851–1864 (2001b)

    Article  Google Scholar 

  3. Kannan, S.M., Jayabalan, V., Jeevanantham, K.: Genetic algorithm for minimizing assembly variation in selective assembly. Int. J. Prod. Res. 41, 3301–3313 (2003)

    Article  Google Scholar 

  4. Asha, A., Kannan, S.M., Jayabalan, V.: Optimization of clearance variation in selective assembly for components with multiple characteristics. Int. J. of Adv. Manuf. Technol. 38, 1026–1044 (2008)

    Article  Google Scholar 

  5. Mease, D., Nair, V.N., Sudjianto, A.: Selective assembly in manufacturing: statistical issues and optimal binning strategies. Technometrics 46(2), 165–175 (2004)

    Article  MathSciNet  Google Scholar 

  6. Matsuura, S., Shinozaki, N.: Optimal process design in selective assembly when components with smaller variance are manufactured at three shifted means. Int. J. Prod. Res., 1–14 (2010) iFirst

    Google Scholar 

  7. Dorigo, M.: Optimization, learning and natural algorithms (in Italian ). Ph.D. thesis, Department di Elettronica, Politecnico di Milano, Italy (1992)

    Google Scholar 

  8. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man. Cybern. Part B 26, 29–41 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raj, M.V., Sankar, S.S., Ponnambalam, S.G. (2011). Ant Colony Optimization to Improve Precision of Complex Assembly. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21402-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21402-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21401-1

  • Online ISBN: 978-3-642-21402-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics