### Abstract

In the solution of combinational optimization problems such as the traveling salesman problem, the already proposed method which automatically adjusts the weight coefficients using a two-layer random field model is considered. An elaboration is presented which applies the method to the search for the optimal solution by deterministic annealing. A SIMD-type parallel computer (CM-2) was used to handle the relatively large scale problem composed of 64 cities.

Original language | English |
---|---|

Pages (from-to) | 61-71 |

Number of pages | 11 |

Journal | Systems and Computers in Japan |

Volume | 25 |

Issue number | 8 |

Publication status | Published - 1994 Jul |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Hardware and Architecture
- Information Systems
- Theoretical Computer Science

### Cite this

**Solution for combinational optimization problems using a two-layer random field model - Mean-field approximation.** / Igarashi, Harukazu.

Research output: Contribution to journal › Article

*Systems and Computers in Japan*, vol. 25, no. 8, pp. 61-71.

}

TY - JOUR

T1 - Solution for combinational optimization problems using a two-layer random field model - Mean-field approximation

AU - Igarashi, Harukazu

PY - 1994/7

Y1 - 1994/7

N2 - In the solution of combinational optimization problems such as the traveling salesman problem, the already proposed method which automatically adjusts the weight coefficients using a two-layer random field model is considered. An elaboration is presented which applies the method to the search for the optimal solution by deterministic annealing. A SIMD-type parallel computer (CM-2) was used to handle the relatively large scale problem composed of 64 cities.

AB - In the solution of combinational optimization problems such as the traveling salesman problem, the already proposed method which automatically adjusts the weight coefficients using a two-layer random field model is considered. An elaboration is presented which applies the method to the search for the optimal solution by deterministic annealing. A SIMD-type parallel computer (CM-2) was used to handle the relatively large scale problem composed of 64 cities.

UR - http://www.scopus.com/inward/record.url?scp=0028479349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028479349&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0028479349

VL - 25

SP - 61

EP - 71

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 8

ER -