𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems

✍ Scribed by Josu Ceberio; Ekhine Irurozki; Alexander Mendiburu; Jose A. Lozano


Book ID
113111860
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
737 KB
Volume
1
Category
Article
ISSN
2192-6352

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)