Home > Papers

 
 
Discrete Particle Swarm Optimization for Terminal Assignment Problems
WANG Jiahai *,CAI Yiqiao
Department of Computer Science, Sun Yat-sen University
*Correspondence author
#Submitted by
Subject:
Funding: the Specialized Research Fund for the Doctoral Program of Higher Education （No.No. 20070558052）, the National Natural Science Foundation of China （No.No. 60805026）
Opened online:26 August 2010
Accepted by: none
Citation: WANG Jiahai,CAI Yiqiao.Discrete Particle Swarm Optimization for Terminal Assignment Problems[OL]. [26 August 2010] http://en.paper.edu.cn/en_releasepaper/content/4382268
 
 
This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for terminal assignment problem (TEAP). EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.
Keywords:combinatorial optimization; discrete particle swarm optimization; estimation of distribution; terminal assignment problem
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 298
Bookmarked 0
Recommend 5
Comments Array
Submit your papers