{"id":"https://openalex.org/W2106556139","doi":"https://doi.org/10.1155/2011/218078","title":"A Heuristic Algorithm for Resource Allocation/Reallocation Problem","display_name":"A Heuristic Algorithm for Resource Allocation/Reallocation Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2106556139","doi":"https://doi.org/10.1155/2011/218078","mag":"2106556139"},"language":"en","primary_location":{"id":"doi:10.1155/2011/218078","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/218078","pdf_url":"https://downloads.hindawi.com/journals/jam/2011/218078.pdf","source":{"id":"https://openalex.org/S190082376","display_name":"Journal of Applied Mathematics","issn_l":"1110-757X","issn":["1110-757X","1687-0042"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://downloads.hindawi.com/journals/jam/2011/218078.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102931104","display_name":"S. Raja Balachandar","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. Raja Balachandar","raw_affiliation_strings":["Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India","Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India","institution_ids":["https://openalex.org/I932239252"]},{"raw_affiliation_string":"Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026550770","display_name":"K. Kannan","orcid":"https://orcid.org/0000-0002-8837-3324"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Kannan","raw_affiliation_strings":["Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India","Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India","institution_ids":["https://openalex.org/I932239252"]},{"raw_affiliation_string":"Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401","institution_ids":["https://openalex.org/I932239252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102931104"],"corresponding_institution_ids":["https://openalex.org/I932239252"],"apc_list":{"value":1025,"currency":"USD","value_usd":1025},"apc_paid":{"value":1025,"currency":"USD","value_usd":1025},"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.21354369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2011","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8299611806869507},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.8295800685882568},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7823899984359741},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7472623586654663},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6862258911132812},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.5672674179077148},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5655850768089294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.538343071937561},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.4778808653354645},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.47222140431404114},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46396932005882263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4281885623931885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3569057881832123},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.3567357063293457},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.12423771619796753},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.10297885537147522}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8299611806869507},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.8295800685882568},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7823899984359741},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7472623586654663},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6862258911132812},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.5672674179077148},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5655850768089294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538343071937561},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.4778808653354645},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47222140431404114},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46396932005882263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4281885623931885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3569057881832123},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3567357063293457},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.12423771619796753},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.10297885537147522},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1155/2011/218078","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/218078","pdf_url":"https://downloads.hindawi.com/journals/jam/2011/218078.pdf","source":{"id":"https://openalex.org/S190082376","display_name":"Journal of Applied Mathematics","issn_l":"1110-757X","issn":["1110-757X","1687-0042"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jam/1331818656","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jam/1331818656","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:RePEc:hin:jnljam:218078","is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/JAM/2011/218078.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:315d4c7ec2aa40829a0d0aa4e39b6aa6","is_oa":true,"landing_page_url":"https://doaj.org/article/315d4c7ec2aa40829a0d0aa4e39b6aa6","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Applied Mathematics, Vol 2011 (2011)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2011/218078","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/218078","pdf_url":"https://downloads.hindawi.com/journals/jam/2011/218078.pdf","source":{"id":"https://openalex.org/S190082376","display_name":"Journal of Applied Mathematics","issn_l":"1110-757X","issn":["1110-757X","1687-0042"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.550000011920929,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2106556139.pdf","grobid_xml":"https://content.openalex.org/works/W2106556139.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W142750658","https://openalex.org/W1545379711","https://openalex.org/W1583764461","https://openalex.org/W1660350378","https://openalex.org/W1966474166","https://openalex.org/W1968297708","https://openalex.org/W1968802784","https://openalex.org/W1983422776","https://openalex.org/W2011562113","https://openalex.org/W2013925092","https://openalex.org/W2015457254","https://openalex.org/W2016761488","https://openalex.org/W2018218474","https://openalex.org/W2027814833","https://openalex.org/W2032107708","https://openalex.org/W2052256717","https://openalex.org/W2080988231","https://openalex.org/W2091599385","https://openalex.org/W2102019950","https://openalex.org/W2112502194","https://openalex.org/W2171590590","https://openalex.org/W2504537197","https://openalex.org/W3023784225"],"related_works":["https://openalex.org/W2400861930","https://openalex.org/W3111117784","https://openalex.org/W2405282859","https://openalex.org/W2038323771","https://openalex.org/W2733854862","https://openalex.org/W4383897618","https://openalex.org/W2105757562","https://openalex.org/W2573689326","https://openalex.org/W126812865","https://openalex.org/W2784271373"],"abstract_inverted_index":{"This":[0,39],"paper":[1],"presents":[2],"a":[3],"1-opt":[4],"heuristic":[5,40,90,97,120],"approach":[6,41,121],"to":[7,30,69,101],"solve":[8],"resource":[9],"allocation/reallocation":[10],"problem":[11,20],"which":[12],"is":[13,28,42,67,91],"known":[14],"as":[15],"0/1":[16],"multichoice":[17],"multidimensional":[18],"knapsack":[19],"(MMKP).":[21],"The":[22,86,108],"intercept":[23],"matrix":[24],"of":[25,36,52,79,88,104],"the":[26,37,57,94,102,105],"constraints":[27],"employed":[29],"find":[31],"optimal":[32],"or":[33],"near\u2010optimal":[34],"solution":[35],"MMKP.":[38],"tested":[43],"for":[44,112,126,130],"33":[45],"benchmark":[46],"problems":[47,116],"taken":[48],"from":[49],"OR":[50],"library":[51],"sizes":[53],"upto":[54],"7000,":[55],"and":[56],"results":[58,110],"have":[59],"been":[60],"compared":[61,92],"with":[62,93,99],"optimum":[63],"solutions.":[64],"Computational":[65],"complexity":[66],"proved":[68],"be":[70,124],"O":[71],"(":[72],"k":[73],"l":[74],"m":[75],"n":[76],"2":[77],")":[78],"solving":[80],"heuristically":[81],"MMKP":[82],"using":[83],"this":[84,119],"approach.":[85],"performance":[87],"our":[89],"best":[95],"state\u2010of\u2010art":[96],"algorithms":[98],"respect":[100],"quality":[103],"solutions":[106,129],"found.":[107],"encouraging":[109],"especially":[111],"relatively":[113],"large\u2010size":[114],"test":[115],"indicate":[117],"that":[118],"can":[122],"successfully":[123],"used":[125],"finding":[127],"good":[128],"highly":[131],"constrained":[132],"NP\u2010hard":[133],"problems.":[134]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
