Asanka Herath Buddhika Kottahachchi

Slides:

Advertisements

Similar presentations

Algorithm Design Methods Spring 2007 CSE, POSTECH.

Advertisements

The Oklahoma Kite Company An Investigation The Oklahoma Kite Company The Oklahoma Kite Company makes kites, using best quality rip-stop nylon to cover.

To optimize something means to maximize or minimize some aspect of it… Strategy for Solving Max-Min Problems 1. Understand the Problem. Read the problem.

Chapter 5 Linear Inequalities and Linear Programming

Learning Objectives for Section 5.3

Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.

S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.

© The McGraw-Hill Companies, Inc., Chapter 8 The Theory of NP-Completeness.

Optimization 4.7. A Classic Problem You have 40 feet of fence to enclose a rectangular garden along the side of a barn. What is the maximum area that.

Lecture 1: Introduction to the Course of Optimization 主講人 : 虞台文.

Algorithms for the leather nesting problem: application to a real automotive industry instance Pedro Brás Supervision: Cláudio Alves and José Valério de.

Parameterized Approximation Scheme for the Multiple Knapsack Problem by Klaus Jansen (SODA’09) Speaker: Yue Wang 04/14/2009.

1 -1 Chapter 1 Introduction Why Do We Need to Study Algorithms? To learn strategies to design efficient algorithms. To understand the difficulty.

A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering Karen Daniels, Arti Mathur, Roger Grinde University of Massachusetts Lowell.

Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.

© J. Christopher Beck Lecture 18: Timetabling with Workforce Capacity.

Ch 13 – Backtracking + Branch-and-Bound

1 The Theory of NP-Completeness 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP? X = P.

A tale of 2-dimensional (Guillotine) bin packing Nikhil Bansal (IBM) Andrea Lodi (Univ. of Bologna, Italy) Maxim Sviridenko (IBM)

Chapter 10 Measurement Section 10.2 Perimeter and Area.

Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.

© 2008 Pearson Addison-Wesley. All rights reserved Chapter 1 Section 9-3 Perimeter, Area, and Circumference.

Section 9-4 Perimeter, Area, and Circumference.

Tag-Cloud Drawing: Algorithm for Cloud Visualization

 Optimal Packing of High- Precision Rectangles By Eric Huang & Richard E. Korf 25 th AAAI Conference, 2011 Florida Institute of Technology CSE 5694 Robotics.

Finding the Area of a Rectangle. Area of a Rectangle WALT: To calculate areas of rectanglesTo calculate areas of rectangles To calculate areas of polygons.

Cutting & Packing Workshop Spring 2008 Furniture Manufacturing.

Measuring area & volume

Area & Perimeter of Parallelograms. w l The distance around a geometric figure is its perimeter. To find the perimeter P of a polygon, you can add the.

PERIMETER Definition Add up all sides of the object 2 5 P = P = 14.

An Efficient Placement Strategy for Metaheuristics based Layout Optimization by Abdul-Rahim Ahmad Otman Basir Systems Design Engineering, University of.

Packing Rectangles into Bins Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM)

DO NOW!!! (1 st ) 1.A rectangular prism has length 4 cm, width 5 cm, and height 9 cm. a) Find the area of the cross section parallel to the base. b) Find.

6.1 Areas Between Curves 1 Dr. Erickson. 6.1 Areas Between Curves2 How can we find the area between these two curves? We could split the area into several.

PERIMETER Definition Add up all sides of the object 2 5 P = P = 14.

Volume of a Rectangular Prism

1 Approximation Algorithm Updated at 2011/01/03. 2 Approximation Algorithm Up to now, the best algorithm for solving an NP-complete problem requires exponential.

For getting out of Ohio State Applications of Graph and Scheduling Theory for getting out of Ohio State Eugene Talagrand Mauktik Gandhi Jeff Mathew.

Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China.

Algorithm Design Methods 황승원 Fall 2011 CSE, POSTECH.

The bin packing problem. For n objects with sizes s 1, …, s n where 0 < s i ≤1, find the smallest number of bins with capacity one, such that n objects.

Solution approaches to the marker layout problem. Kath Dowsland Gower Optimal Algorithms Ltd.

Minimizing Perimeter. The Problem A spectator viewing area for a downhill ski race needs to be fenced in. The organizers know they need 64 m 2 of enclosed.

A25 & 26-Optimization (max & min problems). Guidelines for Solving Applied Minimum and Maximum Problems 1.Identify all given quantities and quantities.

ACO for NP-hard Problems (continued) ACO February 2008 C. Colson.

PERIMETERS What is the Perimeter of a shape. What is the Perimeter of this rectangle? What is the Perimeter of this rectangle? 5cm 15cm.

From Design to Reality…

The Oklahoma Kite Company

Perimeter, Area, and Circumference

Ch. 5 – Applications of Derivatives

Chapter 5 Linear Inequalities and Linear Programming

Algorithm Design Methods

Chart Packing Heuristic

GCF Problem Solving How can you tell if a word problem requires you to use Greatest Common Factor?

Exam 2 LZW not on syllabus. 73% / 75%.

Objective : Calculate the area of rectangles.

Algorithm Design Methods

Area and Perimeter.

Algorithm Design Methods

What is area? The amount of space that a figure encloses

Area and Perimeter.

Area and Perimeter.

What Is Area ? Area is the amount of space inside a shape: Area Area

Approximation Algorithm

Nesting by Shachaf Ben Jakov.

Finding the Area of a Rectangle

Algorithm Design Methods

Presentation transcript:

Asanka Herath Buddhika Kottahachchi Polygon Packing Asanka Herath Buddhika Kottahachchi

What? Given a set of polygons, determine a layout such that the rectangle enclosing them is minimal, allowing translation and rotation.

Why? It has important applications in the apparel industry Pieces of material (polygons) need to be cut out of rolls of material to be assembled together as items of clothing Considerable amounts of material is wasted as a result of not having an optimal layout for making the cuts NP-hard problem. Current approaches use heuristics with varying degrees of efficiency. Room for improvement.

Exploiting Parallel Processing Process multiple candidate layouts simultaneously Split resources to work on different approaches (…) Fast heuristics to determine initial layouts Slower relaxed placement methods to optimize initial layouts Share information about current bounds and current optimal solution to reduce search space Implementation: C and MPI

Anyone been here before? Lots of existing literature Referred to as Nesting Problem Marker Maker’s Problem Many related problems (…) Our method would follow work done by Benny Kaejr Nielsen and Allan Odgaard (Copenhagen, Denmark) Commercial implementations (…) At least one attempt at a parallel library for solving nesting problems

Related problems Can be categorized as Decision Problems Decide whether a given set of shapes fit within a given shape Knapsack Problem Given a set of shapes and a region, find a placement of a subset of shapes that maximizes the utilization (area covered) of the region. Bin packing problem. Given a set of shapes and a set of regions, minimize the number of regions needed to place all shapes. Strip packing problem. Given a set of shapes and a width W, minimize the length of a rectangular region with width W such that all shapes are contained in the region.

Commercial Implementations

Questions?