Ant colony algorithm of partially optimal programming based on dynamic convex hull guidance for solving TSP problem

Ant colony algorithm of partially optimal programming based on dynamic convex hull guidance for solving TSP problem

To solve basic ant colony algorithm’s drawbacks of large search space,low convergence rate and easiness of trapping in local optimal solution,an ant colony algorithm of partially optimal programming based on dynamic convex hull guidance was proposed.The improved algorithm dynamically controlled the...

Full description

Saved in:
Bibliographic Details
Main Authors: Xuesen MA, Shuai GONG, Jian ZHU, Hao TANG
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2018-10-01
Series:Tongxin xuebao
Subjects:
ant colony algorithm
convex hull
TSP
partially optimal programming
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018218/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018218/

Similar Items