Dissertation > Excellent graduate degree dissertation topics show

The Optimal Layout of Circular Parts

Author: ZhangJingQin
Tutor: LiDaWei
School: Liaoning University of Science and Technology
Course: Operational Research and Cybernetics
Keywords: Layout problem constrained layout the nesting layout NEST layout BLOCK layout
CLC: TB114.1
Type: Master's thesis
Year: 2012
Downloads: 58
Quote: 0
Read: Download Dissertation

Abstract


The Circular blank layout problems exist widely in all kinds of manufacturing, such as machinery manufacturing, clothing manufacturing, furniture manufacturing, wood processing industry, leather products manufacturing and so on. However, because the Circular blank layout problems has been proved to be quite difficult completely NP-hard problem, at home and abroad, the research method of the scholars is very few, partly, the circular parts are processed for rectangular components (seeking for the minimum envelope moment), and then use the research methods for rectangle parts layout problem to deal with the optimize layout of circular parts. Basically, there are dynamic programming algorithm, branch bound algorithm, neural network algorithm, genetic algorithm, tabu search algorithm, particle swarm algorithm and so on, but the effect of the optimization is not obvious. But in recent years, some scholars use the bar band method to divide the circular parts into bar band of X and Y directions, and then use dynamic programming algorithm to obtain optimal solution. In some degree ,although it has obtained good effect, it still can’t meet the requirements of production. So the further researches of the circular blank layout problem have theoretical and practical significance. The Circular blank layout problem include constrained layout and unconstrained layout. Unconstrained layout does not require times of appearance of all sorts of circular piece, only makes the utilization rate (value) of raw materials largest. This kind of layout problem relatively simple, it mostly uses linear programming algorithm to solve; However constrained layout demand to meet the requirement of all sorts of circular piece, and make the utilization rate of raw materials largest, this problem in actual production is used widely, but the research is very difficult.This paper studies the constrained layout of the circular pieces, and cutting rounds on the raw material of rectangular. In the course of the study, the main research is the single round of layout and the nesting layout. In the research of the single layout, firstly, there are given respectively highest utilization rate model and the model of least consumption of raw materials ,then it introduces two kinds of typical layout way—the layout model A and the layout mode B, and the layout mode B is divided into two kinds of situations: the most number of parts in the odd and the even lines is same and the most number of parts in the odd lines is one more than the most number of parts in the even lines, and are given, In the final ,by analysis the layout process and the solving of the example, it sums up to that the two layout ways have optimization effects under the different situations. In the study of the nesting layout of circular parts, the firstly, inspiration by the single row layout patterns, it seeks out two kinds of layout way of the nesting layout–the NEST layout and the BLOCK layout, and gives the specific layout process. But by analysis the two layout process ,it is sure that, although NEST layout mode is greatly raised the utilization rate of the raw materials, in the layout process, it is according to the order of the diameter of the round parts from the large to the small, by the NEST layout of characteristics, when the difference of two kinds of round the diameter of the piece is great, it will create a lot of waste and the chaos of the raw material of the layout. And in BLOCK layout mode ,it is not appear mentioned problems of the above, but when the diameter of the round piece changes, it also can create a lot of waste materials, therefore, this paper puts forward to the radius search method, it is effective optimized combination of the two kinds of layout mode, it meets the requirement of all sorts of circular piece. In addition, it makes the requirement of the raw materials least, so as to increases the utilization ratio of the raw materials. Finally through the examples and the matlab7.1 operational results, it proves that the radius search method is effective and feasible.

Related Dissertations

  1. Rise and Fall of historical inquiry Chrysostom Hong Kong,K29
  2. The Realization of Floorplan in Large Scale Mixed-Signal SOC Design,TN47
  3. Research on Two-Dimensional Cutting Stock Problems under Several Constraints,TP391.7
  4. The Design and Implementation of the mWebPortal Platform for Smart Terminal Equipment Accessing Web Application,TP311.52
  5. The Construction of Multi-Objective Differential Evolution Algorithms and Its Application,TP301.6
  6. Study on Theory and Method of Intelligent Optimal Design for Hydraulic Manifold Block,TH137
  7. Multiagent Evolutionary Models and Algorithms,TP18
  8. Research on Particle Swarm Optimization and Its Application,TP301.6
  9. Airborne packing scheme developed in the logistics system software development,F252
  10. Research on Facility Layout Problem Based on Hybrid Intelligent Algorithm,TP18
  11. Algorithms for Reliable Facility Location Problem,TB114
  12. Optimization Research on Workplace Facility Layout Problem Based on Human Factors,F224
  13. The Evolutionary Algorithms for Solving Placement Problem,O224
  14. Particle Swarm Optimization glass nesting problems,TP301.6
  15. The logistics nodes facilities layout design method,F252
  16. Research on Warehouse Layout Optimization Based on Ant Colony Optimization Algorithm,TH692.3
  17. Study on Two-stage Approach to Facility Layout Problem Based on Genetic Algorithm,TP18
  18. Research on Machine Layout Problem Based on Partheno-Genetic Algorithm,TH18
  19. Study & Implementation of Professional CAD System for Boating Decoration,U662.9
  20. Research on Optimization Method Based on Complex Network for Crossing Waypoints Location,V249.1
  21. Theory and Algorithm of Layout Optimization Characterized by Topological Structure,O224

CLC: > Industrial Technology > General industrial technology > Engineering and basic science > Engineering Mathematics > The application of probability theory, mathematical statistics > The application of operations research
© 2012 www.DissertationTopic.Net  Mobile