A New Neural Network Algorithm with the Orthogonal Optimized Parameters to Solve the Optimal Problems
Summary :
In this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.9 pp.1520-1526
- Publication Date
- 1993/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Neural Networks
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
Dao Heng YU, Jiyou JIA, Shinsaku MORI, "A New Neural Network Algorithm with the Orthogonal Optimized Parameters to Solve the Optimal Problems" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 9, pp. 1520-1526, September 1993, doi: .
Abstract: In this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_9_1520/_p
Copy
@ARTICLE{e76-a_9_1520,
author={Dao Heng YU, Jiyou JIA, Shinsaku MORI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Neural Network Algorithm with the Orthogonal Optimized Parameters to Solve the Optimal Problems},
year={1993},
volume={E76-A},
number={9},
pages={1520-1526},
abstract={In this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A New Neural Network Algorithm with the Orthogonal Optimized Parameters to Solve the Optimal Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1520
EP - 1526
AU - Dao Heng YU
AU - Jiyou JIA
AU - Shinsaku MORI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1993
AB - In this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.
ER -
English
