《物流课程讲义4.pptVIP

Computer-Aided Layout Algorithm Classification Input data qualitative “flow” data (relationship chart) quantitative flow matrix (from-to chart); numerical values of closing rating both qualitative and quantitative (BLOCPLAN) Objective function “distance-based”: minimize flow*distance (from-to chart) - QAP “adjacency-based”: maximize adjacency score (relationship chart) Algorithm Classification Distance-based Adjacency-based Algorithm Classification Normalized adjacency score (efficiency rating) Layout representation discrete (grid size?computational burden) continuous (rectangular building and department shapes) department cannot be split enclosed void Algorithm Classification Layout improvement start with an initial layout incremental change Layout construction given dimension (basic assumption in the book) “green field”: site plan Two Types Construction Type Improvement Types CRAFT - Improvement Heuristic Computerized Relative Allocation of Facilities Technique Armour, Buffa, and Vollman (1963) Given a initial layout and cost and flow data Attempts to improve layout using Two-way and three-way interchanges Assumes all distances are centroidal and rectilinear Evaluation and Interchange in CRAFT Interchanges are only possible if Depts. are the same size; or Adjacent (necessary condition) Estimates the potential saving for an interchange For evaluation only the centroids are swapped Selects the best among all possible interchanges Actually performs the interchange Path-dependent heuristic (locally optimal) Dummy Departments May be used to Fill building irregularities Represent obstacles or unusable areas in the facility (fixed location) Represent extra space in the facility Aid in evaluating aisle locations in the final layout Comments on CRAFT Estimated cost reduction may not be obtained after interchange Departments of unequal size that are not adjacent are not considered for interchange (MIRCO-CRAFT relaxes this constraint) Strangely shaped department are