<?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-02118813</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-21T04:37:04+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Md.</forename>
                <forename type="middle">Azizur</forename>
                <surname>Rahman</surname>
              </persName>
              <email type="md5">034478bff431217d88e3136e4ed2d5ed</email>
              <email type="domain">pku.edu.cn</email>
              <idno type="idhal" notation="numeric">1046625</idno>
              <idno type="halauthorid" notation="string">1578128-1046625</idno>
              <affiliation ref="#struct-300884"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jinwen</forename>
                <surname>Ma</surname>
              </persName>
              <email type="md5">d58d17b7e7ec1e2fc40a361b1f023a31</email>
              <email type="domain">math.pku.edu.cn</email>
              <idno type="idhal" notation="numeric">1046618</idno>
              <idno type="halauthorid" notation="string">1578122-1046618</idno>
              <affiliation ref="#struct-300884"/>
            </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">2019-05-03 13:25:22</date>
              <date type="whenModified">2019-05-03 15:34:15</date>
              <date type="whenReleased">2019-05-03 15:34:15</date>
              <date type="whenProduced">2018-11-02</date>
              <date type="whenEndEmbargoed">2021-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-02118813v1/document">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02118813v1/file/474230_1_En_41_Chapter.pdf" id="file-2118813-2113760">
                <date notBefore="2021-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-02118813</idno>
            <idno type="halUri">https://inria.hal.science/hal-02118813</idno>
            <idno type="halBibtex">rahman:hal-02118813</idno>
            <idno type="halRefHtml">&lt;i&gt;2nd International Conference on Intelligence Science (ICIS)&lt;/i&gt;, Nov 2018, Beijing, China. pp.378-387, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-01313-4_41"&gt;&amp;#x27E8;10.1007/978-3-030-01313-4_41&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">2nd International Conference on Intelligence Science (ICIS), Nov 2018, Beijing, China. pp.378-387, &amp;#x27E8;10.1007/978-3-030-01313-4_41&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2118813-2113760"/></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-ICIS" corresp="IFIP">International Conference on Intelligence Science</idno>
            <idno type="stamp" n="IFIP-AICT-539" corresp="IFIP-AICT">Intelligence Science II Third IFIP TC 12 International Conference, ICIS 2018</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 6: Intelligent Robot</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">Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Md.</forename>
                    <forename type="middle">Azizur</forename>
                    <surname>Rahman</surname>
                  </persName>
                  <email type="md5">034478bff431217d88e3136e4ed2d5ed</email>
                  <email type="domain">pku.edu.cn</email>
                  <idno type="idhal" notation="numeric">1046625</idno>
                  <idno type="halauthorid" notation="string">1578128-1046625</idno>
                  <affiliation ref="#struct-300884"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jinwen</forename>
                    <surname>Ma</surname>
                  </persName>
                  <email type="md5">d58d17b7e7ec1e2fc40a361b1f023a31</email>
                  <email type="domain">math.pku.edu.cn</email>
                  <idno type="idhal" notation="numeric">1046618</idno>
                  <idno type="halauthorid" notation="string">1578122-1046618</idno>
                  <affiliation ref="#struct-300884"/>
                </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">2018-11-02</date>
                  <date type="end">2018-11-05</date>
                  <settlement>Beijing</settlement>
                  <country key="CN">China</country>
                </meeting>
                <editor>Zhongzhi Shi</editor>
                <editor>Cyriel Pennartz</editor>
                <editor>Tiejun Huang</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Intelligence Science II</biblScope>
                  <biblScope unit="volume">AICT-539</biblScope>
                  <biblScope unit="pp">378-387</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-01313-4_41</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Discrete optimization</term>
                <term xml:lang="en">Filtering proportion</term>
                <term xml:lang="en">Travelling salesman problem</term>
                <term xml:lang="en">Probe machine</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>The travelling salesman problem (TSP) is one of the NPC combinatorial optimization problems and still now it remains as an interesting and challenging problem in the field of combinatorial optimization. In this paper, we propose a consecutive route filtering approach to solving the symmetric TSP with the help of probe concept such that the worse routes are filtered out step by step by using a rigorous predesigned step proportion. In this way, it is important to set up a reasonable value of the step proportion which is needed in each step during the filtering process. Actually, our proposed algorithm is implemented on the set of symmetric TSP benchmarks with both small and large numbers of cities from the TSPLIB dataset. It is demonstrated by the experimental results that our proposed algorithm can obtain the best results in some cases and generally get the approximation results close to the best known solutions.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 12</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-300884" status="VALID">
          <idno type="ROR">https://ror.org/02v51f717</idno>
          <orgName>Peking University [Beijing]</orgName>
          <desc>
            <address>
              <addrLine>No.5 Yiheyuan Road Haidian District, Beijing, P.R.China 100871</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.pku.edu.cn/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>