Scribd Logo
Upload

Welcome to Scribd!

  • FALLSEM2023-24 MEE1014 TH VL2023240101810 2023-10-06 Reference-Material-I

    Uploaded by

    Divya Shivanand
    10 views32 pages
    The CRAFT algorithm is an iterative process that begins by calculating department centroids and distances. It determines an initial layout cost and then considers exchanges to reduce costs, updating centroids after each exchange until no further cost reduction is possible. The ALDEP algorithm is also an iterative layout optimization method but the document provides no details about its specific steps.

    Original Description:

    Original Title

    FALLSEM2023-24_MEE1014_TH_VL2023240101810_2023-10-06_Reference-Material-I (4)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The CRAFT algorithm is an iterative process that begins by calculating department centroids and distances. It determines an initial layout cost and then considers exchanges to reduce costs, updating centroids after each exchange until no further cost reduction is possible. The ALDEP algorithm is also an iterative layout optimization method but the document provides no details about its specific steps.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views32 pages

    FALLSEM2023-24 MEE1014 TH VL2023240101810 2023-10-06 Reference-Material-I

    Uploaded by

    Divya Shivanand
    The CRAFT algorithm is an iterative process that begins by calculating department centroids and distances. It determines an initial layout cost and then considers exchanges to reduce costs, updating centroids after each exchange until no further cost reduction is possible. The ALDEP algorithm is also an iterative layout optimization method but the document provides no details about its specific steps.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 32

    Computerized Layout

    Planning
    CRAFT Algorithm
    ALDEP Algorithm
    CRAFT Algorithm
    (Computerized Relative Allocation of Facilities Technique)

    1. Determine the department centroids.


    2. Calculate the inter department rectilinear distances.
    3. Calculate the initial cost of the layout by multiplying the
    from-to matrix with the cost matrix.
    4. CRAFT then considers all the possible two-way or
    three-way department exchanges and identifies the
    best “exchange”.
    5. Update the layout and calculate the new department
    centroids.
    6. The above procedure is repeated until no further
    reduction in the cost can be obtained.
    CRAFT
    CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    Example for CRAFT
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    Example for ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm
    ALDEP Algorithm

    You might also like