Essec\Faculty\Model\Contribution {#6196
  #_index: "academ_contributions"
  #_id: "12120"
  #_source: array:25 [
    "id" => "12120"
    "slug" => "an-optimization-based-heuristic-for-the-split-delivery-vehicle-routing-problem"
    "yearMonth" => "2008-02"
    "year" => "2008"
    "title" => "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem"
    "description" => "ARCHETTI, C., SPERANZA, M.G. et SAVELSBERGH, M.W.P. (2008). An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. <i>Transportation Science</i>, 42(1), pp. 22-31."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "SPERANZA M. Grazia"
      ]
      2 => array:1 [
        "name" => "SAVELSBERGH Martin W. P."
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:4 [
      0 => "vehicle routing"
      1 => "split delivery"
      2 => "tabu search"
      3 => "integer programming"
    ]
    "updatedAt" => "2021-07-13 14:32:00"
    "publicationUrl" => "https://pubsonline.informs.org/doi/abs/10.1287/trsc.1070.0204"
    "publicationInfo" => array:3 [
      "pages" => "22-31"
      "volume" => "42"
      "number" => "1"
    ]
    "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" => "The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set."
      "en" => "The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2023-12-09T11:22:13.000Z"
    "docTitle" => "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, SPERANZA M. Grazia, SAVELSBERGH Martin W. P."
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, SPERANZA M. Grazia, SAVELSBERGH Martin W. P.</span><br><span class="document-property-authors_fields">Systèmes d’Information, Sciences de la Décision et Statistiques</span> | <span class="document-property-year">2008</span>"
    "keywordList" => "<a href="#">vehicle routing</a>, <a href="#">split delivery</a>, <a href="#">tabu search</a>, <a href="#">integer programming</a>"
    "docPreview" => "<b>An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem</b><br><span>2008-02 | Articles </span>"
    "docType" => "research"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 9.017484
  +"parent": null
}