<?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-01388530</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-03T23:22:31+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Bidirectional Preference-based Search for Multiobjective State Space Graph Problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Lucie</forename>
                <surname>Galand</surname>
              </persName>
              <email type="md5">2c4f1c8db3ba2b8789568d8971dd8df3</email>
              <email type="domain">dauphine.fr</email>
              <idno type="idhal" notation="string">lucie-galand</idno>
              <idno type="idhal" notation="numeric">743157</idno>
              <idno type="halauthorid" notation="string">31094-743157</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anisse</forename>
                <surname>Ismaili</surname>
              </persName>
              <idno type="halauthorid">943067-0</idno>
              <affiliation ref="#struct-394573"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Patrice</forename>
                <surname>Perny</surname>
              </persName>
              <email type="md5">660fbf2ed2d2fd691694f8feb494f838</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">patrice-perny</idno>
              <idno type="idhal" notation="numeric">9264</idno>
              <idno type="halauthorid" notation="string">20708-9264</idno>
              <idno type="IDREF">https://www.idref.fr/11341689X</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5741-2861</idno>
              <affiliation ref="#struct-394573"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Spanjaard</surname>
              </persName>
              <email type="md5">0806aff1987e28ac9756ab819064fc6f</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">olivier-spanjaard</idno>
              <idno type="idhal" notation="numeric">14601</idno>
              <idno type="halauthorid" notation="string">359-14601</idno>
              <idno type="IDREF">https://www.idref.fr/081158882</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9948-090X</idno>
              <affiliation ref="#struct-394573"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Paris Dauphine-PSL</forename>
                <surname>Administrateur</surname>
              </persName>
              <email type="md5">96236028a9bc00deae119f59d00ad1fd</email>
              <email type="domain">dauphine.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-12-14 16:26:59</date>
              <date type="whenModified">2025-10-16 10:42:47</date>
              <date type="whenReleased">2016-12-14 17:25:59</date>
              <date type="whenProduced">2013-07</date>
              <date type="whenEndEmbargoed">2016-10-27</date>
              <ref type="file" target="https://hal.science/hal-01388530v1/document">
                <date notBefore="2016-10-27"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-01388530v1/file/7238-30162-1-PB.pdf" id="file-1388530-1502685">
                <date notBefore="2016-10-27"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1291823">
                <persName>
                  <forename>Paris Dauphine-PSL</forename>
                  <surname>Administrateur</surname>
                </persName>
                <email type="md5">96236028a9bc00deae119f59d00ad1fd</email>
                <email type="domain">dauphine.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01388530</idno>
            <idno type="halUri">https://hal.science/hal-01388530</idno>
            <idno type="halBibtex">galand:hal-01388530</idno>
            <idno type="halRefHtml">&lt;i&gt;6th Annual Symposium on Combinatorial Search (SoCS 2013)&lt;/i&gt;, Jul 2013, Leavenworth, Washington, United States. pp.80-88</idno>
            <idno type="halRef">6th Annual Symposium on Combinatorial Search (SoCS 2013), Jul 2013, Leavenworth, Washington, United States. pp.80-88</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1388530-1502685"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-DAUPHINE">Université Paris Dauphine - Paris IX</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="LAMSADE-DAUPHINE" corresp="UNIV-DAUPHINE">LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision)</idno>
            <idno type="stamp" n="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="UNIV-DAUPHINE-PSL" corresp="PSL">Université Paris Dauphine - PSL</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <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">Bidirectional Preference-based Search for Multiobjective State Space Graph Problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lucie</forename>
                    <surname>Galand</surname>
                  </persName>
                  <email type="md5">2c4f1c8db3ba2b8789568d8971dd8df3</email>
                  <email type="domain">dauphine.fr</email>
                  <idno type="idhal" notation="string">lucie-galand</idno>
                  <idno type="idhal" notation="numeric">743157</idno>
                  <idno type="halauthorid" notation="string">31094-743157</idno>
                  <affiliation ref="#struct-989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anisse</forename>
                    <surname>Ismaili</surname>
                  </persName>
                  <idno type="halauthorid">943067-0</idno>
                  <affiliation ref="#struct-394573"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Patrice</forename>
                    <surname>Perny</surname>
                  </persName>
                  <email type="md5">660fbf2ed2d2fd691694f8feb494f838</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">patrice-perny</idno>
                  <idno type="idhal" notation="numeric">9264</idno>
                  <idno type="halauthorid" notation="string">20708-9264</idno>
                  <idno type="IDREF">https://www.idref.fr/11341689X</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5741-2861</idno>
                  <affiliation ref="#struct-394573"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Spanjaard</surname>
                  </persName>
                  <email type="md5">0806aff1987e28ac9756ab819064fc6f</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">olivier-spanjaard</idno>
                  <idno type="idhal" notation="numeric">14601</idno>
                  <idno type="halauthorid" notation="string">359-14601</idno>
                  <idno type="IDREF">https://www.idref.fr/081158882</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9948-090X</idno>
                  <affiliation ref="#struct-394573"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 6th Annual Symposium on Combinatorial Search (SoCS 2013)</title>
                <meeting>
                  <title>6th Annual Symposium on Combinatorial Search (SoCS 2013)</title>
                  <date type="start">2013-07</date>
                  <settlement>Leavenworth, Washington</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">80-88</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Preference-based search</term>
                <term xml:lang="en">Bidirectional search</term>
                <term xml:lang="en">Multiobjective search</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 multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred solutions being a subset (possibly the entire set) of Pareto optima. Standard algorithms for MOPBS perform a unidirectional search developing the search tree forward from the initial state to a goal state. Instead, in this paper, we focus on bidirectional search algorithms developing simultaneously one forward and one backward search tree. Although bi-directional search has been tested in various single objective problems, its efficiency in a multiobjective setting has never been studied. In this paper, we present several implementations of bidirectional preference-based search convenient for the multiobjective case and investigate their efficiency.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-989" status="VALID">
          <idno type="IdRef">030107156</idno>
          <idno type="ISNI">0000 0001 2097 7052</idno>
          <idno type="RNSR">201120462Y</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q3214405</idno>
          <orgName>Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision</orgName>
          <orgName type="acronym">LAMSADE</orgName>
          <desc>
            <address>
              <addrLine>Place de Lattre de Tassigny 75775 PARIS CEDEX 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lamsade.dauphine.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300302" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation name="UMR7243 / FRE3234 / UMR7024" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-394573" status="OLD">
          <orgName>DECISION</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300302" status="VALID">
          <idno type="IdRef">027787109</idno>
          <idno type="ISNI">0000000120977052</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q1546437</idno>
          <orgName>Université Paris Dauphine-PSL</orgName>
          <desc>
            <address>
              <addrLine>Place du Maréchal de Lattre de Tassigny75775 PARIS Cedex 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://dauphine.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-564132" status="VALID">
          <idno type="IdRef">241597595</idno>
          <idno type="ISNI">0000 0004 1784 3645</idno>
          <idno type="ROR">https://ror.org/013cjyk83</idno>
          <orgName>Université Paris Sciences et Lettres</orgName>
          <orgName type="acronym">PSL</orgName>
          <desc>
            <address>
              <addrLine>60 rue Mazarine 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.psl.eu/</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>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>