Discrete particle swarm optimization bas
โ
Jiahai Wang; Yiqiao Cai; Yalan Zhou; Ronglong Wang; Caiwei Li
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 294 KB
## a b s t r a c t Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA)