Skip to main content
SpringerLink
Log in

A novel approach in selective assembly with an arbitrary distribution to minimize clearance variation using evolutionary algorithms: a comparative study

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

The minimization of surplus components with normal dimensional distributions while making selective assemblies was the only objective considered in the previous research works carried out by various researchers in different periods. Seldom works have been found on selective assembly by considering all dimensional distributions. In this proposed work, a novel method is developed for making assemblies with zero surplus components and minimum clearance variation by considering arbitrary distribution, to demonstrate the greater improvement in the results than the past literature. Krill Herd algorithm has been implemented for identifying the best combination of groups. Computational results showed that the proposed krill herd algorithm outperformed as compared with existing literature and as well as the results by gaining-sharing knowledge-based algorithm, differential evolution algorithm, and particle swarm optimization algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Abbreviations

A, B and C :

Name of the components in the assembly

NP jk :

Number of parts in jth component presents in kth group

T j :

Tolerance of jth component

ng :

Number of groups

L :

Length of the best combination of the group’s string

itr :

Index for iteration number

nitr :

Number of iterations

α :

A constant value assumed between 0 and 3

N :

Number of components in the assembly

R jk :

Repetition of jth components of kth group

nk :

Number of krill

P ijk :

ith krill random combination of a group of jth component in kth group

i :

Index to represent krill number

j :

Index to represent a component number in the assembly

k :

Index to represent group number

l :

Index to represent nearby krill

gw j :

Group width of jth component

CX ik :

Maximum clearance of assembly obtained by matching the kth group components of A, B and C of ith krill

CM ik :

Minimum clearance of assembly obtained by matching the kth group components of A, B and C of ith krill

NA ik :

Number of assemblies made by matching the kth group components of A, B and C of ith krill

NA i :

Number of assemblies made in ith krill

O i :

Fitness value/Clearance variation of ith krill obtained by matching the components A, B and C based on Pijk

O max :

Minimum value of clearance variation

O min :

Maximum value of clearance variation

P b :

Best combination of groups corresponding to Omax

P w :

Worst combination of groups corresponding to Omin

O b :

Equal to Omax

O w :

Equal to Omin

pbP ij :

Previous best combination of groups of ith krill jth component

pbO i :

Previous best clearance variation value of ith krill

ds i :

Sensing distance of ith krill

P i :

ith krill combination of groups

P j :

jth krill combination of groups

nn i :

Number of krill nearby to ith krill

\( a_{i}^{t\arg et} \) :

Target effect of ith krill

Target effect of ith krill

O ib :

Normalized fitness value of ith krill with respect to best fitness value

O i :

Fitness value of ith krill

ɸ :

A constant small value assumed as 0.15

P ib :

Normalized combination of groups of ith krill concerning the best combination of groups

\( a_{i}^{local} \) :

Local effect of ith krill

O il :

Normalized fitness value concerning nearby lth krill

O l :

Fitness value of nearby lth krill

P il :

Normalized value of the combination of groups concerning nearby lth krill combination of groups value

a i :

Motion of ith krill induced by krill swamp

\( N_{i}^{o} ,N_{i}^{n} \) :

Old and new motion induced by ith krill

P f :

Location of food

C f :

Value of food concentration

\( b_{i}^{f} \) :

Movement of ith krill due to the attraction of food

O if :

Normalized fitness value of ith krill concerning the location of food

O f :

Fitness value concerning the location of food

P if :

Normalized combination of groups of ith krill concerning the location of food

\( b_{i}^{b} \) :

Movement of ith krill due to previously experienced best fitness value

pbO i :

Best fitness value of ith krill with respect to its previous experienced fitness value

pbP i :

Best combination of groups of ith krill concerning its previous experienced best fitness value

O ipb :

Normalized fitness value of ith krill concerning previous best fitness value

P ipb :

Normalized combination of groups value of ith krill concerning the previous best combination of groups

\( F_{i}^{o} ,F_{i}^{n} \) :

