1 / 17

A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity of Solutions

2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC2010). A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity of Solutions. Takeya Matsui 1 Masato Noto 1 Masanobu Numazawa 2 1 Kanagawa University, Japan 2 Otaru University of Commerce, Japan.

eris
Download Presentation

A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity of Solutions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC2010) A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity of Solutions Takeya Matsui1Masato Noto1Masanobu Numazawa2 1Kanagawa University, Japan 2Otaru University of Commerce, Japan 11, Oct., 2010

  2. Outline • Introduction • Particle Swarm Optimization (PSO) • Proposed Method • Simulation Experiments • Conclusion and Future Work SMC2010 in Istanbul,TURKEY

  3. Introduction Particle Swarm Optimization (PSO) • An optimization method that emulates the behavior of creatures such as a flock of birds or a school of fish. • Each of a number of candidate points (particles) has information about its own position and velocity. • That information is shared within the swarm, and the search proceeds while information on the best solution is shared. • A characteristic of PSO • The PSO algorithms are extremely simple. • PSO is applied to various different types of problem and its validity has been confirmed. SMC2010 in Istanbul,TURKEY

  4. Particle Swarm Optimization (PSO) • Gbest model • The best solution discovered by the entire swarm is shared by the entire swarm. • The most basic model for PSO. • This model can converge quickly on a solution and may become trapped at a local solution. • Lbest model • Divides the swarm into a number of groups. • Shares the best solution that is discovered by each group within that group. • This model converges slowly on the solution but its global search capability is better. SMC2010 in Istanbul,TURKEY

  5. In this study • We propose a hybrid PSO algorithm. • In order to resolve the drawback of PSO in that it can easily get trapped at a local solution. • The initial stages of the search maintain the diversity of the search by using the Lbest model. • Then the method intensifies the search in the later stages by switching to the Gbest model. • The method searches the optimal solution candidates vicinity carefully by limiting update of the shared information. SMC2010 in Istanbul,TURKEY

  6. PSO (Gbest model) algorithm • Each Particle in the -dimension space • Current position: • Current velocity: • Own best solutions: • Evaluation value: ( is the Particle number, is the number of iterations) • Shared by the entire swarm • Best solutions discovered by the entire swarm: • Evaluation value: SMC2010 in Istanbul,TURKEY

  7. Travel of Particle in Gbest model • Updating velocities • Updating positions SMC2010 in Istanbul,TURKEY

  8. Lbest model • Each Particle forms a group consisting of itself and neighboring Particles. • Shares the best solution that is discovered by each group as within that group. • Each group search regions that are mutually different. • The global search capability is increased. • Since the particles are formed into groups with overlapping portions, this means that there is some sharing of information within the entire swarm. • The processing eventually converges on the best value within the values. SMC2010 in Istanbul,TURKEY

  9. Degree of activity of swarm • The degree of activity of the swarm has been proposed as an indicator for quantitively comprehending the search situation in PSO. • The degree of activity of the swarm is defined as the root mean square of the velocities of the particles. • Use of the degree of activity of the swarm makes it possible to know the activity state of the entire swarm. • When the degree of activity is large --> Expanding • When the degree of activity is small --> Converging : Number of Particles : Number of dimensions of the problem : -dimensional element of the velocity of the th particle in iterations SMC2010 in Istanbul,TURKEY

  10. Proposed method • By using the degree of activity of the swarm to monitor the diversity of the search. • The initial stages of the search maintain the diversity of the search by using the Lbest model. • The final stages of the search intensifies the search by switching to the Gbest model. • Furthermore, the method is adopting the lowest number of iterations of the shared information. • Updating the shared information of the swarm, and then searching carefully in the vicinity of the optimal solution candidates without further updating the shared information untilis reached. SMC2010 in Istanbul,TURKEY

  11. Simulation experiments • 2nminima function Subj. to Globally optimal solution: • Rastrigin function Subj. to Globally optimal solution: Rastrigin function ( ) 2nminima function ( ) SMC2010 in Istanbul,TURKEY

  12. Simulation Parameters : The maximum value of the degree of activity of the swarm during the iterations. SMC2010 in Istanbul,TURKEY

  13. Simulation Results SMC2010 in Istanbul,TURKEY

  14. Transitions in degree of activity 2nminimafunction Rastriginfunction • The proposed method maintains the degree of activity of the swarm right up to the end. • This is thought to be because the diversity of the search is maintained for a long while with the proposed method. • By using the Lbest model to search in different ranges for each group, until the degree of activity falls to a certain amount. SMC2010 in Istanbul,TURKEY

  15. Transitions in best values 2nminimafunction Rastriginfunction • The proposed method took longer to converge on the solution than the Gbest model. • Uses the Lbest model in the initial stages of the search. • The adoption of delays the convergence on the solution. • No great difference in convergence on the solution was seen in comparison with the Lbest model. • The search is intensified by switching to the Gbest model in the final stages of the search. SMC2010 in Istanbul,TURKEY

  16. Conclusion and Future Work • In this study, we proposed a hybrid method in order to resolve the drawback of PSO in that it can easily get trapped by a local solution. • We have confirmed from the results of simulation experiments that the proposed method has superior search capabilities. • Future work • Optimization of and . • Evaluations of various different benchmark problems. • Verification of the validity of the method in real-life systems. SMC2010 in Istanbul,TURKEY

  17. Thank you for your kind attention!

More Related