Essec\Faculty\Model\Contribution {#2190`
#_index: "academ_contributions"
#_id: "12160"
#_source: array:26 [``
"id" => "12160"
"slug" => "the-directed-profitable-location-rural-postman-problem"
"yearMonth" => "2014-08"
"year" => "2014"
"title" => "The directed profitable location Rural Postman Problem"
"description" => "ARBIB, C., SERVILIO, M., ARCHETTI, C. et SPERANZA, M.G. (2014). The directed profitable location Rural Postman Problem. <i>European Journal of Operational Research</i>, 236(3), pp. 811-819."
"authors" => array:4 [``
0 => array:3 [``
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
`]
1 => array:1 [`
"name" => "ARBIB Claudio"
`]
2 => array:1 [`
"name" => "SERVILIO Mara"
`]
3 => array:1 [`
"name" => "SPERANZA Maria Grazia"
`]
]
"ouvrage" => ""
"keywords" => array:5 [`
0 => "Freight transportation"
1 => "Rural Postman Problem"
2 => "Facility location"
3 => "Arc routing with profits"
4 => "Integer programming"
`]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221713005997"
"publicationInfo" => array:3 [`
"pages" => "811-819"
"volume" => "236"
"number" => "3"
`]
"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 introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference between the profit collected along the arcs and the cost of traversing the arcs and installing the facilities. We analyze properties of the problem, present a mathematical programming formulation and a branch-and-cut algorithm. In an extensive computational experience the algorithm could solve instances with up to 140 vertices and 190 arcs and up to 50 vertices and 203 arcs."
"en" => "In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference between the profit collected along the arcs and the cost of traversing the arcs and installing the facilities. We analyze properties of the problem, present a mathematical programming formulation and a branch-and-cut algorithm. In an extensive computational experience the algorithm could solve instances with up to 140 vertices and 190 arcs and up to 50 vertices and 203 arcs."
`]
"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-19T05:21:59.000Z"
"docTitle" => "The directed profitable location Rural Postman Problem"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, ARBIB Claudio, SERVILIO Mara, SPERANZA Maria Grazia"
"docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, ARBIB Claudio, SERVILIO Mara, SPERANZA Maria Grazia</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="#">Freight transportation</a>, <a href="#">Rural Postman Problem</a>, <a href="#">Facility location</a>, <a href="#">Arc routing with profits</a>, <a href="#">Integer programming</a>"
"docPreview" => "<b>The directed profitable location Rural Postman Problem</b><br><span>2014-08 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://www.sciencedirect.com/science/article/pii/S0377221713005997" target="_blank">The directed profitable location Rural Postman Problem</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 8.774437
+"parent": null
}