2019
DOI: 10.1016/j.eswa.2018.10.036
|View full text |Cite
|
Sign up to set email alerts
|

Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 45 publications
(32 citation statements)
references
References 36 publications
0
32
0
Order By: Relevance
“…For the innovation of the modeling process, a matching network based on memory and attention is proposed, which makes it possible to learn quickly. For the innovation of the training process, this work is based on a principle of traditional ML, that is training and testing are to be carried out under the same conditions [35]- [36]. It is proposed that the network should constantly look at the insufficient samples of each type during training, which will be consistent with the testing process.…”
Section: Matching Networkmentioning
confidence: 99%
“…For the innovation of the modeling process, a matching network based on memory and attention is proposed, which makes it possible to learn quickly. For the innovation of the training process, this work is based on a principle of traditional ML, that is training and testing are to be carried out under the same conditions [35]- [36]. It is proposed that the network should constantly look at the insufficient samples of each type during training, which will be consistent with the testing process.…”
Section: Matching Networkmentioning
confidence: 99%
“…Nevertheless, the greedy heuristic may yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. This algorithm has been applied to VRPs in various domains, such as cumulative capacitated VRPs, 39 robust stochastic vehicle routing and scheduling for bushfire emergency evacuation, 40 selecting metaheuristics for solving VRPs with time windows via meta-learning, 41 rebalancing bike-sharing systems, 42 and other similar domains. [27][28][29][43][44][45][46] However, it has not been utilized for UAV routing in real-estate sector, which is targeted in the current study.…”
Section: Uav Routing Problems and Key Algorithmsmentioning
confidence: 99%
“…e metalearning field is also known as "learning to learn" [22] and it brings systems that can help by searching patterns across different tasks to control the process of exploiting cumulative expertise. e metalearning concept has been present in the field of heuristics and metaheuristics for TSP [23], the quadratic assignment problem, and hyperheuristics.…”
Section: Metalearningmentioning
confidence: 99%
“…On the other hand, Gutierrez-Rodríguez et al [23] used VRP with time windows and proposed a methodology based on metalearning to select the best metaheuristic for each instance. Besides, their proposal shared and exploited an offline scheme for the instant solutions of academies and industry.…”
Section: Metalearningmentioning
confidence: 99%