Research On The Algorithms Based On Estimation Of Distribution Algorithm For The Selection Of Manufacturing Resources And Cell Formation

As the strategy of manufacturing enterprises in the 21st century, agile manufacturing is a new-type manufacturing mode adaptable to international product market environment. Reconfiguration of manufacturing resource is one important technology to realize agile manufacturing. Selection of manufacturing resources and cell formation are important content. Therefore, to explore and study the methods of Selection of manufacturing resources and cell formation has important theoretical and practical significance to the realization of agile flexible manufacturing and the rapid development of manufacturing industry in our country. The text solves three problems: the selection of manufacturing resources in Agile Manufacturing System (AMS), the selection of manufacturing resources in Agile Manufacturing Cell (AMC) and Cell Formation (CF).The problem of the selection of manufacturing resources in AMS is a kind of Zero-One Integer Programming Problem. Based on the characters of the problem, the author designs the algorithm for the selection of manufacturing resources in AMS which introduces virtual manufacturing resources and the probability model of ECGA. The strategy of introducing virtual manufacturing resources reduces the quantity of calculating. The probability model of ECGA makes the algorithm convergence faster. The characteristics of the algorithm proposed are fast, accurate and all-purpose.The problem of the selection of manufacturing resources in AMC is a kind of Liner Integer Programming Problem. The author introduces the methods of managing the restriction and the coding of binary sum used in GA. At the same time, the operator of mutation is introduced. The algorithm designed for the selection of manufacturing resource in AMC not only solves the problem efficiently, but also provides a new method of Liner Integer Programming problem.The problem of CF is a kind of Combinatorial Optimization problems and NP hard problems. The coding of natural number, the operator of revising and local searching make the algorithm for Cell Formation based on EDA solve the CF problem simply, fast and efficiently.