Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications (2306.14690v2)

Published 26 Jun 2023 in cs.NE

Abstract: The multiple-choice knapsack problem (MCKP) is a classic NP-hard combinatorial optimization problem. Motivated by several significant real-world applications, this work investigates a novel variant of MCKP called chance-constrained multiple-choice knapsack problem (CCMCKP), where the item weights are random variables. In particular, we focus on the practical scenario of CCMCKP, where the probability distributions of random weights are unknown but only sample data is available. We first present the problem formulation of CCMCKP and then establish two benchmark sets. The first set contains synthetic instances and the second set is devised to simulate a real-world application scenario of a certain telecommunication company. To solve CCMCKP, we propose a data-driven adaptive local search (DDALS) algorithm. The main novelty of DDALS lies in its data-driven solution evaluation approach that can effectively handle unknown probability distributions of item weights. Moreover, in cases with unknown distributions, high intensity of chance constraints, limited amount of sample data and large-scale problems, it still exhibits good performance. Experimental results demonstrate the superiority of DDALS over other baselines on the two benchmarks. Additionally, ablation studies confirm the effectiveness of each component of the algorithm. Finally, DDALS can serve as the baseline for future research, and the benchmark sets are open-sourced to further promote research on this challenging problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. P. Sinha and A. A. Zoltners, “The multiple-choice knapsack problem,” Operations Research, vol. 27, no. 3, pp. 503–515, 1979.
  2. T. C. Sharkey, H. E. Romeijn, and J. Geunes, “A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems,” Mathematical Programming, vol. 126, no. 1, pp. 69–96, 2011.
  3. K. Taaffe, J. Geunes, and H. Romeijn, “Target market selection with demand uncertainty: the selective newsvendor problem,” Eur. J. Oper. Res, vol. 189, no. 3, pp. 987–1003, 2008.
  4. R. M. Nauss, “The 0–1 knapsack problem with multiple choice constraints,” European Journal of Operational Research, vol. 2, no. 2, pp. 125–131, 1978.
  5. T. Zhong and R. Young, “Multiple choice knapsack problem: Example of planning choice in transportation,” Evaluation and program planning, vol. 33, no. 2, pp. 128–137, 2010.
  6. C. K. Kwong, L.-F. Mu, J. Tang, and X. Luo, “Optimization of software components selection for component-based software system development,” Computers & Industrial Engineering, vol. 58, no. 4, pp. 618–624, 2010.
  7. H. Kellerer, U. Pferschy, and D. Pisinger, “The multiple-choice knapsack problem,” in Knapsack Problems.   Springer, 2004, pp. 317–347.
  8. E. Zemel, “The linear multiple choice knapsack problem,” Operations Research, vol. 28, no. 6, pp. 1412–1423, 1980.
  9. M. Dyer, N. Kayal, and J. Walker, “A branch and bound algorithm for solving the multiple-choice knapsack problem,” Journal of computational and applied mathematics, vol. 11, no. 2, pp. 231–249, 1984.
  10. K. Dudziński and S. Walukiewicz, “Exact methods for the knapsack problem and its generalizations,” European Journal of Operational Research, vol. 28, no. 1, pp. 3–21, 1987.
  11. G. Gens and E. Levner, “An approximate binary search algorithm for the multiple-choice knapsack problem,” Information Processing Letters, vol. 67, no. 5, pp. 261–265, 1998.
  12. M. Hifi, M. Michrafy, and A. Sbihi, “A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem,” Computational Optimization and Applications, vol. 33, no. 2, pp. 271–285, 2006.
  13. R. Ji and M. A. Lejeune, “Data-driven distributionally robust chance-constrained optimization with wasserstein metric,” Journal of Global Optimization, vol. 79, no. 4, pp. 779–811, 2021.
  14. W. Xie, “On distributionally robust chance constrained programs with wasserstein distance,” Mathematical Programming, vol. 186, no. 1-2, pp. 115–155, 2021.
  15. A. Nasrallah, A. S. Thyagaturu, Z. Alharbi, C. Wang, X. Shao, M. Reisslein, and H. ElBakoury, “Ultra-low latency (ull) networks: The ieee tsn and ietf detnet standards and related 5g ull research,” IEEE Communications Surveys & Tutorials, vol. 21, no. 1, pp. 88–145, 2018.
  16. G. P. A. W. Group et al., “View on 5g architecture: Version 2.0,” https://5g-ppp.eu/, 2017.
  17. I. Parvez, A. Rahmati, I. Guvenc, A. I. Sarwat, and H. Dai, “A survey on low latency towards 5g: Ran, core network and caching solutions,” IEEE Communications Surveys & Tutorials, vol. 20, no. 4, pp. 3098–3130, 2018.
  18. S. H. Huan, S. K. Sheoran, and G. Wang, “A review and analysis of supply chain operations reference (scor) model,” Supply chain management: An international Journal, vol. 9, no. 1, pp. 23–29, 2004.
  19. F. Yang and N. Chakraborty, “Algorithm for optimal chance constrained knapsack problem with applications to multi-robot teaming,” in 2018 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2018, pp. 1043–1049.
  20. D. Pisinger, “A minimal algorithm for the multiple-choice knapsack problem,” European Journal of Operational Research, vol. 83, no. 2, pp. 394–410, 1995.
  21. C. He, J. Y. Leung, K. Lee, and M. L. Pinedo, “An improved binary search algorithm for the multiple-choice knapsack problem,” RAIRO-Operations Research, vol. 50, no. 4-5, pp. 995–1001, 2016.
  22. A. Mkaouar, S. Htiouech, and H. Chabchoub, “Solving the multiple choice multidimensional knapsack problem with abc algorithm,” in 2020 IEEE Congress on Evolutionary Computation (CEC).   IEEE, 2020, pp. 1–6.
  23. L. Lamanna, R. Mansini, and R. Zanotti, “A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem,” European Journal of Operational Research, vol. 297, no. 1, pp. 53–65, 2022.
  24. E. Delage and S. Mannor, “Percentile optimization for markov decision processes with parameter uncertainty,” Operations research, vol. 58, no. 1, pp. 203–213, 2010.
  25. B. Doerr, C. Doerr, A. Neumann, F. Neumann, and A. Sutton, “Optimization of chance-constrained submodular functions,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, 2020, pp. 1460–1467.
  26. J. Kleinberg, Y. Rabani, and É. Tardos, “Allocating bandwidth for bursty connections,” in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 1997, pp. 664–673.
  27. A. Goel and P. Indyk, “Stochastic load balancing and related problems,” in 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039).   IEEE, 1999, pp. 579–586.
  28. V. Goyal and R. Ravi, “A ptas for the chance-constrained knapsack problem with random item sizes,” Operations Research Letters, vol. 38, no. 3, pp. 161–164, 2010.
  29. R. Chai, A. Savvaris, A. Tsourdos, S. Chai, Y. Xia, and S. Wang, “Solving trajectory optimization problems in the presence of probabilistic constraints,” IEEE Transactions on Cybernetics, vol. 50, no. 10, pp. 4332–4345, 2020.
  30. X. Zhang, J. Ma, Z. Cheng, S. Huang, S. S. Ge, and T. H. Lee, “Trajectory generation by chance-constrained nonlinear mpc with probabilistic prediction,” IEEE Transactions on Cybernetics, vol. 51, no. 7, pp. 3616–3629, 2021.
  31. P. Mohajerin Esfahani and D. Kuhn, “Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations,” Mathematical Programming, vol. 171, no. 1-2, pp. 115–166, 2018.
  32. R. Gao and A. Kleywegt, “Distributionally robust stochastic optimization with wasserstein distance,” Mathematics of Operations Research, 2022.
  33. A. Ferreira and J. M. Robson, “Fast and scalable parallel algorithms for knapsack-like problems,” Journal of Parallel and Distributed Computing, vol. 39, no. 1, pp. 1–13, 1996.
  34. N. Metropolis and S. Ulam, “The monte carlo method,” Journal of the American statistical association, vol. 44, no. 247, pp. 335–341, 1949.
  35. S. Liu, K. Tang, Y. Lei, and X. Yao, “On performance estimation in automatic algorithm configuration,” in Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI’2020, New York, NY, Feb 2020, pp. 2384–2391.
  36. C. Luo, W. Xing, S. Cai, and C. Hu, “Nusc: An effective local search algorithm for solving the set covering problem,” IEEE Transactions on Cybernetics, pp. 1–14, 2022.
  37. K. Tang, S. Liu, P. Yang, and X. Yao, “Few-shots parallel algorithm portfolio construction via co-evolution,” IEEE Transactions on Evolutionary Computation, vol. 25, no. 3, pp. 595–607, 2021.
  38. S. Liu, K. Tang, and X. Yao, “Memetic search for vehicle routing with simultaneous pickup-delivery and time windows,” Swarm and Evolutionary Computation, vol. 66, p. 100927, 2021.
  39. S. Liu, Y. Zhang, K. Tang, and X. Yao, “How good is neural combinatorial optimization? A systematic evaluation on the traveling salesman problem,” IEEE Computational Intelligence Magazine, vol. 18, no. 3, pp. 14–28, 2023.
  40. P. Yang, K. Tang, and X. Lu, “Improving estimation of distribution algorithm on multimodal problems by detecting promising areas,” IEEE Transactions on Cybernetics, vol. 45, no. 8, pp. 1438–1449, 2015.
  41. R. Tempo, E.-W. Bai, and F. Dabbene, “Probabilistic robustness analysis: Explicit bounds for the minimum number of samples,” in Proceedings of 35th IEEE Conference on Decision and Control, vol. 3.   IEEE, 1996, pp. 3424–3428.
  42. T. Alamo, R. Tempo, and A. Luque, “On the sample complexity of randomized approaches to the analysis and design under uncertainty,” in Proceedings of the 2010 American Control Conference.   IEEE, 2010, pp. 4671–4676.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now