earticle

논문검색

Analysis of Performance of Particle Swarm Optimization with Varied Inertia Weight Values for solving Travelling Salesman Problem

초록

영어

Particle Swarm Optimization is a popular heuristic search technique developed by Eberhart and Kennedy in 1995 which takes its inspiration from the social and cognitive learning of birds or fishes. This algorithm comprises the involvement of swarm intelligence technique for optimization. The most widely accepted variation of the basic PSO technique is PSO with Inertia weight which substantially controls the convergence behaviour and exploration exploitation trade-off in the basic PSO technique. From its initialization onwards a huge range of modifications of Inertia Weight strategy have been recommended. This paper involves the use of PSO with varying values of inertia weight for solving the Travelling Salesman Problem. An analysis of how different inertia weight values effect the solution in terms of time complexity, space complexity and convergence in carried out in order to know the value best suited for setting up the inertia weight.

목차

Abstract
 1. Introduction
 2. Problem Formulation
 3. Particle Swarm Optimization
 4. Inertia Weight Particle Swarm Optimization
 5. Experimental Parameter Setting
 6. Experimental Results
 7. Conclusion
 References

저자정보

  • Ashima Chopra Computer Science Guru Nanak Dev University, RC Jalandhar, Punjab, India
  • Mandeep Kaur Computer Science, Guru Nanak Dev University RC Jalandhar, Punjab, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.