玻尔兹曼网络的一种应用

An Application of Boltzmann Network

本文基于Boltzmann网络模型,探讨了解组合优化中两个NP难题的算法.第一个是解旅行商问题(TSP)算法,文中首先以Aarts等提出的算法为基础,对其"收敛过程"作了改进,因而与原算法相比,运算速度较快.第二个是任务安排算法,该算法具有优化程度高,计算速度快等特点.

This paper discusses two algorithms in combinatorial optimization problem based on Boltzmann machine. The first is the TSP (Travelling Salesman Problem) algorithm which is originally presented by Aarts but with different cooling schedule. It's faster than Aatrs'. The second is the task arrange problem algorithm. It is characterized by high optimization degree and computation speed.