Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "12189"
  #_source: array:26 [
    "id" => "12189"
    "slug" => "the-split-delivery-vehicle-routing-problem-a-survey"
    "yearMonth" => "2008-01"
    "year" => "2008"
    "title" => "The split delivery vehicle routing problem: a survey"
    "description" => "ARCHETTI, C. et M. GRAZIA SPERANZA, M.G. (2008). The split delivery vehicle routing problem: a survey. Dans: Golden B., Raghavan S., Wasil E. eds. <i>The Vehicle Routing Problem: Latest Advances and New Challenges</i>. 1st ed. Boston: Springer, pp. 103-122."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "M. GRAZIA SPERANZA M. Grazia"
      ]
    ]
    "ouvrage" => "The Vehicle Routing Problem: Latest Advances and New Challenges"
    "keywords" => array:3 [
      0 => "Split Delivery Vehicle Routing Problem"
      1 => "Survey"
      2 => "Computational Complexity  -Algorithms"
    ]
    "updatedAt" => "2021-02-11 10:09:54"
    "publicationUrl" => "https://doi.org/10.1007/978-0-387-77778-8_5"
    "publicationInfo" => array:3 [
      "pages" => "103-122"
      "volume" => "43"
      "number" => ""
    ]
    "type" => array:2 [
      "fr" => "Chapitres"
      "en" => "Book chapters"
    ]
    "support_type" => array:2 [
      "fr" => "Editeur"
      "en" => "Publisher"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this chapter we present a survey of the state-of-the-art on the SDVRP."
      "en" => "In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this chapter we present a survey of the state-of-the-art on the SDVRP."
    ]
    "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-18T23:22:03.000Z"
    "docTitle" => "The split delivery vehicle routing problem: a survey"
    "docSurtitle" => "Book chapters"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, M. GRAZIA SPERANZA M. Grazia"
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, M. GRAZIA SPERANZA M. Grazia</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2008</span>"
    "keywordList" => "<a href="#">Split Delivery Vehicle Routing Problem</a>, <a href="#">Survey</a>, <a href="#">Computational Complexity  -Algorithms</a>"
    "docPreview" => "<b>The split delivery vehicle routing problem: a survey</b><br><span>2008-01 | Book chapters </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1007/978-0-387-77778-8_5" target="_blank">The split delivery vehicle routing problem: a survey</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.563771
  +"parent": null
}