Abstract
Collections of cans containing nuclear fuel have to be grouped in batches that are as homogeneous as possible with respect to several criteria. This highly combinatorial problem, which can be described as grouping or clustering, is tackled using simulated annealing and tabu search. Both approaches are submitted to extensive experimentation on a real data set and several artificial ones. Two variants of the basic approaches called “Locally optimized simulated annealing” and “Tabu search with variable offset” are also tested. Sensitivity to parameter choice and to problem size are investigated. All four algorithms outperform a local search heuristic previously proposed in the literature; on the class of instances dealt with, a remarkably stable ranking of the four algorithms emerges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.H.L. Aarts and P.J.M. van Laarhoven,Simulated Annealing: Theory and Application (Kluwer, 1987).
V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient algorithm, J. Optim. Theory Appl. 45(1985)41–51.
U. Faigle and W. Kern, Some convergence results for probabilistic taby search, ORSA J. Comp. 4(1992)32–37.
F. Glover and H.J. Greenberg, New approaches for heuristic search: a bilateral linkage with artificial intelligence, Eur. J. Oper. Res. 39(1989)118–130.
F. Glover, Tabu search I, ORSA J. Comp. 1(1989)190–206.
F. Glover, Tabu search II, ORSA J. Comp. 2(1990)4–32.
F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74–94.
F. Glover, Candidate list strategies and tabu search, CAAI Research Report, University of Colorado, Boulder (July 1989).
F. Glover, Simple tabu thresholding in optimization, CAAI Research Report, University of Colorado, Boulder (May 1992).
B. Hajek, Cooling schedules for optimal annealing, Math. Oper. Res. 13(1988)311–329.
A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 29(1987)345–351.
D.S. Johnson, C.R. Aragon, L.A. Mc Gesch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; Part I, Graph partitioning, Oper. Res. 37(1989)865–892.
D.S. Johnson, C.R. Aragon, L.A. Mc Gesch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; Part II, Graph coloring and number partitioning, Oper. Res. 39(1991)378–406.
S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680.
B. Liégeois, M. Pirlot, J. Teghem, E. Trauwaert and D. Tuyttens, Balanced grouping through simulated annealing,Appl. Simul. Annealing, ed. R.V.V. Vidal, Lecture Notes in Economics and Mathematical Systems (Springer, 1992) pp. 275–290.
C. Minguet, Simulated annealing improving nuclear fuel manufacturing, JORBEL 32(1992)121–147.
J.M. Pedersen, Simulated annealing and finite-time thermodynamics, PhD Thesis, University of Copenhagen (1990).
M. Pirlot, General local search heuristics in combinatorial optimization: a tutorial, JORBEL 32(1992)7–69.
G. Ruppeiner, J.M. Pedersen and P. Salomon, Ensemble approach to simulated annealing, J. Physique 1(1991)455–470.
E. Trauwaert and A. Decrock, A heuristic algorithm for allocation of components in manufacturing processes, Eur. J. Oper. Res. 31(1987)232–239.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tuyttens, D., Pirlot, M., Teghem, J. et al. Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Ann Oper Res 50, 575–607 (1994). https://doi.org/10.1007/BF02085659
Issue Date:
DOI: https://doi.org/10.1007/BF02085659