Skip to main content
SpringerLink
Log in

A heuristic partitioning algorithm for a packaging problem

Heuristischer dekompositorischer Algorithmus für die Lösung des Problems der Verpackung

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A heuristic algorithm for solving a problem of a minimum-cost packaging ofN items of the magnitudea j intoM boxes of the capacityb i with a costc ij being assigned to the itemj packing into the boxi is presented. The principal idea of the algorithm consists in the preliminary partitioning of the problem into smaller subproblems and getting an approximate solution by solving these subproblems. A motivation of the heuristic and an application of the algorithm are given.

Zusammenfassung

Das im Artikel behandelte Problem der Verpackung besteht darin, daß mit minimalen Kostenn Gegenstände mit gegebenen Maßen inm Kisten mit gegebenen Fassungsvermögen verpackt werden, wobei die Kostenc ij für einen Gegenstandjin die Kistei betragen. Es wird ein neuer heuristischer Algorithmus für die annähernde Lösung dieser Aufgabe gegeben. Das Wesen des Algorithmus besteht in der vorhergehenden Gliederung des Problems in kleinere Subprobleme und der Lösung jedes Subproblems. Der heuristische Prozeß und die Anwendung des Algorithmus werden erläutert.

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. De Maio, A., Roveda, C.: An all zero-one algorithm for a certain class of transportation problems. Oper. Res.19, 1406–1418 (1971).

    Google Scholar 

  2. Hu, T. C.: Integer Programming and Network Flows. London: Addison-Wesley 1970.

    Google Scholar 

  3. Intrator, J., Berrebi, M.: Auxiliary Procedures for Solving Long Transportation Problems. NRLQ27, 447–452 (1980).

    Google Scholar 

  4. Korchemkin, M.: The piecewise solution of a certain class of transportation problems. Eesti NSV TA Toimetised. Füüsika & Matem.28, 317–324 (1979).

    Google Scholar 

  5. Kron, G.: Diakoptics. London: MacDonald 1963.

    Google Scholar 

  6. Nagelhout, R. V., Tompson, G. L.: A single source transportation algorithm. Comput. & Oper. Res.7, 185–198 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Economics of the, Academy of Sciences of the Estonian S.S.R., 7 Estonia av, 200101, Tallinn, U.S.S.R.

    M. B. Korchemkin

Authors
  1. M. B. Korchemkin
    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

Korchemkin, M.B. A heuristic partitioning algorithm for a packaging problem. Computing 31, 203–209 (1983). https://doi.org/10.1007/BF02263431

Download citation

  • Received:

  • Issue Date:

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

AMS Subject Classifications

Key words

Search

Navigation