Skip to main content
SpringerLink
Log in

Optimizing single-terminal dispatch of large volume trips to trucks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of delivering large volumes of products from a single supplier to a set of commercial outlets with the use of a non-homogeneous fleet of trucks. The non-homogeneity implies different costs and, hence, traditional methods which measure miles, hours, and/or number of trucks are not appropriate. The problem may be modeled as an elastic generalized assignment problem. A special purpose branch and bound algorithm is developed and a set of real-world distribution problems and solved.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.A. Assad, Modeling and implementation issues in vehicle routing, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad, Studies in Management Science and Systems, Vol. 16 (North-Holland, Amsterdam, 1988) pp. 7–45.

    Google Scholar 

  2. E. Balas and R. Jeroslow, Canonical cuts in the unit hypercube, SIAM J. Appl. Math. 23(1972)61–69.

    Google Scholar 

  3. P. Barcia and K. Jörnsten, Improved Lagrangian decomposition: An application to the generalized assignment problem, Eur. J. Oper. Res. 46(1990)84–92.

    Google Scholar 

  4. L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews, Comp. Oper. Res. 10(1983)63–211.

    Google Scholar 

  5. G.G. Brown and G.W. Graves, Real time dispatch of petroleum tank trucks, Manag. Sci. 27(1981)19–32.

    Google Scholar 

  6. M.L. Fisher, R. Jaikumar and L.N. Van Wassenhove, A multiplier adjustment method for the generalized assignment problem, Manag. Sci. 32(1986)1095–1103.

    Google Scholar 

  7. A.M. Geoffrion and R.E. Marsten, Integer programming algorithms: A framework and state-of-the-art survey, Manag. Sci. 18(1972)465–491.

    Google Scholar 

  8. K.L. Hoffman and M. Padberg, Improving LP-representations of zero-one linear programs for branch-and-cut, ORSA J. Comp. 3(1991)121–134.

    Google Scholar 

  9. K.O. Jörnsten and M. Näsberg, A new Lagrangian relaxation approach to the generalized assignment problem, Eur. J. Oper. Res. 27(1986)313–323.

    Google Scholar 

  10. R.M. Nauss, An efficient algorithm for the 0–1 knapsack problem, Manag. Sci. 23(1976)27–31.

    Google Scholar 

  11. D. Ronen, Allocation of trips to trucks operating from a single terminal, Comp. Oper. Res. 19(1992)129–138.

    Google Scholar 

  12. D. Ronen, Perspectives on practical aspects of truck routing and scheduling, Eur. J. Oper. Res. 35(1988)137–145.

    Google Scholar 

  13. G.T. Ross and R.M. Soland, A branch and bound algorithm for the generalized assignment problem, Math. Progr. 8(1975)91–103.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of Missouri-St. Louis, 8001 Natural Bridge Road, 63121, St. Louis, MO, USA

    Robert M. Nauss

Authors
  1. Robert M. Nauss
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nauss, R.M. Optimizing single-terminal dispatch of large volume trips to trucks. Ann Oper Res 50, 455–471 (1994). https://doi.org/10.1007/BF02085653

Download citation

  • Issue Date:

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

Keywords

Search

Navigation