{"id":"https://openalex.org/W4413311574","doi":"https://doi.org/10.1145/3729878.3746617","title":"Hyper-GRASP: A Hypervolume-Based Constructive Heuristic","display_name":"Hyper-GRASP: A Hypervolume-Based Constructive Heuristic","publication_year":2025,"publication_date":"2025-08-19","ids":{"openalex":"https://openalex.org/W4413311574","doi":"https://doi.org/10.1145/3729878.3746617"},"language":"en","primary_location":{"id":"doi:10.1145/3729878.3746617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746617","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3729878.3746617","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101998443","display_name":"Gon\u00e7alo Lopes","orcid":"https://orcid.org/0000-0003-4192-689X"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Gon\u00e7alo Lopes","raw_affiliation_strings":["University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal"],"raw_orcid":"https://orcid.org/0000-0003-4192-689X","affiliations":[{"raw_affiliation_string":"University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055996291","display_name":"Lu\u00eds Paquete","orcid":"https://orcid.org/0000-0001-7525-8901"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Lu\u00eds Paquete","raw_affiliation_strings":["University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal"],"raw_orcid":"https://orcid.org/0000-0001-7525-8901","affiliations":[{"raw_affiliation_string":"University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038504776","display_name":"Carlos M. Fonseca","orcid":"https://orcid.org/0000-0001-5162-2457"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Carlos Fonseca","raw_affiliation_strings":["University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal"],"raw_orcid":"https://orcid.org/0000-0001-5162-2457","affiliations":[{"raw_affiliation_string":"University of Coimbra, CISUC/LASI, DEI, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101998443"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2838233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"178","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9977999925613403,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9977999925613403,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9962000250816345,"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/grasp","display_name":"GRASP","score":0.878174901008606},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7405413389205933},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7132673859596252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5921058654785156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5163837671279907},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3301714062690735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31210970878601074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06618756055831909}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.878174901008606},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7405413389205933},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7132673859596252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5921058654785156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5163837671279907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3301714062690735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31210970878601074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06618756055831909},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729878.3746617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746617","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3729878.3746617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746617","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1347574001","display_name":null,"funder_award_id":"CA22137","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G6749827554","display_name":null,"funder_award_id":"2021.07381.BD, UIDB/00326/2025 and UIDP/00326/2025","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W110584030","https://openalex.org/W118285713","https://openalex.org/W1497425225","https://openalex.org/W1502839085","https://openalex.org/W1527824269","https://openalex.org/W1528711985","https://openalex.org/W1538348021","https://openalex.org/W1558919105","https://openalex.org/W1564638059","https://openalex.org/W1588375755","https://openalex.org/W1769929792","https://openalex.org/W1965680834","https://openalex.org/W1968876856","https://openalex.org/W1993123118","https://openalex.org/W2020127609","https://openalex.org/W2028438572","https://openalex.org/W2038420231","https://openalex.org/W2043847750","https://openalex.org/W2044562026","https://openalex.org/W2050914643","https://openalex.org/W2060322444","https://openalex.org/W2064659014","https://openalex.org/W2065148320","https://openalex.org/W2073819677","https://openalex.org/W2074514699","https://openalex.org/W2074954931","https://openalex.org/W2098907614","https://openalex.org/W2102048265","https://openalex.org/W2108968575","https://openalex.org/W2130651948","https://openalex.org/W2159307101","https://openalex.org/W2161880126","https://openalex.org/W2736457838","https://openalex.org/W2749049297","https://openalex.org/W2984307052","https://openalex.org/W2997776631","https://openalex.org/W2999087044","https://openalex.org/W3046910774","https://openalex.org/W3087354970","https://openalex.org/W3141867575","https://openalex.org/W3162269979","https://openalex.org/W3177307174","https://openalex.org/W3183976931","https://openalex.org/W4302557773","https://openalex.org/W4394849239","https://openalex.org/W4404421150","https://openalex.org/W6949610434","https://openalex.org/W6950437952"],"related_works":["https://openalex.org/W2163296013","https://openalex.org/W2743859443","https://openalex.org/W2326995835","https://openalex.org/W165915117","https://openalex.org/W2059402478","https://openalex.org/W2123347777","https://openalex.org/W4387804363","https://openalex.org/W2019547100","https://openalex.org/W2477150073","https://openalex.org/W2963326767"],"abstract_inverted_index":{"This":[0],"article":[1],"proposes":[2],"a":[3,60,64],"novel":[4],"constructive":[5],"heuristic":[6],"approach,":[7],"Hyper-GRASP,":[8],"that":[9,111],"integrates":[10],"the":[11,35,45,49,73,78,93,98,112,118,133,138],"hypervolume":[12,46],"indicator":[13],"and":[14,30,70,82,97,142],"GRASP":[15],"principles":[16],"to":[17,63,104],"solve":[18],"multiobjective":[19,94,134],"combinatorial":[20],"optimization":[21],"problems.":[22],"The":[23,53,87,108],"approach":[24,89],"constructs":[25],"solutions":[26,84],"iteratively":[27],"by":[28,40],"generating":[29],"evaluating":[31],"candidate":[32],"extensions":[33],"of":[34,48],"current":[36],"partial":[37],"solution,":[38],"guided":[39],"an":[41],"optimistic":[42],"bound":[43],"on":[44,92],"contribution":[47],"future":[50],"complete":[51],"solution.":[52],"most":[54],"promising":[55],"extension":[56],"is":[57,90],"selected":[58],"from":[59],"pool":[61],"according":[62],"parameter":[65],"\u03b1,":[66],"which":[67],"balances":[68],"greediness":[69],"exploration":[71],"during":[72],"solution":[74],"construction":[75],"phase.":[76],"Throughout":[77],"procedure,":[79],"only":[80],"feasible":[81],"nondominated":[83],"are":[85],"retained.":[86],"proposed":[88],"tested":[91],"knapsack":[95,135],"problem":[96,103,136,139],"biobjective":[99],"minimum":[100],"spanning":[101],"tree":[102],"assess":[105],"its":[106],"performance.":[107],"results":[109],"show":[110],"best-performing":[113],"Hyper-GRASP":[114],"variant":[115],"effectively":[116],"approximates":[117],"Pareto":[119],"front":[120],"across":[121,143],"various":[122,144],"instances.":[123],"Moreover,":[124],"it":[125],"can":[126],"also":[127],"outperform":[128],"state-of-the-art":[129],"exact":[130],"algorithms":[131],"for":[132],"as":[137],"size":[140],"increases":[141],"time":[145],"budgets.":[146]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}