On the optimization of pit stop strategies via dynamic programming

DOI10.1007/S10100-022-00806-4MaRDI QIDQ6100684zbMATH OpenFDO

Authors Oscar F. Carrasco Heine, Charles Thraves

Publication date 22 June 2023

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/20.500.12942/698031

zbMATH Keywords

dynamic programmingformula 1pit stoprace strategy

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Correction to: ``On the optimization of pit stop strategies via dynamic programming
• scientific article; zbMATH DE number 1054896
• A note on the optimal stopping parking problem
• Dynamic programming for optimal stopping via pseudo-regression
• scientific article; zbMATH DE number 25181
• A dynamic programming approach to distribution-constrained optimal stopping
• Dynamic programming in a nonstationary route problem
• scientific article; zbMATH DE number 3892056
• An efficient algorithm for finding optimal car-driving strategy
• scientific article; zbMATH DE number 1400162

Cites work

• A finite horizon dynamic programming model for production and repair decisions
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• Planning Formula One race strategies using discrete-event simulation

Cited in

(2)

• A novel auto-pruned ensemble clustering via SOCP
• Optimizing pit stop strategies in Formula 1 with dynamic programming and game theory

This page was built for publication: On the optimization of pit stop strategies via dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100684)