Abstract
In any factory or industry the high level noise can be very harmful to the employees. As investigated by Occupational Safety and Health Act of 1970, the high level noise not only causes physiological ailments in employees but also causes harmful environment in the neighborhood. Therefore it becomes essential to control the noise levels in any manufacturing plant or industry. This can be achieved by optimal allocation of noise equipment which is quite not easy to recognize the exact location. In this study a shuffled frog-leaping algorithm (SFLA) with modification is applied to identify optimal locations for equipment in order to reduce noise level in multi noise plant. Comparatively, SFLA is a recent addition to the family of nontraditional population based search methods that mimics the social and natural behavior of species (frogs). SFLA merges the advantages of particle swarm optimization and genetic algorithm (GA). Though SFLA has been successfully applied to solve many benchmark and real time problems but it limits in convergence speed. In order to improve its performance, the frog with best position in each memeplexes is allowed to slightly modify its position using random walk. This process improves the local search around the best position. The proposal is named as improved local search in SFLA. The simulated results defend the efficacy of the proposal when compared with the differential evolution, GA and SFL algorithms.
Similar content being viewed by others
References
Bies DA, Hansen CH (1988) Engineering noise control. Unwin Hyman, London
Duan Q, Gupta VK, Sorooshian S (1993) A shuffled complex evolution approach for effective and efficient global minimization. Optim Theory Appl 76(3):501–521
Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inform 19(1):43–53
Elbeltagi E, Hegazy T, Grierson D (2007) A modified shuffled frog-leaping optimization algorithm: applications to project management. Struct Infrastruct Eng Maint Manag Life-Cycle 3(1):53–60
Eusuff MM, Lansey KE (2001) Water distribution network design using the shuffled frog leaping algorithm. In: Proceedings of the 2nd world water congress of the international water association, Berlin, Germany
Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129(3):210–225
Eusuff MM, Lansey KE, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154
Gandomi AH, Yang XS (2012) Evolutionary boundary constraint handling scheme. Neural Comput Appl 21(6):1449–1462
Kumar P, Pant M (2013) Noisy source recognition in multi noise plants by differential evolution. In: Proceedings of 2013 IEEE swarm intelligence symposium (SIS), pp 271–275
Naruka B, Sharma TK, Pant M, Sharma S, Rajpurohit J (2015) Differential shuffled frog leaping algorithm. In: Proceedings of fourth international conference on soft computing for problem solving (SocProS-2014) at NIT Silchar, Assam. Advances in intelligent systems and computing, vol 336, pp 245–253. Springer, Berlin
Sharma TK, Pant M (2015) Improved local search in shuffled frog leaping algorithm. In Proceedings of fifth international conference on soft computing for problem solving, 18–22 December 2015, AISC Series of Springer, IIT Roorkee
Sharma S, Sharma TK, Pant M, Rajpurohit J, Naruka B (2014) Accelerated shuffled frog-leaping algorithm. In: Proceedings of fourth international conference on soft computing for problem solving (SocProS-2014). Advances in intelligent systems and computing, vol 336, pp 181–189. Springer, Berlin
Sharma S, Sharma TK, Pant M, Rajpurohit J, Naruka B (2015) Centroid mutation embedded shuffled frog-leaping algorithm. Proc Comput Sci 46:127–134
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sharma, T.K., Pant, M. Identification of noise in multi noise plant using enhanced version of shuffled frog leaping algorithm. Int J Syst Assur Eng Manag 9, 43–51 (2018). https://doi.org/10.1007/s13198-016-0466-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-016-0466-7