Parallel Computing Adaptive Simulated Annealing Scheme for Fuel Assembly Loading Pattern Optimization in PWRs

REFERENCES

• D. J. KROPACZEK and P. J. TURINSKY, “In-Core Nuclear Fuel Management Optimization for Pressurized Water Reactors Using Simulated Annealing,” Nucl. Technol., 95, 9 (1991).
   Web of Science ®Google Scholar
• J. G. STEVENS, K. S. SMITH, K. R. REMPE, and T. J. DOWNER, “Optimization of Pressurized Water Reactor Shuffling by Simulated Annealing with Heuristics,” Nucl. Sci. Eng., 121, 67 (1995).
   Web of Science ®Google Scholar
• G. T. PARKS, P. J. TURINSKY, and G. I. MALDONADO, Scientific Excellence in Supercomputing, The IBM 1990 Contest Prize Papers, Vol. I, Balwin Press, Athens, Georgia (1992).
   Google Scholar
• A. YAMAMOTO and H. HASHIMOTO, “Applications of Temperature Parallel Simulated Annealing to Loading Pattern Optimizations of Pressurized Water Reactors,” Proc. Int. Conf. Mathematics and Computations, Reactor Physics, and Environmental Analysis in Nuclear Applications, Madrid, Spain, Vol. 2, p. 1445 (1999).
   Google Scholar
• J. H. LEE, H. C. LEE, and C. H. KIM, “Parallel Computing Fuel Assembly Loading Pattern Optimization by Simulated Annealing Method,” Trans. Am. Nucl. Soc., 80, 228 (1999).
   Google Scholar
• J. H. LEE, H. J. SHIM, C. S. JANG, and C. H. KIM, “Incorporation of Neural Networks into Simulated Annealing Algorithm for Fuel Assembly Loading Pattern Optimization in a PWR,” Proc. Int. Conf. Physics of Nuclear Science and Technology, October 5–8, 1998, Long Island, New York, Vol. 1, p. 75, American Nuclear Society (1998).
   Google Scholar
• M. D. HUANG, F. ROMEO, and A. SANGIOVANNIVINCENTELLI, “An Efficient General Cooling Schedule for Simulated Annealing,” Proc. Int. Conf. Computer Aided Design, p. 381, Institute of Electrical and Electronics Engineers (1986).
   Google Scholar
• D. J. KROPACZEK, P. J. TURINSKY, G. T. PARKS, and G. I. MALDONADO, “The Efficiency and Fidelity of the In-Core Nuclear Fuel Management Code FORMOSA-P,” Reactor Physics and Reactor Computations, Israel Nuclear Society and European Nuclear Society, Tel-Aviv, Israel (1994).
   Google Scholar
• G. T. PARKS and D. J. KROPACZEK, “Nuclear Fuel Management,” Adaptation of Simulated Annealing to Chemical Optimization Problems, p. 205, J. KALIVAS, Ed., Elsevier Science, Amsterdam, The Netherlands (1995).
   Google Scholar
• C. S. JANG, H. J. SHIM, and C. H. KIM, “Optimization Layer by Layer Networks for In-Core Fuel Management Optimization Computations in PWR’s,” Ann. Nucl. Energy (to be published).
   Google Scholar
• E. AARTS and J. KORST, Simulated Annealing and Boltzmann Machines, John Wiley & Sons, New York (1989).
   Google Scholar
• R. OTTEN and L. VAN GINNEKEN, The Annealing Algorithm, Kluwer Academic Publishers, The Netherlands (1989).
   Google Scholar
• R. DIEKMANN, R. LÜLING, and J. SIMON, “Problem Independent Distributed Simulated Annealing and Its Application,” Technical Report PC2, TR-003-93 (1993).
   Google Scholar
• T. K. KIM and C. H. KIM, “Verification of the Pressurized Water Reactor Analysis Codes: CASMO/NEMSNAP,” Proc. Spring Mtg., Pohang, Korea, May 27–28, 1994, Korean Nuclear Society (1994).
   Google Scholar
• “Nuclear Design Report for YGN 3 Cycle1,” 9-4-21-0700-004, Korea Atomic Energy Research Institute (1994).
   Google Scholar
• P. S. PACHEO, Parallel Programming with MPI, Morgan Kautmann Publisher Inc., San Fransisco, California (1997).
   Google Scholar
• S. R. WHITE, “Concepts of Scaling in Simulated Annealing,” Proc. Int. Conf. Computer Aided Design, p. 646, Institute of Electrical and Electronics Engineers (1984).
   Google Scholar
• E. AARTS, F. DE BONT, E. HABERTS, and P. VAN LAARHOVEN, “Parallel Implementations of the Statistical Cooling Algorithm,” North-Holland INTEGRATION, VLSIJ., 4, 209 (1986).
   Google Scholar
• J. R. A. ALLWRIGHT and D. B. CARPENTER, “A Distributed Implementation of Simulated Annealing for the Travelling Salesman Problem,” Parallel Computing, 10, 335 (1989).
   Google Scholar
• F. BAIARDI and S. ORLANDO, “Strategies for a Massively Parallel Implementation of Simulated Annealing,” Proc. Parallel Architectures and Languages (PARLE ’89), p. 273 (1989).
   Google Scholar
• P. BANERJEE, M. JONES, and J. SARGENT, “Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, 1, 1, 91 (Jan. 1990).
   Google Scholar
• A. CASOTTO, F. ROMEO, and A. SANGIOVANNIVINCENTELLI, “A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells,” IEEE Trans. Computer Aided Design, CAD-6, 5, 838 (Sep. 1987).
   Web of Science ®Google Scholar
• F. DAREMA, S. KIRKPATRICK, and V. A. NORTON, “Parallel Algorithms for Chip Placement by Simulated Annealing,” IBM J. Res. Dev., 31, 391 (May 1987).
   Web of Science ®Google Scholar
• B. VIROT, “Parallelization of the Simulated Annealing Algorithm: Application to the Placement Problem,” University of Orleans, France (1990).
   Google Scholar