2021
DOI: 10.1016/j.cor.2021.105442
|View full text |Cite
|
Sign up to set email alerts
|

Arc routing under uncertainty: Introduction and literature review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 99 publications
0
4
0
Order By: Relevance
“…Uncertainty could also be addressed [see the review of De Maio et al. ( 2021 ) concerning other optimization problems in the transport area]. Fourth, as mentioned above, public transport strongly depends on the behavior of the passengers: the availability of a wider and more fine-grained database on the preferences of passengers could help to improve the overall model and, as a consequence, the decisions of the policymaker.…”
Section: Discussionmentioning
confidence: 99%
“…Uncertainty could also be addressed [see the review of De Maio et al. ( 2021 ) concerning other optimization problems in the transport area]. Fourth, as mentioned above, public transport strongly depends on the behavior of the passengers: the availability of a wider and more fine-grained database on the preferences of passengers could help to improve the overall model and, as a consequence, the decisions of the policymaker.…”
Section: Discussionmentioning
confidence: 99%
“…TCARP can also be seen as a particular case of CARPDD in which the arc demands and the objective function have the same time units. For a comprehensive review of the literature De Maio et al [15] summarize the methodologies used in each particular case to model ARPs and the methods used to solve the problem either exactly or using heuristics.…”
Section: Related Workmentioning
confidence: 99%
“…This occurs when input data or graph properties cannot be adequately modeled in a static or deterministic environment. The CARP can then be formulated within the frameworks of robust optimization and stochastic programming De Maio et al [15].…”
Section: The Stochastic Capacitated Arc Routing Problemmentioning
confidence: 99%
“…However, this was not the case in this study, since there is was specific set of smart bins with known locations that should have been serviced/emptied; hence, the VRP model was chosen. Moreover, in certain cases, the density of the points along a street is so large that the natural way to approach the corresponding routing problem is to adopt the ARP instead of the VRP [25]. Such cases did not apply in this study, where the locations of the bins were sparsely scattered around the city.…”
Section: Mathematical Modelingmentioning
confidence: 99%