IEICE TRANSACTIONS on Fundamentals
A Neural Network with a Function of lnhibiting Subtours on TSP
Summary :
The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.12 pp.2068-2071
- Publication Date
- 1993/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section of Letters Selected from the 1993 IEICE Fall Conference)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akira YAMAMOTO, Masaya OHTA, Hiroshi UEDA, Akio OGIHARA, Kunio FUKUNAGA, "A Neural Network with a Function of lnhibiting Subtours on TSP" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 12, pp. 2068-2071, December 1993, doi: .
Abstract: The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_12_2068/_p
Copy
@ARTICLE{e76-a_12_2068,
author={Akira YAMAMOTO, Masaya OHTA, Hiroshi UEDA, Akio OGIHARA, Kunio FUKUNAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Neural Network with a Function of lnhibiting Subtours on TSP},
year={1993},
volume={E76-A},
number={12},
pages={2068-2071},
abstract={The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Neural Network with a Function of lnhibiting Subtours on TSP
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2068
EP - 2071
AU - Akira YAMAMOTO
AU - Masaya OHTA
AU - Hiroshi UEDA
AU - Akio OGIHARA
AU - Kunio FUKUNAGA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1993
AB - The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.
ER -
English
