Essec\Faculty\Model\Contribution {#2188
#_index: "academ_contributions"
#_id: "12122"
#_source: array:26 [
"id" => "12122"
"slug" => "the-capacitated-team-orienteering-and-profitable-tour-problems"
"yearMonth" => "2009-06"
"year" => "2009"
"title" => "The capacitated team orienteering and profitable tour problems"
"description" => "ARCHETTI, C., FEILLET, D., HERTZ, A. et SPERANZA, M.G. (2009). The capacitated team orienteering and profitable tour problems. <i>Journal of the Operational Research Society</i>, 60(6), pp. 831-842."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "FEILLET D"
]
2 => array:1 [
"name" => "HERTZ A"
]
3 => array:1 [
"name" => "SPERANZA M G"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "team orienteering problem"
1 => "profitable tour problem"
2 => "column generation"
3 => "branch and price"
4 => "tabu search"
5 => "variable neighbourhood search"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1057/palgrave.jors.2602603"
"publicationInfo" => array:3 [
"pages" => "831-842"
"volume" => "60"
"number" => "6"
]
"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 the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors."
"en" => "In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors."
]
"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-08-14T15:22:03.000Z"
"docTitle" => "The capacitated team orienteering and profitable tour problems"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, FEILLET D, HERTZ A, SPERANZA M G"
"docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, FEILLET D, HERTZ A, SPERANZA M G</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2009</span>"
"keywordList" => "<a href="#">team orienteering problem</a>, <a href="#">profitable tour problem</a>, <a href="#">column generation</a>, <a href="#">branch and price</a>, <a href="#">tabu search</a>, <a href="#">variable neighbourhood search</a>"
"docPreview" => "<b>The capacitated team orienteering and profitable tour problems</b><br><span>2009-06 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1057/palgrave.jors.2602603" target="_blank">The capacitated team orienteering and profitable tour problems</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 9.058587
+"parent": null
}