{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:55:52Z","timestamp":1773968152347,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T00:00:00Z","timestamp":1554768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11227-019-02847-0","type":"journal-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T08:03:26Z","timestamp":1554797006000},"page":"6239-6259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7920-6121","authenticated-orcid":false,"given":"Saloua","family":"El Motaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Yahyaouy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Gualous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalal","family":"Sabor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"issue":"17","key":"2847_CR1","doi-asserted-by":"publisher","first-page":"2939","DOI":"10.1016\/j.comnet.2009.10.004","volume":"53","author":"K Kant","year":"2009","unstructured":"Kant K (2009) Data center evolution: a tutorial on state of the art, issues, and challenges. Comput Netw 53(17):2939\u20132965","journal-title":"Comput Netw"},{"key":"2847_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.procs.2016.02.093","volume":"78","author":"Z Usmani","year":"2016","unstructured":"Usmani Z, Singh S (2016) A survey of virtual machine placement techniques in a cloud data center. Procedia Comput Sci 78:491\u2013498 (1st International Conference on Information Security & Privacy 2015)","journal-title":"Procedia Comput Sci"},{"key":"2847_CR3","doi-asserted-by":"crossref","unstructured":"Bobroff N, Kochut A, Beaty K (2007) Dynamic placement of virtual machines for managing sla violations. In: 2007 10th IFIP\/IEEE International Symposium on Integrated Network Management, pp 119\u2013128","DOI":"10.1109\/INM.2007.374776"},{"key":"2847_CR4","doi-asserted-by":"crossref","unstructured":"Shawish A, Salama M (2014) Cloud computing: paradigms and technologies. Springer, Berlin, pp 39\u201367","DOI":"10.1007\/978-3-642-35016-0_2"},{"issue":"2","key":"2847_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TPDS.2010.91","volume":"22","author":"X Wang","year":"2011","unstructured":"Wang X, Wang Y (2011) Coordinating power control and performance management for virtualized server clusters. IEEE Trans Parallel Distrib Syst 22(2):245\u2013259","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2847_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jnca.2016.01.011","volume":"66","author":"M Masdari","year":"2016","unstructured":"Masdari M, Shahab Nabavi S, Ahmadi V (2016) An overview of virtual machine placement schemes in cloud computing. J Netw Comput Appl 66:106\u2013127","journal-title":"J Netw Comput Appl"},{"key":"2847_CR7","first-page":"48","volume":"20","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Sahoo B, Prakash Jayaraman P, Jun S, Zomaya AY, Ranjan R (2018) Energy-efficient VM-placement in cloud data center. Sustain Comput Inform Syst 20:48\u201355","journal-title":"Sustain Comput Inform Syst"},{"key":"2847_CR8","doi-asserted-by":"crossref","unstructured":"Choudharya A, Ranab S, Matahaic KJ (2016) A critical analysis of energy efficient virtual machine placement techniques and its optimization in a cloud computing environment. In: International Conference on Information Security & Privacy (ICISP2015), 11\u201312 December 2015, Nagpur, India, pp 132\u2013138","DOI":"10.1016\/j.procs.2016.02.022"},{"issue":"9","key":"2847_CR9","doi-asserted-by":"publisher","first-page":"4042","DOI":"10.1007\/s11227-017-1999-5","volume":"73","author":"Z Hassan","year":"2017","unstructured":"Hassan Z, Morteza BS (2017) A method for the optimum selection of datacenters in geographically distributed clouds. J Supercomput 73(9):4042\u20134081","journal-title":"J Supercomput"},{"issue":"4","key":"2847_CR10","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TSC.2010.25","volume":"3","author":"B Speitkamp","year":"2010","unstructured":"Speitkamp B, Bichler M (2010) A mathematical programming approach for server consolidation problems in virtualized data centers. IEEE Trans Serv Comput 3(4):266\u2013278","journal-title":"IEEE Trans Serv Comput"},{"key":"2847_CR11","unstructured":"Pisinger D (1995) Algorithms for knapsack problems. PhD thesis, Universitetsparken 1, DK-2100 Copenhagen, Denmark"},{"key":"2847_CR12","unstructured":"Wikipedia. Np-hardness, 2018"},{"key":"2847_CR13","unstructured":"Camati RS, Lima L Jr, Calsavara A (2014) Solving the virtual machine placement problem as a multiple multidimensional knapsack problem. In: ICN 2014: The Thirteenth International Conference on Networks"},{"key":"2847_CR14","doi-asserted-by":"crossref","unstructured":"Alboaneen DA, Tianfield H, Zhang Y (2016) Glowworm swarm optimisation algorithm for virtual machine placement in cloud computing. In: 2016 International IEEE Conferences on Ubiquitous Intelligence Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC\/ATC\/ScalCom\/CBDCom\/IoP\/SmartWorld), pp 808\u2013814","DOI":"10.1109\/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0129"},{"key":"2847_CR15","unstructured":"Yan Y, Jian C, Minglu L (2013) A network-aware virtual machine allocation in cloud datacenter. In: Proceedings of the 10th IFIP International Conference on Network and Parallel Computing, Volume 8147, New York, NY, USA, 2013. Springer, New York, pp 71\u201382"},{"key":"2847_CR16","doi-asserted-by":"crossref","unstructured":"Campegiani P (2009) A genetic algorithm to solve the virtual machines resources allocation problem in multi-tier distributed systems","DOI":"10.1109\/ICAS.2009.49"},{"key":"2847_CR17","doi-asserted-by":"crossref","unstructured":"Al-Dulaimy A, Zekri A, Itani W, Zantout R (2017) Paving the way for energy efficient cloud data centers: a type-aware virtual machine placement strategy. In: 2017 IEEE International Conference on Cloud Engineering (IC2E), pp 5\u20138","DOI":"10.1109\/IC2E.2017.51"},{"key":"2847_CR18","doi-asserted-by":"crossref","unstructured":"Amarante SRM, Roberto FM, Cardoso AR, Celestino J (2013) Using the multiple knapsack problem to model the problem of virtual machine allocation in cloud computing. In: 2013 IEEE 16th International Conference on Computational Science and Engineering, pp 476\u2013483","DOI":"10.1109\/CSE.2013.77"},{"issue":"1","key":"2847_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/2492101.1555368","volume":"37","author":"A Gandhi","year":"2009","unstructured":"Gandhi A, Balter Mor H, Rajarshi D, Charles L (2009) Optimal power allocation in server farms. SIGMETRICS Perform Eval Rev 37(1):157\u2013168","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"2847_CR20","unstructured":"Arjona J, Chatzipapas A, Anta AF, Mancuso V (2014) A measurement-based analysis of the energy consumption of data center servers, vol 3, no 4, pp 266\u2013278"},{"key":"2847_CR21","first-page":"1","volume":"16","author":"A Shaheen","year":"2016","unstructured":"Shaheen A, Sleit A (2016) Comparing between different approaches to solve the 0\/1 knapsack problem. IJCSNS Int J Comput Sci Netw Secur 16:1\u201310","journal-title":"IJCSNS Int J Comput Sci Netw Secur"},{"key":"2847_CR22","unstructured":"Maya H, Shrestha D (2004) Different approaches to solve the 0\/1 knapsack problem. PhD thesis, Simpson College, Indianola, IA 50125"},{"key":"2847_CR23","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11:4135\u20134151","journal-title":"Appl Soft Comput"},{"key":"2847_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","volume":"28","author":"K Dudzinski","year":"1987","unstructured":"Dudzinski K, Walukiewicz S (1987) Exact methods for the knapsack problem and its generalizations. Eur J Oper Res 28:3\u201321","journal-title":"Eur J Oper Res"},{"key":"2847_CR25","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1287\/mnsc.30.6.765","volume":"30","author":"M Silvano","year":"1984","unstructured":"Silvano M, Paolo T (1984) A mixture of dynamic programming and branch-and-bound for the subset-sum problem. Manag Sci 30:765\u2013771","journal-title":"Manag Sci"},{"key":"2847_CR26","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1968","unstructured":"Kolesar PJ (1968) A branch and bound algorithm for knapsack problem. Manag Sci 13:723\u2013735","journal-title":"Manag Sci"},{"key":"2847_CR27","unstructured":"Anne B, Yves R, Fr\u00e9d\u00e9ric V (2013) A guide to algorithm design: paradigms, methods, and complexity analysis. Applied algorithms and data structures series. Chapman & Hall\/CRC, Boca Raton"},{"key":"2847_CR28","unstructured":"Richard B (2010) Dynamic programming. Princeton University Press, Princeton"},{"key":"2847_CR29","first-page":"145","volume":"51","author":"I Shachar","year":"2016","unstructured":"Shachar I, Rohit S, Armando S, Kuat Y, Yongquan L, Charles L, Rezaul C (2016) Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. SIGPLAN Not 51:145\u2013164","journal-title":"SIGPLAN Not"},{"issue":"3","key":"2847_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0377-2217(80)90084-3","volume":"5","author":"EA Silver","year":"1980","unstructured":"Silver EA, Victor R, Vidal V, de Werra D (1980) A tutorial on heuristic methods. Eur J Oper Res 5(3):153\u2013162","journal-title":"Eur J Oper Res"},{"key":"2847_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1057\/jors.2010.160","volume":"62","author":"A Uwe","year":"2011","unstructured":"Uwe A, Alistair C (2011) Heuristic optimisation. J Oper Res Soc 62:251\u2013252","journal-title":"J Oper Res Soc"},{"issue":"19","key":"2847_CR32","first-page":"21","volume":"58","author":"M Baghel","year":"2012","unstructured":"Baghel M, Agrawal S, Silakari S (2012) Survey of metaheuristic algorithms for combinatorial optimization. Int J Comput Appl 58(19):21\u201331","journal-title":"Int J Comput Appl"},{"key":"2847_CR33","doi-asserted-by":"crossref","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"2847_CR34","unstructured":"Sami K, Thomas B, J\u00f6rg H (1994) The zero\/one multiple knapsack problem and genetic algorithms. In: Proceedings of the 1994 ACM Symposium on Applied Computing, New York, NY, USA. ACM, pp 188\u2013193"},{"key":"2847_CR35","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu P, Beasley J (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"2847_CR36","doi-asserted-by":"crossref","unstructured":"Cotta C, Troya JM (1998) A hybrid genetic algorithm for the 0\u20131 multiple knapsack problem. Springer, Vienna","DOI":"10.1007\/978-3-7091-6492-1_55"},{"key":"2847_CR37","doi-asserted-by":"crossref","unstructured":"Raidl GR (1998) An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), pp 207\u2013211","DOI":"10.1109\/ICEC.1998.699502"},{"issue":"1","key":"2847_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"2847_CR39","unstructured":"Dorigo M, Di Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol 2, pp 1470\u20131477"},{"key":"2847_CR40","doi-asserted-by":"crossref","unstructured":"Shi H (2006) Solution to 0\/1 knapsack problem based on improved ant colony algorithm. In: 2006 IEEE International Conference on Information Acquisition, pp 1062\u20131066","DOI":"10.1109\/ICIA.2006.305887"},{"key":"2847_CR41","doi-asserted-by":"crossref","unstructured":"Zhao P, Zhao P, Zhang X (2006) A new ant colony optimization for the knapsack problem. In: 2006 7th International Conference on Computer-Aided Industrial Design and Conceptual Design, pp 1\u20133","DOI":"10.1109\/CAIDCD.2006.329439"},{"key":"2847_CR42","doi-asserted-by":"crossref","unstructured":"Changdar C, Mahapatra GS, Pal RK (2013) An ant colony optimization approach for binary knapsack problem under fuzziness. Appl Math Comput 223:243\u2013253","DOI":"10.1016\/j.amc.2013.07.077"},{"key":"2847_CR43","unstructured":"Leguizamon G, Michalewicz Z (1999) A new version of ant system for subset problems. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol 2, pp 1459\u20131464"},{"key":"2847_CR44","doi-asserted-by":"crossref","unstructured":"Fidanova S (2004) Evolutionary algorithm for multiple knapsack problem","DOI":"10.1007\/978-3-540-24588-9_14"},{"key":"2847_CR45","unstructured":"Ines A, Christine S, Khaled G (2004) Ant algorithm for the multidimensional knapsack problem. In: Proceedings of International Conference on Bioinspired Methods and Their Applications (BIOMA 2004), Slovenia, Slovenia, pp 63\u201372"},{"key":"2847_CR46","unstructured":"Wikipedia (2018) Pseudo-polynomial time"},{"key":"2847_CR47","unstructured":"Changyeon J, Youngsu C, Bernhard E (2017) A machine learning approach to live migration modeling. In: ACM Symposium on Cloud Computing, SoCC\u201917"},{"key":"2847_CR48","unstructured":"Rodola G (2019) Psutil documentation"},{"key":"2847_CR49","unstructured":"Beazley DM (2001) Python essential reference. Sams Publishing, Indianapolis"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02847-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T23:08:32Z","timestamp":1586300912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,9]]},"references-count":49,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["2847"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02847-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,9]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}