A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs

Abstract : We study the uncapacitated lot-sizing problem with uncertain demand and costs. We consider a multi-stage decision process and rely on a scenario tree to represent the uncertainty. We propose to solve this stochastic combinatorial optimization problem thanks to a new extension of the stochastic dual dynamic integer programming algorithm. Our results show that this approach can provide good quality solutions in a reasonable time for large-size instances.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02421766
Contributor : Céline Gicquel <>
Submitted on : Friday, February 7, 2020 - 11:14:38 AM
Last modification on : Wednesday, February 12, 2020 - 10:48:40 PM

File

3498-Article Text-6547-1-10-20...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-02421766, version 1

Citation

Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum. A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs. 29th International Conference on Automated Planning and Scheduling ICAPS2019, Jul 2019, Berkeley, United States. pp.353-361. ⟨hal-02421766⟩

Share

Metrics

Record views

33

Files downloads

4