Two-dimensional packing for irregular shaped objects
暂无分享,去创建一个
Ping Chen | Andrew Lim | Brian Rodrigues | Zhaohui Fu | Ping-Ou Chen | Z. Fu | A. Lim | B. Rodrigues
[1] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[3] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[4] Jerry L. Sanders,et al. A nesting algorithm for irregular parts and factors affecting trim losses , 1987 .
[5] Jacek Blazewicz,et al. Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..
[6] Henk Sol,et al. Proceedings of the 54th Hawaii International Conference on System Sciences , 1997, HICSS 2015.
[7] Dov Dori,et al. Efficient nesting of congruent convex figures , 1984, CACM.
[8] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.
[9] Alain Hertz,et al. The tabu search metaheuristic: How we used it , 1990, Annals of Mathematics and Artificial Intelligence.
[10] H. Gea,et al. Two-dimensional packing problems using genetic algorithms , 2005, Engineering with Computers.
[11] Fred Glover,et al. Tabu Search: A Tutorial , 1990 .
[12] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[13] Antonio Albano,et al. Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.
[14] Antonio Albano,et al. NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES , 1976 .
[15] Y. Kajitani,et al. The multi-BSG: stochastic approach to an optimum packing of convex-rectilinear blocks , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).