A matheuristic for the asymmetric capacitated vehicle routing problem
المؤلف | Leggieri V. |
المؤلف | Haouari M. |
تاريخ الإتاحة | 2020-02-05T08:53:38Z |
تاريخ النشر | 2018 |
اسم المنشور | Discrete Applied Mathematics |
المصدر | Scopus |
الرقم المعياري الدولي للكتاب | 0166218X |
الملخص | In this paper, we propose a novel matheuristic for the Asymmetric Capacitated Vehicle Routing Problem (ACVRP). This optimization-based approach combines some heuristic concepts with compact mixed-integer linear programming (MILP) formulations. Basically, the proposed matheuristic includes three sequential stages. First, the problem size is heuristically reduced by discarding unpromising arcs. Second, a starting feasible solution is derived. Finally, an optimization-based improvement procedure is invoked to iteratively generate near-optimal solutions. This latter procedure requires solving a sequence of two- or three-vehicle ACVRP reduced instances. A peculiar feature of the solution strategy is that all the three stages are solely based on solving compact MILP formulations using a commercial solver and it does not resort to any constructive heuristic nor metaheuristic. We describe the results of extensive computational experiments, that were carried out on a large set of benchmark instances with up to 200 nodes, and we provide empirical evidence that the proposed matheuristic often delivers high-quality solutions. 2016 |
اللغة | en |
الناشر | Elsevier B.V. |
الموضوع | Asymmetric capacitated vehicle routing problem Compact MILP formulations Matheuristic |
النوع | Article |
الصفحات | 139-150 |
رقم المجلد | 234 |
تحقق من خيارات الوصول
الملفات في هذه التسجيلة
الملفات | الحجم | الصيغة | العرض |
---|---|---|---|
لا توجد ملفات لها صلة بهذه التسجيلة. |
هذه التسجيلة تظهر في المجموعات التالية
-
الهندسة الميكانيكية والصناعية [1343 items ]