Essec\Faculty\Model\Contribution {#2190`
#_index: "academ_contributions"
#_id: "10695"
#_source: array:26 [``
"id" => "10695"
"slug" => "an-exact-algorithm-for-the-inventory-routing-problem-with-logistic-ratio"
"yearMonth" => "2019-11"
"year" => "2019"
"title" => "An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio"
"description" => "ARCHETTI, C., COELHO, L.C. et SPERANZA, M.G. (2019). An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio. <i>Transportation Research Part E: Logistics and Transportation Review</i>, 131, pp. 96-107."
"authors" => array:3 [``
0 => array:3 [``
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
`]
1 => array:1 [`
"name" => "COELHO Leandro C."
`]
2 => array:1 [`
"name" => "SPERANZA Maria Grazia"
`]
]
"ouvrage" => ""
"keywords" => array:3 [`
0 => "Inventory routing problem"
1 => "Logistic ratio"
2 => "Exact method"
`]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.tre.2019.09.016"
"publicationInfo" => array:3 [`
"pages" => "96-107"
"volume" => "131"
"number" => null
`]
"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" => "The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a fractional objective function. An exact algorithm is known, solving instances with up to 15 customers. We propose an iterative exact algorithm where, at each iteration, an IRP with a linear objective function is solved. Experiments show that the proposed algorithm is faster when the number of vehicles is small, solving instances with more customers and a longer planning horizon."
"en" => "The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a fractional objective function. An exact algorithm is known, solving instances with up to 15 customers. We propose an iterative exact algorithm where, at each iteration, an IRP with a linear objective function is solved. Experiments show that the proposed algorithm is faster when the number of vehicles is small, solving instances with more customers and a longer planning horizon."
`]
"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-19T07:22:02.000Z"
"docTitle" => "An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, COELHO Leandro C., SPERANZA Maria Grazia"
"docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, COELHO Leandro C., SPERANZA Maria Grazia</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2019</span>"
"keywordList" => "<a href="#">Inventory routing problem</a>, <a href="#">Logistic ratio</a>, <a href="#">Exact method</a>"
"docPreview" => "<b>An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio</b><br><span>2019-11 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1016/j.tre.2019.09.016" target="_blank">An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 9.100971
+"parent": null
}