Online Knapsack Problem with Items Delay

Hajer Ben-Romdhane, Saoussen Krichen

2014

Abstract

We address in this paper a special case of the online knapsack problem (OKP) that considers a number of items arriving sequentially over time without any prior information about their features. As items features are not known in advance but revealed at their arrival, we allow the decision maker to delay his decision about incoming items (to select the current item or reject it) until observing the next ones. The main objective in this problem is to load the best subset of items that maximizes the expected value of the total reward without exceeding the knapsack capacity. The selection process can be stopped before observing all items if the capacity constraint is exhausted. To solve this problem, we propose an exact solution approach that decomposes the original problem dynamically and incorporates a stopping rule in order to decide whether to load or not each new incoming item. We illustrate the proposed approach by numerical experimentations and compare the obtained results for different utility functions using performance measures. We discuss thereafter the effect of the decision maker’s utility function and his readiness to take risks over the final solution.

References

  1. Aggarwal, G. and Hartline, J. D. (2006). Knapsack auctions. In SODA 7806: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 1083-1092. ACM.
  2. Albers, S. (2003). Online algorithms: a survey. Mathematical Programming, 97(1-2):3-26.
  3. Babaioff, M., Immorlica, N., Kempe, D., and Kleinberg, R. (2007). A knapsack secretary problem with applications. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 4627 of Lecture Notes in Computer Science, pages 16-28.
  4. Gilbert, J. and Mosteller, F. (2006). Recognizing the maximum of a sequence. In Selected Papers of Frederick Mosteller, Springer Series in Statistics, pages 355- 398.
  5. Han, X. and Makino, K. (2009). Online knapsack problems with limited cuts. In Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 341-351. Springer Berlin Heidelberg.
  6. Iwama, K. and Taketomi, S. (2002). Removable online knapsack problems. In Automata, Languages and Programming, Lecture Notes in Computer Science, pages 293-305. Springer Berlin Heidelberg.
  7. Iwama, K. and Zhang, G. (2010). Online knapsack with resource augmentation. Inf. Process. Lett., pages 1016- 1020.
  8. Kleywegt, A. J. and Papastavrou, J. D. (1998). The dynamic and stochastic knapsack problem. Operations Research, 46:17-35.
  9. Kramer, A. D. I. (2010). Delaying decisions in order to learn the distribution of options. PhD thesis.
  10. Lueker, G. S. (1995). Average-case analysis of off-line and on-line knapsack problems. In SODA 7895: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 179-188. Society for Industrial and Applied Mathematics.
  11. Mahdian, M., Nazerzadeh, H., and Saberi, A. (2012). Online optimization with uncertain information. ACM Trans. Algorithms, 8:2:1-2:29.
  12. Marchetti-Spaccamela, A. and Vercellis, C. (1995). Stochastic on-line knapsack problems. Mathematical Programming, 68:73-104.
  13. Marini, C., Nicosia, G., Pacifici, A., and Pferschy, U. (2013). Strategies in competing subset selection. Annals of Operations Research, 207(1):181-200.
  14. Papastavrou, J. D. and Kleywegt, A. J. (2001). The dynamic and stochastic knapsack problem with random sized items. Operations Research, 49:26-41.
  15. Pisinger, D. (1995). An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research, 87(1):175 - 187.
  16. Zhou, Y., Chakrabarty, D., and Lukose, R. (2008). Budget constrained bidding in keyword auctions and online knapsack problems. In Internet and Network Economics, volume 5385 of Lecture Notes in Computer Science, pages 566-576.
Download


Paper Citation


in Harvard Style

Ben-Romdhane H. and Krichen S. (2014). Online Knapsack Problem with Items Delay . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 213-220. DOI: 10.5220/0004832702130220


in Bibtex Style

@conference{icores14,
author={Hajer Ben-Romdhane and Saoussen Krichen},
title={Online Knapsack Problem with Items Delay},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={213-220},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004832702130220},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Online Knapsack Problem with Items Delay
SN - 978-989-758-017-8
AU - Ben-Romdhane H.
AU - Krichen S.
PY - 2014
SP - 213
EP - 220
DO - 10.5220/0004832702130220