Parallel Simulated Annealing (PSA) is an effective method for some commbinatorial optimization problems. In this letter, We apply PSA to the graph partitioning problem and the maximum clique problem in a PC-cluster environment, and show the results of our simulations.
A member of IEEJ can access the transactions of the Technical Society to which the member belongs. Please enter the My Page login ID in the subscriber number column and the birth date (year/month/date with one-byte characters: for example, 19800303) in the password column.