Abstract
When publishing tabular data, the United States Bureau of the Census must sometimes round fractional data to integer values or round integer data to multiples of a prespecified base. Data integrity can be maintained by rounding tabular data subject to additivity constraints while minimizing the overall perturbation of the data. In this paper, we describe a heuristic based on tabu search with strategic oscillation for solving this NP-hard problem. A lower-bounding technique is developed in order to evaluate the quality of the solutions and provide a starting solution for the tabu search. Numerical results demonstrate the effectiveness of the procedure when applied to extremely large tables with up to 27,000 randomly generated entries. Additionally, the algorithm is shown to perform extremely well when applied to actual data obtained from the United States Bureau of the Census.
Similar content being viewed by others
References
Z. Baranyai, On the factorization of the complete uniform hypergraph,Infinite and Finite Sets, Vol. 1, ed. A. Hajnal, R. Rado and V. Sos (North-Holland, Amsterdam, 1975) pp. 91–98.
D.P. Bertsekas and P. Tseng, The relax codes for linear minimum cost network flow problems, Ann. Oper. Res. 13(1988)125–190.
L.H. Cox and L.R. Ernst, Controlled rounding, INFOR 20(1982)423–432.
L.H. Cox and J.A. George, Controlled rounding for tables with subtotals, Ann. Oper. Res. 20(1989)141–157.
I.P. Fellegi, On the question of statistical confidentiality, J. Amer. Statis. Assoc. 67(1972)7–18.
J.T. Fagan, B.V. Greenberg and R.J. Hemmig, Controlled rounding of three-dimensional tables, Bureau of the Census, Statistical Research Division Report Series, Census/SRD(RR-88/02 (1988).
F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156–166.
F. Glover, Tabu Search, Part I, ORSA J. Comput. 1(1989)190–206.
J.P. Kelly, Protecting confidentiality in two- and three-dimensional tables, Ph.D. Dissertation, Mathematics Department, University of Maryland, College Park, MD (1990).
J.P. Kelly, A.A. Assad and B.L. Golden, The controlled rounding problem: Relaxations and complexity issues, OR Spektrum 12(1990)129–138.
J.P. Kelly, B.L. Golden and A.A. Assad, Using simulated annealing to solve controlled rounding problems, ORSA J. Comput. 2(1990)174–185.
J.P. Kelly, B.L. Golden, A.A. Assad and E.K. Baker, Controlled rounding of tabular data, Oper. Res. 38(1990)760–772.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kelly, J.P., Golden, B.L. & Assad, A.A. Large-scale controlled rounding using tabu search with strategic oscillation. Ann Oper Res 41, 69–84 (1993). https://doi.org/10.1007/BF02022563
Issue Date:
DOI: https://doi.org/10.1007/BF02022563