ACO による分割統治型 TSP 近似解法

原 元司; 梶野 大輔; 堀内 匡

doi:10.3156/jsoft.24.1101

Journal of Japan Society for Fuzzy Theory and Intelligent Informatics

Online ISSN : 1881-7203
Print ISSN : 1347-7986
ISSN-L : 1347-7986

Short Notes

ACO Algorithm with Divide-and-Conquer Technique for The TSP

Motoshi HARA, Daisuke KAJINO, Tadashi HORIUCHI

Author information

Keywords: ACO (Ant Colony Optimization), AS (Ant System), Divide-and-Conquer Technique, 2-opt, SA (Simulated Annealing)

JOURNAL FREE ACCESS

2012 Volume 24 Issue 6 Pages 1101-1105

DOI https://doi.org/10.3156/jsoft.24.1101

Details

Abstract

This paper presents the ACO algorithm with divide-and-conquer technique (We termed it DAS) for the TSP. Consequently, some numerical simulations demonstrate that the DAS is able to generate shorter tours than the conventional SA (Simulated Annealing), 2-opt and AS techniques.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!