An Example of CRAFT

Product, Process & Schedule Data

Product Processing sequence 1 2 3 ABCBCD ACBD ACBCBD Daily No of items production in Trolley 100 50 200 5 5 40 Trolley loads/ day 20 10 5

Initial Layout
From /To
A D

A B

--1 2 1

1 --1 2

2 1 --1

1 2 1 ---

C D

Distance Matrix for initial layout (Assuming Rectilinear Distances)

Load Matrix
From/To

A ---

B 20 --45

C 15 45 ---

A B C D

15 20 ---

Unit Cost Matrix

From/To

A --1 2 1

B 1 --1 1

C 2 1 --1

D 1 1 1 ---

A B C D

Load x Unit Cost Matrix (Flow Matrix)

From /To

A ---

B 20 --45

C 30 45 --75

D 50 15 20 --35 60 65 00

A B C D

00

65

Initial Layout (Distance Matrix)

From /To A B A B C D

--1 2 1

1 --1 2

2 1 --1

1 2 1 ---

C D

Material Handling Effort for Initial Layout

From /To

A ---

B 20 --45
From /To

C 30 45 --A ---

D 15 20 --B 20 --90 C 60 45 ---

From A /To A B C D --1 2 1

A B C D

1 --1 2

2 1 --1

1 2 1 ---

D 80 30 20 --75 110 00 265

A B C D

00

110 105 50

Pair wise Exchanges

Initial Layout A D B C
265 Material Handling Effort

AB B D A C

AC C D B A

AD D A B C

BC A D C B

BD A B D C

CD A C B D

Alternative 1 (Distance Matrix)

A A B C D ---1 1 2 B 1 ---2 1 C 1 2 ---1 D 2 1 1 ----

B D A C

Material Handling Effort = Flow x Distance Matrix = 220

Alternative 2 (Distance Matrix)

A A B C D ---1 2 1 B 1 ---1 2 C 2 1 ---1 D 1 2 1 ----

C D B A

Material Handling Effort = Flow x Distance Matrix = 265

Alternative 3 (Distance Matrix)

A A B C D ---2 1 1 B 2 ---1 1 C 1 1 ---2 D 1 1 2 ----

D A B C

Material Handling Effort = Flow x Distance Matrix = 215

Alternative 4 (Distance Matrix)

A A B C D ---2 1 1 B 2 ---1 1 C 1 1 ---2 D 1 1 2 ----

A D C B

Material Handling Effort = Flow x Distance Matrix = 215

Alternative 5 (Distance Matrix)

A A B C D ---1 2 1 B 1 ---1 2 C 2 1 ---1 D 1 2 1 ----

A B D C

Material Handling Effort = Flow x Distance Matrix = 265

Alternative 6 (Distance Matrix)

A A B C D ---1 1 2 B 1 ---2 1 C 1 2 ---1 D 2 1 1 ----

A C B D

Material Handling Effort = Flow x Distance Matrix = 220

Pair wise Exchanges

Initial Layout A D B C
Material Handling 265 Effort

AB B D A C
220

AC C D B A
265

AD D A B C
215*

BC A D C B
215*

BD A B D C
265

CD A C B D
220

Summary of the CRAFT procedure

This example demonstrates one iteration of the basic CRAFT procedure The best layout so produced is compared with the starting layout. If it is inferior to the starting layout, the starting layout is declared optimal and the search stops Otherwise a new iteration with the discovered layout as the starting node is initiated

An Example of ALDEP

The Available Space

Placement of 1st Department

Placement of 2nd Department

D D

Placement of 3rd Department

B A

D D

Placement of 4th Department

C B A C

D D

Final Layout
C B A C

D D