Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons

Journal of the Brazilian Society of Mechanical Sciences and Engineering

Volumn 30, Issue 3, 2008, Pages 205-212

  De Martins, Thiago C ^a   Tsuzuki, Marcos S G ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Cutting and packing; Knapsack problem; Optimization

Indexed keywords

ANNEALING; INTEGER PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; OBJECT ORIENTED PROGRAMMING;

BINARY SEARCHES; CUTTING AND PACKING; EXTERNAL-; FREE REGIONS; HEURISTIC; KNAPSACK PROBLEM; LARGE OBJECTS; RANDOM PERMUTATIONS; SCALE FACTORS;

SIMULATED ANNEALING;

EID: 54549120315     PISSN: 16785878     EISSN: 18063691     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Art, R. C., 1966, "An approach to the two-dimensional irregular cutting stock problem", IBM Cambridge Scientific Centre, Report 36-Y08.
2. Bennell, J. A. and Dowsland, K. A., 2001, "Hybridizing tabu search with optimisation techniques for irregular stock cutting", Management Science, Vol. 47, pp. 1160-1172.
3. Burke, E. K., Hellier, R. S. R., Kendall, G., Whitwell, G., 2007, "Complete and robust no-fit polygon generation for the irregular stock cutting problem", European Journal of Operational Research, Vol. 179, pp. 27-49.
4. Dowsland, K. A., Vaid, S. and Dowsland, B. W., 2002, "An algorithm for polygon placement using a bottom-left strategy", European Journal of Operational Research, Vol. 141, pp. 371-381.
5. Dyckhoff, H., 1990, "A typology of cutting and packing problems", European Journal of Operational Research, Vol. 44, pp. 145-159.
6. Fowler, R. J., Paterson, M. and Tanimoto, S. L., 1981, "Optimal packing and covering in the plane are np-complete", Inf. Process. Lett., Vol. 12, pp. 133-137.
7. Gomes, A. M. and Oliveira, J. F., 2006, "Solving irregular strip packing problems by hybridising simulated annealing and linear programming", European Journal of Operational Research, Vol. 171, pp. 811-829.
8. Heckmann, R. and Lengauer, T., 1995, "A simulated annealing approach to the nesting problem in the textile manufacturing industry", Annals of Operations Research, Vol. 57, pp. 103-133.
9. Herz, A. and Widmer, M., 2003, "Guidelines for use of meta-heuristics in combinatorial optimization", European Journal of Operational Research, Vol. 151, pp. 247-252.
10. Hifi, M. and Hallah R. M., 2003, "Hybrid algorithm for the twodimensional layout problem: the cases of regular and irregular shapes", International Transaction in Operational Research, Vol. 10, pp. 195-216.
11. Jakobs, S., 1996, "On genetic algorithms for the packing of polygons", European Journal of Operational Research, Vol. 88, pp. 165-181.
12. Kirkpatrick, S., Gellat, C. D. and Vecchi, M. P., 1983, "Optimization by simulated annealing", Science, Vol. 220, pp. 671-680.
13. Latombe, J. C., 1991, "Robot Motion Planning", Kluwer Academic Publishers.
14. Leonov, M. V., 2004, Polyboolean library. http://www.complexa5.ru/ polyboolean/.
15. Matsumoto, M. and Nishimura, T., 1998, "Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator", ACM Trans. on Modeling and Computer Simulation, Vol. 8, pp. 3-30.
16. Wascher, G., Haussner, H. and Schumann, H., 2007, "An improved typology of cutting and packing problems", European Journal of Operational Research, Vol. 183, pp. 1109-1130.