Skip to content
Research Article Open access CC BY 3.0

A Method for Two-Dimensional Cutting Stock Problem with Triangular Shape Items

W. N. P. Rodrigo, W. B. Daundasekera, A. A. I. Perera

Journal of Advances in Mathematics and Computer Science · pp. 750–771 · Published 21 Aug 2013

10.9734/BJMCS/2013/5165

Abstract

Increasing cost of raw material and need to avoid industrial wastage, solving cutting stock problems became of great interest in the area of Operations Research. An optimum cutting stock problem can be defined as cutting a main sheet into smaller pieces while minimizing total wastage of the raw material or maximizing overall profit obtained by cutting smaller pieces from the main sheet. Objective of this study is to generate feasible cutting patterns for two-dimensional triangular shape cutting items. An algorithm is presented based on modified Branch and Bound Algorithm. A computer program is developed using Matlab software package to generate feasible cutting patterns. As a case study, four different sizes of triangular shape items with their demands are selected to cut from a main sheet with known dimensions. Applying proposed algorithm, demand is satisfied and total wastage is minimized. Proposed algorithm can be exploited to generate cutting patterns for rectangular and triangular cutting items at the same time and more suitable for medium size two dimensional cutting stock problem.

Cutting stock problem Branch and Bound Algorithm pattern generation Matlab software package

Cited by 7

Column Generation Model in Capacitated Multi-Periods Cutting Stock Problem with Pattern Set-Up Cost

P. Bangun, S. Octarina, L. Hanum · 2021

The N-Sheet Model in Capacitated Multi-Period Cutting Stock Problem with Pattern Set-Up Cost

S. Octarina, P. Bangun, Sisca Pebrina · 2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI) · 2020

Set Covering Model in Solving Multiple Cutting Stock Problem

S. Octarina, Devi Gusmalia Juita, Ning Eliyati · 2020

The greedy randomized adaptive search procedure method in formulating set covering model on cutting stock problem

S. Octarina, F. M. Puspita, S. Supadi · Journal of Physics, Conference Series · 2020

3-Phase Matheuristic Model in Two-Dimensional Cutting Stock Problem of Triangular Shape Items

P. Bangun, S. Octarina, Sisca Puspita Sepriliani · 2020

Use of Cartesian Coordinate Geometry in Solving One-Dimensional Bin-Packing Problems

W. N. P. Rodrigo, W. Daundasekera, Aai Pereraa · 2018

One-Dimensional Cutting Stock Problem with Cartesian Coordinate Points

W. N. P. Rodrigo, S. Shashikala · 2017

Related research

Article metrics

Real usage data collected on this platform.

20

Page views

0

PDF downloads

3

Outbound clicks

7

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.