Study On The Application Of Partition Tree-genetic Algorithm In Workshop Layout Of H Company

With the deepening of the process of economic globalization,the mode of production of manufacturing enterprises gradually tends to be customized on a large scale and the competition among them has entered a stage of short-cut and phase-in.As a carrier of enterprise production to be implemented-manufacturing plant,also face more severe test.In order to be able to quickly respond to customer requests,products that satisfy customers can be manufactured in the shortest time and at the lowest cost,and the workshop needs to be reconfigured and optimized to suit production.According to statistics,only about 5% of the processing time is spent in the entire production process,while the remaining 95% are used for handling,waiting,loading and unloading.In the United States,it costs more than250 billion U.S.dollars a year to optimize the layout of the shop floor.This shows that the layout of the study for the manufacturer is crucial,it can minimize the cost of logistics enterprises,significantly enhance the operational capacity of enterprises.In this thesis,the problems of No.two plant of H company layout has been exposed under the spotlight.Through the segmentation tree space layout of genetic algorithm,a new improvement plan has been obtained,so that the total logistics cost between the workshops of No.two factory is the lowest.No.two plant is a branch of H Company,which is used to produce inside and outside the pilla,triple-purpose valves,roof beams and drill pipes.The workshop layout problem is mainly to decorating the remaining 9 workshops area.It belongs to the workshop class layout problem.Because the no.2 plant is a redevelopment plant,there are already 6workshops in the original factory.At present,the remaining nine workshops are arranged in the factory area on the basis of not changing the existing six workshops and the layout of the plant.Since the required area for the nine workshops is not exactly the same,so we will layout problem abstraction into a continuous plane layout,that is,according to the central coordinates of each workshop,we put them in the layout plane.The segmentation tree space layout of genetic algorithm is based on Polish coding and decoding,four crossover operations of single parent gene inversion,gene insertion,gene translocation and gene exchange,population evaluation,father and son competition population selection method,using Matlab to find the optimal solution.At the same time,we compare the segmentation tree space layout of genetic algorithm with the traditional genetic algorithm,and prove thesuperiority of the segmentation tree space layout of genetic algorithm in solving solve the linear layout problem.Finally this article is successful to find a satisfied layout plan of H company by the segmentation tree space layout of genetic algorithm.So the segmentation tree space layout of genetic algorithm is an effective method to solve the linear layout problem.