Dissertation > Excellent graduate degree dissertation topics show

Solving 0-1 Knapsack Problems Using Improved Discrete Particle Swarm Optimization

Author: LiLan
Tutor: HaoZhiFeng
School: South China University of Technology
Course: Computational Mathematics
Keywords: 0-1 knapsack problem Discrete Particle Swarm Optimization Greedy operator Random replacement operator
CLC: TP301.6
Type: Master's thesis
Year: 2011
Downloads: 140
Quote: 1
Read: Download Dissertation

Abstract


All types of knapsack problem can be converted to the 0-1 knapsack problem , therefore the basic 0-1 knapsack problem as a research object . View of the particle swarm optimization algorithm is simple , simple , not too much parameter adjustment , can handle difficult for traditional search methods to solve nonlinear problems , this paper take the technical route of the discrete particle swarm algorithm , the particle swarm algorithm advantage able discrete problem can be brought into play . The particle swarm algorithm is to simulate the natural mechanisms of biological evolution algorithm , but due to the discrete particle swarm algorithm thinking is different from the essence of the idea of the particle swarm algorithm , this paper proposed late in the particle iteration velocity update formula more in line with the idea of the particle swarm . Replace the operator to reduce blindness and to increase the probability of optimization in order to make the search process , the proposed discrete particle swarm algorithm with greedy operator and with random discrete particle swarm algorithm to solve the 0-1 knapsack question . In the final chapter of experimental analysis shows that the improved algorithm is applied to the 0-1 knapsack problem with a certain practicality and effectiveness .

Related Dissertations

  1. Research on Combinatorial Optimization Problem Based on DNA Self-Assemble,TP399-C8
  2. Multi-objective artificial fireflies swarm optimization algorithm and its application,TP301.6
  3. Simulation Training System Research and Design for a Certain Type of Equipment,TJ06
  4. The Improvement of Genetic Algorithm and It’s Application on Knapsack Problem and Function Optimization,TP18
  5. Research on the Combinational Optimization in Shuffled Frog Leaping Algorithm,TP301.6
  6. Research on Modified Particle Swarm Optimization and Its Application,TP301.6
  7. The Research of Artificial Fish Swarm Algorithm and Its Application,TP301.6
  8. The Research of a Multi-objective Evolutionary Algorithm Based on Steady-state,O221.6
  9. Research on Lock Capacity on the Minjiang River Downstream,U641.7
  10. The Study of the Resourceallocationalgorithm in Ofdm-based Cognitive Radio Systems,TN925
  11. The Numerical Algorithm for the Linear Congruential Equations with Single Modulus / Multi-modulus and Its Application in Cryptography,TN918.1
  12. MPI-based parallel genetic algorithm for 0-1 knapsack problem Applied Research,TP18
  13. Application Research of Particle Swarm Optimization in Conbinatiorial Optimization Problems,TP301.6
  14. Genetic Algorithms Research and Application mode - based alternative,TP18
  15. On the Multi-population Ant Colony Optimization Algorithm,TP301.6
  16. Research on Quantum Evolutionary Algorithm and It’s Applications,TP18
  17. Evolutionary Strategies for Solving Multiple-choice Multidimensional Knapsack Problems,TP18
  18. An Optimization Model for the Ro-Ro Ship Loading,F224
  19. The Comparison and Improvement of Algorithms for Solving the 0-1 Knapsack Problem,TP301.6
  20. Research on Optimal Voyage Decision Optimization of Bulk Cargo Shipping,U692.3
  21. Research of Differential Evolutionary Algorithms Application on Combination Optimization,TP301.6

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