[Shao, Kai; Zhou, Kang; Duan, Yingying; Dong, Wenbo] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
通讯机构：
[Shao, Kai] W
Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
语种：
英文
关键词：
PSO;TNDBDCP;Spanning tree
期刊：
PROCEEDINGS OF THE 2015 INTERNATIONAL SYMPOSIUM ON COMPUTERS & INFORMATICS
ISSN：
2352-538X
年：
2015
卷：
13
页码：
1176-1181
会议名称：
International Symposium on Computers and Informatics (ISCI)
会议论文集名称：
ACSR-Advances in Comptuer Science Research
会议时间：
JAN 17-18, 2015
会议地点：
Beijing, PEOPLES R CHINA
会议主办单位：
[Shao, Kai;Zhou, Kang;Duan, Yingying;Dong, Wenbo] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
主编：
Liang, H Wang, W
出版地：
29 AVENUE LAVMIERE, PARIS, 75019, FRANCE
出版者：
ATLANTIS PRESS
ISBN：
978-94-62520-56-1
机构署名：
本校为第一且通讯机构
院系归属：
数学与计算机学院
摘要：
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 ...
