𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Research topics in discrete estimation of distribution algorithms based on factorizations

✍ Scribed by Roberto Santana; Pedro Larrañaga; Jose A. Lozano


Book ID
107647032
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
395 KB
Volume
1
Category
Article
ISSN
1865-9284

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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)