Virgile Galle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Virgile Galle has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Cynthia Barnhart
2 shared publications- Patrick Jaillet
Massachusetts Institute of Technology
2 shared publications C. Barnhart
1 shared publication- Cynthia Barnhart
Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
1 shared publication P. Jaillet
1 shared publicationPatrick Jaillet
1 shared publication
Latest Publications
- 1 November 2018
- Published by Elsevier in European Journal of Operational Research
- Vol. 271 (1) , 288-316
Yard Crane Scheduling for container storage, retrieval, and relocation
- 1 November 2018
- Published by Elsevier in European Journal of Operational Research
- Vol. 271 (1) , 288-316
Yard Crane Scheduling for container storage, retrieval, and relocation
- Open Access
- 1 October 2018
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 52 (5) , 1035-1058
The Stochastic Container Relocation Problem
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 October 2018
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 52 (5) , 1035-1058
Open AccessThe Stochastic Container Relocation Problem
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 June 2018
- Published by Elsevier in European Journal of Operational Research
- Vol. 267 (2) , 467-477
A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations
- 1 June 2018
- Published by Elsevier in European Journal of Operational Research
- Vol. 267 (2) , 467-477
A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations
- Open Access
- 1 November 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (6) , 723-728
An average-case asymptotic analysis of the Container Relocation Problem
- 1 November 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (6) , 723-728
Open AccessAn average-case asymptotic analysis of the Container Relocation Problem