Skip to main content

An improved disaggregation method for transportation problems

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. E. Balas, “Solution of large scale transportation problems through aggregation,”Operations Research 13 (1965) 82–93.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Geoffrian, “Customer aggregation in distribution modeling” Working paper no 259, Western Management Science Institute, University of California (Los Angeles, CA, 1976).

    Google Scholar 

  3. H. Kuhn and D. Cullen, Aggregation in network models for transportation planning—final report, Mathtech, Inc. (Princeton, NJ, 1977).

    Google Scholar 

  4. P. Zipkin, “Bounds for aggregating nodes in network problems”,Mathematical programming 19 (1980) 155–177.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592058

Key words