Skip to main content
SpringerLink
Log in

Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad, whereas an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound if adapted accordingly to the case of the SSFCTP.

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

  • Alidaee, B., Kochenberger, G.A.: A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transp. Sci. 39, 140–143 (2005)

    Article  Google Scholar 

  • Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130–1154 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  • Chauhan, S.S., Proth, J.-M.: The concave cost supply problem. Eur. J. Oper. Res. 148, 374–383 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Chauhan, S.S., Eremeev, A.V., Romanova, A.A., Servakh, V.V.: Approximation of linear cost supply management problem with lower-bounded demands. In: Proceedings of Discrete Optimization Methods in Production and Logistics, Nasledie Dialog-Sibir Pbs., Omsk, pp. 16–21, 2004

  • Csirik, J., Frenk, J.B.G., Labbé, M., Zhang, S.: Heuristics for the 0-1 min-knapsack problem. Acta Cybern. 10, 15–20 (1991)

    MATH  Google Scholar 

  • Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Becvár, J. (ed.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 74, pp. 292–300. Springer, Berlin (1979)

    Google Scholar 

  • Güntzer, M.M., Jungnickel, D.: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem. Oper. Res. Lett. 26, 55–66 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Herer, Y.T., Rosenblatt, M.J., Hefter, I.: Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transp. Sci. 30, 276–290 (1996)

    Article  MATH  Google Scholar 

  • Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)

    MATH  Google Scholar 

  • Klose, A.: Algorithms for solving the single-sink fixed-charge transportation problem. Comput. Oper. Res. (2006), doi:10.1016/j.cor.2006.10.011

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics and Social Sciences, University of Wuppertal, Gaußstraße 20, 42197, Wuppertal, Germany

    Simon Görtz

  2. Department of Mathematical Sciences, University of Aarhus, Ny Munkegade, Building 1530, 8000, Aarhus C, Denmark

    Andreas Klose

Authors
  1. Simon Görtz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Klose
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Klose.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Görtz, S., Klose, A. Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. J Heuristics 15, 331–349 (2009). https://doi.org/10.1007/s10732-007-9065-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9065-8

Keywords

Search

Navigation