Virgile Galle

Virgile Galle

Auto-generated profile, based on publicly available information

Virgile Galle

Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2018 in European Journal of Operational Research
Verified
Journal Article
Closed access
VGVirgile Galle
Virgile Galle
CBCynthia Barnhart
Cynthia Barnhart
PJPatrick Jaillet
Patrick Jaillet

1 June 2018 in European Journal of Operational Research
Verified
Journal Article
Closed access
VGVirgile Galle
Virgile Galle
CBCynthia Barnhart
Cynthia Barnhart
PJPatrick Jaillet
Patrick Jaillet

1 October 2018 in Transportation Science
Verified
Journal Article
Open access
VGV. Galle
V. Galle
VMV. H. Manshadi
V. H. Manshadi
SBS. Borjian Boroujeni
S. Borjian Boroujeni
CBC. Barnhart
C. Barnhart
PJP. Jaillet
P. Jaillet
The container relocation problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the assumption of knowing the full retrieval order of containers is particularly unrealistic in real operations. This paper studies the stochastic CRP, which relaxes this assumption. A new multistage stochastic model, called the batch model, is introduced, motivated, and compared with an existing model (the online model). The two main contributions are an optimal algorithm called Pruning-Best-First-Search (PBFS) and a randomized approximate algorithm called PBFS-Approximate with a bounded average error. Both algorithms, applicable in the batch and online models, are based on a new family of lower bounds for which we show some theoretical properties. Moreover, we introduce two new heuristics outperforming the best existing heuristics. Algorithms, bounds, and heuristics are tested in an extensive computational section. Finally, based on strong computational evidence, we conjecture the optimality of the “leveling” heuristic in a special “no information” case, where, at any retrieval stage, any of the remaining containers is equally likely to be retrieved next. The online appendix is available at https://doi.org/10.1287/trsc.2018.0828 .

1 November 2016 in Operations Research Letters
Verified
Journal Article
Open access
VGV. Galle
V. Galle
SBS. Borjian Boroujeni
S. Borjian Boroujeni
VMV.H. Manshadi
V.H. Manshadi
CBC. Barnhart
C. Barnhart
PJP. Jaillet
P. Jaillet