Professional Documents
Culture Documents
(1)
ij
F ,
amount of material flow among machines i and j (i,j=1,2,.,M).
ij
C , unit material handling cost between locations of machines i and j (i,j=1,2,.,M).
ij
D , rectilinear distance between locations of machines i and j
MHC , total cost of material handling system
ii. Maximize the total closeness rating score
1 1
M M
ij
i j
CRS R
= =
=
(2)
ij
R Closeness score between locations of machines i and j
iii. Minimize total cost considering the above two factors
1
2
1
Z MHC
CRS
= + (3)
1
and
2
are the weights used to unify the two objectives
The constraint considered in this model is as follows:
(1) The precedence constraints which ensure that the processing sequence of process flow operation
to be predefined.
The problem is to find optimum allocation of M machines on N locations considering the constraints and
objectives.
4. Problem Solving Process
Genetic algorithm (GA) has been applied to select the best valued fitness function. Solving with GA requires
several parameters such as encoding type, length of the chromosome, selection method, reproduction operations,
termination conditions etc. Using GA as a solving procedure a result is obtained. The problem solving approach is
shown in Figure 2.
Figure 2: Problem solving approach
4.1 Solving with Genetic Algorithm
4.1.1 Algorithm structure
Step 1: Create N no. of chromosomes (Facility location) to create an initial population pool. A typical chromosome is
shown in figure 3. The initial population number is taken as computer input for the program. Check the chromosome
strings whether they are valid or not.
1 5 6 9 8 3 2 4 7
Figure 3: A typical chromosome for 3 rows and 3 columns
Step 2: Evaluate the Fitness function or the objective function
Step 3: Calculate the probability p
i
and cumulative probability q
i
for i chromosomes.
[ ] 20 i =
Step 4: Select the chromosomes with some selection mechanism. Roulette wheel mechanism is used.
Step 5: Select the chromosomes as Parents which will undergo breeding for to create next generation.
Step 6: Take crossover rate
c
p and mutation rate
m
p as computer program input. Crossover rate indicates how many
chromosomes will undergo the crossover operation. Mutation rate indicates how many of the bits will undergo through
mutation. Crossover and Mutation operations are selected randomly.
Step 7: Select randomly the chromosomes for crossover. Apply single point crossover. No. of X-over points
p
C
N =L-1,
where L =no of locations. If L =6 then there are five points where crossover can take place.
Step 8: Select randomly the bits in chromosomes which will undergo the mutation process. The selected bits will be
swapped with the adjacent bit (either earlier or later).
Step 9: A generation is complete and a new set of population (offspring) has been created.
Start
Problem I nputs
No of location
No of facilities
Sequence of
operation
Developing the
objective function
Aggregating the
objectives
Select
solution
GA
GA inputs
Encoding type
Chromosome
Selection method
Reproduction
Termination condition
Result
Step 10: Evaluate the fitness function value for the new population and save the best value.
Step 11: Go to step 3 until Stopping conditions are met.
Predefined number of generations
No improvement in solution for last G generations. G is an input taken from the program. Typical value of G =50.
5. Case study
A hypothetical case is presented illustrating the Multi-objective facility layout problem. In this case a toy factory is
considered where there are nine departments (shown in Table 1) that are to be arranged to minimize the
interdepartmental material handling cost and maximizing the closeness rating score. For the optimum allocation of
nine departments where all the departments space are equal the flow of materials and the cost involve to move the
materials from one department to another department is given in a Table 2 and 3. These two tables are needed for
calculating the material handling cost. Different reasons of closeness and numerical weights given to different
closeness are shown in Table 4 and 5. A relationship chart is shown in Table 6 that is required to calculate the
closeness rating score.
Table 1: Departments name
Department Activity
1 Shipping and receiving
2 Plastic molding and stamping
3 Metal forming
4 Sewing department
5 Small toy assembly
6 Large toy assembly
7 Painting
8 Mechanism assembly
9 Packaging section
Table 2: Flow between departments (number of moves)
Dept. 1 2 3 4 5 6 7 8 9
1 0 10 12 15 17 11 20 22 19
2 1 0 13 18 7 2 1 1 104
3 2 3 0 100 109 17 100 1 31
4 5 1 11 0 0 78 247 178 1
5 2 17 12 9 0 1 10 1 79
6 9 14 8 21 30 0 0 1 0
7 11 19 25 31 7 2 0 0 0
8 5 4 12 19 23 31 40 0 12
9 8 11 25 29 9 7 2 5 0
Table 3: Material handling cost between locations
Dept. 1 2 3 4 5 6 7 8 9
1 0 1 2 3 3 4 2 6 7
2 0 0 12 4 7 5 8 6 5
3 0 0 0 5 9 1 1 1 1
4 0 0 0 0 1 1 1 4 6
5 0 0 0 0 0 1 1 1 1
6 0 0 0 0 0 0 1 4 6
7 0 0 0 0 0 0 0 7 1
8 0 0 0 0 0 0 0 0 1
9 0 0 0 0 0 0 0 0 0
Table 4: Different reasons of closeness
Code Reason
1 Type of customer
2 Ease of supervision
3 Common personnel
4 Contact necessary
5 Share same space
6 Psychology
Table 5: Numerical weight of different value
Value Closeness Numerical weight
A Absolutely necessary 16
E Especially important 8
I Important 4
O Ordinary closeness OK 2
U Unimportant 0
X Undesirable -80
5.1 Solving with GA
A computer program was developed with Microsoft