Skip to main content
Log in

A simple greedy algorithm for a class of shuttle transportation problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Greedy algorithms for combinatorial optimization problems are typically direct and efficient, but hard to prove optimality. The paper presents a special class of transportation problems where a supplier sends goods to a set of customers, returning to the source after each delivery. We show that these problems with different objective functions share a common structural property, and therefore a simple but powerful generic greedy algorithm yields optimal solutions for all of them.

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

Access this article

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. Alsuwaiyel M.H.: Algorithms Design Techniques and Analysis. World Scientific Publishing, Singapore (1992)

    Google Scholar 

  2. Bellman B.: Notes on the theory of dynamic programming transportation models. Manag. Sci. 4, 191–195 (1958)

    Article  MATH  Google Scholar 

  3. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithm, vol. 2. McGraw-Hill, New York (2001)

    Google Scholar 

  4. Edmonds J.: Matroids and the greedy algorithm. Math. Prog. 1, 171–236 (1971)

    Article  MathSciNet  Google Scholar 

  5. Gendreau M., Laporte G., Seguin R.: Stochastic vehicle routing. Euro. J. Oper. Res. 88, 3–12 (1996)

    Article  MATH  Google Scholar 

  6. Luenberger D.G.: Linear and Nonlinear Programming, vol. 2. Addison-Wesley, Reading (1984)

    Google Scholar 

  7. Psaraftis H.N.: A dynamic programming solution the single vehicle many-to-many immediate request dial-a-ride problem. Trans. Sci. 14, 130–154 (1980)

    Article  Google Scholar 

  8. Szwarc W., Posner M.E.: The tridiagonal transportation problem. Oper. Res. Lett. 3, 25–30 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Zheng Y., Wang J., Xue J.: Agent based framework for emergency rescue and assistance planning. Lect. Notes Comput. Sci. 4430, 70–81 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yujun Zheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, Y., Xu, C. & Xue, J. A simple greedy algorithm for a class of shuttle transportation problems. Optim Lett 3, 491–497 (2009). https://doi.org/10.1007/s11590-009-0126-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0126-9

Keywords

Navigation