Developing an aCe solution for two-dimensional strip packing

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 3585-3592

  Dorband, John E ^a   Mumford, Christine L ^b   Wang, Pearl Y ^c  

^a NASA GODDARD SPACE FLIGHT CENTER   (United States)

^b CARDIFF UNIVERSITY   (United Kingdom)

^c George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUCKNELL UNIVERSITY; GENETIC SIMULATED ANNEALING (GSA) ALGORITHM; GEORGE MASON UNIVERSITY; STRIP PACKING;

BENCHMARKING; CHROMOSOMES; COMPUTER PROGRAMMING LANGUAGES; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SIMULATED ANNEALING;

PARALLEL PROCESSING SYSTEMS;

EID: 12444253907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. TreadMarks: Shared Memory Computing on Networks of Workstations. IEEE Computer, 29(2):18-28, 1996.
2. B. S. Baker and J. S. Schwarz. Shelf algorithms for two-dimensional packing problems. SLAM Journal of Computing, 12(3):508-525, August 1983.
3. H. Chen, N. S. Flann, and D. W. Watson. Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm. IEEE Transactions on Parallel and Distributed Systems, 2(9): 126-136, 1998.
4. E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing - an updated survey. In G. Ausiello, N. Lucertini, and P. Serafini, editors, Algorithm Design for Computer Systems Design, pages 49-106. Springer-Verlag, Vienna, 1984.
5. J. E. Dorband. aCe C Language Reference. NASA Goddard Space Flight Center, Greenbelt MD.
6. J. E. Dorband. An Architecture-Adaptive Computing Environment, URL: newton.gsfc.nasa.gov/aCe. NASA Goddard Space Flight Center.
7. nd ASEE/IEEE of Frontiers in Education C onference. IEEE, 2002.
8. J. E. Dorband, M. F. Aburdene, and M. McCotter. aCe-ing Parallel Programming. August 2002.
9. EURO Special Interest Group on Cutting and Packing. URL: - www.apdio.pt/sicup/.
10. I. Golan. Performance bounds for orthogonal oriented two-dimensional packing algorithms. SIAM Journal of Computing, 10(3):571-581, August 1981.
11. E. Hopper and B. C. H. Turton. An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research, 128:34-57, 2001.
12. S. M. Hwang, C. Y. Kao, and J. T. Horng. On solving rectangle bin packing problems using genetic algorithms. In Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics, pages 1583-1590, 1994.
13. S. Koakutsu, M. Kang, and W. W.-M. Dai. Genetic Simulated Annealing and Application to Non-slicing Floor-plan Design. Technical report, University of California, Santa Cruz, Computer Engineering & Information Sciences, November 1995.
14. B. Kröger. Guillotineable bin packing: A genetic approach. European Journal of Operational Research, 84:645-661, 1995.
15. T. Leung, C. K. Chan, and M. D. Troutt. Application of a mixed simulated annealing-genetic algorithm heuristic for two-dimensional orthogonal packing problem. European Journal of Operational Research, 145:530-542, 2003.
16. D. Liu and H. Teng. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research, 112:413-420, 1999.
17. C. L. Mumford-Valenzuela, J. Vick, and P. Y. Wang. Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study. In M. G. Resende and J. P. de Sousa, editors, Metaheuristics: Computer Decision-Making, volume 86, pages 501-522. Kluwer Academic Publishers B.V., December 2003.
18. I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the travelling salesman problem. In Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 224-230, 1987.
19. D. D.K.D.B., Sleator. A 2.5 times optimal algorithm for packing in two dimensions. Information Procesing Letters, 10(1):37-40, February 1980.
20. Unified Parallel C. URL: upc.gwu.edu.
21. C. L. Valenzuela and P. Y. Wang. A Genetic Algorithm for VLSI Floorplanning. In Parallel Problem Solving from Nature - PPSN VI, Lecture Notes in Computer Science 1917, pages 671-680, 2000.
22. C. L. Valenzuela and P. Y. Wang. VLSI Placement and Area Optimization Using a Genetic Algorithm to Breed Normalized Postfix Expressions. IEEE Transactions on Evolutionary Computation, 6(4):390-401, 2002.