Dissertation > Excellent graduate degree dissertation topics show

Based on intelligent algorithm research dimensional cutting stock problem

Author: GaoZhiE
Tutor: ZhangGongJing
School: Qingdao University
Course: Computer Software and Theory
Keywords: two-dimensional cutting-stock greedy-algorithm horizontal line scan particle swarm optimization algorithm
CLC: TP301.6
Type: Master's thesis
Year: 2011
Downloads: 186
Quote: 0
Read: Download Dissertation

Abstract


The cutting stock problem layout a series of small parts with different shapes is to find the optimal arrangement of parts and producing the least waste. The problem belongs to the typical combination and optimization problem, which is the NP-complete problem with the high calculate complexity, for the large-scale cutting stock problem, conventional manual layout operation has many shortcoming such as inefficient low yield and long time consuming, even if use computer also have to exploder high efficiency arithmetic to achieve the relatively high efficiency optimum cutting.According to space division, the cutting stock problem divide into one-dimensional, two-dimensional, three-dimensional, in which two-dimensional cutting-stock is widely used.At present, rectangular cutting-stock combined with a variety of intelligent algorithms, has made a number of sophisticated algorithms. In the paper, for the rectangular cutting stock problem, use sheet with restricted in width but infinite in length to cut a group of triangles with known size, minimize the used area of sheet, the graphic scan conversion techinque can transforms the triangle into the discretizing geometrical information, which solves the problems caused by the complex profiles of triangles. The Heuristic Searching Algorithm based on graphic scan conversion method is introduced in the paper, which serves as the bottom, improved particle swarm optimization serves as the upper optimization Algorithm. The bottom Algorithm receive the optimization parameters from the upper optimization Algorithms.In the end, through simulating the experimental results show that the proposed heuristic particle swarm optimization algorithm has strong global search ability, the utilization of materials has been greatly improved and have a near optimize result in a relatively short time. In a word, the heuristic particle swarm optimization is an efficient, fast and accurate intelligence algorithm.

Related Dissertations

  1. Computing Minimum Distance between Curves/Surfaces Based on PSO Algorithm,O182
  2. Active Power Filter and Its Application in Distribution Network,TN713.8
  3. Research on Fuzzy C-Mean Clustering Algorithm Based on Particle Swarm Optimization and Shuffled Frog Leaping Algorithm,TP18
  4. Based on RFID Prison Intelligent Management System Research and Implementation,TP315
  5. The Research on the Target Localization and Tracking Based on WSN,TN929.5
  6. Simulation and Fabrication of Refractive Micro-Structures Based on Wet KOH Etching Characteristics of Silicon,TP391.41
  7. Research on Cultural Algorithm and Its Application in Constrained Optimization Problems,O224
  8. Control of the Water Tank Process Device Based on Particle Swarm Optimization,TP18
  9. The Scheduling of Multi-objective Elevator Group Control Algorithm Based on PSO,TU857
  10. Research on the Improved Grid Schedule Algorithm Based on Min-Min and Max-Min,TP393.01
  11. The Research of Moving Object Tracking Based on Swarm Intelligence Algorithm,TP391.41
  12. Based the UML college Automated Course Scheduling System Design and Implementation,TP311.52
  13. Based on particle swarm optimization algorithm for ship route planning method,TP301.6
  14. Particle Swarm Optimization and Its Application in Rendezvous and Docking of Spacecraft,TP301.6
  15. Application of Wavelet Network in Economic Prediction,F201
  16. Energy Efficient Hierarchical Routing Protocol in WSN,TN915.04
  17. The Numerical Algorithm for the Linear Congruential Equations with Single Modulus / Multi-modulus and Its Application in Cryptography,TN918.1
  18. Study on Resource-constrained New Product Development Project Scheduling Problem,F273.2
  19. (m, 4) - split lines and (m, 1,2) - Some results of separate lines,O157
  20. Particle Swarm Optimization Algorithm and the Application in Blind Equalization,TN911.7

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods > Algorithm Theory
© 2012 www.DissertationTopic.Net  Mobile