IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v9y2018i1d10.1007_s13198-016-0466-7.html
   My bibliography  Save this article

Identification of noise in multi noise plant using enhanced version of shuffled frog leaping algorithm

Author

Listed:
  • Tarun Kumar Sharma

    (Amity University Rajasthan)

  • Millie Pant

    (IIT Roorkee)

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.

Suggested Citation

  • Tarun Kumar Sharma & Millie Pant, 2018. "Identification of noise in multi noise plant using enhanced version of shuffled frog leaping algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 43-51, February.
    • Handle: RePEc:spr:ijsaem:v:9:y:2018:i:1:d:10.1007_s13198-016-0466-7
    DOI: 10.1007/s13198-016-0466-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-016-0466-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-016-0466-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vahid Hajipour & Parviz Fattahi & Hasan Bagheri & Samaneh Babaei Morad, 2022. "Dynamic maximal covering location problem for fire stations under uncertainty: soft-computing approaches," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 90-112, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:9:y:2018:i:1:d:10.1007_s13198-016-0466-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.