Essec\Faculty\Model\Contribution {#6196
  #_index: "academ_contributions"
  #_id: "12139"
  #_source: array:25 [
    "id" => "12139"
    "slug" => "optimal-solutions-for-routing-problems-with-profits"
    "yearMonth" => "2013-03"
    "year" => "2013"
    "title" => "Optimal solutions for routing problems with profits"
    "description" => "ARCHETTI, C., BIANCHESSI, N. et SPERANZA, M.G. (2013). Optimal solutions for routing problems with profits. <i>Discrete Applied Mathematics</i>, 161(4-5), pp. 547-557."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "BIANCHESSI N."
      ]
      2 => array:1 [
        "name" => "SPERANZA M.G."
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:6 [
      0 => "Routing"
      1 => "Profits"
      2 => "Branch-and-price"
      3 => "Heuristic"
      4 => "Capacitated Team Orienteering Problem"
      5 => "Capacitated Profitable Tour Problem"
    ]
    "updatedAt" => "2021-07-13 14:32:00"
    "publicationUrl" => "https://doi.org/10.1016/j.dam.2011.12.021"
    "publicationInfo" => array:3 [
      "pages" => "547-557"
      "volume" => "161"
      "number" => "4-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 present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality."
      "en" => "In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality."
    ]
    "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-10T22:22:14.000Z"
    "docTitle" => "Optimal solutions for routing problems with profits"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, BIANCHESSI N., SPERANZA M.G."
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, BIANCHESSI N., SPERANZA M.G.</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">2013</span>"
    "keywordList" => "<a href="#">Routing</a>, <a href="#">Profits</a>, <a href="#">Branch-and-price</a>, <a href="#">Heuristic</a>, <a href="#">Capacitated Team Orienteering Problem</a>, <a href="#">Capacitated Profitable Tour Problem</a>"
    "docPreview" => "<b>Optimal solutions for routing problems with profits</b><br><span>2013-03 | Articles </span>"
    "docType" => "research"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 9.017484
  +"parent": null
}