1、2100 英文单词， 12000 英文字符 ，中文 3700 字 文献出处： Mihajlovi I, ivkovi , trbac N. Using genetic algorithms to resolve facility layout problemJ. Serbian Journal of Management, 2007, 2(1): 35-46. USING GENETIC ALGORITHMS TO RESOLVE FACILITY LAYOUT PROBLEM University of Belgrade, Technical Faculty at Bor, Vojske J
2、ugoslavije 12, 19210 Bor, Serbia (Received 12 May 2006; accepted 23 July 2006) Abstract: The component layout problem requires efficient search of large, discontinuous spaces. The efficient layout planning of a production site is a fundamental task to any project undertaking. This paper describes a
3、genetic algorithm (GA) to solve the problem of optimal facilities layout in manufacturing system design so that material-handling costs are minimized. The performance of the proposed heuristic is tested over problems selected from the literature. Computational results indicate that the proposed appr
4、oach gives better results compared to many existing algorithms in this area. Keywords: facility layout; flexible manufacturing; stochastic programming 1. INTRODUCTION Component layout plays an important role in the design and usability of many engineering products. The layout problem is also classif
5、ied under the headings of packing, packaging, configuration, container stuffing, pallet loading or spatial arrangement in the literature. The problem involves the placement of components in an available space such that a set of objectives can be optimized while satisfying optional spatial of perform
6、ance constraints. Current tools available in practice to designers to aid in the general mechanical layout process mostly remain at the stages of physical or electronic models with the assistance of manual adjustment and visual feedback. The difficulty in automating the mechanical and electromechanical layout processes stems from: (1) the modeling of the design objectives and constraints; (2) the constraints; (3) the identification of appropriate optimization search strategies. A number