Old and new foraging motion induced by ith krill

δ :

Random directional vector ranges between – 1 and 1

dt :

Scale factor

\( P_{i}^{o} ,P_{i}^{n} \) :

Old and new combination of groups value of ith krill where \( P_{i}^{o} \) is equal to Pijk during initialization and after replacement \( P_{i}^{n} \) becomes Pijk

References

  • Abualigah, L. M. Q. (2019). Feature selection and enhanced krill herd algorithm for text document clustering (pp. 1–165). Berlin: Springer.

    Book  Google Scholar 

  • Abualigah, L. M., Khader, A. T., & Hanandeh, E. S. (2018). Hybrid clustering analysis using improved krill herd algorithm. Applied Intelligence, 48(11), 4047–4071.

    Article  Google Scholar 

  • Aderiani, A. R., Wärmefjord, K., & Söderberg, R. (2018). A multistage approach to the selective assembly of components without dimensional distribution assumptions. Journal of Manufacturing Science and Engineering, 140(7), 071015.

    Article  Google Scholar 

  • Alajmi, M. S., Alfares, F. S., & Alfares, M. S. (2019). Selection of optimal conditions in the surface grinding process using the quantum based optimisation method. Journal of Intelligent Manufacturing, 30(3), 1469–1481.

    Article  Google Scholar 

  • Asha, A., & Babu, J. R. (2017). Comparison of clearance variation using selective assembly and metaheuristic Approach. International Journal of Latest Trends in Engineering and Technology, 8(3), 148–155.

    Google Scholar 

  • Asha, A., Kannan, S. M., & Jayabalan, V. (2008). Optimization of clearance variation in selective assembly for components with multiple characteristics. The International Journal of Advanced Manufacturing Technology, 38(9–10), 1026–1044.

    Article  Google Scholar 

  • Asli, B. Z., Haddad, O. B., & Chu, X. (2018). Krill Herd Algorithm (KHA). In O. B. Haddad (Ed.), Advanced optimization by nature-inspired algorithms (pp. 69–79). New York: Springer.

    Google Scholar 

  • Babu, J. R., & Asha, A. (2014). Tolerance modelling in selective assembly for minimizing linear assembly tolerance variation and assembly cost by using Taguchi and AIS algorithm. The International Journal of Advanced Manufacturing Technology, 75(5–8), 869–881.

    Article  Google Scholar 

  • Babu, J. R., & Asha, A. (2015). Modelling in selective assembly with symmetrical interval-based Taguchi loss function for minimising assembly loss and clearance variation. International Journal of Manufacturing Technology and Management, 29(5–6), 288–308.

    Article  Google Scholar 

  • Bolaji, A. L. A., Al-Betar, M. A., Awadallah, M. A., Khader, A. T., & Abualigah, L. M. (2016). A comprehensive review: Krill Herd algorithm (KH) and its applications. Applied Soft Computing, 49, 437–446.

    Article  Google Scholar 

  • Brajević, I., & Ignjatović, J. (2019). An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems. Journal of Intelligent Manufacturing, 30(6), 2545–2574.

    Article  Google Scholar 

  • Brajević, I., & Stanimirović, P. (2018). An improved chaotic firefly algorithm for global numerical optimization. International Journal of Computational Intelligence Systems, 12(1), 131–148.

    Article  Google Scholar 

  • Brajević, I., Stanimirović, P. S., Li, S., & Cao, X. (2020). A Hybrid Firefly and Multi-Strategy Artificial Bee Colony Algorithm. International Journal of Computational Intelligence Systems, 13(1), 810.

    Article  Google Scholar 

  • Cheng, Z., Wang, H., & Liu, G. R. (2020). Deep convolutional neural network aided optimization for cold spray 3D simulation based on molecular dynamics. Journal of Intelligent Manufacturing. https://doi.org/10.1007/s10845-020-01599-6.

    Article  Google Scholar 

  • Chu, X., Xu, H., Wu, X., Tao, J., & Shao, G. (2018). The method of selective assembly for the RV reducer based on genetic algorithm. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 232(6), 921–929.

    Google Scholar 

  • Derrac, J., García, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1), 3–18.

    Article  Google Scholar 

  • Falih, A., & Shammari, A. Z. (2019). Hybrid constrained permutation algorithm and genetic algorithm for process planning problem. Journal of Intelligent Manufacturing. https://doi.org/10.1007/s10845-019-01496-7.

    Article  Google Scholar 

  • Gandomi, A. H., & Alavi, A. H. (2012). Krill herd: A new bio-inspired optimization algorithm. Communications in Nonlinear Science and Numerical Simulation, 17(12), 4831–4845.

    Article  Google Scholar 

  • Guan, C., Zhang, Z., Liu, S., & Gong, J. (2019). Multi-objective particle swarm optimization for multi-workshop facility layout problem. Journal of Manufacturing Systems, 53, 32–48.

    Article  Google Scholar 

  • Guo, W., & Gao, Y. L. (2016, May). A study on the parameters of krill herd algorithm. In 2016 Chinese Control and Decision Conference (CCDC) (pp. 758–762). IEEE.

  • Harifi, S., Khalilian, M., Mohammadzadeh, J., & Ebrahimnejad, S. (2020). Optimization in solving inventory control problem using nature inspired Emperor Penguins Colony algorithm. Journal of Intelligent Manufacturing. https://doi.org/10.1007/s10845-020-01616-8.

    Article  Google Scholar 

  • Hui, Y., Mei, X., Jiang, G., Zhao, F., Ma, Z., & Tao, T. (2020). Assembly quality evaluation for linear axis of machine tool using data-driven modeling approach. Journal of Intelligent Manufacturing, 103, 1–17.

    Google Scholar 

  • Ju, F., & Li, J. (2014). A Bernoulli model of selective assembly systems. IFAC Proceedings Volumes, 47(3), 1692–1697.

    Article  Google Scholar 

  • Ju, F., Li, J., & Deng, W. (2016). Selective assembly system with unreliable Bernoulli machines and finite buffers. IEEE Transactions on Automation Science and Engineering, 14(1), 171–184.

    Article  Google Scholar 

  • Kannan, S. M., Asha, A., & Jayabalan, V. (2005). A new method in selective assembly to minimize clearance variation for a radial assembly using genetic algorithm. Quality Engineering, 17(4), 595–607.

    Article  Google Scholar 

  • Kannan, S. M., Sivasubramanian, R., & Jayabalan, V. (2009a). A new method in selective assembly for components with skewed distributions. International Journal of Productivity and Quality Management, 4(5–6), 569–589.

    Article  Google Scholar 

  • Kannan, S. M., Sivasubramanian, R., & Jayabalan, V. (2009b). Particle swarm optimization for minimizing assembly variation in selective assembly. The International Journal of Advanced Manufacturing Technology, 42(7–8), 793–803.

    Article  Google Scholar 

  • Kern, D. C. (2003). Forecasting manufacturing variation using historical process capability data: applications for random assembly, selective assembly, and serial processing (Doctoral dissertation, Massachusetts Institute of Technology, Department of Mechanical Engineering).

  • Lin, J. T., & Chiu, C. C. (2018). A hybrid particle swarm optimization with local search for stochastic resource allocation problem. Journal of Intelligent Manufacturing, 29(3), 481–495.

    Article  Google Scholar 

  • Liu, S., & Liu, L. (2017). Determining the number of groups in selective assembly for remanufacturing engine. Procedia engineering, 174, 815–819.

    Article  Google Scholar 

  • Liu, H., Wang, Y., Tu, L., Ding, G., & Hu, Y. (2019). A modified particle swarm optimization for large-scale numerical optimizations and engineering design problems. Journal of Intelligent Manufacturing, 30(6), 2407–2433.

    Article  Google Scholar 

  • Lu, C., & Fei, J. F. (2015). An approach to minimizing surplus parts in selective assembly with genetic algorithm. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 229(3), 508–520.

    Article  Google Scholar 

  • Matsuura, S., & Shinozaki, N. (2011). Optimal process design in selective assembly when components with smaller variance are manufactured at three shifted means. International Journal of Production Research, 49(3), 869–882.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Mohamed, A. W., Hadi, A. A., & Jambi, K. M. (2019). Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization. Swarm and Evolutionary Computation, 50, 100455.

    Article  Google Scholar 

  • Mohamed, A. W., Hadi, A. A., & Mohamed, A. K. (2020). Gaining-sharing knowledge based algorithm for solving optimization problems: A novel nature-inspired algorithm. The International Journal of Machine Learning and Cybernetics, 11, 1501–1529.

    Article  Google Scholar 

  • Raj, M. V., Sankar, S. S., & Ponnambalam, S. G. (2011). Genetic algorithm to optimize manufacturing system efficiency in batch selective assembly. The International Journal of Advanced Manufacturing Technology, 57(5–8), 795–810.

    Google Scholar 

  • Rout, U. K., Sahu, R. K., & Panda, S. (2013). Design and analysis of differential evolution algorithm based automatic generation control for interconnected power system. Ain Shams Engineering Journal, 4(3), 409–421.

    Article  Google Scholar 

  • Siva Kumar, M., Kannan, S. M., & Jayabalan, V. (2007). A new algorithm for minimizing surplus parts in selective assembly by using genetic algorithm. International Journal of Production Research, 45(20), 4793–4822.

    Article  Google Scholar 

  • Tan, C. J., Neoh, S. C., Lim, C. P., Hanoun, S., Wong, W. P., Loo, C. K., et al. (2019). Application of an evolutionary algorithm-based ensemble model to job-shop scheduling. Journal of Intelligent Manufacturing, 30(2), 879–890.

    Article  Google Scholar 

  • Wang, G. G., Gandomi, A. H., Alavi, A. H., & Gong, D. (2019). A comprehensive review of krill herd algorithm: Variants, hybrids and applications. Artificial Intelligence Review, 51(1), 119–148.

    Article  Google Scholar 

  • Wang, W., Li, D., & Chen, J. (2011, July). Minimizing assembly variation in selective assembly for complex assemblies using genetic algorithm. In 2011 Second International Conference on Mechanic Automation and Control Engineering (pp. 1401-1406). IEEE.

  • Xu, H. Y., Kuo, S. H., Tsai, J. W. H., Ying, J. F., & Lee, G. K. K. (2014). A selective assembly strategy to improve the components’ utilization rate with an application to hard disk drives. The International Journal of Advanced Manufacturing Technology, 75(1–4), 247–255.

    Article  Google Scholar 

  • Yue, X., Wu, Z., Tianze, H., & Julong, Y. (2014). A heuristic algorithm to minimize clearance variation in selective assembly. Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia, 37(2), 55–65.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Avadi, Chennai, 600 062, India

    Lenin Nagarajan & Siva Kumar Mahalingam

  2. Manufacturing Engineering, School of Mechanical Engineering, VIT University, Vellore Campus, Vellore, Tamil Nadu, 632014, India

    Jayakrishna Kandasamy

  3. Mechanical Engineering, Sri Sivasubramaniya Nadar College of Engineering, Chennai, Tamil Nadu, 603110, India

    Selvakumar Gurusamy

Authors
  1. Lenin Nagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siva Kumar Mahalingam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jayakrishna Kandasamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Selvakumar Gurusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siva Kumar Mahalingam.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nagarajan, L., Mahalingam, S.K., Kandasamy, J. et al. A novel approach in selective assembly with an arbitrary distribution to minimize clearance variation using evolutionary algorithms: a comparative study. J Intell Manuf 33, 1337–1354 (2022). https://doi.org/10.1007/s10845-020-01720-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-020-01720-9

Keywords

Search

Navigation