<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01820897</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-20T23:07:10+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover</title>
            <author role="aut">
              <persName>
                <forename type="first">Chen</forename>
                <surname>Yan</surname>
              </persName>
              <email type="md5">7d3bb89da7a088c1f9ce177f39f6e787</email>
              <email type="domain">orange-ftgroup.com</email>
              <idno type="idhal" notation="numeric">964575</idno>
              <idno type="halauthorid" notation="string">707957-964575</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-0551-4786</idno>
              <idno type="IDREF">https://www.idref.fr/127422684</idno>
              <affiliation ref="#struct-538359"/>
              <affiliation ref="#struct-469164"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Qiqi</forename>
                <surname>Xie</surname>
              </persName>
              <idno type="halauthorid">1385543-0</idno>
              <affiliation ref="#struct-469164"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Qiulin</forename>
                <surname>Chen</surname>
              </persName>
              <idno type="halauthorid">1385544-0</idno>
              <affiliation ref="#struct-469164"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Li</forename>
                <surname>Zhang</surname>
              </persName>
              <idno type="idhal" notation="numeric">763748</idno>
              <idno type="halauthorid" notation="string">528575-763748</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0343-9476</idno>
              <affiliation ref="#struct-469164"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yaodong</forename>
                <surname>Cui</surname>
              </persName>
              <idno type="halauthorid">1385545-0</idno>
              <affiliation ref="#struct-469164"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Zuqiang</forename>
                <surname>Meng</surname>
              </persName>
              <idno type="halauthorid">1070038-0</idno>
              <affiliation ref="#struct-469164"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-06-22 10:42:40</date>
              <date type="whenModified">2026-02-19 11:06:41</date>
              <date type="whenReleased">2018-06-22 10:51:39</date>
              <date type="whenProduced">2017-10-25</date>
              <date type="whenEndEmbargoed">2020-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01820897v1/document">
                <date notBefore="2020-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01820897v1/file/978-3-319-68121-4_25_Chapter.pdf" id="file-1820897-1848477">
                <date notBefore="2020-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01820897</idno>
            <idno type="halUri">https://inria.hal.science/hal-01820897</idno>
            <idno type="halBibtex">yan:hal-01820897</idno>
            <idno type="halRefHtml">&lt;i&gt;2nd International Conference on Intelligence Science (ICIS)&lt;/i&gt;, Oct 2017, Shanghai, China. pp.234-240, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-68121-4_25"&gt;&amp;#x27E8;10.1007/978-3-319-68121-4_25&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">2nd International Conference on Intelligence Science (ICIS), Oct 2017, Shanghai, China. pp.234-240, &amp;#x27E8;10.1007/978-3-319-68121-4_25&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1820897-1848477"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-AICT" corresp="IFIP">IFIP Advances in Information and Communication Technology</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC12" corresp="IFIP-TC">TC12 - Artificial Intelligence</idno>
            <idno type="stamp" n="IFIP-AICT-510" corresp="IFIP-AICT">Intelligence Science I (ICIS 2017)</idno>
            <idno type="stamp" n="IFIP-ICIS" corresp="IFIP">International Conference on Intelligence Science</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Big Data Analysis and Machine Learning</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Chen</forename>
                    <surname>Yan</surname>
                  </persName>
                  <email type="md5">7d3bb89da7a088c1f9ce177f39f6e787</email>
                  <email type="domain">orange-ftgroup.com</email>
                  <idno type="idhal" notation="numeric">964575</idno>
                  <idno type="halauthorid" notation="string">707957-964575</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-0551-4786</idno>
                  <idno type="IDREF">https://www.idref.fr/127422684</idno>
                  <affiliation ref="#struct-538359"/>
                  <affiliation ref="#struct-469164"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Qiqi</forename>
                    <surname>Xie</surname>
                  </persName>
                  <idno type="halauthorid">1385543-0</idno>
                  <affiliation ref="#struct-469164"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Qiulin</forename>
                    <surname>Chen</surname>
                  </persName>
                  <idno type="halauthorid">1385544-0</idno>
                  <affiliation ref="#struct-469164"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Li</forename>
                    <surname>Zhang</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">763748</idno>
                  <idno type="halauthorid" notation="string">528575-763748</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0343-9476</idno>
                  <affiliation ref="#struct-469164"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yaodong</forename>
                    <surname>Cui</surname>
                  </persName>
                  <idno type="halauthorid">1385545-0</idno>
                  <affiliation ref="#struct-469164"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Zuqiang</forename>
                    <surname>Meng</surname>
                  </persName>
                  <idno type="halauthorid">1070038-0</idno>
                  <affiliation ref="#struct-469164"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">IFIP Advances in Information and Communication Technology</title>
                <meeting>
                  <title>2nd International Conference on Intelligence Science (ICIS)</title>
                  <date type="start">2017-10-25</date>
                  <date type="end">2017-10-28</date>
                  <settlement>Shanghai</settlement>
                  <country key="CN">China</country>
                </meeting>
                <editor>Zhongzhi Shi</editor>
                <editor>Ben Goertzel</editor>
                <editor>Jiali Feng</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Intelligence Science I</biblScope>
                  <biblScope unit="volume">AICT-510</biblScope>
                  <biblScope unit="pp">234-240</biblScope>
                  <date type="datePub">2017</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-68121-4_25</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Circle stock problem</term>
                <term xml:lang="en">Sequential heuristic procedure</term>
                <term xml:lang="en">Recursive algorithm</term>
                <term xml:lang="en">Standard usage leftover</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In view of the cutting stock problem of the plate fragments and scrap cannot make full use, this paper introduces the concept of standard usage leftover, uses the recursive algorithm and the sequential heuristic procedure to solve the circle cutting problem, achieving the follow-up orders specification to use the usage leftover of the previous orders. This method can make the cutting process more simple, convenient usage leftovers inventory management, as well as conform to the requirements of the blanking for a long time. Computational experimental results show that the algorithm has a high material utilization, and playing a guiding role to the actual industrial production.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 12</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-538359" status="VALID">
          <idno type="ROR">https://ror.org/049tv2d57</idno>
          <orgName>Southern University of Science and Technology</orgName>
          <orgName type="acronym">SUSTech</orgName>
          <date type="start">2019-01-11</date>
          <desc>
            <address>
              <addrLine>1088 Xueyuan Ave, Nanshan, Shenzhen, Guangdong, 518055</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">https://www.sustech.edu.cn/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-469164" status="VALID">
          <idno type="ISNI">0000 0001 2254 5798</idno>
          <idno type="ROR">https://ror.org/02c9qn167</idno>
          <idno type="Wikidata">Q1552757</idno>
          <orgName>Guangxi University [Nanning]</orgName>
          <orgName type="acronym">GXU</orgName>
          <date type="start">1928-01-01</date>
          <desc>
            <address>
              <addrLine>No.100, East Daxue Road, Xixiangtang District, Nanning, Guangxi</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">https://www.gxu.edu.cn/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>