{"id":"https://openalex.org/W4414701174","doi":"https://doi.org/10.1504/ijmor.2025.148874","title":"A genetic algorithm combined with mathematical programming to solve generalised quadratic multiple knapsack problem","display_name":"A genetic algorithm combined with mathematical programming to solve generalised quadratic multiple knapsack problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414701174","doi":"https://doi.org/10.1504/ijmor.2025.148874"},"language":"en","primary_location":{"id":"doi:10.1504/ijmor.2025.148874","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148874","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043445898","display_name":"Yassine Adouani","orcid":"https://orcid.org/0000-0003-3461-5794"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Yassine Adouani","raw_affiliation_strings":["Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems Laboratory, University of Sfax, Tunisia"],"affiliations":[{"raw_affiliation_string":"Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems Laboratory, University of Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043445898"],"corresponding_institution_ids":["https://openalex.org/I142899784"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40081487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"2","first_page":"199","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9973999857902527,"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.9973999857902527,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9905999898910522,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9707000255584717,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9652000069618225},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7915999889373779},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.7472000122070312},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5777999758720398},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5705000162124634},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5368000268936157},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5254999995231628},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48240000009536743}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9652000069618225},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7915999889373779},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7472000122070312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6787999868392944},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5777999758720398},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5705000162124634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.555400013923645},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5368000268936157},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5254999995231628},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48240000009536743},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4675999879837036},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.3714999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36809998750686646},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3521000146865845},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.33880001306533813},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.296099990606308},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2750999927520752}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmor.2025.148874","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148874","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,35],"this":[1],"paper,":[2],"the":[3,32,36,46,56,84,101,106,109,114,118,125],"generalised":[4],"quadratic":[5],"multiple":[6],"knapsack":[7,64,79],"problem":[8,51,116],"(GQMKP)":[9],"is":[10,42,58,73,87],"tackled":[11],"with":[12,26,120],"an":[13,70],"efficient":[14],"hybrid":[15],"approach,":[16,38],"called":[17,52],"GA&IP,":[18],"which":[19],"combines":[20],"a":[21,39,49,67],"binary":[22],"genetic":[23,126],"algorithm":[24,72],"(GA)":[25],"integer":[27,121],"programming":[28,122],"(IP)":[29],"to":[30,44,75],"solve":[31,77],"GQMKP":[33,47,115],"problem.":[34,80],"GA&IP":[37,85,111],"linearisation":[40],"technique":[41],"used":[43,99],"transform":[45],"into":[48,60],"linear":[50],"LGQMKP.":[53],"After":[54],"that,":[55],"LGQMKP":[57],"transformed":[59],"several":[61],"dependent":[62],"classical":[63],"problems":[65],"using":[66],"GA.":[68],"Finally,":[69],"IP":[71],"applied":[74],"optimally":[76],"each":[78],"The":[81],"effectiveness":[82,107],"of":[83,108],"approach":[86],"demonstrated":[88],"through":[89],"experimentation":[90],"on":[91],"96":[92],"diverse":[93],"benchmark":[94],"instances":[95],"that":[96],"are":[97],"commonly":[98],"in":[100,112],"field.":[102],"Experimental":[103],"results":[104],"show":[105],"proposed":[110],"solving":[113],"and":[117],"hybridisation":[119],"can":[123],"enhance":[124],"algorithm.":[127]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}