Skip to main content
SpringerLink
Log in

A Non-greedy Local Search Heuristic for Facility Layout Problem

  • Conference paper
Signal Processing and Information Technology (SPIT 2011)

  • 942 Accesses

Abstract

This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function increment divided by an intensity factor. Proposed heuristic is tested on commonly used Nugxx series problems and computational results show efficiency and effectiveness of proposed heuristic.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Opt. 10(1), 391–403 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Diponegoro, A., Sarker, B.R.: Machine assignment in a nonlinear multi-product flowline. J. Oper. Res. Soc. 54, 472–489 (2003)

    Article  MATH  Google Scholar 

  3. Heragu, S.S., Kusiak, A.: Machine layout: An optimization and Knowledge Based Approach. Int. J. Prod. Res. 28(4), 615–635 (1990)

    Article  Google Scholar 

  4. Heragu, S.S.: Recent models and techniques for solving the layout problem. Eur. J. Oper. Res. 57(2), 136–144 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Koopmans, T.C., Beckman, M.: Assignment problems and the location of economic activities. Economet. 25(1), 53–76 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kusiak, A., Heragu, S.S.: The facility layout problem. Eur. J. Oper. Res. 29(3), 229–251 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Matai, R., Singh, S.P., Mittal, M.L.: Facility Layout Problem: A State-of-the-art Review. Vilak. XIMB J. Manag. 7(2), 81–106 (2010)

    Google Scholar 

  8. Sahni, S., Gonzalez, P.: P-Complete approximation problems. J. ACM 23(3), 555–565 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  9. Singh, S.P., Sharma, R.R.K.: A survey on various approaches to solve facility layout problem. Int. J. Adv. Manu. Tech. 30, 425–433 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Department, BITS Pilani, India

    Rajesh Matai

  2. Department of Management Studies, IIT Delhi, India

    Surya Prakash Singh

  3. Department of Mechanical Engineering, MNIT Jaipur, India

    Murari Lal Mittal

Authors
  1. Rajesh Matai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Surya Prakash Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Murari Lal Mittal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Doctors Engineering and Scientists, Ouderkerk aan de Amstel, 1191 GT, Amsterdam,, The Netherlands

    Vinu V. Das

  2. London Metropolitan University, Tower Building 166-220 Holloway Road, N7 8DB, London, UK

    Ezendu Ariwa

  3. Block F, FTSM, Faculty of Information Scienceand Technology, Universiti Kebangsaan Malaysia UKM, 43600, Bangi, Selangor, Malaysia

    Syarifah Bahiyah Rahayu

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Matai, R., Singh, S.P., Mittal, M.L. (2012). A Non-greedy Local Search Heuristic for Facility Layout Problem. In: Das, V.V., Ariwa, E., Rahayu, S.B. (eds) Signal Processing and Information Technology. SPIT 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32573-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32573-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32572-4

  • Online ISBN: 978-3-642-32573-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation