This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with those of layout solutions generated by the branch and bound algorithm, a hybrid method merging simulated annealing and local search techniques and an optimization process of an enveloped block.
Tavakkoli-Moghaddam, R. (1999). Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method. International Journal of Engineering, 12(4), 233-246.
MLA
Reza Tavakkoli-Moghaddam. "Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method". International Journal of Engineering, 12, 4, 1999, 233-246.
HARVARD
Tavakkoli-Moghaddam, R. (1999). 'Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method', International Journal of Engineering, 12(4), pp. 233-246.
VANCOUVER
Tavakkoli-Moghaddam, R. Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method. International Journal of Engineering, 1999; 12(4): 233-246.