2D Optimal Cutting Problem View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2017-10-26

AUTHORS

Georgi Evtimov , Stefka Fidanova

ABSTRACT

Good management of industrial processes lead to optimization problems. Some of them are NP-hard and needs special algorithms to be solved. One such problem is cutting stock problem (CSP). The accurate and fast cutting out with less possible waste is very important element from the working process. The aim is to cut 2D items from rectangular stock, minimizing the waste. The problem is very difficult and the most of the authors solve the simplified version of the problem when the items are rectangular. The computational time increases exponentially when the number of items increase. Finding the optimal solution for large-sized problems for a reasonable time is impossible. Therefore exact algorithms and traditional numerical methods can be apply only on very small problems, less than 100 items. We propose an approximate algorithm which solve the problem when the items are polygons. More... »

PAGES

33-39

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-65530-7_4

DOI

http://dx.doi.org/10.1007/978-3-319-65530-7_4

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1092380969


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria", 
          "id": "http://www.grid.ac/institutes/grid.424988.b", 
          "name": [
            "Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Evtimov", 
        "givenName": "Georgi", 
        "id": "sg:person.07366160356.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07366160356.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria", 
          "id": "http://www.grid.ac/institutes/grid.424988.b", 
          "name": [
            "Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fidanova", 
        "givenName": "Stefka", 
        "id": "sg:person.011173106320.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011173106320.18"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2017-10-26", 
    "datePublishedReg": "2017-10-26", 
    "description": "Good management of industrial processes lead to optimization problems. Some of them are NP-hard and needs special algorithms to be solved. One such problem is cutting stock problem (CSP). The accurate and fast cutting out with less possible waste is very important element from the working process. The aim is to cut 2D items from rectangular stock, minimizing the waste. The problem is very difficult and the most of the authors solve the simplified version of the problem when the items are rectangular. The computational time increases exponentially when the number of items increase. Finding the optimal solution for large-sized problems for a reasonable time is impossible. Therefore exact algorithms and traditional numerical methods can be apply only on very small problems, less than 100 items. We propose an approximate algorithm which solve the problem when the items are polygons.", 
    "editor": [
      {
        "familyName": "Georgiev", 
        "givenName": "Krassimir", 
        "type": "Person"
      }, 
      {
        "familyName": "Todorov", 
        "givenName": "Michail", 
        "type": "Person"
      }, 
      {
        "familyName": "Georgiev", 
        "givenName": "Ivan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-65530-7_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-65529-1", 
        "978-3-319-65530-7"
      ], 
      "name": "Advanced Computing in Industrial Mathematics", 
      "type": "Book"
    }, 
    "keywords": [
      "large-sized problems", 
      "approximate algorithm", 
      "exact algorithm", 
      "computational time", 
      "reasonable time", 
      "small problems", 
      "optimal solution", 
      "optimization problem", 
      "cutting problem", 
      "algorithm", 
      "special algorithm", 
      "rectangular stocks", 
      "such problems", 
      "stock problem", 
      "possible waste", 
      "traditional numerical methods", 
      "working process", 
      "simplified version", 
      "number of items", 
      "numerical method", 
      "industrial processes", 
      "NPs", 
      "items", 
      "polygons", 
      "important element", 
      "version", 
      "problem", 
      "better management", 
      "process", 
      "time", 
      "solution", 
      "management", 
      "method", 
      "number", 
      "elements", 
      "authors", 
      "aim", 
      "waste", 
      "stocks"
    ], 
    "name": "2D Optimal Cutting Problem", 
    "pagination": "33-39", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1092380969"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-65530-7_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-65530-7_4", 
      "https://app.dimensions.ai/details/publication/pub.1092380969"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:55", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_51.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-65530-7_4"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-65530-7_4'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-65530-7_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-65530-7_4'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-65530-7_4'


 

This table displays all metadata directly associated to this object as RDF triples.

124 TRIPLES      23 PREDICATES      66 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-65530-7_4 schema:about anzsrc-for:01
2 anzsrc-for:0103
3 anzsrc-for:08
4 anzsrc-for:0802
5 schema:author N12d5e08f97db47cf912b5e6bb2eef47a
6 schema:datePublished 2017-10-26
7 schema:datePublishedReg 2017-10-26
8 schema:description Good management of industrial processes lead to optimization problems. Some of them are NP-hard and needs special algorithms to be solved. One such problem is cutting stock problem (CSP). The accurate and fast cutting out with less possible waste is very important element from the working process. The aim is to cut 2D items from rectangular stock, minimizing the waste. The problem is very difficult and the most of the authors solve the simplified version of the problem when the items are rectangular. The computational time increases exponentially when the number of items increase. Finding the optimal solution for large-sized problems for a reasonable time is impossible. Therefore exact algorithms and traditional numerical methods can be apply only on very small problems, less than 100 items. We propose an approximate algorithm which solve the problem when the items are polygons.
9 schema:editor N9c9e44a1b9eb414691cbdb920ce32740
10 schema:genre chapter
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf N8e8e9d505cc641b9801dcdaefed506e1
14 schema:keywords NPs
15 aim
16 algorithm
17 approximate algorithm
18 authors
19 better management
20 computational time
21 cutting problem
22 elements
23 exact algorithm
24 important element
25 industrial processes
26 items
27 large-sized problems
28 management
29 method
30 number
31 number of items
32 numerical method
33 optimal solution
34 optimization problem
35 polygons
36 possible waste
37 problem
38 process
39 reasonable time
40 rectangular stocks
41 simplified version
42 small problems
43 solution
44 special algorithm
45 stock problem
46 stocks
47 such problems
48 time
49 traditional numerical methods
50 version
51 waste
52 working process
53 schema:name 2D Optimal Cutting Problem
54 schema:pagination 33-39
55 schema:productId N87a4d2fa4f8b45b5ad7bd6ce8d0ff826
56 Nf06b0738998d4f1691592632382f941e
57 schema:publisher Na22b4ad6ebdf4961ab72675a7c0abb9b
58 schema:sameAs https://app.dimensions.ai/details/publication/pub.1092380969
59 https://doi.org/10.1007/978-3-319-65530-7_4
60 schema:sdDatePublished 2022-05-10T10:55
61 schema:sdLicense https://scigraph.springernature.com/explorer/license/
62 schema:sdPublisher N747ff140a5b54de4a42fddf757f48ac7
63 schema:url https://doi.org/10.1007/978-3-319-65530-7_4
64 sgo:license sg:explorer/license/
65 sgo:sdDataset chapters
66 rdf:type schema:Chapter
67 N0ce84c8ec4a9484d81dfcbd7cd4f1775 schema:familyName Todorov
68 schema:givenName Michail
69 rdf:type schema:Person
70 N12d5e08f97db47cf912b5e6bb2eef47a rdf:first sg:person.07366160356.00
71 rdf:rest N639900283cae46a4bce3caa2eaf9922b
72 N53749f68b7ae48218d2bbe4ed81a0eca rdf:first N79b722ac43d742b6a57a828edddf5008
73 rdf:rest rdf:nil
74 N639900283cae46a4bce3caa2eaf9922b rdf:first sg:person.011173106320.18
75 rdf:rest rdf:nil
76 N747ff140a5b54de4a42fddf757f48ac7 schema:name Springer Nature - SN SciGraph project
77 rdf:type schema:Organization
78 N79b722ac43d742b6a57a828edddf5008 schema:familyName Georgiev
79 schema:givenName Ivan
80 rdf:type schema:Person
81 N87a4d2fa4f8b45b5ad7bd6ce8d0ff826 schema:name doi
82 schema:value 10.1007/978-3-319-65530-7_4
83 rdf:type schema:PropertyValue
84 N8e8e9d505cc641b9801dcdaefed506e1 schema:isbn 978-3-319-65529-1
85 978-3-319-65530-7
86 schema:name Advanced Computing in Industrial Mathematics
87 rdf:type schema:Book
88 N9c9e44a1b9eb414691cbdb920ce32740 rdf:first Nd151dae8a08645dfb85027ed25de31f9
89 rdf:rest Ne22935ff198244faa2bec44991b49082
90 Na22b4ad6ebdf4961ab72675a7c0abb9b schema:name Springer Nature
91 rdf:type schema:Organisation
92 Nd151dae8a08645dfb85027ed25de31f9 schema:familyName Georgiev
93 schema:givenName Krassimir
94 rdf:type schema:Person
95 Ne22935ff198244faa2bec44991b49082 rdf:first N0ce84c8ec4a9484d81dfcbd7cd4f1775
96 rdf:rest N53749f68b7ae48218d2bbe4ed81a0eca
97 Nf06b0738998d4f1691592632382f941e schema:name dimensions_id
98 schema:value pub.1092380969
99 rdf:type schema:PropertyValue
100 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
101 schema:name Mathematical Sciences
102 rdf:type schema:DefinedTerm
103 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
104 schema:name Numerical and Computational Mathematics
105 rdf:type schema:DefinedTerm
106 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
107 schema:name Information and Computing Sciences
108 rdf:type schema:DefinedTerm
109 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
110 schema:name Computation Theory and Mathematics
111 rdf:type schema:DefinedTerm
112 sg:person.011173106320.18 schema:affiliation grid-institutes:grid.424988.b
113 schema:familyName Fidanova
114 schema:givenName Stefka
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011173106320.18
116 rdf:type schema:Person
117 sg:person.07366160356.00 schema:affiliation grid-institutes:grid.424988.b
118 schema:familyName Evtimov
119 schema:givenName Georgi
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07366160356.00
121 rdf:type schema:Person
122 grid-institutes:grid.424988.b schema:alternateName Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria
123 schema:name Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., bl. 25A, 1113, Sofia, Bulgaria
124 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...