The　original　PSO　algorithms　are　disturbed　by　the　＂curse　of　dimensionality＂,　which　concludes　that　their　performance　deteriorates　as　the　dimensionality　of　the　search　space　increase.　This　paper　shows　a　variation　on　the　original　PSO　algorithm,　called　improved　cooperative　particle　swarm　algorithm,　or　COPSO,　employing　cooperative　behavior　to　significantly　improve　the　performance　of　the　original　algorithm,　and　then　we　add　a　constriction　factor　to　the　CPSO　to　form　an　improved　CPSO　algorithm　(ICPSO).　Finally,　the　paper　do　the　experiments　on　three　classic　functions,　the　result　of　the　ICPSO　algorithm,　relatives　to　the　classic　PSO　algorithm　and　the　COPSO　algorithm,　shows　the　better　optimization　performance.　©　2011　IEEE.