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.
Similar content being viewed by others
References
Alsuwaiyel M.H.: Algorithms Design Techniques and Analysis. World Scientific Publishing, Singapore (1992)
Bellman B.: Notes on the theory of dynamic programming transportation models. Manag. Sci. 4, 191–195 (1958)
Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithm, vol. 2. McGraw-Hill, New York (2001)
Edmonds J.: Matroids and the greedy algorithm. Math. Prog. 1, 171–236 (1971)
Gendreau M., Laporte G., Seguin R.: Stochastic vehicle routing. Euro. J. Oper. Res. 88, 3–12 (1996)
Luenberger D.G.: Linear and Nonlinear Programming, vol. 2. Addison-Wesley, Reading (1984)
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)
Szwarc W., Posner M.E.: The tridiagonal transportation problem. Oper. Res. Lett. 3, 25–30 (1984)
Zheng Y., Wang J., Xue J.: Agent based framework for emergency rescue and assistance planning. Lect. Notes Comput. Sci. 4430, 70–81 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0126-9