๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multi Resource Scheduling Problem Based on an Improved Discrete Particle Swarm Optimization

โœ Scribed by Su Wang; Jun Zheng; Kai Zheng; Jun Guo; Xiaoping Liu


Book ID
113847282
Publisher
Elsevier
Year
2012
Tongue
English
Weight
337 KB
Volume
25
Category
Article
ISSN
1875-3892

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)