Abstract: 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.