A genetic algorithm to find pareto-optimal solutions for the dynamic facility layout problem with multiple objectives

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6443 LNCS, pp. 642–651). https://doi.org/10.1007/978-3-642-17537-4_78

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