Dissertation > Excellent graduate degree dissertation topics show

Heuristic Algorithm for Circle Packing Problem and Structure Prediction Problem of Model Protein

Author: ZhouGuoCheng
Tutor: LiuJingFa
School: Nanjing University of Information Engineering
Course: Applied Computer Technology
Keywords: Heuristic algorithm NP-hard problem Circles Packing Problem HP lattice model Protein Structure Prediction
CLC: TP301.6
Type: Master's thesis
Year: 2011
Downloads: 24
Quote: 0
Read: Download Dissertation

Abstract


Solving NP-hard problem is a bottleneck in the computer science and technology tasks. In recent years, studies have shown that may not even exist both complete and strict nor too slow algorithm for NP-hard problem. The researchers are trying to be inspired from biological evolution, the process of physical movement and human social medium, in order to get the absolute complete non-class problem, but efficient approximation heuristic algorithm. Thus, some efficient modern heuristic algorithm to optimize performance without the need for special information, etc. have emerged, such as evolutionary algorithms, simulated annealing, tabu search algorithm, ant colony algorithm. These calculation methods have greatly enriched the modern optimization techniques, and the most difficult to deal with optimization techniques for traditional NP-hard problem and provide practical solutions. Greedy algorithm which, local search algorithms, simulated annealing, tabu search algorithm, genetic algorithm, the Monte Carlo algorithm, a simple introduction and focus on the round (ball) the shape Packing problems as well as the model protein structure prediction problem modern heuristic algorithm. First, based on the quasi human thought, flatten method proposed an efficient configuration update strategy for the potential energy surface. Flatten method will improve the potential energy surface (ELP) combination based on adaptive step gradient wears Hybrid Algorithm for Solving Circles Packing Problem. Secondly, through the neighborhood solution tabu search algorithm taboo objects and the acceptance of principles and the current solution improvements, improved tabu search algorithm, and improved tabu search algorithm based on adaptive step gradient algorithm combining proposed a tabu search-based heuristic algorithm solving spherical Packing problem. In addition, taking into account the improved ELP (ELP) method efficient optimize performance, this article ELP method applied to protein structure prediction in the HP lattice model, an efficient heuristic algorithm. The algorithm uses a greedy strategy to generate initial configuration, then the use of traction Mobile update configuration, once calculated fall into the trap of the minimum value, a 90 ° rotation, translation and other heuristic jump pit strategy to escape from the local minimum points. Short, inspired by the physical movement of the process of human society, as well as specific issues, this round (ball) shape Packing problem and model protein structure prediction problem has made a number of effective heuristic algorithm. Universal practical significance of these methods for realistic study of NP-hard problem to solve.

Related Dissertations

  1. Study on Site Selection of Ecological Food Franchisees in Jiaxiang, Taiyuan,F426.82
  2. Research of Vehicle Scheduling Problem Based on Ant Colony Algorithm,TP301.6
  3. The Research of Signal Detecting Algorithms and Improved Sphere Detecting Algorithms in MIMO Systems,TN919.3
  4. Hysteresis -based optimization of vehicle routing problem,O224
  5. Parallel sorting multiple orders optimization problem,F224
  6. Aircraft assembly moving assembly line job scheduling optimization,V262.43
  7. Flexible resource scheduling algorithm for dynamic combinatorial production and realization,F426.8
  8. Resource-based needs analysis study time production plant logistics optimization,F426.471
  9. Based on the feature fusion membrane protein transmembrane helix prediction,Q51
  10. Paralleling Genetic Annealing Algorithm with OpenMP,TP301.6
  11. Study on Mixed Model Line Balancing with Human Factors Under Make-to-Order Environment,F273;F224
  12. Application Research of Critical Chain Project Method in Project Schedule Management,F224
  13. Distribution center location based on the supply chain environment research,F224
  14. Predictions of Human Kinome-Small Molecule Interactions,Q55
  15. A Flow-shop S with Parameters Research of Complexity and Heuristic Lgorithms for the Parallel Machine and Cheduling Problems,O223
  16. Study on Attribute Reduction Algorithms Based on Rough Sets,TP18
  17. Design and Implementation of the 110 police line optimization system,TP301.6
  18. Two Kinds of Double Objective Functions Scheduling Problem Reserch,O223
  19. Integrated Batch Planning Research of Steelmaking Based on Robust Optimization Method,TF758
  20. Preliminary Design and Development for Roller Heating Process Management and Decision Support System,TP311.52
  21. Research and Application on Matching Method of Vessels and Cargos in Ocean Shipping Market,F224

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