Presentation | 2012-03-27 Designing method of Energy Functions for Solving Combinatorial Optimization Problems by the Network with Higher-order Connections Takahiro SOTA, Yoshihiro HAYAKAWA, Shigeo SATO, Koji NAKAJIMA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We have proposed the Inverse function Delayed network with Higher order synaptic Connections (HC-ID network) to solve various combinatorial optimization problems such as the Traveling Salesman Problems (TSP) and the Quadratic Assignment Problems (QAP), etc. By using this method, we can select the solutions that are shown by the network state at stable states according to the cost of the solutions. Thus it is considered the HC-ID network is powerful tool for solving combinatorial optimization problems. However, this method cannot be applied to other problems because the energy function that represents the applied problem has some restrictions about the structure or the order of the synaptic connections. In this report, we expand the energy function of higher-order form to apply the HC-ID network to solve any other problems. We also apply the network to solve a scheduling problem by using the improved energy function. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Higher-order Connection Inverse function Delayed network / Higher-order form energy function / Defense of thesis Scheduling Problem |
Paper # | NLP2011-148 |
Date of Issue |
Conference Information | |
Committee | NLP |
---|---|
Conference Date | 2012/3/20(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) | Designing method of Energy Functions for Solving Combinatorial Optimization Problems by the Network with Higher-order Connections |
Sub Title (in English) | |
Keyword(1) | Higher-order Connection Inverse function Delayed network |
Keyword(2) | Higher-order form energy function |
Keyword(3) | Defense of thesis Scheduling Problem |
1st Author's Name | Takahiro SOTA |
1st Author's Affiliation | Research Institute of Electrical Communication, Tohoku University() |
2nd Author's Name | Yoshihiro HAYAKAWA |
2nd Author's Affiliation | Department of Information Systems, Sendai National College of Technology |
3rd Author's Name | Shigeo SATO |
3rd Author's Affiliation | Research Institute of Electrical Communication, Tohoku University |
4th Author's Name | Koji NAKAJIMA |
4th Author's Affiliation | Research Institute of Electrical Communication, Tohoku University |
Date | 2012-03-27 |
Paper # | NLP2011-148 |
Volume (vol) | vol.111 |
Number (no) | 498 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |