Abstract
A comparative study of aggregation error bounds for the generalized transportation problem is presented. A priori and a posteriori error bounds were derived and a computational study was performed to (a) test the correlation between the a priori, the a posteriori, and the actual error and (b) quantify the difference of the error bounds from the actual error. Based on the results we conclude that calculating the a priori error bound can be considered as a useful strategy to select the appropriate aggregation level. The a posteriori error bound provides a good quantitative measure of the actual error.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms and Applications, Prentice Hall, NY.
Evans, J.R. (1979).“Aggregation in the Generalized Transportation Problem.” Computers & Operations Research, 6, 199–204.
Francis, R.L., T.J. Lowe, and A. Tamir. (2002). “Demand Point Aggregation for Location Models.” In Drezner Z. and Hamacher H.W (eds.), Facility Location: Applications and Theory, Springer, pp. 207–232.
Glover, F., D. Klingman, and N. Phillips. (1990). “Netform Modeling and Applications,” Interfaces, 20(4), 7–27.
Hallefjord, A., K.O. Jornsten, and P. Varbrand (1993) “Solving Large Scale Generalized Assignment Problems—An Aggregation/Disaggregation Approach.” European Journal of Operational Research, 64, 103–114.
Klingman, D., A. Napier, and J. Stutz. (1974). “NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Problems.” Management Science, 20, 814–821.
Leisten, R.A. (1997). “A Posteriori Error Bounds in Linear Programming Aggregation.” Computers & Operations Research, 24, 1–16.
Litvinchev, I. and S. Rangel. (2002). “Comparing Aggregated Generalized Transportation Models Using Error Bounds.” Technical Report TR2002-02-OC, UNESP, S.J. Rio Preto, Brazil. (Downloadable from website http://www.dcce.ibilce.unesp.br/~socorro/aggregation/gtp_2002/.)
Litvinchev, I. and S. Rangel. (1999). “Localization of the Optimal Solution and a Posteriori Bounds for Aggregation.” Computers & Operations Research, 26, 967–988.
Litvinchev, I. and V. Tsurkov. (2003). “Aggregation in Large Scale Optimization.” Applied Optimization, 83, Kluwer, NY.
Mendelsohn, R. (1980). “Improved Bounds for Aggregated Linear Programs.” Operations Research, 28, 1450–1453.
Montgomery, D.C. (2001). Design and Analysis of Experiments, 5th edition, John Wiley & Sons INC.
Norman, S.K., D.F. Rogers, and M.S. Levy. (1999). “Error Bound Comparisons for Aggregation/Disaggregation Techniques Applied to the Transportation Problem.” Computers & Operations Research, 26, 1003–1014.
Rogers, D.F., R.D. Plante, R.T. Wong, and J.R. Evans. (1991). “Aggregation and Disaggregation Techniques and Methodology in Optimization,” Operations Research, 39, 553–582.
Shetty, C.M. and R.W. Taylor. (1987). “Solving Large-Scale Linear Programs by Aggregation.” Computers & Operations Research, 14, 385–393.
Zipkin, P.H. (1980a). “Bounds for Aggregating Nodes in Network Problems.” Mathematical Programming, 19, 155–177.
Zipkin, P.H. (1980b). “Bounds on the Effect of Aggregating Variables in Linear Programs.” Operations Research, 28, 403–418.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Litvinchev, I.S., Rangel, S. Using error bounds to compare aggregated generalized transportation models. Ann Oper Res 146, 119–134 (2006). https://doi.org/10.1007/s10479-006-0051-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0051-6