Paper Abstract and Keywords |
Presentation |
2009-11-11 14:50
Solving Traveling Salesman Problem Using 2-opt and Or-opt Algorithms Driven by Chaotic Neurons Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-93 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
To find near optimum solutions of TSPs, a method with chaotic neurodynamics for solving TSPs has already been proposed. To avoid local minima, in the method, 2-opt algorithm and Or-opt algorithm for solving TSP are driven by chaotic neurodynamics. In the method, two local searches are driven by the same chaotic neuron. As a result, this method shows good performance, even though the 2-opt and the Or-opt algorithms are simple local search. In this report, to improve the performance of this method, we propose a new method. In the proposed method, the 2-opt and Or-opt algorithms are driven by different chaotic neurons. As a result, the proposed method shows higher performance than the previous chaotic search methods. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Traveling Salesman Problem / Chaotic Neural Network / 2-opt algorithm / Or-opt algorithm / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 109, no. 269, NLP2009-93, pp. 61-66, Nov. 2009. |
Paper # |
NLP2009-93 |
Date of Issue |
2009-11-04 (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 |
NLP2009-93 |
Conference Information |
Committee |
NLP |
Conference Date |
2009-11-11 - 2009-11-14 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
|
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
NLP |
Conference Code |
2009-11-NLP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Solving Traveling Salesman Problem Using 2-opt and Or-opt Algorithms Driven by Chaotic Neurons |
Sub Title (in English) |
|
Keyword(1) |
Traveling Salesman Problem |
Keyword(2) |
Chaotic Neural Network |
Keyword(3) |
2-opt algorithm |
Keyword(4) |
Or-opt algorithm |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Takafumi Matsuura |
1st Author's Affiliation |
Saitama University (Saitama Univ.) |
2nd Author's Name |
Tohru Ikeguchi |
2nd Author's Affiliation |
Saitama University (Saitama Univ.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
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 |
2009-11-11 14:50:00 |
Presentation Time |
20 minutes |
Registration for |
NLP |
Paper # |
NLP2009-93 |
Volume (vol) |
vol.109 |
Number (no) |
no.269 |
Page |
pp.61-66 |
#Pages |
6 |
Date of Issue |
2009-11-04 (NLP) |
|