Title :
Parallel algorithm of simulated annealing with modified generation mechanism
Author :
Ishibuchi, Hisao ; Misaki, Shinta ; Tanaka, Hideo
Author_Institution :
Dept. of Ind. Eng., Osaka Prefecture Univ., Japan
Abstract :
The authors propose a general parallel algorithm for simulated annealing with a modified generation mechanism The proposed algorithm has the following advantages: (i) it can be generally applied to various kinds of combinatorial optimization problems, (ii) it is easily implemented as a computer program, (iii) it is less sensitive to the value of the control parameter than the standard algorithm, and (iv) it can generate better solutions than the standard algorithm. The first and second advantages are clarified from the structure of the proposed algorithm. The third and the fourth advantages are shown from simulation results for a flow shop scheduling problem
Keywords :
combinatorial mathematics; parallel algorithms; simulated annealing; combinatorial optimization; flow shop scheduling; modified generation mechanism; parallel algorithm; simulated annealing; Cities and towns; Clustering algorithms; Computational modeling; Costs; Industrial engineering; Job shop scheduling; Mathematical model; Parallel algorithms; Scheduling algorithm; Simulated annealing;
Conference_Titel :
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN :
0-7803-0227-3
DOI :
10.1109/IJCNN.1991.170753
