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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, G., Ye, M., Cao, Z., Ye, F. (2006). A Genetic Algorithm Approach on a Facility Layout Design Problem with Aisles. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_127
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_127
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)