Solving nesting problems with non-convex polygons by constraint logic programming

International Transactions in Operational Research

Volumn 10, Issue 6, 2003, Pages 651-663

  Carravilla, M A ^a   Ribeiro, C ^a   Oliveira, J F ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Artificial intelligence; Constraint logic programming; Nesting; Packing

Indexed keywords

EID: 34447107040     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/1475-3995.00434     Document Type: Article

References (20)

1. Adamowicz, M., Albano, A., 1972. A two-stage solution of the cutting-stock problem. Information Processing, 71, 1086-1091.
2. Adamowicz, M., Albano, A., 1976. A solution of the rectangular cutting-stock problem. IEEE Transactions on Systems, Man and Cybernetics, 6, 4, 302-310.
3. Albano, A., Sapuppo, G., 1980. Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Transactions on Systems, Man and Cybernetics, SMC, 10, 5, 242-248.
4. Art, R.C., 1966. An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.008, IBM Cambridge Centre.
5. Błażewicz, J., Hawryluk, P., Walkowiak, R., 1993. Using tabu search approach for solving the two-dimensional irregular cutting problem in tabu search. In:Glover, F., Laguna, M., Taillard, E., De Werra, D.(eds.)Tabu Search. volume 41 of Annals of Operations ResearchJ. C. Baltzer, AG.
6. Carlsson, M., Ottosson, G., Carlson, B., 1997. An open ended finite domain constraint solver. In:Glaser, H., Hartel, P., Kucken, H.(eds.), Programming Languages: Implementations, Logics, and Programming, volume 1292 of Lecture Notes in Computer ScienceSpringer-Verlag, Southampton, pp.191-206.
7. Dowsland, K., Dowsland, W., 1992. Packing problems. European Journal of Operational Research, 56, 2-14.
8. Dowsland, K., Dowsland, W., 1995. Solution approaches to irregular nesting problems. European Journal of Operational Research, 84, 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, 647-658.
10. ILOG. 2001. ILOG Solver 5.1 User’s Manual.
11. Jaffar, J., Maher, M.J., 1994. Constraint logic programming: A survey. Journal of Logic Programming, 19/20, 503-581.
12. Mahadevan, A., 1984. Optimization in Computer-Aided Pattern Packing. PhD thesis, North Carolina State University.
13. Marriott, K., Stuckey, P.J., 1998. Programming with Constraints-an Introduction. MIT Press.
14. Milenkovic, V., Daniels, K., 1999. Translational polygon containment and minimal enclosure using mathematical programming. International Transactions in Operational Research.
15. Oliveira, J.F., Ferreira, J.S., 1993. Algorithms for nesting problems. InRené, V., Vidal, V.(Eds)Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems Springer-Verlag, pp.255-273.
16. Ribeiro, C., Carravilla, M.A., Oliveira, J.F., 1999a. Applying constraint logic programming to the resolution of nesting problems. Pesquisa Operacional, 19, 2, 239-247.
17. Ribeiro, C., Carravilla, M.A., Oliveira, J.F., 1999b. Applying constraint logic programming to the resolution of nesting problems. InWorkshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems.
18. Swedish Institute of Computer Science 1995. SICStus Prolog User’s Manual.
19. Stoyan, Y.G., Yaskov, G.N., 1998. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions on Operational Research, 5, 1, 45-57.
20. Tsang, E., 1995. Foundations of Constraint Satisfaction. Academic Press.