Essec\Faculty\Model\Contribution {#2216
  #_index: "academ_contributions"
  #_id: "12096"
  #_source: array:26 [
    "id" => "12096"
    "slug" => "an-exact-method-for-assortment-optimization-under-the-nested-logit-model"
    "yearMonth" => "2021-06"
    "year" => "2021"
    "title" => "An Exact Method for Assortment Optimization under the Nested Logit Model"
    "description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2021). An Exact Method for Assortment Optimization under the Nested Logit Model. <i>European Journal of Operational Research</i>, 291(3), pp. 830-845."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
      1 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      2 => array:1 [
        "name" => "HASSANZADEH Alborz"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:2 [
      0 => "combinatorial optimization"
      1 => "revenue management -assortment optimization -fractional programming -nested logit"
    ]
    "updatedAt" => "2021-09-24 10:33:27"
    "publicationUrl" => "https://doi.org/10.1016/j.ejor.2020.12.007"
    "publicationInfo" => array:3 [
      "pages" => "830-845"
      "volume" => "291"
      "number" => "3"
    ]
    "type" => array:2 [
      "fr" => "Articles"
      "en" => "Journal articles"
    ]
    "support_type" => array:2 [
      "fr" => "Revue scientifique"
      "en" => "Scientific journal"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => """
        We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n
        programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n
        Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one.
        """
      "en" => """
        We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n
        programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n
        Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one.
        """
    ]
    "authors_fields" => array:2 [
      "fr" => "Management des opérations"
      "en" => "Operations Management"
    ]
    "indexedAt" => "2024-12-03T16:21:42.000Z"
    "docTitle" => "An Exact Method for Assortment Optimization under the Nested Logit Model"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, <a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, HASSANZADEH Alborz"
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, LJUBIC Ivana, HASSANZADEH Alborz</span><br><span class="document-property-authors_fields">Operations Management</span> | <span class="document-property-year">2021</span>"
    "keywordList" => "<a href="#">combinatorial optimization</a>, <a href="#">revenue management -assortment optimization -fractional programming -nested logit</a>"
    "docPreview" => "<b>An Exact Method for Assortment Optimization under the Nested Logit Model</b><br><span>2021-06 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.ejor.2020.12.007" target="_blank">An Exact Method for Assortment Optimization under the Nested Logit Model</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.422003
  +"parent": null
}