2020
DOI: 10.1007/s10898-020-00910-2
|View full text |Cite
|
Sign up to set email alerts
|

GRASP with Variable Neighborhood Descent for the online order batching problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 13 publications
(1 citation statement)
references
References 42 publications
0
1
0
Order By: Relevance
“…With the aim of reducing the required computing time, we consider a GRASP, combining good heuristic solutions that are quickly generated and an efficient local search method which minimizes the number of Monte Carlo evaluations to further improve the initial solution. The use of GRASP in Graph Theory and Network Science has led to several successful research in the last years (Pérez-Peló et al 2019Gil-Borrás et al 2020).…”
Section: Literature Reviewmentioning
confidence: 99%
“…With the aim of reducing the required computing time, we consider a GRASP, combining good heuristic solutions that are quickly generated and an efficient local search method which minimizes the number of Monte Carlo evaluations to further improve the initial solution. The use of GRASP in Graph Theory and Network Science has led to several successful research in the last years (Pérez-Peló et al 2019Gil-Borrás et al 2020).…”
Section: Literature Reviewmentioning
confidence: 99%