An adaptive control scheme of simulated annealing (SA) parameters derived from the polynomial-time cooling schedule is presented in terms of the efficiency enhancement of the SA algorithm. The parallel computing adaptive SA optimization scheme, which incorporates the optimization-layer-by-layer (OLL) neutronics evaluation model is then applied to determining the optimum fuel assembly (FA) loading pattern (LP) in the Korea Nuclear Unit 2 pressurized water reactor (PWR) using seven Pentium personal computers (three 266-MHz Pentium II and four 200-MHz Pentium Pro computers). It is shown that the parallel scheme enhances the efficiency of the SA optimization computation significantly but that it can get trapped in local optimum LPs more frequently than the single-processor SA scheme unless one takes preventive steps. As a way to prevent trapping of the parallel scheme in local optima, using multiple seed LPs is proposed instead of a single LP with which the individual processors start each stage, and how to determine the multiple seed LPs is discussed. Because of the high efficiency of the parallel scheme, the acceptability of a hybrid neutronics evaluation model, which is slower but more accurate than the OLL model, in the parallel optimization calculation is examined from the standpoint of computing time. more » By demonstrating that the FA LP optimization calculation for the equilibrium cycle core of the KNU-2 PWR can be completed in <1 h on seven Pentiums, we justify the routine utilization of the hybrid model in the parallel SA optimization scheme. « less
[1]
R. H. J. M. Otten,et al.
The Annealing Algorithm
,
1989
.
[2]
T. J. Downar,et al.
Optimization of pressurized water reactor shuffling by simulated annealing with heuristics
,
1995
.
[3]
Paul J. Turinsky,et al.
In-core nuclear fuel management optimization for pressurized water
,
1991
.
[4]
Alberto L. Sangiovanni-Vincentelli,et al.
A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells
,
1987,
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[5]
F. Darema,et al.
Parallel Algorithms for Chip Placement by Simulated Annealing
,
1987,
IBM J. Res. Dev..
[6]
Prithviraj Banerjee,et al.
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
,
1990,
IEEE Trans. Parallel Distributed Syst..
[7]
Geoffrey T. Parks,et al.
Chapter 9 Nuclear fuel management
,
1995
.
[8]
James R. A. Allwright,et al.
A distributed implementation of simulated annealing for the travelling salesman problem
,
1989,
Parallel Comput..
[9]
Reinhard Lüling,et al.
Problem Independent Distributed Simulated Annealing and its Applications
,
1993
.
[10]
Geoffrey T. Parks,et al.
The efficiency and fidelity of the in-core nuclear fuel management code FORMOSA-P
,
1994
.
[11]
Huang,et al.
AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING
,
1986
.