Details

Title

Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing

Journal title

Bulletin of the Polish Academy of Sciences: Technical Sciences

Yearbook

2009

Numer

No 3

Publication authors

Divisions of PAS

Nauki Techniczne

Publisher

Polish Academy of Sciences

Date

2009

Identifier

ISSN 0239-7528, eISSN 2300-1917

References

Kirkpatrick S. (1983), Optimization by simulated annealing, Science, 220, 671. ; Corana A. (1987), Minimizing multimodal functions of continuous variables with the simulated annealing algorithm, ACM Transactions on Mathematical Software, 13, 262. ; Miki M. (2002), Simulated annealing with advanced adaptive neighborhood, Proc. Computational Intelligence and Applications, 2, 113. ; Ingber L. (1989), Very fast simulated re-annealing, Mathematical and Computer Modelling, 12, 967. ; Ingber L. (1992), Genetic algorithms and very fast simulated reannealing: a comparison, Mathematical and Computer Modelling, 16, 87. ; Gomesand A. (2006), Solving irregular strip packing problems by hybridising simulated annealing and linear programming, Eur. J. Operational Research, 171, 811. ; Heckmann R. (1995), A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research, 57, 103. ; Martins T. (2007), Irregular rotational placement of shapes over non-convex containers with fixed dimensions, Proc. IFAC Workshop on Intelligent Manufacturing Systems, 8, 182. ; Dyckhoff H. (1990), A typology of cutting and packing problems, Eur. J. Operational Research, 44, 145. ; Wäscher G. (2007), An improved typology of cutting and packing problems, Eur. J. Operational Research, 183, 1109. ; Jakobs S. (1996), On genetic algorithms for the packing of polygons, Eur. J. Operational Research, 88, 165. ; Hifi M. (2003), Hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, Int. Transaction in Operational Research, 10, 195. ; R.C Art, <i>An Approach to the Two-Dimensional Irregular Cutting Stock Problem. Technical Report</i>, IBM Cambridge Scientific Centre, Cambridge, 1966. ; Burke E. (2007), Complete and robust no-fit polygon generation for the irregular stock cutting problem, Eur. J. Operational Research, 179, 27. ; Dowsland K. (2002), An algorithm for polygon placement using a bottom-left strategy, Eur. J. Operational Research, 141, 371. ; Bohachevsky I. (1986), Generalized simulated annealing for function optimization, Technometrics, 28, 209. ; Brooks D. (1988), Computational experience with generalized simulated annealing over continuous variables, American J. Mathematical and Management Sciences, 8, 425. ; Wang P. (1996), Continuous optimization by a variant of simulated annealing, Computational Optimization and Applications, 6, 59. ; Martins T. (2006), Simulated annealing applied to the rotational polygon packing, Proc. IFAC Symposium Information Control Problems in Manufacturing, 12, 475. ; Martins T. (2008), Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons, J. Brazilian Society of Mechanical Sciences and Engineering, 30, 196.

DOI

10.2478/v10175-010-0129-9

×