Skip to main content
SpringerLink
Log in

A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem

  • Conference paper
  • First Online:
Bio-Inspired Computing -- Theories and Applications (BIC-TA 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 562))

Included in the following conference series:

Abstract

The Multidimensional Multiple-choice Knapsack Problem (M MKP) is an NP-hard combinatorial optimization task that appears in various applications. We present a fast stochastic local search heuristic for the MMKP that uses an iterative perturbative search paradigm with penalty weights for dimensions, and an additive weighting scheme is adopted to diversify the search. Our heuristic is tested on the standard benchmark problem instances. Experiments show that it is very competitive in terms of the best solutions found, compared the fast heuristics in the literature. Besides, our heuristic is easy to implement, has no parameter to tune in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Martello, S., Toth, P.: Algorithms for knapsack problems. North-Holland Math. Stud. 132, 213–257 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Sinha, P., Zoltners, A.A.: The multiple-choice knapsack problem. Oper. Res. 27(3), 503–515 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63–86 (1998)

    Article  MATH  Google Scholar 

  4. Basnet, C., Wilson, J.: Heuristics for determining the number of warehouses for storing non-compatible products. Int. Trans. Oper. Res. 12(5), 527–538 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ykman-Couvreur, C., Nollet, V., Catthoor, F., Corporaal, H.: Fast multi-dimension multi-choice knapsack heuristic for MP-SoC run-time management. In: International Symposium on System-on-Chip, pp. 1–4. IEEE (2006)

    Google Scholar 

  6. Shojaei, H., Wu, T.H., Davoodi, A., Basten, T.: A pareto-algebraic framework for signal power optimization in global routing. In: Proceedings of the 16th ACM/IEEE International Symposium on Low Power Electronics and Design, pp. 407–412. ACM (2010)

    Google Scholar 

  7. Yu, T., Zhang, Y., Lin, K.J.: Efficient algorithms for web services selection with end-to-end QoS constraints. ACM Trans. Web (TWEB) 1(1), 6 (2007)

    Article  Google Scholar 

  8. Pisinger, D.: Budgeting with bounded multiple-choice constraints. Eur. J. Oper. Res. 129(3), 471–480 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Li, V., Curry, G.L., Boyd, E.A.: Towards the real time solution of strike force asset allocation problems. Comput. Oper. Res. 31(2), 273–291 (2004)

    Article  MATH  Google Scholar 

  10. Ghasemi, T., Razzazi, M.: Development of core to solve the multidimensional multiple-choice knapsack problem. Comput. Indus. Eng. 60(2), 349–360 (2011)

    Article  Google Scholar 

  11. Khan, S.: Quality adaptation in a multi-session adaptive multimedia system: model and architecture. Ph.D. thesis, Department of Electronical and Computer Engineering, University of Victoria, Canada (1998)

    Google Scholar 

  12. Sbihi, A.: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. J. Comb. Optim. 13(4), 337–351 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Moser, M., Jokanovic, D.P., Shiratori, N.: An algorithm for the multidimensional multiple-choice knapsack problem. IEICE Trans. Fundam. Electr. Commun. Comput. Sci. 80(3), 582–589 (1997)

    Google Scholar 

  14. Akbar, M.M., Manning, E.G., Shoja, G.C., Khan, S.: Heuristic solutions for the multiple-choice multi-dimension knapsack problem. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol. 2074, pp. 659–668. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Khan, S., Li, K.F., Manning, E.G., Akbar, M.M.: Solving the knapsack problem for adaptive multimedia systems. Stud. Inform. Univ. 2(1), 157–178 (2002)

    Google Scholar 

  16. Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55(12), 1323–1332 (2004)

    Article  MATH  Google Scholar 

  17. Hifi, M., Michrafy, M., Sbihi, A.: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 33(2–3), 271–285 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Cherfi, N., Hifi, M.: A column generation method for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 46(1), 51–73 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Cherfi, N., Hifi, M.: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem. Int. J. Oper. Res. 5(1), 89–109 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Iqbal, S., Bari, M.F., Rahman, M.S.: Solving the multi-dimensional multi-choice knapsack problem with the help of ants. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 312–323. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  21. Ren, Z., Feng, Z.: An ant colony optimization approach to the multiple-choice multidimensional knapsack problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 281–288. ACM (2010)

    Google Scholar 

  22. Shojaei, H., Ghamarian, A., Basten, T., Geilen, M., Stuijk, S., Hoes, R.: A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for cmp run-time management. In: Proceedings of the 46th Annual Design Automation Conference, pp. 917–922. ACM (2009)

    Google Scholar 

  23. Hanafi, S., Mansi, R., Wilbaut, C.: Iterative relaxation-based heuristics for the multiple-choice multidimensional knapsack problem. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 73–83. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  24. Crévits, I., Hanafi, S., Mansi, R., Wilbaut, C.: Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Comput. Oper. Res. 39(1), 32–41 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Mansi, R., Alves, C., Valério de Carvalho, J., Hanafi, S.: A hybrid heuristic for the multiple choice multidimensional knapsack problem. Eng. Optim. 45(8), 983–1004 (2013)

    Article  MathSciNet  Google Scholar 

  26. Chen, Y., Hao, J.K.: A “reduce and solve” approach for the multiple-choice multidimensional knapsack problem. Eur. J. Oper. Res. 239(2), 313–322 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  27. Shojaei, H., Basten, T., Geilen, M., Davoodi, A.: A fast and scalable multidimensional multiple-choice knapsack heuristic. ACM Trans. Des. Autom. Electron. Syst. 18(4), 51:1–51:32 (2013)

    Article  Google Scholar 

  28. Htiouech, S., Bouamama, S., Attia, R.: Using surrogate information to solve the multidimensional multi-choice knapsack problem. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2102–2107. IEEE (2013)

    Google Scholar 

  29. Toyoda, Y.: A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manag. Sci. 21(12), 1417–1427 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  30. Hiremath, C.S., Hill, R.R.: New greedy heuristics for the multiple-choice multi-dimensional knapsack problem. Int. J. Oper. Res. 2(4), 495–512 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, University of Science and Technology of China, Hefei, China

    Youxin Xia, Chao Gao & JinLong Li

Authors
  1. Youxin Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. JinLong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to JinLong Li .

Editor information

Editors and Affiliations

  1. Xidian University, Xi'an, China

    Maoguo Gong

  2. Huazhong Univ. of Science and Technology, Wuhan, China

    Pan Linqiang

  3. University of Petroleum, Qingdao, China

    Song Tao

  4. University of Science and Technology of China, Hefei, China

    Ke Tang

  5. Anhui University, Hefei, China

    Xingyi Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, Y., Gao, C., Li, J. (2015). A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49014-3_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49013-6

  • Online ISBN: 978-3-662-49014-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation