Research On Layout Algorithm Of Travel Area In Typical Manufacturing Enterprise

Layout problems stem from modern production and daily life in many areas and they perform all kinds of forms. They are widely used in the mechanical engineering, aerospace, robot motion planning, pattern recognition, transportation, large-scale integrated circuit design, publishing and printing, clothing, leather, shipbuilding, city planning and architectural design, and many other industries. People have studied more deeply on the layout problems. In many areas we have also made some progress, but the study of the overall layout is relatively weak. Layout problem in many industries is an important part of the production , it can greatly reduce production costs, improve production efficiency in the manufacturing enterprise if we have the quick and efficient layout solution to the problem. This paper studies storage travel area, introduces the theory of distribution in detail, gives a detailed description and analysis on the layout algorithm.Layout problems are complex combinatorial optimization problems and NP-complete problems. It is very difficult to find the exact global optimal solution in a certain period of time. This paper uses the heuristic algorithm, the focus of analysis is to combine the greedy algorithm and the people algorithm, study and improvement it. Then applies it on solving the problem of distribution, establishes the model to solve the layout problem, gives effective algorithm and feasible programmes. The use of heuristic methods, algorithms and programming techniques makes it to be true that design two-dimensional layout of a buffer zone, and Analysis parameters of the example.The main contents are as follows:First, in the introduction part we introduce the significance and the application of the layout problem, the research results in the theory of the domestic and international distribution , the practical application status of the layout problem solving method , and put forward the issue content of this paper.Then focuses on the theoretical foundation on solving the layout problem and describes the layout problems heuristic algorithm.Expound the characteristic of solving the layout problem and the principles we should give an attention when we solve the problem. Recapitulate briefly all aspects about the layout problems related: layout problems bound and layout model.Put forward the concept of feasible domain, space sequencing rules and positioning rules of layout objects.Introduces typical rectangular layout methods and carried out a detailed analysis on the greedy algorithm and the people algorithm of the layout problem. We has proposed the problem, introduced the basic concepts , studied the distribution strategy, and gave the final algorithm description. These two algorithms to solve different objectives layout problems were provided their own effective means. The layout algorithm minimizes the various possible location, accesses time and reduce complexity of the algorithm. If a combination of appropriate intelligent algorithm improve the initial distribution, there is hope to put the layout algorithm in the ultimate practice.Followed gives the empirical analysis and introduces various functional areas of the travel area. Travel has been selected as the main study area and is the example of its layout analysis. The Travel district and layout objects status are given. According to heuristic algorithm of the travel areas layout and the existing layout status, with the improved greedy algorithm and the impersonate algorithm, make a reasonable layout. And comparing the improved layout with the original layout, we get the corresponding conclusions .Finally, we gave the summary of the full text, obtained some useful conclusions, and gave a number of ideas on further research.