Presentation 2011-05-27
Ant Colony Optimization using Genetic Information for TSP
Sho SHIMOMURA, Haruna MATSUSHITA, Yoshifumi NISHIO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This study proposes an Ant Colony Optimization using Genetic Information (GIACO). GIACO algorithm combines Ant Colony Optimization (ACO) with Genetic Algorithm (GA). GIACO searches solutions using the pheromone of ACO and the genetic information of GA. In addition, the ant which cannot trail the pheromone is caused by the mutation. We apply GIACO to Traveling Salesman Problems (TSPs) and confirm that GIACO obtains more effective results than the conventional ACO and the conventional GA.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Ant Colony Optimization / Genetic Algorithm / Traveling Salesman Problem / meta-heuristic
Paper # NLP2011-23
Date of Issue

Conference Information
Committee NLP
Conference Date 2011/5/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Ant Colony Optimization using Genetic Information for TSP
Sub Title (in English)
Keyword(1) Ant Colony Optimization
Keyword(2) Genetic Algorithm
Keyword(3) Traveling Salesman Problem
Keyword(4) meta-heuristic
1st Author's Name Sho SHIMOMURA
1st Author's Affiliation Department of Electrical and Electronic Engineering Tokushima University()
2nd Author's Name Haruna MATSUSHITA
2nd Author's Affiliation Department of Reliability-based Information Systems Engineering, Kagawa University
3rd Author's Name Yoshifumi NISHIO
3rd Author's Affiliation Department of Electrical and Electronic Engineering Tokushima University
Date 2011-05-27
Paper # NLP2011-23
Volume (vol) vol.111
Number (no) 62
Page pp.pp.-
#Pages 5
Date of Issue