Skip to main content
SpringerLink
Log in

Parallel genetic packing of rectangles

  • Genetic Algorithms
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature (PPSN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 496))

Included in the following conference series:

Abstract

A parallel, problem-specific genetic algorithm to compute a certain optimization problem, the two-dimensional Bin Packing Problem, is presented. The algorithm includes a new graph-theoretical model to encode the problem and a problem specific mutation and crossover operator. Experimental results indicate that the algorithm is able to solve large Bin Packing Problems in reasonable time and that smaller instances are likely to be solved optimally.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Davis, Job Shop Scheduling with Genetic Algorithms, in: J.J. Grefenstette, Proc. of an Intern. Conf. on Genetic Algorithms and Their Application, Pittsburgh P.A., 1985, pp. 136–140

    Google Scholar 

  2. M. Grötschel, O. Holland, Solution of Large-Scale Symmetric Traveling Salesman Problems, OR Report, University of Bonn, 1988

    Google Scholar 

  3. B. Kröger, O. Vornberger, Solving a Cutting Stock Problem on a Transputer Network, Proceedings of the 2nd North American Transputer Users Group Meeting, Oct. 1989, Durham, USA, pp. 393–404

    Google Scholar 

  4. H. Mühlenbein, M. Gorges-Schleuter, O. Krämer, Evolution Algorithms in Combinatorial Optimization, Parallel Computing 7, 1988, pp. 65–85

    Article  Google Scholar 

  5. D. Smith, Binpacking with Adaptive Search, in: J.J. Grefenstette, Proc. of an Intern. Conf. on Genetic Algorithms and Their Application, Pittsburgh P.A., 1985, pp. 202–206

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Osnabrück, Albrechtstraße 28, 45 Osnabrück, West Germany

    Berthold Kröger, Peter Schwenderling & Oliver Vornberger

Authors
  1. Berthold Kröger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Schwenderling
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oliver Vornberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kröger, B., Schwenderling, P., Vornberger, O. (1991). Parallel genetic packing of rectangles. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029747

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54148-6

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation