Abstract
Two parallel, problem-specific algorithms to compute a certain optimization problem, the two-dimensional Bin Packing Problem, are set against. A parallel branch-&-bound procedure which guarantees to find the optimal solution is compard to a heuristic genetic algorithm which successively improves a set of solutions. Both algorithms were implemented on a local memory multiprocessor system of 32 transputers. Empirical results indicate that — due to the problem's complexity — sophisticated heuristics are the only mean to get reasonable solutions for larger problem sizes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B.F. Baker, E.G. Coffman, R.L. Rivest, Orthogonal Packing in Two Dimensions, SIAM Journal on Computing, Vol. 9, No. 4, Nov. 1980, pp. 846–855.
P. De Cani, Packing Problems in Theory and Practice, Ph. D. Thesis, University of D. Thesis, University of Birmingham, Department of Engineering Production, March 1979.
E.G. Coffman, M.R. Garey, D.S. Johnson, R.E. Tarjan, Performance Bounds for Level-Oriented two-dimensional Packing Algorithms, SIAM Journal on Computing, Vol. 9, No. 4, Nov. 1980, pp. 808–826.
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.
E.W, Dijkstra, W.H.J. Feijen, A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computations, Inf. Proc. Letters 16 (1983), pp. 217–219.
M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, California.
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
J.J. Grefenstette, Incorporating Problem Specific Knowledge into Genetic Algorithms, in: J. Davis, Genetic Algorithms and Simulated Annealing, Morgan Kaufman Publ., Los Altos, 1987, pp. 42–60.
M. Grötschel, O. Holland, Solution of Large-Scale Symmetric Traveling Salesman Problems, OR Report, University of Bonn, 1988.
J.C. Herz, Recursive Computational Procedure for Two-dimensional Stock Cutting, in: IBM J. Res. Develop. 16 (1972) 5, pp. 462–469.
J.H. Holland, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
INMOS LTD, The Transputer Family-Product Information, March 1986.
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.
T.H. Lai, S. Sahni, Anomalies in Parallel Branch-and-Bound Algorithms, Communications of the ACM, Vol. 27, No. 6, June 1984, pp. 594–602.
E.L. Lawler, D.E. Wood, Branch-and-Bound Methods: A Survey, Operations Research 14 (1966), pp. 699–719.
G. Li, B.W. Wah, Computational Efficiency of Parallel Approximate Branch-and-Bound Algorithms, Proc. of the 1984 International Conference on Parallel Processing, pp. 473–480.
R. Lüling, B. Monien, Two Strategies for Solving the Vertex Cover Problem on a Transputer Network, Proceedings of the 3rd International Conference on Distributed Algorithms, Nice, Sep. 1989, pp. 160–170.
B. Monien, O. Vornberger, Parallel Processing of Combinatorial Search Trees, Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR), May 1987, Akademie-Verlag Berlin.
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.
O. Vornberger, Transputer Networks for Operations Research Problems, Journal of Microcomputer Applications, Special Issue on Transputer Applications, Vol. 13 (1990), pp. 69–79.
B.W. Wah, G. Li, Ch.F. Yu, Multiprocessing of Combinatorial Search Problems, Computer, June 1985, pp. 93–108.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kröger, B., Vornberger, O. (1992). Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem. In: Monien, B., Ottmann, T. (eds) Data structures and efficient algorithms. Lecture Notes in Computer Science, vol 594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_35
Download citation
DOI: https://doi.org/10.1007/3-540-55488-2_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55488-2
Online ISBN: 978-3-540-47103-5
eBook Packages: Springer Book Archive