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

Application of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem

โœ Scribed by Chengming Qi

Book ID
119354253
Publisher
Elsevier
Year
2011
Tongue
English
Weight
300 KB
Volume
15
Category
Article
ISSN
1877-7058

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Discrete particle swarm optimization bas
Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems
โœ 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)