Skip to main content
SpringerLink
Log in

Ant System Embedded with Local Search for Solving Facility Layout Problem

  • Conference paper
Information Processing and Management (BAIP 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 70))

  • 1165 Accesses

Abstract

The goal of this paper is to present an ant system embedded with local search named as ANTELS for quadratic assignment problem (QAP) which is a widely accepted mathematical formulation for facility layout problem (FLP). The performance of the proposed ANTELS is compared to other well known heuristics/ Meta-heuristics of FLP as well as other existing ant system. The computational results show that the proposed ANTELS provides promising result.

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 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. Koopmans, T.C., Beckmann, M.: Assignment Problems and the location of Economic Activities. Econometric 25, 53–76 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  2. Sahni, S., Gonzalez, T.: P-complete approximation problem. Journal of Associated Computing Machinery 23(3), 555–565 (1976)

    MATH  MathSciNet  Google Scholar 

  3. Maniezzo, V., Dorigo, M., Colorini, A.: The Ant System Applied to the Quadratic Assignment Problem. Technical Report IRIDIA/94-28, Universite Libre de Bruxelles, Belgium (1998)

    Google Scholar 

  4. Gambardella, L.M., Tailard, E.D., Dorigo, M.: Ant Colonies for the Quadratic Assignment Problem. Technical Report IDSIA-4-97, IDSIA, Lugano, Switzerland (1997)

    Google Scholar 

  5. Stutzle, T., Dorigo, M.: ACO algorithm for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in Optimization. McGraw-Hill, New York (1999)

    Google Scholar 

  6. Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant algorithm. Journal of Heuristics 8(3), 305–320 (2002)

    Article  MATH  Google Scholar 

  7. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoretical Computational Science 344, 243–278 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Solimanpur, M., Vrat, P., Shankar, R.: Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. European Journal of Operational Research 157, 592–606 (2005)

    Article  MathSciNet  Google Scholar 

  9. Loiola, E.M., Abreu, N.M.M., Boarenture-Netto, P.O., Hahn, P., Querido, T.: An analytical survey for the Quadratic assignment problem. European Journal of Operational Research (2007) (in press)

    Google Scholar 

  10. Singh, S.P., Sharma, R.R.K.: A review on different approaches to facility layout problems. International Journal of Advanced Manufacturing System 30, 425–433 (2006)

    Article  Google Scholar 

  11. Dorido, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transaction on Systems, Man, and Cybernetics–Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  12. Stutzle, T., Hoos, H.: MAX_MIN ant system. Future Generation Computer Systems 16(8), 889–914 (1997)

    Article  Google Scholar 

  13. Taillard, E.D., Gambardella, L.: Adaptive memories for the qudratic assigment problem. Technical Report, IDSIA, Lugano, Switzerland, pp. 87–97 (1997)

    Google Scholar 

  14. Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer System 17, 441–449 (2001)

    Article  MATH  Google Scholar 

  15. Demirel, N.C., Toksari, M.D.: Optimization of the quadratic assignment problem using an ant colony algorithm. Applied Mathematics and Computation 183(1), 427–43 (2006)

    Google Scholar 

  16. Hani, Y., Amodeo, L., Yalaoui, F., Chen, H.: Ant colony optimization for solving an industrial layout problem. European Journal of Operational Research 183(2), 633–642 (2007)

    Article  MATH  Google Scholar 

  17. Taillard, E.D.: Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing 17, 443–455 (1991)

    Article  MathSciNet  Google Scholar 

  18. Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal of Computing 6, 126–140 (1994)

    MATH  Google Scholar 

  19. Connolly, D.T.: An improved annealing scheme for the QAP. European Journal of Operational Research 46, 93–100 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Operations Management and Decision Sciences, Xavier Institute of Managment Bhubaneswar, Bhubaneswar, 751013, India

    Surya Prakash Singh

Authors
  1. Surya Prakash Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. NSS College of Engineering, Palakkadu, Kerala, India

    R. Vijayakumar

  3. Winona State University, Winona, MN, USA

    Narayan C. Debnath

  4. Viswajiyithi College Engineering, Muvattupuzha, Kerala, India

    Janahanlal Stephen

  5. Jackson State University, Jackson, MS, USA

    Natarajan Meghanathan

  6. University of West Indies, Kingston, Jamaica

    Suresh Sankaranarayanan

  7. CGM, ACEEE, Pattom, Kerala, India

    P. M. Thankachan

  8. University of Indonesia, Depok, Indonesia

    Ford Lumban Gaol

  9. College of Engineering, Trivandrum, Kerala, India

    Nessy Thankachan

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singh, S.P. (2010). Ant System Embedded with Local Search for Solving Facility Layout Problem. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_115

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12214-9_115

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12213-2

  • Online ISBN: 978-3-642-12214-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation