Abstract
Constraint Programming (CP) is a very general programming paradigm that proved its efficiency on solving complex industrial problems. Most real-life problems are stochastic in nature, which is usually taken into account through different compromises, such as applying a deterministic algorithm to the average values of the input, or performing multiple runs of simulation. Our goal in this paper is to analyze different techniques taken either from practical CP applications or from stochastic optimization approaches. We propose a benchmark issued from our industrial experience, which may be described as an Online Multi-choice Knapsack with Deadlines. This benchmark is used to test a framework with four different dynamic strategies that utilize a different combination of the stochastic and combinatorial aspects of the problem. To evaluate the expected future state of the reservations at the time horizon, we either use simulation, average values, systematic study of the most probable scenarios, or yield management techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko: Approximation schemes for minimizing average weighted completion time with release dates. Proc. of the 1999 Symposium on Foundations of Computer Science (FOCS99), 1999.
A. N. Avramidis, J. R. Wilson: Integrated variance reduction strategies for simulation. Operations Research 44 (2): 327–346, 1996.
R. Bellman. Dynamic Programming. Princeton University Press, 1957.
D. P. Bertsekas, D. A. Castanon. Adaptative aggregation for infinite horizon dynamic programming. IEEE Transactions on Automatic Control, 34(6):589–598, 1989.
C. Boutilier, R. Dearden, M. Goldszmidt: Exploiting structure in policy construction. In Proceedings of the 1995 international joint conference on artificial intelligence, 1995.
J. Birge, F. Louveaux,: Introduction to Stochastic Programming Springer Series in Operations Research, 1997.
D. P. Bertsekas, J. N. Tsitsiklis: Neuro-dynamic Programming. Athena, Belmont, MA, 1996.
Y. Caseau, G. Silverstein. F. Laburthe, A Meta-Heuristic Factory for Vehicle Routing Problems, Proc. of the 5th Int. Conference on Principles and Practice of Constraint Programming CP’99, LNCS 1713, Springer, 1999.
F. D'Epenoux. A probabilistic production and inventory problem. Management Science: 10:98–108, 1963.
T. Dean, S. H. Lin. Decomposition techniques for planning in stochastic domains, In Proceedings of the 1995 international joint conference on artificial intelligence, 1995.
A. Di Pierro, H. Wiklicky: Randomised Algorithms and Probabilistic Constraint Programming Proc. of the ERCIM/Compulog Workshop on Constraints, 19–21 June, Padova, Italy, 2000.
A. Fiat, G. J. Woeginger: Online Algorithms Lecture Notes in Computer Science, vol. 1442.
J. I. McGuill, G. J. Van Ryzin Revenue Management: research overview and prospects Transportation science vol.33 n°2, may 1999.
R. A. Howard: Dynamic programming and markov Chains. MIT Press. Cambridge, 1960.
W. Harvey, M. Ginsberg: Limited Discrepancy Search. Proceedings of the 14th IJCAI, p. 607–615, Morgan Kaufmann, 1995.
L. Hall, A. S. Schulz, D. Shmoys, J. Wein: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Proc of SODA: ACM-SIAM Symposium on Discrete Algorithms, 1996.
H. J. Kushner, C. H. Chen: Decomposition of systems governed by Markov chains. IEEE transactions on Automatic Control, AC-19(5):501–507, 1974.
N. Meuleau, M. Hauskrecht, K.-E. Kim, L. Peshkin, L. P. Kaelbling, T. dean, C. Boutilier. Solving Very Large Weakly Coupled Markov Decision Processes. American Association for Artificial Intelligence, 1998.
S. Martello, P. Toth, Knapsack problems. Algorithms and computer implementations. John Wiley and Sons, West Sussex, England, 1990.
R. Parr. Flexible Decompostion Algorithms for weakly coupled Markov Decision Problems. Uncertainty in Artificial Intelligence. Madison, Wisconsin, USA, 1998
M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, 1994.
J. Papastavrou, S. Rajagopalan, A. Kleywegt: The Dynamic and Stochastic Knapsack Problem with Deadlines. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, April 1995.
S. P. Singh, D. Cohn. How to dynamically merge Markov Decision Processes. In M. Mozer, M. Jordan and T. Petsche eds, NIPS-11. MIT Press, Cambridge, 1998.
L. R. Weatherford, S. E. Bodily: A Taxonomy and Research Overview of Perishable-Asset Revenue Managment: Yield Managment, Overbooking and Pricing. Operations Research 40:831–844, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benoist, T., Bourreau, E., Caseau, Y., Rottembourg, B. (2001). Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive