2022
DOI: 10.3390/a15080289
|View full text |Cite
|
Sign up to set email alerts
|

Biased-Randomized Discrete-Event Heuristics for Dynamic Optimization with Time Dependencies and Synchronization

Abstract: Many real-life combinatorial optimization problems are subject to a high degree of dynamism, while, simultaneously, a certain level of synchronization among agents and events is required. Thus, for instance, in ride-sharing operations, the arrival of vehicles at pick-up points needs to be synchronized with the times at which users reach these locations so that waiting times do not represent an issue. Likewise, in warehouse logistics, the availability of automated guided vehicles at an entry point needs to be s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 47 publications
0
1
0
Order By: Relevance
“…Many interactions between combinatorial analysis and modern machine and statistical learning techniques have focused on the field of combinatorial optimization [21][22][23]. These analyses have both applied learning techniques to generating heuristics or approximate solutions to difficult combinatorial problems [24][25][26][27], as well as motivating interesting new areas of combinatorial research [28]. Another recent area of interest is Graph Neural Networks [29,30] which use graph structures to better represent features in modern datasets.…”
Section: Statistical Learning and Enumerative Metrics On Treesmentioning
confidence: 99%
“…Many interactions between combinatorial analysis and modern machine and statistical learning techniques have focused on the field of combinatorial optimization [21][22][23]. These analyses have both applied learning techniques to generating heuristics or approximate solutions to difficult combinatorial problems [24][25][26][27], as well as motivating interesting new areas of combinatorial research [28]. Another recent area of interest is Graph Neural Networks [29,30] which use graph structures to better represent features in modern datasets.…”
Section: Statistical Learning and Enumerative Metrics On Treesmentioning
confidence: 99%
“…Exact approaches, as well as classic heuristics and meta-heuristics, are not usually designed for such dynamic scenarios. On the other hand, discrete-event heuristics (DEH) combine a fast heuristic algorithm with a discrete-event simulation [53]. As represented in Figure 5, while the heuristic is responsible for making decisions, the simulation updates the state of the system event by event in order to evaluate how the decisions made by the heuristic affect the overall system with all of its parallelisms, dynamism, and synchronization.…”
Section: Vrps With Synchronization Issuesmentioning
confidence: 99%