Advertisement

Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup

Conference paper
  • 64 Downloads
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 283)

Abstract

The Multiple Knapsack Problem with Setups (MKPS) belongs to the well-known NP-hard knapsack family, which represents an extended version of the binary multiple knapsack problem. In this paper, we study MKPS in which a set of families of items and a set of knapsacks are available. Each item is characterized by a knapsack-dependent profit and each family is associated with a knapsack-dependent cost. An item can be selected only if the corresponding family is activated and a family can only be setup in one knapsack. A key feature is that the activation of a family incurs a knapsack-dependent setup cost that should be considered both in the objective function and constraints. The setup cost varies with the knapsack and the goal consists in selecting appropriate items, from different families, to enter a knapsack while maximizing its value with respecting its capacity. We first propose a hybrid algorithm that combines the solution related to the mixed integer linear relaxation and a series of knapsack problems. The mixed linear relaxation can be viewed as the driving problem, where it is solved by using a special black-box solver while the series of knapsack try to build the solutions provided by calling the state-of-the-art Cplex solver. We then propose an enhanced version of the first method, where a series of valid constraints are added for providing a powerful method. The performance of the proposed methods are evaluated on benchmark instances of the literature, where their provided results are compared to those reached by the state-of-the-art Cplex solver and the best methods available in the literature. The computational power of the proposed method shows the importance of hybridization, especially for that type of problems.

Keywords

Knapsack Setups Local branching Relaxation 

Notes

Acknowledgments

The authors thank the anonymous referees for their helpful comments and suggestions which contributed to the improvement of the contents of this paper.

References

  1. 1.
    Adouani, Y., Jarboui, B., Masmoudi, M.: Efficient matheuristic for the generalised multiple knapsack problem with setup. Eur. J. Ind. Eng. (EJIE) 14(5), 715–741 (2020)CrossRefGoogle Scholar
  2. 2.
    Akinc, U.: Approximate and exact algorithms for the fixed-charge knapsack problem. Eur. J. Oper. Res. 170(2), 363–375 (2006)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Altay, N., Robinson, J.R., Powell, E., Bretthauer, K.M.: Exact and heuristic solution approaches for the mixed integer setup knapsack problem. Eur. J. Oper. Res. 190(3), 598–609 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Amiri, A.: A Lagrangean based solution algorithm for the knapsack problem with setups. Expert Syst. Appl. 143, 113077 (2019).  https://doi.org/10.1016/j.eswa.2019.113077CrossRefGoogle Scholar
  5. 5.
    Boukhari, S., Dahmani, I., Hifi, M.: Local branching strategy-based method for the knapsack problem with setup. In: Wyld, D.C., et al. (eds.) Proceedings of the 4th International Conference on Artificial Intelligence, Soft Computing And Applications, CS & IT - CSCP 2020, pp. 65–75 (2020).  https://doi.org/10.5121/csit.2020.101606
  6. 6.
    Chebil, K., Khemakhem, M.: A dynamic programming algorithm for the knapsack problem with setup. Comput. Oper. Res. 64, 40–50 (2015)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Della, C.F., Salassa, F., Scatamacchia, R.: An exact approach for the 0–1 knapsack problem with setups. Comput. Oper. Res. 80, 61–67 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Furini, F., Monaci, M., Traversi, E.: Exact algorithms for the knapsack problem with setup. Technical report, University of Paris Dauphine (2017)Google Scholar
  9. 9.
    Guignard, M.: Solving Makespan minimization problems with Lagrangean decomposition. Discrete Appl. Math. 42(1), 17–29 (1993)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Hifi, M.: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31(5), 657–674 (2004)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Khemakhem, M., Chebil, K.: A tree search based combination heuristic for the knapsack problem with setup. Comput. Ind. Eng. 99, 280–286 (2016)CrossRefGoogle Scholar
  12. 12.
    Lahyani, R., Chebil, K., Khemakhem, M., Coelho, C.: Matheuristics for solving the multiple knapsack problem with setup. Comput. Ind. Eng. 129, 76–89 (2019)CrossRefGoogle Scholar
  13. 13.
    McLay, L.A.: Designing Aviation Security Systems: Theory and Practice (2006)Google Scholar
  14. 14.
    Merkle, M., Hellman, M.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theor. 24(5), 525–530 (1978)CrossRefGoogle Scholar
  15. 15.
    Michel, S., Perrot, N., Vanderbeck, F.: Knapsack problems with setups. Eur. J. Oper. Res. 196(3), 909–918 (2009)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Perboli, G., Gobbato, L., Perfetti, F.: Packing problems in transportation and supply chain: new problems and trends. Proc. Soc. Behav. Sci. 111, 672–681 (2014)CrossRefGoogle Scholar
  17. 17.
    Yanchun, Y.: Knapsack problems with setup. Dissertation, Auburn University, USA (2006)Google Scholar

Copyright information

© The Author(s), under exclusive license to Springer Nature Switzerland AG 2022

Authors and Affiliations

  1. 1.LaROMaD, USTHB, BP 32 El AliaAlgerAlgérie
  2. 2.AMCD-RO, USTHB, BP 32 El AliaAlgerAlgérie
  3. 3.EPROAD EA 4669, Université de Picardie Jules VerneAmiensFrance

Personalised recommendations