Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 51319 (01)
- University: Sharif University of Technology
- Department: Industrial Engineering
- Advisor(s): Eshghi, Kourosh
- Abstract:
- The layout problem is directly related to the material handling system; therefore, these two concepts are always being considered together. The main criterion for evaluating the layout in the objective function, is the cost of controlling and moving the materials. In order to calculate the material handling cost, it is necessary to provide an accurate information on the distance between departments, number of goods transported, and the cost of moving a unit of goods per unit of distance; therefore, accurate calculation of the distance between departments is an issue of paramount importance. In the literature, the distance between the departments is measured in three ways: Euclidean distance, rectilinear distance, and Contour distance. In the first two ways, the distance between departments is often calculated as center-to-center and without considering the aisle; then, according to these calculations, the optimal layout is determined. Eventually, the movement between departments is done through the aisles; Therefore, the initial calculation of the traveled distance will not be identical to real traveled distance. Due to the fact that aisles are the main platform for the transfer of materials, attention to their placement is important, which has not been considered in most studies. In this paper, a new model has been developed based on establishing an appropriate aisle structure and computing the lowest aisle distance between departments. Finally, a three-stage model is proposed to solve the layout problem. Firstly, with the help of a string of cut lines, an aisle structure, and an initial map is created. Then, the matrix of the shortest aisle pathway between regions is defined as the second stage input parameter. In the second step, by using the actual calculated intervals, the problem of allocating departments to the regions is solved, and finally, in the third step, the optimal layout among different structures is determined as the optimum solution
- Keywords:
- Genetic Algorithm ; Geometry Optimization ; Layout Problem ; Aisle Structure
Digital Object List
-
محتواي کتاب
- view
Bookmark