Translational Placement using Simulated Annealing and Collision Free Region with Parallel Processing
|
|
- Iris Wade
- 6 years ago
- Views:
Transcription
1 Translational Placement using Simulated Annealing and Collision Free Region with Parallel Processing André Kubagawa Sato, Rogério Yugo Takimoto, Thiago de Castro Martins, Marcos de Sales Guerra Tsuzuki Computational Geometry Laboratory Departamento de Engenharia Mecatrônica e de Sistemas Mecânicos Escola Politécnica da Universidade de São Paulo andre.kubagawa@gmail.com takimotoyugo@gmail.com tcmartins@gmail.com mtsuzuki@usp.br Abstract The irregular shape packing problem is a combinatorial optimization problem that consists of arranging items on a container in such way that no item overlaps. In this paper we adopt a solution that places the items sequentially, touching the already placed items or the container. To place a new item without overlaps, the collision free region for the new item is robustly computed using non manifold Boolean operations. A simulated annealing algorithm controls the items sequence of placement, the item s placement and orientation. In this work, the placement occurs at collision free region s vertices. Several results with benchmark datasets obtained from the literature are reported. Some of them are the best already reported in the literature. To improve the computational cost performance of the algorithm, a parallelization method to determine the collision free region is proposed. We demonstrated two possible algorithms to compute the collision free region, and only one of them can be parallelized. The results showed that the parallelized version is better than the sequential approach only for datasets with very large number of items. The computational cost of the non manifold Boolean operation algorithm is strongly dependent on the number of vertices of the original polygons. I. INTRODUCTION The irregular shape packing problem is a part of a wider set of combinatorial optimization problems, the cutting and packing problems. The field of cutting and packing is important in several industries such as clothing, wood and sheet metal among others. Wäscher et al. [1] have proposed a typology that classifies the problem types by dimension, objective, assortment of item type, as well as the number and nature of the containers. In this paper, we consider the two-dimensional problem with the objective of packing all items inside a container. The items and the container can be any simple polygon, and they are not necessarily convex. There are several proposals in the literature to solve this type of problem. However, one can identify two main approaches for the irregular shape packing problem. The first consists in representing the solution as an ordered list of items and the configuration is constructed by applying a placement rule. This way, a feasible layout is guaranteed, i.e. layouts where items do not overlap and fit inside the container. The second approach represents the solution as a physical layout on the container and moves the items within the layout [2], [3]. The collision free region is a construction very useful for defining collision free positions. Several works used the collision free region to ensure feasible layouts [4], [5], [6], [7], [8], [9], [10]. The second strategy generates an initial configuration on the container either through a simple constructive heuristic or randomly. This strategy may permit overlap between items and imposes a penalty in the objective function, also called as external penalization [11]. Martins and Tsuzuki [9] showed that the use of external penalization can result in an optimal solution whose layout has overlaps. The irregular shape packing problem is NP-Hard, even in its restricted variations (e.g. limiting the polygon shape to rectangle only). Most published solutions make use of probabilistic heuristic methodologies to solve the combinatorial problem. Other researchers combine these heuristics with deterministic ones to constrain the feasible region to a subset of the entire solution space [2], [12]. The metaheuristic simulated annealing was almost simultaneously introduced by [13] for statistic mechanics and by [14] in the area of combinatorial optimization, i.e. when the cost function is defined in a discrete domain. [15] modified the simulated annealing algorithm to apply to the optimization of functions defined in a continuous domain, using distinct steps according to temperature intervals. This work uses a simulated annealing algorithm with adaptive neighborhood proposed by [5], [8]. The adaptive neighborhood heuristic defines the densities of the distribution of the next candidate and it can be simultaneously used in discrete and continuous domains. In this work, the collision free region is determined by a robust implementation of two dimensional non manifold Boolean operations. The items are placed sequentially, one at a time on the vertices of the collision free region. Simulated annealing controls the order of the items and the placement position. Some of the controls can be turned off and the simulated annealing is combined with deterministic heuristics: larger first and bottom left. To improve the performance of the algorithm, the determination of the collision free region is parallelized using a multi-core processor. Several tests were executed to show the impact in the performance of the algorithm.
2 Fig. 1. Set of translations of a shape represented as a region containing all possible translations from its reference point. Fig. 2. The inner fit polygon for given item and container. II. NO-FIT POLYGONS AND COLLISION-FREE REGION No-fit polygons represent set of translations of an item and are mathematically represented by a set of vectors. For a better understanding of the properties of the no-fit polygons, the set of translations of an item is represented by polygons in the plane. Every item has a reference point that can be internal or external to it. The no-fit polygon represents a set of forbidden translations that when applied to the item, will move the reference point to be internal to the no-fit polygon, as shown in Fig. 1. For an item P, let i(p ) be its interior, P be its boundary and c(p ) be its complement. Definition 2.1: The no-fit polygon induced by item P i to item P j, denoted by Υ(P i, P j ), is the set of translation vectors applied to P j that leads it to a collision with P i. Thus, Υ(P i, P j ) = i(p i ) i(p j ) (1) = { v a i(p j ), a + v i(p i )} The no-fit polygon can be obtained by the Minkowski sum algorithm [16], that can be calculated very efficiently for convex polygons. The result of a Minkowski sum of two convex polygons is a convex polygon built from the original polygon edges ordered counterclockwise. Non convex polygons can be decomposed into convex polygons on a preprocessing step, as the transformations applied (rotations and translations) do not affect such a decomposition. Definition 2.2: The Minkowski sum of two polygons P i and P j, noted P i P j, is defined as the set of points {O + v + w O + v P i, O + w P j }. Definition 2.3: The opposed polygon for a given polygon P j, denoted by P j, is defined as the set of points P j = {O w O + w P j }. From the above definitions, one can see that i(p i ) i(p j ) = i(p i ) ( i(p j )) (2) meaning that the no-fit polygon is produced by the Minkowski sum of the fixed item with the opposed item to be placed. A. The Inner Fit Polygon The inner fit polygon is another important concept frequently used, which is derived from the no-fit polygon and represents a set of translations for the placement of items Fig. 3. The collision free region is filled with a hatch pattern. The item to be placed is not filled and the already placed items are filled with a solid pattern. inside a container C. The inner fit polygon can be computed by sliding an item along the internal contour of the container [17] (see Fig. 2). Definition 2.4: The inner fit polygon induced by container C to item P j, denoted by Λ(C, P j ), is the set of translation vectors applied to P j that leads it to be inside the container. Thus, Λ(C, P i ) = c(c(c) ( i(p i ))) (3) B. The Collision Free Region = { v a i(p i ), a + v C} Considering a container C and a set of items P = {P 1,, P n } already placed, as shown in Fig. 3, a new item P m, m > n, will be placed in the interior of the container without collision with the already placed items. The feasible set of translations for item P m is given by the collision free region (see Fig. 3). Definition 2.5: The collision free region is the set of all translations, that, when applied to a specific item, place the specific item in the interior of a container without colliding with the already placed items. When the container is empty, the collision free region represents all translations that place the item in the interior of the container. This specific collision free region is the already defined inner fit polygon [17]. For a given item, the calculation of the inner fit polygon is the first step in the determination of the collision free region. The collision free region for a specific item is determined by removing the no-fit polygons generated by the already placed
3 (a) (b) (c) Fig. 4. (a) No-fit polygon generated from a movable item and two already placed items. The item can be placed in the common boundary edge, as it is not a forbidden placement considering both no-fit polygons. (b) Result of a manifold union operation applied to the no-fit polygons. (c) Correct result obtained by the non manifold union opereation. The item can be placed on the internal edge. (a) items, from the inner fit polygon. Π(C, P, P m ) = Λ(C, P m ) P i P i(p i ) i(p m ) (4) By analyzing expression (4), it is possible to define at least two possible algorithms to compute de collision free region. The first algorithm, removes every no-fit polygon from the inner fit polygon and uses uniquely the difference operator (called as sub-approach). The second algorithm calculates the unions of all no-fit polygons and then subtracts it from the inner fit polygon (called as mixed-approach). The implementation of the necessary Boolean operations is not an easy task. C. Modified Boolean Operations General manifold Boolean operations between polygons [18], [19] should not be applied to determine the collision free region. If manifold Boolean operation are adopted then feasible positions may be lost for the placement of items. Fig. 4 shows a situation where the results of the manifold and of the non-manifold union operations are different. The correct result for the determination of the collision free region is obtained by non-manifold Boolean operations. The interior of a no-fit polygon (excluding the boundary) represents placements where the item collides. The boundary and exterior of a no-fit polygon represent feasible placements for the item. When an union is applied to no-fit polygons, the result must consider uniquely the union of the interior of both no-fit polygons (see Fig. 4). The inner fit polygon is a normal manifold polygon as its interior and boundary are feasible placements. When a difference operation is applied to no-fit polygon and inner fit polygon, the operation must consider uniquely the interior of the no-fit polygon. As a consequence, a collision free region can result in a set of multiple disconnected polygons with holes, disconnected edges or vertices. In this work, robust two dimensional non-manifold Boolean operations were implemented. The implementation was done using fixed precision. The intersection determination procedure is the main module [20]. After that the intersections are determined, the edges are classified and the appropriated edges are collected to define the final result. (b) Fig. 5. (a) This placement problem has three items on the left and a rectangular container on the right. (b) Considering that the first item to be placed is the item on the middle, its collision free region is a segment shown with a thick line and it must be placed in a internal point of this segment. The second and third items are placed on their collision free region s vertices. It does not matter which item is placed first, the first item cannot be placed on its collision free region s vertices. III. THE PROPOSED APPROACH Simulated annealing is the probabilistic meta heuristic adopted in this work. The cost function to be minimized is the space wasted inside the container. The container considered here has fixed dimensions, and consequently its cost function assumes only discrete values [9]. The placement of an item is controlled by a discrete parameter r, that is a vertex of the collision free region for that item. Previous works have considered the placement as a continuous parameter [4], [5], [7], [8], [9]. r can assume only some discrete values associated with the vertices of the collision free region. In this work, the new item is always placed on the collision free region s vertices. Fig. 5 shows a specific situation that is very rare in practice, where the first item must not be placed in a collision free region s vertex. The simulated annealing also controls the order of the items in the sequence of placement and the item s orientation. A. Parallelization of the Collision Free Region Determination In this work, two methods to determine the collision free region were adopted. Both methods were proposed based on the analysis of equation (4). The first method subtracts each no-fit polygon from the inner fit polygon. This leads to a series of subtractions, as seen in Fig. 6. The second method is divided into two distinct steps. The first step determines the union of all no-fit polygons and the second step subtracts this result from the inner fit polygon. The first method (sub approach) cannot be parallelized. The first step of the second method was parallelized. The unions are processed in parallel, using a multi-core processor. To achieve this, the no-fit polygons are placed in a queue. Each processor pops two no-fit polygons from the queue and computes the result. The result is pushed into the queue. This
4 Fig. 6. Determining the collision free region using uniquely subtractions. N: no-fit polygon; I: inner fit polygon; C: collision free region. All operations are executed sequentially by one unique processor. TABLE I BENCHMARK DATA SETS. TNP: TOTAL NUMBER OF POLYGONS; ANV: THE AVERAGE NUMBER OF VERTICES; AO: ADMISSIBLE ORIENTATIONS (DEGREES); ML: MINIMUM LENGTH. THE DATA SETS WITH ARE THE BEST RESULTS IN THE LITERATURE case TNP ANV AO ML Density albano , dagli , dighe dighe fu , 90, 180, jakobs , 90, 180, jakobs , 90, 180, mao , 90, 180, marques , 90, 180, shapes , shapes , shapes , shirts , trousers , TABLE II SERIAL GENERATION OF ALL COLLISION FREE REGION IN BENCHMARK DATA SETS WITH 1000 RUNS. NNFP: NUMBER OF NO-FIT POLIGONS; SUB: PROCESSING TIME (SEC) USING SUBTRACTION ONLY; US: PROCESSING TIME (SEC) USING UNION AND SUBTRACTION. Fig. 7. Determining the collision free region using unions and subtractions. N: no-fit polygon; I: inner fit polygon; C: collision free region. This approach was implemented in two different ways: sequential and parallel. Considering the situation where two processors are used, the first processor executes N 1 N 2 and the second processor executes N 3 N 4. The operations R 1 R 2 and I R are executed sequentially. process is repeated n 1 times (see Fig. 7), where n is the total number of no-fit polygons. Finally, the subtraction of this result from the inner fit polygon occurs in order to obtain the resulting collision free region. IV. RESULTS In this work, we evaluated the algorithm using 14 benchmark problems gathered from the literature. These data sets can be found on the EURO Special Interest Group on Cutting and Packing (ESICUP) website 1. These sets are irregular strip packing problems with the objective of minimizing the length of the container with a fixed width. To allow the possibility of a comparison, the container dimensions (width and length) were considered fixed. The objective was to find the minimum length for the container such that all items fit inside the container and they do not overlap. All tests were executed on i7 2.8GHz processor with 4 GB RAM. 1 esicup/tiki-index.php. case NNFP SUB US albano dagli dighe dighe fu jakobs jakobs mao marques shapes shapes shapes shirts trousers Table I shows the minimum length obtained for the studied problems and the density of the layouts. Figs. 8(a)-(h) and Figs. 9.(a)-(f) shows the optimized layouts. Other tests were executed to evaluate the computational speed of the proposed approach. We tested both approaches proposed to determine the collision free region with one unique processor. Each test was repeated 1000 times and the results are shown on Table II. One can observe that the sub approached computed the collision free region faster, excepting the trousers and shirts benchmark. The trousers (shirts) benchmark was executed by the mixed approach 1.71 (1.94) times faster than the sub approach. The OpenMP was used to develop the parallel algorithms. The results are shown in Table III. Up to four processors were used. It can be observed that the Dighe1, Dighe2, Fu, Jakobs1, Mao, Marques and Shapes2 benchmarks were executed slower by the parallel algorithm when compared to the best sequential algorithm. Fig. 10 shows graphs comparing the time processing of some benchmark datasets for sequential and parallelized versions of the collision free region computation algorithms. It
5 (a) (a) (b) (b) (c) (c) (d) (d) (e) (f) (e) (g) (h) Fig. 8. The best solutions obtained by the proposed algorithm. (a) albano. (b) shapes0. (c) dagli. (d) fu. (e) dighe1. (f) dighe2. (g) mao. (h) marques. (f) Fig. 9. The best solutions obtained by the proposed algorithm. (a) shapes1. (b) shapes2. (c) shirts. (d) trousers. (e) jakobs1. (f) jakobs2.
6 TABLE III PARALLEL GENERATION OF ALL COLLISION FREE REGION POLYGONS IN BENCHMARK DATA SETS 1000 TIMES. TIME IN SECONDS. case number of processors albano dagli dighe dighe fu jakobs jakobs mao marques shapes shapes shapes shirts trousers Fig. 10. Graphs comparing some time processing of benchmark datasets for the sequential (blue lines) and parallelized algorithms (yellow lines). The datasets that showed improvement in the parallelized version of algorithms are shirts and trousers solely. is convenient to observe that the parallelized algorithm is based on unions and differences and the sequential algorithm was based uniquely on differences. Considering both approaches with single processing, the approach based uniquely on differences was faster. The conclusion is that even the parallelization was not enough to get smaller time processing in all situations. This is because the complexity computation of the non manifold Boolean operation is strongly based on the number of vertices of the original polygons. The early use of the inner fit polygon, which has a rectangular shape, by the approach based exclusively on differences showed to have a smaller number of vertices. V. CONCLUSION This work deals with the problem of minimizing the waste of space that occurs on translational placements of a set of irregular bi dimensional items inside a bi dimensional container with fixed dimensions. The collision free region concept was proposed and implemented using robust two dimensional non manifold Boolean operations. The results obtained in this work were very competitive when compared with previous works. A parallelization method to determine the collision free region was proposed. The speed of this algorithm was compared against the serial algorithm. Only problems with very large number of pieces showed gain in speed. Other problems showed that the overhead of the parallelization caused it to run considerably slower. REFERENCES [1] G. Wäscher, H. Haussner, and H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, vol. 183, pp , [2] A. M. Gomes and J. F. Oliveira, Solving irregular strip packing problems by hybridising simulated annealing and linear programming, European Journal of Operational Research, vol. 171, pp , [3] J. Egeblad, B. K. Nielsen, and A. Odgaard, Fast neighborhood search for two- and three dimensional nesting problems, European Journal of Operational Research, vol. 183, pp , [4] T. C. Martins and M. S. G. Tsuzuki, Irregular rotational placement of shapes over non-convex containers with fixed dimensions, in Proceedings of the 8 th IFAC Workshop on Intelligent Manufacturing Systems, [5], Simulated annealing with adaptive neighborhood applied to the placement over containers with fixed dimensions, in Proceedings of the IFAC Workshop on Intelligent Manufacturing Systems, [6], Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons, Journal of the Brazilian Society of Mechanical Sciences and Engineering, vol. 30, pp , [7], Comparison of deterministic heuristics and simulated annealing for the rotational placement problem over containers with fixed dimensions, in Proceedings of the IFAC Symposium Information Control Problems in Manufacturing, [8], Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing, Bulletin of the Polish Academy of Sciences Technical Sciences, vol. 57, pp , [9], Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions, Expert Systems with Applications, vol. 37, pp , [10] A. K. Sato, T. C. Martins, and M. S. G. Tsuzuki, Rotational placement using simulated annealing and collision free region, in Proceedings of the 10 th IFAC Workshop on Intelligent Manufacturing Systems, 2010, pp [11] R. Heckmann and T. Lengauer, A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research, vol. 57, pp , [12] J. A. Bennell and K. A. Dowsland, Hybridising tabu search with optimisation techniques for irregular stock cutting, Manage. Sci., vol. 47, pp , [13] S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi, Optimization by simulated annealing, Science, vol. 220, pp , [14] V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol. 45, pp , [15] A. Corana, M. Marchesi, C. Martini, and S. Ridella, Minimizing multimodal functions of continuous variables with the simulated annealing algorithm, ACM Transactions on Mathematical Software, vol. 13, pp , [16] P. K. Agarwal, E. Flato, and D. Halperin, Polygon decomposition for efficient construction of minkowski sums, Computational Geometry, vol. 21, pp , [17] K. A. Dowsland, S. Vaid, and B. W. Dowsland, An algorithm for polygon placement using a bottom left strategy, European Journal of Operational Research, vol. 141, pp , [18] M. Mäntylä, An Introduction to Solid Modeling. Computer Science Press, [19] M. S. G. Tsuzuki and M. Shimada, Geometric classification tests using interval arithmetic in b rep solid modeling, Journal of the Brazilian Society of Mechanical Sciences and Engineering, vol. 25, pp , [20] J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, vol. C-28, pp , 1979.
A GRASP Approach to the Nesting Problem
MIC 2001-4th Metaheuristics International Conference 47 A GRASP Approach to the Nesting Problem António Miguel Gomes José Fernando Oliveira Faculdade de Engenharia da Universidade do Porto Rua Roberto
More informationSolving Irregular Strip Packing problems by hybridising simulated annealing and linear programming q
European Journal of Operational Research 171 (2006) 811 829 www.elsevier.com/locate/ejor Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming q A. Miguel Gomes
More informationA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
A Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem Kittipong Ekkachai 1 and Pradondet Nilagupta 2 ABSTRACT This paper presents a packing algorithm to solve
More informationAvailable online at ScienceDirect. Procedia Engineering 183 (2017 )
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 183 (2017 ) 291 296 17th International Conference on Sheet Metal, SHEMET17 Meta-heuristic algorithms for nesting problem of
More informationArc-Flow Model for the Two-Dimensional Cutting Stock Problem
Arc-Flow Model for the Two-Dimensional Cutting Stock Problem Rita Macedo Cláudio Alves J. M. Valério de Carvalho Centro de Investigação Algoritmi, Universidade do Minho Escola de Engenharia, Universidade
More informationResearch Article Dealing with Nonregular Shapes Packing
Mathematical Problems in Engineering, Article ID 548957, 10 pages http://dx.doi.org/10.1155/2014/548957 Research Article Dealing with Nonregular Shapes Packing Bonfim Amaro Júnior, Plácido Rogério Pinheiro,
More informationApplying Simulated Annealing and the No Fit Polygon to the Nesting Problem. Abstract. 1. Introduction
Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem Edmund Burke University of Nottingham University Park Nottingham, UK NG7 2RD UK ekb@cs.nott.ac.uk Graham Kendall University of
More informationSolving nesting problems with non-convex polygons by constraint logic programming
Intl. Trans. in Op. Res. 10 (2003) 651 663 INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH Solving nesting problems with non-convex polygons by constraint logic programming M. A. Carravilla, C. Ribeiro
More informationOptimization methods for nesting problems
DEGREE PROJECT FOR MASTER OF SCIENCE WITH SPECIALIZATION IN ROBOTICS DEPARTMENT OF ENGINEERING SCIENCE UNIVERSITY WEST Optimization methods for nesting problems Mattijs Timmerman i Summary Nesting problems
More informationA New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
OPERATIONS RESEARCH Vol. 54, No. 3, May June 2006, pp. 587 601 issn 0030-364X eissn 1526-5463 06 5403 0587 informs doi 10.1287/opre.1060.0293 2006 INFORMS A New Bottom-Left-Fill Heuristic Algorithm for
More informationCircle Covering Representation for Nesting problems with continuous rotations
Preprints of the 19th World Congress The International Federation of Automatic Control Circle Covering Representation for Nesting problems with continuous rotations Pedro Rocha Rui Rodrigues A. Miguel
More informationOptimal positioning of irregular shapes in stamping die strip
Int J Adv Manuf Technol (2011) 52:497 505 DOI 10.1007/s00170-010-2772-6 ORIGINAL ARTICLE Optimal positioning of irregular shapes in stamping die strip Roberto Licari E. Lo Valvo Received: 25 November 2009
More informationSolving a Nesting Problem using the Collision Free Region
Solving a Nesting Problem using the Collision Free Region Master Thesis August 31 th, 2016 Irene Reijntjes Supervisor: dr. ir. C.A.J. Hurkens Abstract This report investigates an irregular shape packing
More informationInterference-Free Polyhedral Configurations for Stacking
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 18, NO. 2, APRIL 2002 147 Interference-Free Polyhedral Configurations for Stacking Venkateswara R. Ayyadevara, David A. Bourne, Kenji Shimada, and Robert
More informationConstructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts
Constructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts Antonio Martinez a, Ramon Alvarez-Valdes b, Julia Bennell a, Jose Manuel Tamarit b a University
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationRepresentation of Curves and Surfaces in B-Rep Solid Modelers
Representation of Curves and Surfaces in B-Rep Solid Modelers Wang Congli Escola Politécnica da USP Departamento de Engenharia Mecatrônica e de Sistemas Mecânicos Marcos de Sales Guerra Tsuzuki Escola
More informationA Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems
Artificial Intelligence Review 16: 257 300, 2001. 2001 Kluwer Academic Publishers. Printed in the Netherlands. 257 A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems
More information1. Introduction. 2. Cutting and Packing Problems. 3. Optimisation Techniques. 4. Automated Packing Techniques
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. COMPUTATIONAL GEOMETRY, BENCHMARKS AND ALGORITHMS FOR RECTANGULAR AND IRREGULAR PACKING...74
More informationAn improved method for calculating the no-fit polygon
Computers & Operations Research 33(2006) 1521 1539 www.elsevier.com/locate/cor An improved method for calculating the no-fit polygon Hamish T. Dean, Yiliu Tu, John F. Raffensperger 200 Armagh Street, P.O.
More informationComplete and Robust No-Fit Polygon Generation for the Irregular Stock Cutting Problem
Complete and Robust No-Fit Polygon Generation for the Irregular Stock Cutting Problem E. K. URKE R. S. R. HELLIER G. KENDLL G. WHITWELL ekb@cs.nott.ac.uk rsh@cs.nott.ac.uk gxk@cs.nott.ac.uk gxw@cs.nott.ac.uk
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More informationAn Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
Vol. 33, No. 9 ACTA AUTOMATICA SINICA September, 2007 An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem ZHANG De-Fu 1 CHEN Sheng-Da 1 LIU Yan-Juan
More informationSolving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming
Solving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming Maria Antónia Carravilla Cristina Ribeiro José F. Oliveira Rua Dr. Roberto Frias s/n, 4250-465 Porto, Portugal {mac,mcr,fo}@fe.up.pt
More informationAn Algorithm for an Optimal Staffing Problem in Open Shop Environment
An Algorithm for an Optimal Staffing Problem in Open Shop Environment Daniela I. Borissova, and Ivan C. Mustakerov Abstract The paper addresses a problem of optimal staffing in open shop environment. The
More informationA comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums JULIA A BENNELL School of Management, University of Southampton, Southampton SO17 1BJ, United Kingdom,.bennell@soton.ac.uk
More informationA GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS. Nelson Mandela Metropolitan University, South Africa
A GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS V. Mancapa 1, T.I. van Niekerk 2 and T Hua 2 1 Department of Electrical Engineering Nelson Mandela Metropolitan University, South Africa mancapa@nmmu.ac.za
More information9. Three Dimensional Object Representations
9. Three Dimensional Object Representations Methods: Polygon and Quadric surfaces: For simple Euclidean objects Spline surfaces and construction: For curved surfaces Procedural methods: Eg. Fractals, Particle
More informationARTICLE IN PRESS. Int. J. Production Economics
Int. J. Production Economics 121 (2009) 148 161 Contents lists available at ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe Active-set sequential quadratic programming
More informationMathematical model and efficient algorithms for object packing problem
Mathematical model and efficient algorithms for object packing problem N. Chernov 1, Yu. Stoyan 2, and T. Romanova 2 December 1, 2008 Abstract The article is devoted to mathematical models and practical
More informationTOWARD BETTER BUILD VOLUME PACKING IN ADDITIVE MANUFACTURING: CLASSIFICATION OF EXISTING PROBLEMS AND BENCHMARKS
TOWARD BETTER BUILD VOLUME PACKING IN ADDITIVE MANUFACTURING: CLASSIFICATION OF EXISTING PROBLEMS AND BENCHMARKS L. J. P. Araújo*, E. Özcan*, J. A. D. Atkin*, M. Baumers, C. Tuck, and R. Hague *Automated
More informationOpen Access Research on the Arranging and Patchwork Design for Storage Tank Bottom Based on Sinovation
Send Orders for Reprints to reprints@benthamscience.ae 78 The Open Petroleum Engineering Journal, 05, 8, 78-83 Open Access Research on the Arranging and Patchwork Design for Storage Tank Bottom Based on
More informationJeinny Peralta 1*, Marina Andretta 1 and José Fernando Oliveira 2
Pesquisa Operacional (2018) 38(2): 195-214 2018 Brazilian Operations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/pope doi: 10.1590/0101-7438.2018.038.02.0195
More information5th GRADE MATHEMATICS
5th GRADE MATHEMATICS 2018-2019 Year-at-a-Glance Place Value and Decimal Fractions Multi-digit number and decimal fraction operations Addition and Subtraction of Fractions Multiplication and Division of
More informationA Branch-and-Cut Algorithm for the Partition Coloring Problem
A Branch-and-Cut Algorithm for the Partition Coloring Problem Yuri Frota COPPE/UFRJ, Programa de Engenharia de Sistemas e Otimização Rio de Janeiro, RJ 21945-970, Brazil abitbol@cos.ufrj.br Nelson Maculan
More informationCOMPUTER-AIDED NESTING OF TWO DIMENSIONAL SHAPED FOR PRESS TOOL DESIGN
COMPUTER-AIDED NESTING OF TWO DIMENSIONAL SHAPED FOR PRESS TOOL DESIGN Mohammed Wasel Al-Hazmi Ph.D Mechanical Engineering Vice Rector for Branches Umm Al-Qura University Makkah, Kingdom of Saudi Arabia
More informationLine segment intersection. Family of intersection problems
CG Lecture 2 Line segment intersection Intersecting two line segments Line sweep algorithm Convex polygon intersection Boolean operations on polygons Subdivision overlay algorithm 1 Family of intersection
More informationA Study on Factors Affecting the Non Guillotine Based Nesting Process Optimization
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 IEEE International Conference
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationAn Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem
European Journal of Operational Research 128/1, 34-57, 2000. An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem E. Hopper and B. C. H. Turton School of Engineering,
More informationNumber and Operation Standard #1. Divide multi- digit numbers; solve real- world and mathematical problems using arithmetic.
Number and Operation Standard #1 MN Math Standards Vertical Alignment for Grade 5 Demonstrate mastery of multiplication and division basic facts; multiply multi- digit numbers; solve real- world and mathematical
More informationMathematics Curriculum
6 G R A D E Mathematics Curriculum GRADE 6 5 Table of Contents 1... 1 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)... 11 Lesson 1: The Area of Parallelograms Through Rectangle Facts...
More informationCSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 8-5 )
CSCI 4620/8626 Computer Graphics Clipping Algorithms (Chapter 8-5 ) Last update: 2016-03-15 Clipping Algorithms A clipping algorithm is any procedure that eliminates those portions of a picture outside
More informationParallel Simulated Annealing for VLSI Cell Placement Problem
Parallel Simulated Annealing for VLSI Cell Placement Problem Atanu Roy Karthik Ganesan Pillai Department Computer Science Montana State University Bozeman {atanu.roy, k.ganeshanpillai}@cs.montana.edu VLSI
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the
More informationCurriki Geometry Glossary
Curriki Geometry Glossary The following terms are used throughout the Curriki Geometry projects and represent the core vocabulary and concepts that students should know to meet Common Core State Standards.
More informationA Novel Hybrid Intelligence Approach for 2D Packing through Internet Crowdsourcing
A Novel Hybrid Intelligence Approach for 2D Packing through Internet Crowdsourcing Anupam Agrawal*, Parmatma Yadav, C. K. Upadhyay Dept. of Information Technology Indian Institute of Information Technology
More information1. Introduction to Constructive Solid Geometry (CSG)
opyright@010, YZU Optimal Design Laboratory. All rights reserved. Last updated: Yeh-Liang Hsu (010-1-10). Note: This is the course material for ME550 Geometric modeling and computer graphics, Yuan Ze University.
More informationThe Algorithm Design Manual
Steven S. Skiena The Algorithm Design Manual With 72 Figures Includes CD-ROM THE ELECTRONIC LIBRARY OF SCIENCE Contents Preface vii I TECHNIQUES 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 2 2.1 2.2 2.3
More informationMathematics Grade 5. COMMON CORE STATE STANDARDS for MATHEMATICS
Mathematics Grade 5 In Grade 5, instructional time should focus on three critical areas: (1) developing fluency with addition and subtraction of fractions, and developing understanding of the multiplication
More informationWeight Annealing Heuristics for Solving the Two-Dimensional Bin Packing Problem
Weight Annealing Heuristics for Solving the Two-Dimensional Bin Packing Problem Kok-Hua Loh, Nanyang Technological University Bruce Golden, University of Maryland Edward Wasil, American University th ICS
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More information5th Grade Units (as articulated through Diocese of Tucson ACE Collaborative Curriculum Design 2012) Unit 1: Mathematical Operations with Whole Numbers
5th Grade Units (as articulated through Diocese of Tucson ACE Collaborative Curriculum Design 2012) Unit 1: Mathematical Operations with Whole Numbers 5.OA.1. Use parentheses, brackets, or braces in numerical
More informationComputer Aided Engineering Design Prof. Anupam Saxena Department of Mechanical Engineering Indian Institute of Technology, Kanpur.
(Refer Slide Time: 00:28) Computer Aided Engineering Design Prof. Anupam Saxena Department of Mechanical Engineering Indian Institute of Technology, Kanpur Lecture - 6 Hello, this is lecture number 6 of
More informationComputational Geometry Algorithmische Geometrie
Algorithmische Geometrie Panos Giannopoulos Wolfgang Mulzer Lena Schlipf AG TI SS 2013 !! Register in Campus Management!! Outline What you need to know (before taking this course) What is the course about?
More informationAnoka Hennepin K-12 Curriculum plan
Anoka Hennepin K-12 Curriculum plan Department: Elementary Math Unit Title: Packages and Polygons (Blue Book, Geo and Measurement) Triangles and Beyond (Blue Book, Geo and Measurement) Everyday Math: Volume
More informationSchool District of Marshfield Mathematics Standards
MATHEMATICS Counting and Cardinality, Operations and Algebraic Thinking, Number and Operations in Base Ten, Measurement and Data, and Geometry Operations and Algebraic Thinking Use the Four Operations
More informationComputer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Welcome to the lectures on computer graphics. We have
More informationApplying Evolutionary Algorithms and the No Fit Polygon to the Nesting Problem
Applying Evolutionary Algorithms and the No Fit Polygon to the Nesting Problem Edmund Burke Department of Computer Science The University of Nottingham Nottingham NG7 2RD UK Graham Kendall Department of
More informationMotion Planning 2D. Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo
Motion Planning 2D Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo Tratto dai corsi: CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Prof. J.C. Latombe Stanford
More informationStandard 1 Students will expand number sense to include integers and perform operations with whole numbers, simple fractions, and decimals.
Stretch Standard 1 Students will expand number sense to include integers and perform operations with whole numbers, simple fractions, and decimals. Objective 1: Represent whole numbers and decimals from
More informationXLVI Pesquisa Operacional na Gestão da Segurança Pública
A HYBRID APPROACH USING A RANDOM-KEY GENETIC ALGORITHM AND POSITIONING METHODS TO TACKLE THE IRREGULAR STRIP PACKING PROBLEMS Bonfim Amaro Júnior University of Fortaleza Graduate Program in Applied Informatics
More informationBoolean Component. Chapter 1. Boolean Operations
Chapter 1. Boolean Component Component: The Boolean Component (BOOL), in the bool directory, performs Boolean operations on the model topology of bodies, first finding the intersections between bodies,
More informationUsing Geometric Constraints to Capture. design intent
Journal for Geometry and Graphics Volume 3 (1999), No. 1, 39 45 Using Geometric Constraints to Capture Design Intent Holly K. Ault Mechanical Engineering Department, Worcester Polytechnic Institute 100
More informationSolid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO
Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces
More informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More informationTopology and Boundary Representation. The ACIS boundary representation (B-rep) of a model is a hierarchical decomposition of the model s topology:
Chapter 6. Model Topology Topology refers to the spatial relationships between the various entities in a model. Topology describes how geometric entities are connected (connectivity). On its own, topology
More informationOn the Number of Rooms in a Rectangular Solid Dissection
IPSJ Journal Vol. 51 No. 3 1047 1055 (Mar. 2010) Regular Paper On the Number of Rooms in a Rectangular Solid Dissection Hidenori Ohta, 1 Toshinori Yamada 2 and Kunihiro Fujiyoshi 1 In these years, 3D-LSIs
More informationGrade 5. Massachusetts Curriculum Framework for Mathematics 48
Grade 5 Introduction In grade 5, instructional time should focus on four critical areas: (1) developing fluency with addition and subtraction of fractions, and developing understanding of the multiplication
More informationGeometric and Solid Modeling. Problems
Geometric and Solid Modeling Problems Define a Solid Define Representation Schemes Devise Data Structures Construct Solids Page 1 Mathematical Models Points Curves Surfaces Solids A shape is a set of Points
More informationInner Approximation of Polygons and Polyhedra by Unions of Boxes
Inner Approximation of Polygons and Polyhedra by Unions of Boxes Christian Spielberger Martin Held Technical Report 2006-02 April 2006 Department of Computer Sciences Jakob-Haringer-Straße 2 5020 Salzburg
More information5 th Grade LEUSD Learning Targets in Mathematics
5 th Grade LEUSD Learning Targets in Mathematics 6/24/2015 The learning targets below are intended to provide a guide for teachers in determining whether students are exhibiting characteristics of being
More informationMinkowski Sums. Dinesh Manocha Gokul Varadhan. UNC Chapel Hill. NUS CS 5247 David Hsu
Minkowski Sums Dinesh Manocha Gokul Varadhan UNC Chapel Hill NUS CS 5247 David Hsu Last Lecture Configuration space workspace configuration space 2 Problem Configuration Space of a Translating Robot Input:
More informationCentral Valley School District Math Curriculum Map Grade 8. August - September
August - September Decimals Add, subtract, multiply and/or divide decimals without a calculator (straight computation or word problems) Convert between fractions and decimals ( terminating or repeating
More informationHybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems
Hybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems Fabio Parisini Tutor: Paola Mello Co-tutor: Michela Milano Final seminars of the XXIII cycle of the doctorate
More informationOptimization Techniques for Design Space Exploration
0-0-7 Optimization Techniques for Design Space Exploration Zebo Peng Embedded Systems Laboratory (ESLAB) Linköping University Outline Optimization problems in ERT system design Heuristic techniques Simulated
More informationNumber and Quantity. Reporting Topic Grade Level Standards Standard Summary
Course Title: Fifth Grade Math Description: In fifth grade the content focuses on procedures, concepts, and applications in three critical areas: Developing fluency with addition and subtraction of fractions,
More informationHierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach
Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach O. El Badawy, M. S. Kamel Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering,
More informationPresents. The Common Core State Standards Checklist Grades 3-5
Presents The Common Core State Standards Checklist Grades 3-5 Third Grade Common Core State Standards Third Grade: Operations and Algebraic Thinking Represent and Solve problems involving Multiplication
More information5.OA.1 5.OA.2. The Common Core Institute
Operations and Algebraic Thinking The Common Core Institute Cluster: Write and interpret numerical expressions. 5.OA.1: Use parentheses, brackets, or braces in numerical expressions, and evaluate expressions
More information6 Mathematics Curriculum
New York State Common Core 6 Mathematics Curriculum GRADE GRADE 6 MODULE 5 Table of Contents 1 Area, Surface Area, and Volume Problems... 3 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)...
More informationConstructive floorplanning with a yield objective
Constructive floorplanning with a yield objective Rajnish Prasad and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 13 E-mail: rprasad,koren@ecs.umass.edu
More informationThe National Strategies Secondary Mathematics exemplification: Y8, 9
Mathematics exemplification: Y8, 9 183 As outcomes, Year 8 pupils should, for example: Understand a proof that the sum of the angles of a triangle is 180 and of a quadrilateral is 360, and that the exterior
More informationNesting of Irregular Shapes Using Feature Matching and Parallel Genetic Algorithms
Nesting of Irregular Shapes Using Feature Matching and Parallel Genetic Algorithms Anand Uday Erik D. Goodman Ananda A. Debnath Genetic Algorithms Research and Applications Group (GARAGe) Michigan State
More informationRestricted-Orientation Convexity in Higher-Dimensional Spaces
Restricted-Orientation Convexity in Higher-Dimensional Spaces ABSTRACT Eugene Fink Derick Wood University of Waterloo, Waterloo, Ont, Canada N2L3G1 {efink, dwood}@violetwaterlooedu A restricted-oriented
More informationA Constructive Genetic Approach to Point-Feature Map Labeling
A pesquisa Operacional e os Recursos Renováveis 4 a 7 de novembro de 2003, Natal-RN A Constructive Genetic Approach to Point-Feature Map Labeling Missae Yamamoto missae@dpi.linpe.br Luiz Antonio Nogueira
More informationA simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints
A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints Sohaib Afifi 1, Duc-Cuong Dang 1,2, and Aziz Moukrim 1 1 Université de Technologie de Compiègne
More informationSmallest Intersecting Circle for a Set of Polygons
Smallest Intersecting Circle for a Set of Polygons Peter Otfried Joachim Christian Marc Esther René Michiel Antoine Alexander 31st August 2005 1 Introduction Motivated by automated label placement of groups
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More information5th Grade Mathematics Mathematics CC
Course Description Fifth grade students will learn mathematical skills and applications relating to Operations and Algebraic Thinking, Number and Operations in Base Ten, Number and Operations in Fractions,
More informationCLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS
CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS B.Vanajakshi Department of Electronics & Communications Engg. Assoc.prof. Sri Viveka Institute of Technology Vijayawada, India E-mail:
More informationCSS Topics / Lessons Terminology. * Denotes a Supporting Cluster End-of-Module Assessment after Lesson 16
Page 1 Module Sequence: 1, 2, 3, 4, 5, 6 1: August 14, 2017 September 19, 2017 Module 1 1 Module 1 Place Value and Decimal Fractions 5.NBT.1 Recognize that in a multi-digit number, a digit in one place
More informationQUANTIZATION WITH KNOWLEDGE BASE IN MINIMUM RECTANGLE ALGORITHM APPLIED TO NESTING PROBLEM
Computer Systems Engineering 2005 - Author's copy Keywords: nesting algorithm, quantization, knowledge base, shape pairing Grzegorz CHMAJ * Leszek KOSZALKA ** QUANTIZATION WITH KNOWLEDGE BASE IN MINIMUM
More informationImplementating the Genetic Algorithm with VLSI Approach for Optimization of Sheet Metal Nesting
5 th International & 26 th All India Manufacturing Technology, Design and Research Conference (AIMTDR 2014) December 12 th 14 th, 2014, IIT Guwahati, Assam, India Implementating the Genetic Algorithm with
More informationApplication of Genetic Algorithms to Packing Problems - A Review
In: Chawdry, P. K., Roy, R. and Kant, R. K. (eds.), Proceedings of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing, Springer Verlag, London, pp. 279-288, 1997.
More informationGeometric Rounding. Snap rounding arrangements of segments. Dan Halperin. Tel Aviv University. AGC-CGAL05 Rounding 1
Geometric Rounding Snap rounding arrangements of segments Dan Halperin danha@tau.ac.il Tel Aviv University AGC-CGAL05 Rounding 1 Rounding geometric objects transforming an arbitrary precision object into
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationA Method for Identifying Irregular Lattices of Hexagonal Tiles in Real-time
S. E. Ashley, R. Green, A Method for Identifying Irregular Lattices of Hexagonal Tiles in Real-Time, Proceedings of Image and Vision Computing New Zealand 2007, pp. 271 275, Hamilton, New Zealand, December
More information