<?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-00678520</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-25T02:00:04+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Heuristic for the preemptive asymmetric stacker crane problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Hervé</forename>
                <surname>Kerivin</surname>
              </persName>
              <email type="md5">f7b66b25ae6ead1b6648f9e7a7c24784</email>
              <email type="domain">uca.fr</email>
              <idno type="idhal" notation="string">herve-kerivin</idno>
              <idno type="idhal" notation="numeric">746928</idno>
              <idno type="halauthorid" notation="string">339323-746928</idno>
              <idno type="IDREF">https://www.idref.fr/186151586</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1694-7640</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mathieu</forename>
                <surname>Lacroix</surname>
              </persName>
              <email type="md5">f5f1aaefd65b8613e9ed890019d8e347</email>
              <email type="domain">lipn.univ-paris13.fr</email>
              <idno type="idhal" notation="string">mathieu-lacroix</idno>
              <idno type="idhal" notation="numeric">741352</idno>
              <idno type="halauthorid" notation="string">19828-741352</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8385-3890</idno>
              <idno type="IDREF">https://www.idref.fr/235318655</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alain</forename>
                <surname>Quilliot</surname>
              </persName>
              <idno type="halauthorid">622552-0</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hélène</forename>
                <surname>Toussaint</surname>
              </persName>
              <email type="md5">776ce73d9f96872049c22b35613ab552</email>
              <email type="domain">isima.fr</email>
              <idno type="idhal" notation="string">helene-toussaint</idno>
              <idno type="idhal" notation="numeric">17693</idno>
              <idno type="halauthorid" notation="string">14704-17693</idno>
              <idno type="ORCID">https://orcid.org/0009-0008-5178-5860</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Bastien</forename>
                <surname>DOREAU</surname>
              </persName>
              <email type="md5">209201e43fe204bc49f2e72efa688459</email>
              <email type="domain">isima.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2012-03-13 11:15:09</date>
              <date type="whenWritten">2009-02-09</date>
              <date type="whenModified">2025-08-12 15:44:41</date>
              <date type="whenReleased">2012-03-13 11:38:37</date>
              <date type="whenProduced">2010-08-01</date>
              <date type="whenEndEmbargoed">2012-03-13</date>
              <ref type="file" target="https://hal.science/hal-00678520v1/document">
                <date notBefore="2012-03-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00678520v1/file/RR-09-01b.pdf" id="file-678520-712980">
                <date notBefore="2012-03-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="533750">
                <persName>
                  <forename>Bastien</forename>
                  <surname>DOREAU</surname>
                </persName>
                <email type="md5">209201e43fe204bc49f2e72efa688459</email>
                <email type="domain">isima.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00678520</idno>
            <idno type="halUri">https://hal.science/hal-00678520</idno>
            <idno type="halBibtex">kerivin:hal-00678520</idno>
            <idno type="halRefHtml">&lt;i&gt;Electronic Notes in Discrete Mathematics&lt;/i&gt;, 2010, 36, pp.Pages 41-48. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.endm.2010.05.006"&gt;&amp;#x27E8;10.1016/j.endm.2010.05.006&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Electronic Notes in Discrete Mathematics, 2010, 36, pp.Pages 41-48. &amp;#x27E8;10.1016/j.endm.2010.05.006&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-678520-712980"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-CLERMONT1" corresp="PRES_CLERMONT">Université d'Auvergne - Clermont-Ferrand I</idno>
            <idno type="stamp" n="UNIV-BPCLERMONT" corresp="PRES_CLERMONT">Université Blaise Pascal - Clermont-Ferrand II</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Heuristic for the preemptive asymmetric stacker crane problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Hervé</forename>
                    <surname>Kerivin</surname>
                  </persName>
                  <email type="md5">f7b66b25ae6ead1b6648f9e7a7c24784</email>
                  <email type="domain">uca.fr</email>
                  <idno type="idhal" notation="string">herve-kerivin</idno>
                  <idno type="idhal" notation="numeric">746928</idno>
                  <idno type="halauthorid" notation="string">339323-746928</idno>
                  <idno type="IDREF">https://www.idref.fr/186151586</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1694-7640</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mathieu</forename>
                    <surname>Lacroix</surname>
                  </persName>
                  <email type="md5">f5f1aaefd65b8613e9ed890019d8e347</email>
                  <email type="domain">lipn.univ-paris13.fr</email>
                  <idno type="idhal" notation="string">mathieu-lacroix</idno>
                  <idno type="idhal" notation="numeric">741352</idno>
                  <idno type="halauthorid" notation="string">19828-741352</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8385-3890</idno>
                  <idno type="IDREF">https://www.idref.fr/235318655</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alain</forename>
                    <surname>Quilliot</surname>
                  </persName>
                  <idno type="halauthorid">622552-0</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hélène</forename>
                    <surname>Toussaint</surname>
                  </persName>
                  <email type="md5">776ce73d9f96872049c22b35613ab552</email>
                  <email type="domain">isima.fr</email>
                  <idno type="idhal" notation="string">helene-toussaint</idno>
                  <idno type="idhal" notation="numeric">17693</idno>
                  <idno type="halauthorid" notation="string">14704-17693</idno>
                  <idno type="ORCID">https://orcid.org/0009-0008-5178-5860</idno>
                  <affiliation ref="#struct-857"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">RR-09-01</idno>
                <idno type="halJournalId" status="VALID">114022</idno>
                <idno type="issn">1571-0653</idno>
                <title level="j">Electronic Notes in Discrete Mathematics</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">36</biblScope>
                  <biblScope unit="pp">Pages 41-48</biblScope>
                  <date type="datePub">2010-08-01</date>
                  <date type="dateEpub">2010-07-17</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.endm.2010.05.006</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">preemptive asymmetric stacker crane problem</term>
                <term xml:lang="en">reloads</term>
                <term xml:lang="en">routing</term>
                <term xml:lang="en">local search</term>
                <term xml:lang="en">heuristic design</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, we deal with the preemptive asymmetric stacker crane problem in an heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation a simple, efficient local search heuristic, as well as an original LIP model. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and at evaluating the impact of the preemption hypothesis.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-857" status="OLD">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2000-01-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>Bât ISIMA Campus des Cézeaux BP 10025 63173 AUBIERE cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.isima.fr/limos/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158 / FRE2239" active="#struct-205618" type="direct"/>
            <relation active="#struct-300267" type="direct"/>
            <relation active="#struct-322672" type="direct"/>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-205618" status="OLD">
          <orgName>Université Blaise Pascal - Clermont-Ferrand 2</orgName>
          <orgName type="acronym">UBP</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>34, avenue Carnot - BP 185 / 63006 Clermont-Ferrand cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-bpclermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300267" status="OLD">
          <orgName>Université d'Auvergne - Clermont-Ferrand I</orgName>
          <orgName type="acronym">UdA</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>49, Boulevard François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-clermont1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-322672" status="OLD">
          <orgName>SIGMA Clermont</orgName>
          <orgName type="acronym">SIGMA Clermont</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>SIGMA Clermont / Campus des Cézeaux  / CS 20265 / 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sigma-clermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>