Paper Abstract and Keywords |
Presentation |
2011-11-11 10:25
An ant colony optimization algorithm based on a memory of plural acceptable solutions and exchange operators Hiroyasu Motomiya, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2011-113 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
In this study, we propose an Ant Colony Optimization (ACO) algorithm based on a memory of plural acceptable solutions and exchange operators. In the proposed method, the intensification of solution search is realized by memorizing acceptable solutions searched by the ACO and introducing exchange operators to them. Also, the diversification of solutions is realized by using plural acceptable solutions. The proposed method is applied to the Traveling Salesman Problem, and its effectiveness is verified by the numerical simulations. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Ant Colony Optimization / Traveling Salesman Problem / Particle Swarm Optimization / Hybrid Method / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 276, NLP2011-113, pp. 121-124, Nov. 2011. |
Paper # |
NLP2011-113 |
Date of Issue |
2011-11-02 (NLP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
NLP2011-113 |
Conference Information |
Committee |
NLP |
Conference Date |
2011-11-09 - 2011-11-11 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Miyako Island Marine Terminal |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
General |
Paper Information |
Registration To |
NLP |
Conference Code |
2011-11-NLP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An ant colony optimization algorithm based on a memory of plural acceptable solutions and exchange operators |
Sub Title (in English) |
|
Keyword(1) |
Ant Colony Optimization |
Keyword(2) |
Traveling Salesman Problem |
Keyword(3) |
Particle Swarm Optimization |
Keyword(4) |
Hybrid Method |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Hiroyasu Motomiya |
1st Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
2nd Author's Name |
Hidehiro Nakano |
2nd Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
3rd Author's Name |
Arata Miyauchi |
3rd Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2011-11-11 10:25:00 |
Presentation Time |
25 minutes |
Registration for |
NLP |
Paper # |
NLP2011-113 |
Volume (vol) |
vol.111 |
Number (no) |
no.276 |
Page |
pp.121-124 |
#Pages |
4 |
Date of Issue |
2011-11-02 (NLP) |
|