Improved artificial bee colony algorithm for large scale colored bottleneck traveling salesman problem
In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its algorithms. An improved artificial bee colony al...
Saved in:
Main Authors: | Wenyong DONG, Xueshi DONG, Yufeng WANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2018-12-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018284/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast agglomerative clustering using approximate traveling salesman solutions
by: Sami Sieranoja, et al.
Published: (2025-01-01) -
ENHANCEMENT OF ARTIFICIAL IMMUNE SYSTEMS FOR THE TRAVELING SALESMAN PROBLEM THROUGH HYBRIDIZATION WITH NEIGHBORHOOD IMPROVEMENT AND PARAMETER FINE-TUNING
by: Peeraya THAPATSUWAN, et al.
Published: (2024-12-01) -
Modified shuffled frog-leaping algorithm to solve traveling salesman problem
by: LUO Xue-hui, et al.
Published: (2009-01-01) -
Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem
by: Awaz Ahmad Shaban, et al.
Published: (2023-07-01) -
An Efficient Tourism Path Approach Based on Improved Ant Colony Optimization in Hilly Areas
by: Mohamed A. Damos, et al.
Published: (2025-01-01)