A simulated annealing algorithm for allocating space to manufacturing cells
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 30 (1), 63-87
- https://doi.org/10.1080/00207549208942878
Abstract
This paper describes a procedure that can be used by facility designers to allocate space to manufacturing cells. The procedure takes into consideration the area and shape requirements of individual cells as well as any occupied regions on a floor plan. A layout is represented as a collection of rectangular partitions organized as a slicing tree. The solution method involves searching through the space of all slicing trees of a given structure. An effective simulated annealing algorithm capable of minimizing inter-cell traffic flow and enforcing geometric constraints is presented. The algorithm is compared with two local search methods with encouraging results.Keywords
This publication has 24 references indexed in Scilit:
- Machine layout: an optimization and knowledge-based approachInternational Journal of Production Research, 1990
- Cluster analysis in manufacturing cellular formationOmega, 1989
- Cellular manufacturing in the U.S. industry: a survey of usersInternational Journal of Production Research, 1989
- Machine grouping problem in cellular manufacturing systems— an integer programming approachInternational Journal of Production Research, 1989
- Research issues in cellular manufacturingInternational Journal of Production Research, 1987
- Weighted similarity measure heuristics for the group technology machine clustering problemOmega, 1985
- Optimization by Simulated AnnealingScience, 1983
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Machine grouping for efficient productionProduction Engineer, 1972
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963