IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region

André Kubagawa Sato, Thiago de Castro Martins, Marcos de Sales Guerra Tsuzuki

2011

Abstract

The two-dimensional irregular open dimension packing problem is a combinatorial optimization problem that searches a layout for a given set of irregular items within a rectangular container so that no item overlaps with other items or protrudes from the container, where each irregular item is not necessarily convex. The container has a fixed width, while its length can change so that all items are placed in it. The objective is to find a layout of the set of polygons that minimizes the length of the container. The proposed algorithm constructively creates layouts from an ordered list of items and a placement heuristic. The placement determines the collision free region (represents the set of translations to create a feasible layout) for the item to be placed. It is shown that the collision free region must be calculated using non-regularized Boolean operations, as contours of no-fit polygons should be ignored. The proposed algorithm to solve the placement problem has two levels, in the internal level the container has fixed dimensions, and the external level reduces or increases the variable dimension. The placement heuristic searches for degenerated vertices and edges as they represent local maximum compaction. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results.

References

  1. Bennell, J. A. and Song, X. (2008). A comprehensive and robust procedure for obtaining the no-fit polygon using minkowski sums. Eur J Oper Res, 35:267-281.
  2. Bennell, J. A. and Song, X. (2008). A comprehensive and robust procedure for obtaining the no-fit polygon using minkowski sums. Eur J Oper Res, 35:267-281.
  3. Burke, E. K., Hellier, R. S. R., Kendall, G., and Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur J Oper Res, 179:27-49.
  4. Burke, E. K., Hellier, R. S. R., Kendall, G., and Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur J Oper Res, 179:27-49.
  5. Dowsland, K. A., Vaid, S., and Dowsland, B. W. (2002). An algorithm for polygon placement using a bottom-left strategy. Eur J Oper Res, 141:371-381.
  6. Dowsland, K. A., Vaid, S., and Dowsland, B. W. (2002). An algorithm for polygon placement using a bottom-left strategy. Eur J Oper Res, 141:371-381.
  7. Egeblad, J., Nielsen, B. K., and Odgaard, A. (2007). Fast neighborhood search for two- and three-dimensional nesting problems. Eur J Oper Res, 183:1249-1266.
  8. Egeblad, J., Nielsen, B. K., and Odgaard, A. (2007). Fast neighborhood search for two- and three-dimensional nesting problems. Eur J Oper Res, 183:1249-1266.
  9. Fowler, R. J., Paterson, M., and Tanimoto, S. L. (1981). Optimal packing and covering in the plane are npcomplete. Inform Process Lett, 12(3):133-137.
  10. Fowler, R. J., Paterson, M., and Tanimoto, S. L. (1981). Optimal packing and covering in the plane are npcomplete. Inform Process Lett, 12(3):133-137.
  11. Gomes, A. M. and Oliveira, J. F. (2006). Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res, 171:811-829.
  12. Gomes, A. M. and Oliveira, J. F. (2006). Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res, 171:811-829.
  13. Imamichi, T., Yagiura, M., and Nagamochi, H. (2009). An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim, 6:345-361.
  14. Imamichi, T., Yagiura, M., and Nagamochi, H. (2009). An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim, 6:345-361.
  15. Mahadevan, A. (1984). Optimization in computer-aided pattern packing (marking, envelopes). PhD thesis, North Carolina State University.
  16. Mahadevan, A. (1984). Optimization in computer-aided pattern packing (marking, envelopes). PhD thesis, North Carolina State University.
  17. Martins, T. C. and Tsuzuki, M. S. G. (2009). Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing. B Pol Acad Sci Techn Sci, 57:273-280.
  18. Martins, T. C. and Tsuzuki, M. S. G. (2009). Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing. B Pol Acad Sci Techn Sci, 57:273-280.
  19. Martins, T. C. and Tsuzuki, M. S. G. (2010). Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions. Expert Syst Appl, 37:1955-1972.
  20. Martins, T. C. and Tsuzuki, M. S. G. (2010). Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions. Expert Syst Appl, 37:1955-1972.
  21. Sato, A. K., Takimoto, R. Y., Martins, T. C., and Tsuzuki, M. S. G. (2010). Translational placement using simulated annealing and collision free region with parallel processing. Proc 9th IEEE/IAS INDUSCON.
  22. Sato, A. K., Takimoto, R. Y., Martins, T. C., and Tsuzuki, M. S. G. (2010). Translational placement using simulated annealing and collision free region with parallel processing. Proc 9th IEEE/IAS INDUSCON.
  23. Vatti, B. R. (1992). A generic solution to polygon clipping. CACM, 35:56-63.
  24. Vatti, B. R. (1992). A generic solution to polygon clipping. CACM, 35:56-63.
  25. Wäscher, G., Haussner, H., and Schumann, H. (2007). An improved typology of cutting and packing problems. Eur J Oper Res, 183:1109-1130.
  26. Wäscher, G., Haussner, H., and Schumann, H. (2007). An improved typology of cutting and packing problems. Eur J Oper Res, 183:1109-1130.
Download


Paper Citation


in Harvard Style

Kubagawa Sato A., de Castro Martins T. and de Sales Guerra Tsuzuki M. (2011). IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 79-84. DOI: 10.5220/0003521900790084


in Harvard Style

Kubagawa Sato A., de Castro Martins T. and de Sales Guerra Tsuzuki M. (2011). IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 79-84. DOI: 10.5220/0003521900790084


in Bibtex Style

@conference{icinco11,
author={André Kubagawa Sato and Thiago de Castro Martins and Marcos de Sales Guerra Tsuzuki},
title={IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={79-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003521900790084},
isbn={978-989-8425-74-4},
}


in Bibtex Style

@conference{icinco11,
author={André Kubagawa Sato and Thiago de Castro Martins and Marcos de Sales Guerra Tsuzuki},
title={IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={79-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003521900790084},
isbn={978-989-8425-74-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region
SN - 978-989-8425-74-4
AU - Kubagawa Sato A.
AU - de Castro Martins T.
AU - de Sales Guerra Tsuzuki M.
PY - 2011
SP - 79
EP - 84
DO - 10.5220/0003521900790084


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - IRREGULAR PLACEMENT PROBLEM - Solved with a 2-Level Algorithm and Collision Free Region
SN - 978-989-8425-74-4
AU - Kubagawa Sato A.
AU - de Castro Martins T.
AU - de Sales Guerra Tsuzuki M.
PY - 2011
SP - 79
EP - 84
DO - 10.5220/0003521900790084