Simulated annealing based parallel genetic algorithm for facility layout problem

NCUTIR > College of Management > Development of Industrial Engineering and Management > 【工業工程與管理系所】期刊論文 > Item 987654321/6830

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/6830

Title:	Simulated annealing based parallel genetic algorithm for facility layout problem
Authors:	古美玉
Contributors:	工業工程與(工程)管理系
Date:	2011-03
Issue Date:	2017-12-17 10:41:46 (UTC+8)
Abstract:	The facility layout problem (FLP), a typical combinational optimisation problem, is addressed in this paper by implementing parallel simulated annealing (SA) and genetic algorithms (GAs) based on a coarse-grained model to derive solutions for solving the static FLP with rectangle shape areas. Based on the consideration of minimising the material flow factor cost (MFFC), shape ratio factor (SRF) and area utilisation factor (AUF), a total layout cost (TLC) function is derived by conducting a weighted summation of MFFC, SRF and AUF. The evolution operations (including crossover, mutation, and selection) of GA provide a population-based global search in the space of possible solutions, and the SA algorithm can lead to an efficient local search near the optimal solution. By combing the characteristics of GA and SA, better solutions will be obtained. Moreover, the parallel implementation of simulated annealing based genetic algorithm (SAGA) enables a quick search for the optimal solution. The proposed method is tested by performing a case study simulation and the results confirm its feasibility and superiority to other approaches for solving FLP. © 2011 Taylor & Francis. (28 refs)
Relation:	International Journal of Production Research
Appears in Collections:	[Development of Industrial Engineering and Management] 【工業工程與管理系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence

Loading...