A Fast Algorithm to Generate Feasible Solution of Production Facilities Layout Based on Plane Segmentation

4Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For facility layout problem with continuous block and unequal area, it is key to generate feasible solution of facility layout with arbitrary space form in order to find the optimal arrangement scheme under a given goal. According to the given slicing position and slicing mode, the plane for arrangement was divided into many block areas by use of plane segmentation, which was consistent with the facilities in number. The precise coordinates of the lower-left corner and the top-right corner of each facility were calculated in light of its area, width, and length. The corresponding algorithm was designed in the form of pseudocode. The procedure proposed can provide a feasible facility layout solution. The running results of facilities layout instance containing 14 facilities show that the scheme can output facilities plane layout scheme quickly and provide decision support for the facilities planning.

Cite

CITATION STYLE

APA

Hou, S. W., Li, Z., & Wang, H. (2016). A Fast Algorithm to Generate Feasible Solution of Production Facilities Layout Based on Plane Segmentation. Mathematical Problems in Engineering, 2016. https://doi.org/10.1155/2016/1712376

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free