Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming (original) (raw)

Abstract

In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space while linear programming models are solved to generate neighbourhoods during the search process. These linear programming models, which are used to locally optimise the layouts, derive from the application of compaction and separation algorithms. Computational tests were run using instances that are commonly used as benchmarks in the literature. The best results published so far have been improved by this new hybrid packing algorithm.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (27)

  1. Art Jr., R.C., 1966. An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.Y08, IBM Cambridge Scientific Centre.
  2. Bennell, J.A., Dowsland, K.A., 1999. A tabu thresholding implementation for the irregular stock cutting problem. International Journal of Production Research 37 (18), 4259- 4275.
  3. Bennell, J.A., Dowsland, K.A., 2001. Hybridising tabu search with optimisation techniques for irregular stock cutting. Management Science 47 (8), 1160-1172.
  4. Bennell, J.A., Dowsland, K.A., Dowsland, W.B., 2001. The irregular cutting-stock problem-a new procedure for deriving the no-fit polygon. Computers and Operations Research 28 (3), 271-287.
  5. Bła_ zewicz, J., Moret-Salvador, A., Walkowiak, R., 2004. Parallel tabu search approaches for two-dimensional cut- ting. Parallel Processing Letters 14 (1), 23-32.
  6. Bła_ zewicz, J., Walkowiak, R., 1995. A local search approach for two-dimensional irregular cutting. OR Spektrum 17, 93-98.
  7. Daniels, K., Milenkovic, V., 1996. Column-based strip packing using ordered and compliant containment. In: Selected papers from the Workshop on Applied Computational Geometry, Towards Geometric Engineering, Lecture Notes in Computer Science. Springer-Verlag, Berlin, pp. 91-107.
  8. Dowsland, K.A., Dowsland, W.B., 1995. Solution approaches to irregular nesting problems. European Journal of Oper- ational Research 84 (3), 506-521.
  9. Dowsland, K.A., Dowsland, W.B., Bennell, J.A., 1998. Jostling for position: Local improvement for irregular cutting patterns. Journal of the Operational Research Society 49 (6), 647-658.
  10. Dyckhoff, H., Kruse, H.-J., Abel, D., Gal, T., 1988. Classifi- cation of real world trim loss problems. In: Fandel, G., Dyckhoff, H., Reese, J. (Eds.), Essays on Production Theory and Planning. Springer-Verlag, pp. 191-208, chapter 12.
  11. Fujita, K., Akagi, S., Kirokawa, N., 1993. Hybrid approach for optimal nesting using a genetic algorithm and a local minimi- zation algorithm. Proceedings of the 19th Annual ASME Design Automation Conference, Albuquerque, NM, 19-22 September 1993, vol. 1. ASME, New York, pp. 477-484.
  12. Gomes, A.M., Oliveira, J.F., 1999. Nesting irregular shapes with simulated annealing. In: Proceedings of 3rd Metaheu- ristics International Conference, Angra dos Reis, Rio de Janeiro, Brazil, 19-23 July, pp. 235-239.
  13. Gomes, A.M., Oliveira, J.F., 2001. A GRASP approach to nesting problems. In: Proceedings of 4th Metaheuristics International Conference, Porto, Portugal, July 16-20, pp. 47-52.
  14. Gomes, A.M., Oliveira, J.F., 2002. A 2-exchange heuristic for nesting problems. European Journal of Operational Research 141 (2), 359-370.
  15. Heckmann, R., Lengauer, T., 1995. A simulated annealing approach to the nesting problem in the textile manufactur- ing industry. In: Burkard, R.E., Hammer, P.L., Ibaraki, T., Queyranne, M. (Eds.), Annals of Operations Research, volume 57. J.C. Baltzer AG Science Publishers, pp. 103-133.
  16. Hifi, M., MÕHallah, R., 2003. A hybrid algorithm for the two- dimensional layout problem: The cases of regular and irregular shapes. International Transactions in Operational Research 10 (3), 195-216.
  17. Hopper, E., 2000. Two-dimensional packing utilising evolu- tionary algorithms and other meta-heuristic methods. Ph.D. Thesis, Cardiff University.
  18. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., 1983. Optimi- zation by simulated annealing. Science 220, 671-680.
  19. Li, Z., Milenkovic, V.J., 1993. The complexity of the compac- tion problem. In: Lubiw, L., Urrutia, J. (Eds.), Proceedings of the Fifth Canadian Conference on Computational Geometry, University of Waterloo, Ont., Canada, 5-9 August 1993, pp. 7-11.
  20. Li, Z., Milenkovic, V., 1995. Compaction and separation algorithms for non-convex polygons and their applications. European Journal of Operational Research 84 (3), 539-561.
  21. Mahadevan, A., 1984. Optimization in Computer-Aided Pat- tern Packing. Ph.D. Thesis, North Carolina State University.
  22. Metropolis, N., Rosenbluth, A., Rosenbluth, M.N., Teller, E., Teller, E., 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics 21, 1087- 1092.
  23. Milenkovic, V.J., Daniels, K., 1999. Translational polygon containment and minimal enclosure using mathematical programming. International Transactions in Operational Research 6 (5), 525-554.
  24. Oliveira, J.F., Gomes, A.M., Ferreira, J.S., 2000. TOPOS-A new constructive algorithm for nesting problems. OR Spektrum 22 (2), 263-284.
  25. Oliveira, J.F.C., Ferreira, J.A.S., 1993. Algorithms for nesting problems. In: Vidal, R.V.V. (Ed.), Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, vol. 396. Springer-Verlag, Berlin, pp. 255-273.
  26. Pirlot, M., 1996. General local search methods. European Journal of Opeartional Research 92 (3), 493-511.
  27. Stoyan, Y.G., Novozhilova, M.V., Kartashov, A.V., 1996. Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. European Journal of Operational Research 92 (1), 193-210.