562015-03-24 , 法政大学大学院理工学・工学研究科
The problem of combinatorial optimization is to find the optimal solution from all feasible solutions. A typical example is the travelling salesman problem that belongs to a class called NP-complete problems. For these problem，simulated annealing and simulated tempering are very effective and practical algorithms. In this study, the performance of simulated annealing was compared with that of simulated tempering through the optimization of the electronic component mounting order. The validity of simulated tempering was demonstrated via numerical experimentation.