[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Genetic Algorithm to Find Pareto-optimal Solutions for the Dynamic Facility Layout Problem with Multiple Objectives

  • Conference paper
Neural Information Processing. Theory and Algorithms (ICONIP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6443))

Included in the following conference series:

  • 2596 Accesses

Abstract

In today’s volatile manufacturing scenario, manufacturing facilities must operate in a dynamic and market-driven environment in which production rates and production mixes are continuously changing. To operate efficiently within such an environment, the facility layout needs to be adaptable to changes. The dynamic facility layout problem (DFLP) deals with changes of layout over time. DFLPs are usually solved just considering quantitative aspect of layout alone, ignoring the qualitative aspect. Few attempts have been made to date to deal with the multi-objective DFLP. These most often use the weighted-sum method to combine different objectives and thus, inherit the well-known problems of this method. The objective of this paper is to introduce an evolutionary approach for solving multi-objective DFLP that presents the layout as a set of Pareto-optimal solutions optimizing both quantitative and qualitative objectives simultaneously. Experimental results obtained with the proposed approach are promising.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Tompkins, A.: Facilities Planning, 3rd edn. John Wiley & Sons, New York (2003)

    Google Scholar 

  2. Singh, S.P., Singh, V.K.: An Improved Heuristic Approach for Multi-Objective Facility Layout Problem. Int. J. Prod. Res. 48(4), 1171–1194 (2010)

    Article  MATH  Google Scholar 

  3. Drira, A., Pierreval, H., Hajri-Gabouj, S.: Facility Layout Problems: A survey. Annual Rev. Con. 31, 255–267 (2007)

    Article  Google Scholar 

  4. Grosan, C., Abraham, A., Tigan, S., Chang, T.G.: How to Solve a Multicriterion Problem for Which Pareto Dominance Relationship Cannot Be Applied? A Case Study from Medicine. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds.) KES 2006. LNCS (LNAI), vol. 4253, pp. 1128–1135. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Chen, G.Y.–H.: Multi-Objective Evaluation of Dynamic Facility Layout using Ant Colony Optimization. PhD Thesis, The University of Texas at Arlington, USA (2007)

    Google Scholar 

  6. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA–II. IEEE Trans. Evo. Comp. 6(2), 182–197 (2002)

    Article  Google Scholar 

  7. Pareto Efficiency, http://en.wikipedia.org/wiki/Pareto_efficiency

  8. Singh, S.P., Sharma, R.R.K.: A Review of Different Approaches to the Facility Layout Problems. Int. J. Adv. Manuf. Technol. 30, 425–433 (2006)

    Article  Google Scholar 

  9. Rosenblatt, M.J.: The Dynamics of Plant Layout. Manag. Sc. 32(1), 76–86 (1986)

    MATH  Google Scholar 

  10. Conway, D.G., Venkataramanan, M.A.: Genetic Search and the Dynamic Facility Layout Problem. Comp. & Oper. Res. 21(8), 955–960 (1994)

    Article  MATH  Google Scholar 

  11. Balakrishnan, J., Cheng, C.H., Conway, D.G., Lau, C.M.: A Hybrid Genetic Algorithm for the Dynamic Plant Layout Problem. Int. J. Prod. Econ. 86, 107–120 (2003)

    Article  Google Scholar 

  12. Ripon, K.S.N., Glette, K., Høvin, M., Tørresen, J.: Dynamic Facility Layout Problem with Hybrid Genetic Algorithm. In: 9th IEEE International Conference on Cybernetic Intelligent Systems 2010, University of Reading, UK (2010)

    Google Scholar 

  13. Singh, S.P., Sharma, R.R.K.: Genetic Algorithm based Heuristics for the Dynamic Facility Layout Problem. Eur. J. Manag. 8(1), 128–134 (2008)

    Google Scholar 

  14. Suresh, G., Vinod, V.V., Sahu, S.: A Genetic Algorithm for Facility Layout. Int. J. Prod. Res. 33(12), 3411–3423 (1995)

    Article  MATH  Google Scholar 

  15. Ripon, K.S.N., Glette, K., Mirmotahari, O., Høvin, M., Tørresen, J.: Pareto Optimal Based Evolutionary Approach for Solving Multi-Objective Facility Layout Problem. In: Chan, J.H. (ed.) ICONIP 2009, Part II. LNCS, vol. 5864, pp. 159–168. Springer, Heidelberg (2009)

    Google Scholar 

  16. Dutta, K.N., Sahu, S.: A Multigoal Heuristic for Facilities Design Problems: MUGHAL. Int. J. Prod. Res. 20(2), 147–154 (1982)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ripon, K.S.N., Glette, K., Høvin, M., Torresen, J. (2010). A Genetic Algorithm to Find Pareto-optimal Solutions for the Dynamic Facility Layout Problem with Multiple Objectives. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science, vol 6443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17537-4_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17537-4_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17536-7

  • Online ISBN: 978-3-642-17537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics