2012 International Conference on Computer Science and Information Processing (CSIP) 2012
DOI: 10.1109/csip.2012.6308918
|View full text |Cite
|
Sign up to set email alerts
|

Study of one-dimensional cutting stock problem with multi-objective optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…This shows the efficiency and dominancy of the presented approach in the sense that fulfills the given demand from the nonstandard leftovers. The presented algorithm in this article is a novel approach to this era, because the previous approaches minimized leftovers in the stock by using the cutting concept, [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24] whereas the proposed one used the combinatorial concept. The maximum utilization of the stock in Reference [56] is up to 99.15%, whereas the presented approach used the stock up to 100%.…”
Section: F I G U R E 4 Pseudo Code Of Genetic Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This shows the efficiency and dominancy of the presented approach in the sense that fulfills the given demand from the nonstandard leftovers. The presented algorithm in this article is a novel approach to this era, because the previous approaches minimized leftovers in the stock by using the cutting concept, [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24] whereas the proposed one used the combinatorial concept. The maximum utilization of the stock in Reference [56] is up to 99.15%, whereas the presented approach used the stock up to 100%.…”
Section: F I G U R E 4 Pseudo Code Of Genetic Algorithmmentioning
confidence: 99%
“…9 Furthermore, an optimal model whose aim is the minimization of waste, cutting patterns, and usable leftover in the whole cutting process, and a 1D cutting stock is minimized. 10 On similar lines, a pattern-set generation algorithm (PSG) for minimization of one-dimensional multiple stock size cutting-stock problem (1DMSSCSP) is presented that has considered those leftovers that are usually left after demand cutting. [11][12][13][14] Gradisar et al 15 have presented a method that handles 1D cutting-stock problem with usable leftovers (CSPUL) in a situation where the ratio between the average stock and average order length is less than 3.…”
Section: Introductionmentioning
confidence: 99%
“…Kantorovich provides two examples in his paper to make the CSP easier to understand [26]. Since then, many scholars have conducted research to obtain a solution to the CSP using linear programming [29][30][31][32][33][34][35][36][37][38][39][40][41][42], genetic, or heuristic approaches [43][44][45][46][47][48].…”
Section: Literature Review Of Cwm Problemsmentioning
confidence: 99%
“…Two approaches, simulated annealing (SA) and tabu search (TS) [8], have been used for the evaluation of the one-dimensional cutting stock problem (1DCSP). A one-dimensional cutting stock design [9] is carried out for the minimization of waste as an optimal model. A technique is presented by Gradisar et al [10] that handles 1D-CSP with usable leftovers in a situation where the average order and stock length are less than three.…”
Section: Introductionmentioning
confidence: 99%