Essec\Faculty\Model\Contribution {#6196
#_index: "academ_contributions"
#_id: "12455"
#_source: array:26 [
"id" => "12455"
"slug" => "a-dynamic-and-probabilistic-orienteering-problem"
"yearMonth" => "2021-12"
"year" => "2021"
"title" => "A dynamic and probabilistic orienteering problem"
"description" => "ANGELELLI, E., ARCHETTI, C., FILIPPI, C. et VINDIGNI, M. (2021). A dynamic and probabilistic orienteering problem. <i>Computers & Operations Research</i>, 136, pp. 105454."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "ANGELELLI Enrico"
]
2 => array:1 [
"name" => "FILIPPI Carlo"
]
3 => array:1 [
"name" => "VINDIGNI Michele"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Routing"
1 => "Heuristics"
2 => "Random requests"
3 => "Dynamic vehicle routing"
4 => "Orienteering problem"
]
"updatedAt" => "2021-09-06 16:57:31"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0305054821002069"
"publicationInfo" => array:3 [
"pages" => "105454"
"volume" => "136"
"number" => ""
]
"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" => """
We consider an online version of the orienteering problem, where stochastic service requests arise during a first time interval from customers located on the nodes of a graph. Every request must be accepted/rejected in real time. Later, a vehicle must visit the accepted customers during a second time interval.\n
We perform extensive computational tests on the proposed algorithms and discuss the pros and cons of the different methods.
"""
"en" => """
We consider an online version of the orienteering problem, where stochastic service requests arise during a first time interval from customers located on the nodes of a graph. Every request must be accepted/rejected in real time. Later, a vehicle must visit the accepted customers during a second time interval.\n
We perform extensive computational tests on the proposed algorithms and discuss the pros and cons of the different methods.
"""
]
"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-20T02:21:47.000Z"
"docTitle" => "A dynamic and probabilistic orienteering problem"
"docSurtitle" => "Articles"
"authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, ANGELELLI Enrico, FILIPPI Carlo, VINDIGNI Michele"
"docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, ANGELELLI Enrico, FILIPPI Carlo, VINDIGNI Michele</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">2021</span>"
"keywordList" => "<a href="#">Routing</a>, <a href="#">Heuristics</a>, <a href="#">Random requests</a>, <a href="#">Dynamic vehicle routing</a>, <a href="#">Orienteering problem</a>"
"docPreview" => "<b>A dynamic and probabilistic orienteering problem</b><br><span>2021-12 | Articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://www.sciencedirect.com/science/article/pii/S0305054821002069" target="_blank">A dynamic and probabilistic orienteering problem</a>"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 8.7467165
+"parent": null
}