Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "12162"
  #_source: array:26 [
    "id" => "12162"
    "slug" => "the-clustered-orienteering-problem"
    "yearMonth" => "2014-10"
    "year" => "2014"
    "title" => "The Clustered Orienteering Problem"
    "description" => "ANGELELLI, E., ARCHETTI, C. et VINDIGNI, M. (2014). The Clustered Orienteering Problem. <i>European Journal of Operational Research</i>, 238(2), pp. 404-414."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "ANGELELLI E."
      ]
      2 => array:1 [
        "name" => "VINDIGNI M."
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:3 [
      0 => "Orienteering Problem"
      1 => "Branch-and-cut"
      2 => "Tabu search"
    ]
    "updatedAt" => "2021-07-13 14:32:01"
    "publicationUrl" => "https://doi.org/10.1016/j.ejor.2014.04.006"
    "publicationInfo" => array:3 [
      "pages" => "404-414"
      "volume" => "238"
      "number" => "2"
    ]
    "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 a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches."
      "en" => "In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches."
    ]
    "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-18T06:22:00.000Z"
    "docTitle" => "The Clustered Orienteering Problem"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, ANGELELLI E., VINDIGNI M."
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, ANGELELLI E., VINDIGNI M.</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2014</span>"
    "keywordList" => "<a href="#">Orienteering Problem</a>, <a href="#">Branch-and-cut</a>, <a href="#">Tabu search</a>"
    "docPreview" => "<b>The Clustered Orienteering Problem</b><br><span>2014-10 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.ejor.2014.04.006" target="_blank">The Clustered Orienteering Problem</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.785142
  +"parent": null
}