Application of Genetic algorithm to Plant layout problem

Submitted By 2010281 Vivek Parekh 2010288 Anuj Bindlish 2010292 Ashish Kanaya 2010296 Sarita Chowdhary 2010298 Debashish Bagg

Different names of present problem

( "economic activity location" (Koopmans and

Beckmann

1957) ( "plant layout"(Foulds and Robinson 1976),(Apple 1963) ( "facilities allocation" (Armour and VoUmann 1964) ( "layout planning"(Muther 1973) ( facilities layout problem (FLP) by Foulds.

Application of Genetic algorithm to Plant layout problem

( Physical model ( Graph theory (Transportation Model) ( Quadratic assignment problem (QAP) ( Linear integer programming (all variables

are

integers) ( Mixed integer programming (some variables are integers) ( Simulation ( Queuing theory ( Semi - Heuristic algorithms (genetic Algorithm)
Application of Genetic algorithm to Plant layout problem

( Simulated annealing algorithm ( Tabu search ( Ant-colony algorithm ( Genetic algorithm (GA)

(SAA)

Application of Genetic algorithm to Plant layout problem

SAA is based on crystallization phenomenon in physics. ( SAA traverses the solution space through generating and evaluating new solutions derived from the current solution.
(

Application of Genetic algorithm to Plant layout problem

( Attributed to Fred W. Glover ( Mathematical optimization method,

for local

search techniques. ( Enhances using memory structures ( A potential solution has been determined, it is marked as taboo

Application of Genetic algorithm to Plant layout problem

( Ant-colony

optimization is a population based approach and is derived from foraging behavior of ant colonies. ( A group of artificial ants work cooperatively to find a better solution.
Application of Genetic algorithm to Plant layout problem

( GA search process is

motivated by the mechanism of natural evolution where the most adapted to the environment survive and thrive.

Application of Genetic algorithm to Plant layout problem

 Characterized as a parallel approach  Optimizes the population of solutions

simultaneously  To provide a set of near optimal solutions  Verified in different combinatorial optimization problems

Slicing: ( the process of cutting a rectangular region ( slicing tree is a binary tree, ( Crossover: ( an offspring chromosome is generated by adopting workstation numbers from one parent and position symbols from the other. ( Mutation: ( Random altering, inverting and swapping are used as a mutation operation ( Selection: ( The task of selection in the genetic algorithms is to allocate the reproductive opportunities to each chromosome such that the chromosomes with higher fitness value are more likely to survive to the next generation.
(

Fitness Table: ( stores the information of fitness of different genes ( Fitness Search Criteria: ( set of constraints that the set of chromosomes (layout design) needs to satisfy ( Evaluation of convergence: ( Convergence criteria are the criteria that make the output acceptable. ( Convergence cost criteria: ( minimization of the total connectivity cost
(

Flowchart of the algorithm

( Finding cost matrix ( Reduction of material handling

cost ( Total combinations 8!ways i.e.

& 40320 combinations if layout shape is

fixed & ( 8 + 7 ) ! = 1307674368000 combinations

( If some of them have constraints & Move ability & Safety regulations & Input output roads etc.
Application of Genetic algorithm to Plant layout problem

Reverse Polish Expression

Number of arrangements possible 4! = 24

Mutation Cross Over

Application of Genetic algorithm to Plant layout problem

( Size of problem: (20 facilities (Unequal sizes ( Criteria: (Facility orientation, (Facility irregular shapes, (input/output locations, (connectivity distances, (Facility non-overlapping, (safety and operability restrictions, (area allocation constraints etc.
Application of Genetic algorithm to Plant layout problem

Application of Genetic algorithm to Plant layout problem

Application of Genetic algorithm to Plant layout problem

( Variation

in the type of coordinate system used to denote spatial location ( Variation of slicing methodology ( Adding Artificial Intelligence to reduce number of iterations. ( Empirical tests indicate it is able to make considerable improvements in the value of the objective function.
Application of Genetic algorithm to Plant layout problem

( Key

features of genetic algorithm

(Parallel in approach (Simultaneously optimizes multiple genes (Mutation brings in random factor so more optimal (considers positions of objects around the site (maintains in each generation chromosomes

representing partial optimal layout (Even if you have not reached a global optimal solution you still have a local optimal solution.
Application of Genetic algorithm to Plant layout problem

1. 2. 3. 4. 5. 6.

7.

8. 9.

10.

L. R. Foulds, , 1983, Techniques for facilities layout: Deciding which pairs of a activities should be adjacent, Management science, Vol. 29, No. 12, Pg. 1414 1426. L. C. Shih, T. Enkawa and K. Itoh, 1992, An AI-search technique-based layout planning method, International Journal of Production Research, Vol. 30, No. 12, Pg. 2839 2855. F. Azadivar and J. Wang, 2000, Facility layout optimization using simulation and genetic algorithms, International Journal of Production Research, Vol. 38, No. 17, Pg. 4369 4383. A. P. Barbosapovoa, R. Mateus and A. Q. Novais, 2001, Optimal two-dimensional layout of industrial facilities, International Journal on Production research, Vol. 39, No. 12, Pg. 2567 2593. T. Dunker, G. Radonsand E. Westkamper, 2003, A co-evolutionary algorithm for a facility layout problem, International Journal of Production Research, Vol. 41, No. 15, Pg. 3479 3500. H. Aytug, M. Khouja and F. E. Vergara, 2003, Use of genetic algorithms to solve production and operations management problems: a review, International Journal of Production Research, Vol. 41, No. 17, Pg. 3955 4009. H. M. Harmanani, P. P. Zouein and A. M. Hajar, 2004, A parallel genetic algorithm for the geometrically constrained site layout problem with unequal size facilities, International Journal of Computational Intelligence and Applications, Vol. 4, No. 4, Pg. 375 400. M. Ye and G. Zhou, 2007, A local genetic approach to multi-objective, facility layout problems with fixed aisles, International Journal of Production Research, Vol. 45, No. 22, Pg. 5243 5264. J. A. DiegoMas, M. C. Santamarina-Siurana, J. A. Marzal and V. A. C.Ballester, 2009, Solving facility layout problems with strict geometric constraints using a two-phase genetic algorithm, International Journal of Production Research, Vol. 47, No. 06, Pg. 1679 1693. T. Tunnukij and C. Hicks, 2009, An Enhanced Grouping Genetic Algorithm for solving the cell formation problem, International Journal of Production Research, Vol. 47, No. 07, Pg. 1989 - 2007.
Application of Genetic algorithm to Plant layout problem

Application of Genetic algorithm to Plant layout problem