Graph theoretic heuristics for unequal-sized facility layout problems
We consider the unequal-sized facility layout problem with the objective of minimizing total transportation distance. The total transportation distance is defined as the sum of products of flow amounts and rectilinear distances between facilities, where flow amount represents the number of trips per time period between facilities. In the layout problem, it is assumed that shapes of facilities are not fixed and that there is no empty space between facilities in the layout. We propose new graph theoretic heuristics for the problem. In the heuristics, an initial layout is obtained by constructing a planar adjacency graph and then the solution is improved by changing the adjacency graph (not the physical layout). Therefore, these heuristics do not need an initial layout in advance, and sizes and locations of facilities do not have to be considered in the improvement procedure. Computational results showed that the proposed algorithms gave better solutions than those from CRAFT, which is one of the most popular algorithms for unequal-sized facility layout problems.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 23 (1995)
Issue (Month): 4 (August)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jouko Seppänen & James M. Moore, 1970. "Facilities Planning with Graph Theory," Management Science, INFORMS, vol. 17(4), pages 242-253, December.
- Harry K. Edwards & Billy E. Gillett & Monta E. Hale, 1970. "Modular Allocation Technique (MAT)," Management Science, INFORMS, vol. 17(3), pages 161-169, November.
- Green, Rh & Al-Hakim, Lar, 1985. "A heuristic for facilities layout planning," Omega, Elsevier, vol. 13(5), pages 469-474.
- Heragu, Sunderesh S. & Kusiak, Andrew, 1991. "Efficient models for the facility layout problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 1-13, July.
- Christopher J. Picone & Wilbert E. Wilhelm, 1984. "A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem," Management Science, INFORMS, vol. 30(10), pages 1238-1249, October.
- Michael Scriabin & Roger C. Vergin, 1985. "A Cluster-Analytic Approach to Facility Layout," Management Science, INFORMS, vol. 31(1), pages 33-49, January.
- Kusiak, Andrew & Heragu, Sunderesh S., 1987. "The facility layout problem," European Journal of Operational Research, Elsevier, vol. 29(3), pages 229-251, June.
- Frederick S. Hillier & Michael M. Connors, 1966. "Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities," Management Science, INFORMS, vol. 13(1), pages 42-57, September.
- Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
- Janny Leung, 1992. "A New Graph-Theoretic Heuristic for Facility Layout," Management Science, INFORMS, vol. 38(4), pages 594-605, April.
- Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
- Heragu, Sunderesh S., 1992. "Recent models and techniques for solving the layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 136-144, March.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:23:y:1995:i:4:p:391-401. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.