메뉴 건너뛰기




Volumn 63, Issue 3, 2012, Pages 379-391

Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region

Author keywords

cutting stock problem; non linear programming; optimization

Indexed keywords

FUNCTIONS; INTEGER PROGRAMMING; OPTIMIZATION;

EID: 84856683985     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.41     Document Type: Article
Times cited : (27)

References (30)
  • 1
    • 34548476012 scopus 로고    scopus 로고
    • The geometry of nesting problems: A tutorial
    • DOI 10.1016/j.ejor.2006.11.038, PII S0377221706012379
    • Bennell J and Oliveira J (2008). The geometry of nesting problems: A tutorial. Eur J Opl Res 184: 397-415. (Pubitemid 47376901)
    • (2008) European Journal of Operational Research , vol.184 , Issue.2 , pp. 397-415
    • Bennell, J.A.1    Oliveira, J.F.2
  • 2
    • 77956056845 scopus 로고    scopus 로고
    • Tools of mathematical modelling of arbitrary object packing problems
    • Bennell J, Scheithauer G, Stoyan YG and Romanova T (2010).Tools of mathematical modelling of arbitrary object packing problems. Ann Opns Res 179: 343-368.
    • (2010) Ann Opns Res , vol.179 , pp. 343-368
    • Bennell, J.1    Scheithauer, G.2    Stoyan, Y.G.3    Romanova, T.4
  • 3
    • 0004231786 scopus 로고
    • Oliver and Boyd, Edinburgh: London
    • Berge C (1963). Topological Spaces. Oliver and Boyd, Edinburgh: London.
    • (1963) Topological Spaces
    • Berge, C.1
  • 5
    • 33645158314 scopus 로고    scopus 로고
    • Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
    • Birgin EG, Martínez JM, Nishihara FH and Ronconi DP (2006).Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Comput Opns Res 33: 3535-3548.
    • (2006) Comput Opns Res , vol.33 , pp. 3535-3548
    • Birgin, E.G.1    Martínez, J.M.2    Nishihara, F.H.3    Ronconi, D.P.4
  • 6
    • 84856636031 scopus 로고    scopus 로고
    • New cutting and packing methodologies and their commercial application
    • In: Bonn JN (ed), Printaholics GmbH: Wiehl
    • Burke E (2009). New cutting and packing methodologies and their commercial application. In: Bonn JN (ed). 23rd European Conference on Operational Research. Printaholics GmbH: Wiehl, pp 303-304.
    • (2009) 23rd European Conference on Operational Research , pp. 303-304
    • Burke, E.1
  • 7
    • 33744788405 scopus 로고    scopus 로고
    • A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem
    • DOI 10.1287/opre.1060.0293
    • Burke E, Hellier E, Kendall E and Whitwell G (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Opns Res 3: 587-601. (Pubitemid 43838368)
    • (2006) Operations Research , vol.54 , Issue.3 , pp. 587-601
    • Burke, E.1    Hellier, R.2    Kendall, G.3    Whitwell, G.4
  • 8
    • 84868117888 scopus 로고    scopus 로고
    • Mathematical model and efficient algorithms for object packing problem
    • Chernov N, Stoyan Y and Romanova T (2010). Mathematical model and efficient algorithms for object packing problem. Comp Geom-Theo Appl 43: 535-553.
    • (2010) Comp Geom-Theo Appl , vol.43 , pp. 535-553
    • Chernov, N.1    Stoyan, Y.2    Romanova, T.3
  • 9
    • 21244471837 scopus 로고    scopus 로고
    • Genetic algorithm coding methods for leather nesting
    • DOI 10.1007/s10489-005-2368-2
    • Crispin A, Clay P, Taylor G, Bayes T and Reedman D (2005). Genetic algorithm coding methods for leather nesting. Appl Intell 23: 9-20. (Pubitemid 40891520)
    • (2005) Applied Intelligence , vol.23 , Issue.1 , pp. 9-20
    • Crispin, A.1    Clay, P.2    Taylor, G.3    Bayes, T.4    Reedman, D.5
  • 11
    • 0025210672 scopus 로고
    • A typology of cutting and packing problems
    • Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opns Res 44: 145-159.
    • (1990) Eur J Opns Res , vol.44 , pp. 145-159
    • Dyckhoff, H.1
  • 13
    • 0036722357 scopus 로고    scopus 로고
    • A 2-exchange heuristic for nesting problems
    • Gomes AM and Oliveira JF (2002). A 2-exchange heuristic for nesting problems. Eur J Opl Res 359: 370.
    • (2002) Eur J Opl Res , vol.359 , pp. 370
    • Gomes, A.M.1    Oliveira, J.F.2
  • 14
    • 31144472348 scopus 로고    scopus 로고
    • Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
    • DOI 10.1016/j.ejor.2004.09.008, PII S0377221704005879, Feature Cluster: Heuristic and Stochastic Methods in Optimization
    • Gomes AM and Oliveira JF (2006). Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Opl Res 171: 811-829. (Pubitemid 43132948)
    • (2006) European Journal of Operational Research , vol.171 , Issue.3 , pp. 811-829
    • Gomes, A.M.1    Oliveira, J.F.2
  • 16
    • 79957976064 scopus 로고    scopus 로고
    • A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes
    • Hifi M and M'Hallah R (2003). A hybrid algorithm for the two dimensional layout problem: The cases of regular and irregular shapes. Int Trans Opl Res 10: 195-216. (Pubitemid 36765864)
    • (2003) International Transactions in Operational Research , vol.10 , Issue.3 , pp. 195-216
    • Hifi, M.1    M Hallah, R.2
  • 18
    • 0030571698 scopus 로고    scopus 로고
    • On genetic algorithms for the packing of polygons
    • DOI 10.1016/0377-2217(94)00166-9
    • Jakobs S (1996). On genetic algorithms for the packing of polygons. Eur J Opl Res 88: 165-181. (Pubitemid 126367100)
    • (1996) European Journal of Operational Research , vol.88 , Issue.1 , pp. 165-181
    • Jakobs, S.1
  • 19
    • 59549087550 scopus 로고    scopus 로고
    • Cutting circles and polygons from areaminimizing rectangles
    • Kallrath J (2009). Cutting circles and polygons from areaminimizing rectangles. J Global Optim 43: 299-328.
    • (2009) J Global Optim , vol.43 , pp. 299-328
    • Kallrath, J.1
  • 21
    • 0009408686 scopus 로고
    • Complexity of packing, covering, and partitioning problems
    • In: Schrijver A (ed), Mathematisch Centrum: Amsterdam
    • Lenstra JK and Rinnooy Kan AHG (1979). Complexity of packing, covering, and partitioning problems. In: Schrijver A (ed).Packing and Covering in Combinatorics. Mathematisch Centrum: Amsterdam, pp 275-291.
    • (1979) Packing and Covering in Combinatorics , pp. 275-291
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 22
    • 54549120315 scopus 로고    scopus 로고
    • Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons
    • Martins T and Tsuzuki MSG (2008). Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons. J Brazil Soc Mech Sci Eng 30: 205-212.
    • (2008) J Brazil Soc Mech Sci Eng , vol.30 , pp. 205-212
    • Martins, T.1    Tsuzuki, M.S.G.2
  • 23
    • 61849122332 scopus 로고    scopus 로고
    • On numerical issues of interior point methods
    • Meszaros C (2008). On numerical issues of interior point methods. Siam J on Matrix Anal Appl 30: 223-235.
    • (2008) Siam J on Matrix Anal Appl , vol.30 , pp. 223-235
    • Meszaros, C.1
  • 24
    • 0006479544 scopus 로고    scopus 로고
    • Rotational polygon overlap minimization and compaction
    • PII S0925772198000121
    • Milenkovic VJ (1998). Rotational polygon overlap minimization and compaction. Comp Geom-Theo Appl 10: 305-318. (Pubitemid 128401871)
    • (1998) Computational Geometry: Theory and Applications , vol.10 , Issue.4 , pp. 305-318
    • Milenkovic, V.J.1
  • 25
    • 0020942665 scopus 로고
    • Mathematical methods for geometric design
    • In: Ellis TMR, Semenkoc OJ (eds), Leningrad North-Holland: Amsterdam
    • Stoyan YG (1983).Mathematical methods for geometric design. In: Ellis TMR, Semenkoc OJ (eds). Advances in CAD/CAM. Proceedings of PROLAMAT, Leningrad. North-Holland: Amsterdam, pp 67-86.
    • (1983) Advances in CAD/CAM. Proceedings of PROLAMAT , pp. 67-86
    • Stoyan, Y.G.1
  • 26
    • 26444582063 scopus 로고    scopus 로고
    • Analytical description of interactions of point sets
    • Stoyan YG (2001). Analytical description of interactions of point sets. J Mech Eng 4(1-2): 77-88.
    • (2001) J Mech Eng , vol.4 , Issue.1-2 , pp. 77-88
    • Stoyan, Y.G.1
  • 29
    • 60649096867 scopus 로고    scopus 로고
    • Packing cylinders and rectangular parallelepipeds with distances between them into a given region
    • Stoyan Yu and Chugay A (2009). Packing cylinders and rectangular parallelepipeds with distances between them into a given region. Eur J Opl Res 197: 446-455.
    • (2009) Eur J Opl Res , vol.197 , pp. 446-455
    • Stoyan, Y.U.1    Chugay, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.