Abstract
The multidemand multidimensional knapsack problem (MDMKP) is a classic NP-hard combinatorial optimization problem with a number of real-world applications. In this paper, we propose an iterated tabu search (ITS) algorithm for solving this computationally intractable problem, by integrating two solution-based tabu search procedures aiming to locally improve the solutions and a perturbation operator aiming to jump out of local optimum traps. The performance of proposed algorithm was assessed on 54 benchmark instances commonly used in the literature, and the experimental results show that the proposed algorithm is very competitive compared to the state-of-the-art algorithms in the literature. In particular, the proposed ITS algorithm improved the best known results in the literature for 27 out of 54 instances.
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
Similar content being viewed by others
References
Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63–86 (1998)
Cappanera, P., Trubian, M.: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem. INFORMS J. Comput. 17(1), 82–98 (2005)
Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discrete Appl. Math. 33(1–3), 3–28 (2003)
Plastria, F.: Static competitive facility location: An overview of optimisation approaches. Eur. J. Oper. Res. 129(3), 461–470 (2001)
Romero-Morales, D., Carrizosa, E., Conde, E.: Semi-obnoxious location models: a global optimization approach. Eur. J. Oper. Res. 102(2), 295–301 (1997)
Beaujon, G.J., Marin, S.P., Mcdonald, G.C.: Balancing and optimizing a portfolio of R&D projects. Naval Res. Logistics (NRL) 48(1), 18–40 (2001)
Arntzen, H., Hvattum, L.M., LKketangen, A.: Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33(9), 2508–2525 (2006)
Gortázar, F., Duarte, A., Laguna, M., MartÃ, R.: Black box scatter search for general classes of binary optimization problems. Comput. Oper. Res. 37, 1977–1986 (2010)
Hvattum, L.M., Arntzen, H., Løkketangen, A., Glover, F.: Alternating control tree search for knapsack/covering problems. J. Heuristics 16(3), 239–258 (2010)
Lai, X.J., Hao, J.K., Yue, D.: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. Eur. J. Oper. Res. 274(1), 35–48 (2018)
Acknowledgements
This work was partially supported by the Natural Science Foundation of Jiangsu Province of China (Grant No. BK20170904), the National Natural Science Foundation of China (Grant No. 61703213), six talent peaks project in Jiangsu Province (Grant No. RJFW-011), and NUPTSF (Grant Nos. NY217154 and RK043YZZ18004).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Luo, D., Lai, X., Sun, Q. (2020). Iterated Tabu Search Algorithm for the Multidemand Multidimensional Knapsack Problem. In: Li, K., Li, W., Wang, H., Liu, Y. (eds) Artificial Intelligence Algorithms and Applications. ISICA 2019. Communications in Computer and Information Science, vol 1205. Springer, Singapore. https://doi.org/10.1007/978-981-15-5577-0_42
Download citation
DOI: https://doi.org/10.1007/978-981-15-5577-0_42
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5576-3
Online ISBN: 978-981-15-5577-0
eBook Packages: Computer ScienceComputer Science (R0)