Abstract
A method is given to disaggregate the solution to an aggregated transportation problem. The resulting solution to the original problem is feasible, all-integer, and has lower cost that those of solutions produced by earlier methods.
References
E. Balas, “Solution of large scale transportation problems through aggregation,”Operations Research 13 (1965) 82–93.
A. Geoffrian, “Customer aggregation in distribution modeling” Working paper no 259, Western Management Science Institute, University of California (Los Angeles, CA, 1976).
H. Kuhn and D. Cullen, Aggregation in network models for transportation planning—final report, Mathtech, Inc. (Princeton, NJ, 1977).
P. Zipkin, “Bounds for aggregating nodes in network problems”,Mathematical programming 19 (1980) 155–177.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zipkin, P., Raimer, K. An improved disaggregation method for transportation problems. Mathematical Programming 26, 238–242 (1983). https://doi.org/10.1007/BF02592058
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02592058