Essec\Faculty\Model\Contribution {#2188
#_index: "academ_contributions"
#_id: "12130"
#_source: array:26 [
"id" => "12130"
"slug" => "enhanced-branch-and-price-and-cut-for-vehicle-routing-with-split-deliveries-and-time-windows"
"yearMonth" => "2011-08"
"year" => "2011"
"title" => "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows"
"description" => "ARCHETTI, C., BOUCHARD, M. et DESAULNIERS, G. (2011). Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. <i>Transportation Science</i>, 45(3), pp. 285-298."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "BOUCHARD M."
]
2 => array:1 [
"name" => "DESAULNIERS G."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "vehicle routing"
1 => "time windows"
2 => "split deliveries"
3 => "branch and price"
4 => "valid inequalities"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://www.jstor.org/stable/23018528"
"publicationInfo" => array:3 [
"pages" => "285-298"
"volume" => "45"
"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 study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-priceand-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements."
"en" => "In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-priceand-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements."
]
"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" => "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, BOUCHARD M., DESAULNIERS G."
"docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, BOUCHARD M., DESAULNIERS G.</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2011</span>"
"keywordList" => "<a href="#">vehicle routing</a>, <a href="#">time windows</a>, <a href="#">split deliveries</a>, <a href="#">branch and price</a>, <a href="#">valid inequalities</a>"
"docPreview" => "<b>Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows</b><br><span>2011-08 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://www.jstor.org/stable/23018528" target="_blank">Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 9.058587
+"parent": null
}