{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:34:59Z","timestamp":1753886099271,"version":"3.41.2"},"reference-count":26,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2011,10,31]],"date-time":"2011-10-31T00:00:00Z","timestamp":1320019200000},"content-version":"vor","delay-in-days":303,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p>This paper presents a<jats:italic>1-opt<\/jats:italic>heuristic approach to solve resource allocation\/reallocation problem which is known as 0\/1 multichoice multidimensional knapsack problem (MMKP). The intercept matrix of the constraints is employed to find optimal or near\u2010optimal solution of the MMKP. This heuristic approach is tested for 33 benchmark problems taken from OR library of sizes upto 7000, and the results have been compared with optimum solutions. Computational complexity is proved to be<jats:italic>O<\/jats:italic>(<jats:italic>k<\/jats:italic><jats:italic>l<\/jats:italic><jats:italic>m<\/jats:italic><jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>) of solving heuristically MMKP using this approach. The performance of our heuristic is compared with the best state\u2010of\u2010art heuristic algorithms with respect to the quality of the solutions found. The encouraging results especially for relatively large\u2010size test problems indicate that this heuristic approach can successfully be used for finding good solutions for highly constrained NP\u2010hard problems.<\/jats:p>","DOI":"10.1155\/2011\/218078","type":"journal-article","created":{"date-parts":[[2011,10,31]],"date-time":"2011-10-31T19:00:50Z","timestamp":1320087650000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic Algorithm for Resource Allocation\/Reallocation Problem"],"prefix":"10.1155","volume":"2011","author":[{"given":"S.","family":"Raja Balachandar","sequence":"first","affiliation":[]},{"given":"K.","family":"Kannan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2011,10,31]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"crossref","unstructured":"Parra-Hern\u00e1ndezR.andrafaelph@engr.uvic.ca DimopoulosN. nikitas@ece.uvic.ca Channel resource allocation\/reallocation in cellular communication and linear programming 3 Proceedings of the IEEE International Conference on Systems Man and Cybernetics October 2003 2983\u20132989.","DOI":"10.1109\/ICSMC.2003.1244345"},{"key":"e_1_2_7_2_2","unstructured":"KhanS. Quality adaptation in a multi-session adaptive multimedia system: model and architecture Ph.D. dissertation 1998 University of Victoria Victoria Canada."},{"key":"e_1_2_7_3_2","first-page":"582","article-title":"An algorithm for the multidimensional multichoice knapsack problem","volume":"80","author":"Moser M.","year":"1997","journal-title":"IEICE Trans Fundam Electron"},{"key":"e_1_2_7_4_2","first-page":"154","article-title":"Solving the Knapsack problem for adaptive multimedia systems","volume":"2","author":"Khan S.","year":"2002","journal-title":"Studia Informatica"},{"key":"e_1_2_7_5_2","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","article-title":"A simplified algorithm for obtaining approximate solutions to zero-one programming problems","volume":"21","author":"Toyoda Y.","year":"1974","journal-title":"Management Science"},{"key":"e_1_2_7_6_2","doi-asserted-by":"crossref","unstructured":"AkbarM. M. ManningE. G. ShojaG. C. andKhanS. AlexandrovV. N. DongarraJ. JulianoB. A. RennerR. S. JengC. andTanK. Heuristic solutions for the multiple-choice multi-dimension knapsack problem the International Conference on Computional Science May 2001 San Francisco Calif USA 659\u2013668 Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-45718-6_71"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601796"},{"key":"e_1_2_7_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589\u2010005\u20103057\u20100"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2009.024531"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589\u2010008\u20109184\u20107"},{"key":"e_1_2_7_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242185"},{"key":"e_1_2_7_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2005.851140"},{"key":"e_1_2_7_13_2","unstructured":"NewtonM. A. H. SadidM. W. H. andAkbarM. M. A parallel heuristic algorithm for multiple-choice multidimensional knapsack problem the International Conference on Computer and Information Technology December 2003 Dhaka Bangladesh 181\u2013184."},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227\u2010007\u20100144\u20102"},{"key":"e_1_2_7_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878\u2010006\u20109035\u20103"},{"key":"e_1_2_7_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.10.045"},{"key":"e_1_2_7_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580428"},{"key":"e_1_2_7_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.1.73"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497325454"},{"key":"e_1_2_7_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45535-3"},{"key":"e_1_2_7_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.1.247"},{"key":"e_1_2_7_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00291\u2010003\u20100130\u2010x"},{"key":"e_1_2_7_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377\u20102217(00)00083\u20107"},{"key":"e_1_2_7_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.10.1209"},{"key":"e_1_2_7_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167\u20106377(86)90093\u20103"},{"key":"e_1_2_7_26_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207160601014148"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2011\/218078.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2011\/218078.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2011\/218078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T14:23:28Z","timestamp":1741875808000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2011\/218078"}},"subtitle":[],"editor":[{"given":"Yuri","family":"Sotskov","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.1155\/2011\/218078"],"URL":"https:\/\/doi.org\/10.1155\/2011\/218078","archive":["Portico"],"relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2011,1]]},"assertion":[{"value":"2011-02-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-07-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"218078"}}