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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
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
M. Grötschel, O. Holland, Solution of Large-Scale Symmetric Traveling Salesman Problems, OR Report, University of Bonn, 1988
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
H. Mühlenbein, M. Gorges-Schleuter, O. Krämer, Evolution Algorithms in Combinatorial Optimization, Parallel Computing 7, 1988, pp. 65–85
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
Author information
Authors and Affiliations
Editor information
Rights 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