ISSN:
1572-9338
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02022563
Permalink
