SciELO - Scientific Electronic Library Online

 
vol.30 número4 índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google

Compartir


South African Journal of Industrial Engineering

versión On-line ISSN 2224-7890
versión impresa ISSN 1012-277X

Resumen

MOHAMADI, A.; EBRAHIMNEJAD, S.; SOLTANI, R.  y  KHALILZADEH, M.. An Integrated Approach Based On A Bi-Level Genetic Algorithm And A Combined Zonelp For The Facility Layout Problem. S. Afr. J. Ind. Eng. [online]. 2019, vol.30, n.4, pp.87-101. ISSN 2224-7890.  http://dx.doi.org/10.7166/30-4-2192.

In this study, a new integrated approach is presented to solve the facility layout problem with unequal areas in an open field. This approach includes a two-stage method and a bi-level genetic algorithm. In the first stage of the proposed method, the arrangement of departments adjacent to each other is determined by an improved zone algorithm; in the second stage, the layout obtained from the first stage is improved by using a linear programming model, and the final locations of the departments are thus determined. This two-stage method is used in a bi-level genetic algorithm to achieve an appropriate layout. The orientation and aspect ratios of the departments are determined at the first level of the algorithm, and at the second level, the sequence of the departments is determined for the layout. The proposed approach is compared with the four approaches in the literature, by using 10 datasets in order to evaluate efficiency and performance. The quality of the proposed approach is confirmed by improving the best solutions obtained from previous studies in seven datasets. Furthermore, the presented approach obtains the best solutions from previous studies in the other three datasets.

        · resumen en Africano     · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons