Improved PSO for TNDBDCP

DOI

10.2991/isci-15.2015.155How to use a DOI?

Keywords

PSO; TNDBDCP; Spanning tree

Abstract

Traffic network distribution based on distribution center problem (TNDBDCP) is put forward, which can not be solved by traditional algorithms. In order to solve TNDBDCP, Particle Swarm Optimization (PSO) is put forward based on the idea of global and feasible searching. In the PSO, introducing check function ensures the feasibility of particle swarm, which is designed based on the neighborhood search method which only uses one loop program to meet the requirement of time constraint and radialized network structure; more reasonable fitness function is designed based on the relationship between spanning tree and its cotree; improvements for updating the position of particle make the current position of particle be beneficial to being close to the best position of particle in its neighborhood.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Kai Shao
AU  - Kang Zhou
AU  - Yingying Duan
AU  - Wenbo Dong
PY  - 2015/01
DA  - 2015/01
TI  - Improved PSO for TNDBDCP
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 1176
EP  - 1181
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.155
DO  - 10.2991/isci-15.2015.155
ID  - Shao2015/01
ER  -