2020
DOI: 10.1287/ijoc.2019.0923
|View full text |Cite
|
Sign up to set email alerts
|

Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty

Abstract: This paper studies robust variants of an extended model of the classical Heterogeneous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles with different capacities, availabilities, fixed costs and routing costs is used to serve customers with uncertain demand. This model includes, as special cases, all variants of the HVRP studied in the literature with fixed and unlimited fleet sizes, accessibility restrictions at customer locations, as well as multiple depots. Contrary to its deterministic count… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 31 publications
(15 citation statements)
references
References 42 publications
0
14
0
1
Order By: Relevance
“…Since some instances are still large, we use an ITS metaheuristic that was developed in a prior study. We refer the interested reader to [33] for the implementation details of the ITS. To justify the quality of the ITS, we compare it with the MIP in the following section.…”
Section: Design Of Experimentsmentioning
confidence: 99%
“…Since some instances are still large, we use an ITS metaheuristic that was developed in a prior study. We refer the interested reader to [33] for the implementation details of the ITS. To justify the quality of the ITS, we compare it with the MIP in the following section.…”
Section: Design Of Experimentsmentioning
confidence: 99%
“…Problem Description. HVRPUD is a variant of CVRP considering the capacity of multiple vehicles and the uncertainty of customer demand [17]. It is assumed that there is a distribution center with a known location and a group of customers with a known location.…”
Section: Heterogeneous Vrp With Uncertainmentioning
confidence: 99%
“…Subramanyam et al studied robust variants of an extended model of the classical heterogeneous vehicle routing problem (HVRP). e proposed local search is then incorporated in a modular fashion within two metaheuristic algorithms to determine robust HVRP solutions [17]. To solve the VRPUD, Sungur et al established a robust optimization model in which the uncertain demand parameter set is a convex hull set, an ellipsoid set, and a box set and solved the problem by using the duality principle [18].…”
Section: Introductionmentioning
confidence: 99%
“…This section describes an iterated tabu search metaheuristic tailored to solving large-scale REEVRP instances (e.g., with more than a thousand nodes). This approach is inspired by existing local-search-based metaheuristics for the heterogeneous VRP [Penna et al, 2013, Subramanyam et al, 2020, albeit with some important differences that exploit characteristics of the REEVRP. A key feature of this ITS approach is its simplicity because it introduces few user-defined parameters and does not require any instance-specific features to accelerate the search process.…”
Section: Iterated Tabu Search Metaheuristicmentioning
confidence: 99%