Essec\Faculty\Model\Contribution {#6196
  #_index: "academ_contributions"
  #_id: "12191"
  #_source: array:25 [
    "id" => "12191"
    "slug" => "vehicle-routing-problems-with-profits"
    "yearMonth" => "2014-01"
    "year" => "2014"
    "title" => "Vehicle routing problems with profits"
    "description" => "ARCHETTI, C., SPERANZA, M.G. et VIGO, D. (2014). Vehicle routing problems with profits. Dans: Paolo Toth, Daniele Vigo eds. <i>Vehicle Routing: Problems, Methods, and Applications</i>. 2nd ed. Philadelphia: SIAM, pp. 273-298."
    "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" => "VIGO Daniele"
      ]
    ]
    "ouvrage" => "Vehicle Routing: Problems, Methods, and Applications"
    "keywords" => []
    "updatedAt" => "2021-02-11 10:25:24"
    "publicationUrl" => "https://epubs.siam.org/doi/abs/10.1137/1.9781611973594.ch10"
    "publicationInfo" => array:3 [
      "pages" => "273-298"
      "volume" => ""
      "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" => "The key characteristic of the class of Vehicle Routing Problems with Profits (VRPPs) is that, contrary to what happens for the most classical vehicle routing problems, the set of customers to serve is not given. Therefore, two different decisions have to be taken: (i) which customers to serve, and (ii) how to cluster the customers to be served in different routes (if more than one) and order the visits in each route. In general, a profit is associated with each customer that makes such a customer more or less attractive. Thus, any route or set of routes, starting and ending at a given depot, can be measured both in terms of cost and in terms of profit. The difference between route profit and cost may be maximized, or the profit or the cost optimized with the other measure bounded in a constraint."
      "en" => "The key characteristic of the class of Vehicle Routing Problems with Profits (VRPPs) is that, contrary to what happens for the most classical vehicle routing problems, the set of customers to serve is not given. Therefore, two different decisions have to be taken: (i) which customers to serve, and (ii) how to cluster the customers to be served in different routes (if more than one) and order the visits in each route. In general, a profit is associated with each customer that makes such a customer more or less attractive. Thus, any route or set of routes, starting and ending at a given depot, can be measured both in terms of cost and in terms of profit. The difference between route profit and cost may be maximized, or the profit or the cost optimized with the other measure bounded in a constraint."
    ]
    "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-10T23:22:14.000Z"
    "docTitle" => "Vehicle routing problems with profits"
    "docSurtitle" => "Chapitres"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, SPERANZA M. Grazia, VIGO Daniele"
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, SPERANZA M. Grazia, VIGO Daniele</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">2014</span>"
    "keywordList" => ""
    "docPreview" => "<b>Vehicle routing problems with profits</b><br><span>2014-01 | Chapitres </span>"
    "docType" => "research"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.847877
  +"parent": null
}