• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

On Problem Solving Ability of Hopfield Neural Network Model for Combinatorial Problems

Research Project

Project/Area Number 03650276
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 電子通信系統工学
Research InstitutionThe University of Tokushima

Principal Investigator

SAKAMOTO Akio  The University of Tokushima,College of Industrial Technology,Professor, 工業短期大学部, 教授 (20108856)

Project Period (FY) 1991 – 1992
Project Status Completed (Fiscal Year 1992)
Budget Amount *help
¥1,200,000 (Direct Cost: ¥1,200,000)
Fiscal Year 1992: ¥400,000 (Direct Cost: ¥400,000)
Fiscal Year 1991: ¥800,000 (Direct Cost: ¥800,000)
KeywordsNeural Networks / Hopfield Model / Boltzmann Machine / Combinatorial Problem / Simulation / シミュレーション / ボルツマン マシン / ユュ-ラルネットワ-ク / シミュレ-ション
Research Abstract

Main goal of this project is to investigate the ability of Hopfield neural network model for a certain kind of combinatorial problems.Research results are as follows:
1.A set programming problem can be defined as a general form of problems that is treatable with Hopfield neural network model. The set programming problem is one of 0-1 programming problems with linear constraints and quadratic objective function to be minimized. We implement a general purpose simulator for set programming problems.
2.Some NP-complete problems,e.g.maximum independent set problem and knapsack problem, can be reformulated as set programming problems. Therefore we make translating programs for these problems,and investigate the ability of our simulator. Results are a little worse than existent heuristic methods for these problems. Those heuristics are produced with great effort of research on original problems,however,our approach needs only an effort to make translating programs from original problems to set programming problems. Thus our general purpose simulator is considered to be useful in practice.
3.Boltzmann machine is a neural network model with probabilistic behavior. By using Boltzmann machine,we implement a router of switchbox,whose routing problem is important in an automated design system of VLSI chips. Our router is useful in small size switchboxes.

Report

(3 results)
  • 1992 Annual Research Report   Final Research Report Summary
  • 1991 Annual Research Report
  • Research Products

    (3 results)

All Other

All Publications (3 results)

  • [Publications] 藤井 政美: "ボルツマンマシンを用いたスイッチボックス配線問題の一解法" 徳島大学工学部研究報告. 37. 89-93 (1992)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1992 Final Research Report Summary
  • [Publications] Masami FUJII: "An Approach to Switchbox Routing Using Boltzmann Machine" Scientific Papers of Faculty of Engineering,The University of Tokushima. No.37. 89-93 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [Publications] 藤井 政美: "ボルツマンマシンによるスイッチボックス配線問題の一解法" 徳島大学工学部研究報告. 37. 89-93 (1992)

    • Related Report
      1991 Annual Research Report

URL: 

Published: 1991-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi