Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "12129"
  #_source: array:26 [
    "id" => "12129"
    "slug" => "complexity-of-the-vrp-and-sdvrp"
    "yearMonth" => "2011-08"
    "year" => "2011"
    "title" => "Complexity of the VRP and SDVRP"
    "description" => "ARCHETTI, C., FEILLET, D., GENDREAU, M. et SPERANZA, M.G. (2011). Complexity of the VRP and SDVRP. <i>Transportation Research Part C: Emerging Technologies</i>, 19(5), pp. 741-750."
    "authors" => array:4 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "FEILLET Dominique"
      ]
      2 => array:1 [
        "name" => "GENDREAU Michel"
      ]
      3 => array:1 [
        "name" => "SPERANZA Maria Grazia"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:5 [
      0 => "Vehicle routing problem"
      1 => "Split delivery vehicle routing problem"
      2 => "Computational complexity on line"
      3 => "TreeStar"
      4 => "Circle"
    ]
    "updatedAt" => "2021-07-13 14:32:00"
    "publicationUrl" => "https://doi.org/10.1016/j.trc.2009.12.006"
    "publicationInfo" => array:3 [
      "pages" => "741-750"
      "volume" => "19"
      "number" => "5"
    ]
    "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" => "In this paper we study the computational complexity of the vehicle routing problem (VRP) and of the split delivery vehicle routing problem (SDVRP) on some special classes of instances, characterized by special structures of the underlying graph, namely a line, a star, a tree and a circle. We both study the problems in the case of unlimited fleet (UF) and under the constraint that a limited fleet is available (LF)."
      "en" => "In this paper we study the computational complexity of the vehicle routing problem (VRP) and of the split delivery vehicle routing problem (SDVRP) on some special classes of instances, characterized by special structures of the underlying graph, namely a line, a star, a tree and a circle. We both study the problems in the case of unlimited fleet (UF) and under the constraint that a limited fleet is available (LF)."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-04-18T21:22:06.000Z"
    "docTitle" => "Complexity of the VRP and SDVRP"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, FEILLET Dominique, GENDREAU Michel, SPERANZA Maria Grazia"
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, FEILLET Dominique, GENDREAU Michel, SPERANZA Maria Grazia</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2011</span>"
    "keywordList" => "<a href="#">Vehicle routing problem</a>, <a href="#">Split delivery vehicle routing problem</a>, <a href="#">Computational complexity on line</a>, <a href="#">TreeStar</a>, <a href="#">Circle</a>"
    "docPreview" => "<b>Complexity of the VRP and SDVRP</b><br><span>2011-08 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.trc.2009.12.006" target="_blank">Complexity of the VRP and SDVRP</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.622849
  +"parent": null
}