A Genetic Algorithm Approach on a Facility Layout Design Problem with Aisles

  • Zhou G
  • Ye M
  • Cao Z
  • et al.
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Facility layout problems concerning space layout optimization have been investigated in depth by researchers in many engineering fields. In this paper, a particular facility layout problem with aisles and two objectives at minimizing total cost of material handling and maximizing adjacent requirement between resources is discussed and formulated as an nonlinear mixed-integer programming. To solve the NP-hard problem, a multiple objective genetic algorithm approach with local search method is developed. The application on a practical FLP case and numerical analysis show the effectiveness and efficiency of the proposed method on FLPs. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Zhou, G., Ye, M., Cao, Z., & Ye, F. (2006). A Genetic Algorithm Approach on a Facility Layout Design Problem with Aisles (pp. 1008–1013). https://doi.org/10.1007/978-3-540-37275-2_127

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free