Academic Bibliography

 Search 200 years of publications by Ghent University researchers.
Advanced search
2 files | 4.31 MB
Add to list
  1. Search results
  2. The dynamic stochastic container dray...

The dynamic stochastic container drayage problem with truck appointment scheduling

Kenneth Stoop (UGent) , Mario Pickavet (UGent) , Didier Colle (UGent) and P. Audenaert (UGent)
(2024) OR SPECTRUM. 46(3). p.953-985
Author
Organization
Project
Abstract
In this work, a stochastic dynamic version of the container drayage problem is studied. The presented model incorporates uncertainty in the form of stochastic loading and unloading times at both terminals and customers, as well as stochastic travel times, conditionally dependent upon the departure time, allowing robust planning with respect to varying processing times. Moreover, the presented model is dynamic, allowing flexible orders and having the capability of re-solving the optimization problem in case of last-minute orders. Finally, the model also incorporates a truck appointment system operating at each terminal. First, a description of the general model is given, which amounts to a mixed integer non-linear program. In order to efficiently solve the optimization problem, and linearize both the objective and the conditional chance constraints, it is reformulated based on time window partitioning, yielding a purely integer linear program. As a test case, a large road carrier operating in the port of Antwerp is considered. We demonstrate that the model is efficiently solvable, even for instances of up to 300 orders. Moreover, the impact of incorporating stochastic information is clearly illustrated.
Keywords
Container drayage problem, Truck appointment scheduling, Real-time, Stochastic, Routing optimization, OPTIMIZATION, OPERATIONS, ALGORITHM, PICKUP

Downloads

  • Download
    8528 acc.pdf
    • full text (Accepted manuscript)
    • |
    • open access
    • |
    • PDF
    • |
    • 1.75 MB
  • Download
    (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 2.56 MB

Citation

Please use this url to cite or link to this publication:

MLA
Stoop, Kenneth, et al. “The Dynamic Stochastic Container Drayage Problem with Truck Appointment Scheduling.” OR SPECTRUM, vol. 46, no. 3, 2024, pp. 953–85, doi:10.1007/s00291-024-00762-2.
APA
Stoop, K., Pickavet, M., Colle, D., & Audenaert, P. (2024). The dynamic stochastic container drayage problem with truck appointment scheduling. OR SPECTRUM, 46(3), 953–985. https://doi.org/10.1007/s00291-024-00762-2
Chicago author-date
Stoop, Kenneth, Mario Pickavet, Didier Colle, and P. Audenaert. 2024. “The Dynamic Stochastic Container Drayage Problem with Truck Appointment Scheduling.” OR SPECTRUM 46 (3): 953–85. https://doi.org/10.1007/s00291-024-00762-2.
Chicago author-date (all authors)
Stoop, Kenneth, Mario Pickavet, Didier Colle, and P. Audenaert. 2024. “The Dynamic Stochastic Container Drayage Problem with Truck Appointment Scheduling.” OR SPECTRUM 46 (3): 953–985. doi:10.1007/s00291-024-00762-2.
Vancouver
1.
Stoop K, Pickavet M, Colle D, Audenaert P. The dynamic stochastic container drayage problem with truck appointment scheduling. OR SPECTRUM. 2024;46(3):953–85.
IEEE
[1]
K. Stoop, M. Pickavet, D. Colle, and P. Audenaert, “The dynamic stochastic container drayage problem with truck appointment scheduling,” OR SPECTRUM, vol. 46, no. 3, pp. 953–985, 2024.
@article{01HX6JQF405JBMEG7HS50NMVSZ,
  abstract     = {{In this work, a stochastic dynamic version of the container drayage problem is studied. The presented model incorporates uncertainty in the form of stochastic loading and unloading times at both terminals and customers, as well as stochastic travel times, conditionally dependent upon the departure time, allowing robust planning with respect to varying processing times. Moreover, the presented model is dynamic, allowing flexible orders and having the capability of re-solving the optimization problem in case of last-minute orders. Finally, the model also incorporates a truck appointment system operating at each terminal. First, a description of the general model is given, which amounts to a mixed integer non-linear program. In order to efficiently solve the optimization problem, and linearize both the objective and the conditional chance constraints, it is reformulated based on time window partitioning, yielding a purely integer linear program. As a test case, a large road carrier operating in the port of Antwerp is considered. We demonstrate that the model is efficiently solvable, even for instances of up to 300 orders. Moreover, the impact of incorporating stochastic information is clearly illustrated.}},
  author       = {{Stoop, Kenneth and Pickavet, Mario and Colle, Didier and Audenaert, P.}},
  issn         = {{0171-6468}},
  journal      = {{OR SPECTRUM}},
  keywords     = {{Container drayage problem,Truck appointment scheduling,Real-time,Stochastic,Routing optimization,OPTIMIZATION,OPERATIONS,ALGORITHM,PICKUP}},
  language     = {{eng}},
  number       = {{3}},
  pages        = {{953--985}},
  title        = {{The dynamic stochastic container drayage problem with truck appointment scheduling}},
  url          = {{http://doi.org/10.1007/s00291-024-00762-2}},
  volume       = {{46}},
  year         = {{2024}},
}
Altmetric
View in Altmetric
Web of Science
Times cited: