{"id":"https://openalex.org/W4294811646","doi":"https://doi.org/10.1109/cec55065.2022.9870417","title":"Algorithm Selection for Combinatorial Packing Problems","display_name":"Algorithm Selection for Combinatorial Packing Problems","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4294811646","doi":"https://doi.org/10.1109/cec55065.2022.9870417"},"language":"en","primary_location":{"id":"doi:10.1109/cec55065.2022.9870417","doi":"https://doi.org/10.1109/cec55065.2022.9870417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870417","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5064675371","display_name":"Ioana Sitaru","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ioana Sitaru","raw_affiliation_strings":["\u201cAlexandru Ioan Cuza\u201d University of Iasi,Faculty of Computer Science,Iasi,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u201cAlexandru Ioan Cuza\u201d University of Iasi,Faculty of Computer Science,Iasi,Romania","institution_ids":["https://openalex.org/I138164181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014135155","display_name":"M\u0103d\u0103lina R\u0103schip","orcid":"https://orcid.org/0000-0003-0020-636X","observed_orcids":["https://orcid.org/0000-0003-0020-636X"]},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Madalina Raschip","raw_affiliation_strings":["\u201cAlexandru Ioan Cuza\u201d University of Iasi,Faculty of Computer Science,Iasi,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u201cAlexandru Ioan Cuza\u201d University of Iasi,Faculty of Computer Science,Iasi,Romania","institution_ids":["https://openalex.org/I138164181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I138164181"],"apc_list":null,"apc_paid":null,"fwci":0.7394,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63709582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9854000210762024,"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.9854000210762024,"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.008200000040233135,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0008999999845400453,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm-selection","display_name":"algorithm selection","score":0.9829999804496765},{"id":"https://openalex.org/keywords/feature-extraction","display_name":"feature extraction","score":0.6439999938011169},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8140000104904175},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.8109999895095825},{"id":"https://openalex.org/keywords/regression-models","display_name":"regression models","score":0.574999988079071},{"id":"https://openalex.org/keywords/execution-time-prediction","display_name":"execution time prediction","score":0.6600000262260437}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7736368179321289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7673018574714661},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6784330606460571},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6587318181991577},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5346996188163757},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4948095679283142},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4658884108066559},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.43429094552993774},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.42860308289527893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4152403771877289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3776850402355194},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2995332181453705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13321799039840698},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec55065.2022.9870417","doi":"https://doi.org/10.1109/cec55065.2022.9870417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870417","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1477325308","https://openalex.org/W1495775210","https://openalex.org/W1545315505","https://openalex.org/W1595545560","https://openalex.org/W2011690685","https://openalex.org/W2014048333","https://openalex.org/W2019318803","https://openalex.org/W2032392871","https://openalex.org/W2058830640","https://openalex.org/W2060747552","https://openalex.org/W2074821977","https://openalex.org/W2076672803","https://openalex.org/W2136588799","https://openalex.org/W2138159236","https://openalex.org/W2147148915","https://openalex.org/W2151554678","https://openalex.org/W2166843422","https://openalex.org/W2167690750","https://openalex.org/W2171979979","https://openalex.org/W2734645630","https://openalex.org/W2898873842","https://openalex.org/W3086639963","https://openalex.org/W3129716652","https://openalex.org/W4299496912"],"related_works":["https://openalex.org/W2163780222","https://openalex.org/W2111772266","https://openalex.org/W4308194743","https://openalex.org/W7099601344","https://openalex.org/W2163144548","https://openalex.org/W3129716652","https://openalex.org/W2534978708","https://openalex.org/W4289779404","https://openalex.org/W2107173823","https://openalex.org/W1973235702"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,101],"way":[4],"of":[5,19,38,56,80,134],"building":[6],"an":[7],"algorithm":[8,68,108],"selection":[9,90],"system":[10,99,120],"for":[11,69,88],"the":[12,36,41,54,60,65,72,77,81,89,97,106,111,115,119,131,135],"two-dimensional":[13],"rectangle":[14],"packing":[15],"problem.":[16,136],"A":[17],"list":[18],"features":[20,39],"was":[21],"defined,":[22],"and":[23,26,76,114],"five":[24],"heuristics":[25],"metaheuristics":[27],"were":[28,83],"selected":[29],"as":[30,85],"solvers.":[31],"The":[32,92],"first":[33],"step":[34],"involves":[35],"extraction":[37],"from":[40],"input":[42],"problem":[43],"instances.":[44],"Using":[45],"those":[46],"computed":[47],"features,":[48],"machine":[49],"learning":[50],"regressors":[51],"will":[52],"predict":[53],"performance":[55,86],"each":[57],"solver":[58],"on":[59,110],"instance":[61],"and,":[62],"therefore,":[63],"find":[64],"most":[66],"fitted":[67],"it.":[70],"Both":[71],"predicted":[73],"execution":[74,113],"time":[75],"expected":[78],"quality":[79],"solution":[82,116],"used":[84],"metrics":[87],"step.":[91],"experimental":[93],"results":[94,123],"showed":[95],"that":[96],"built":[98],"has":[100],"high":[102],"accuracy":[103],"in":[104],"predicting":[105],"best":[107],"based":[109],"runtime":[112],"quality.":[117],"Moreover,":[118],"achieves":[121],"these":[122],"with":[124],"much":[125],"lower":[126],"computational":[127],"resources":[128],"than":[129],"running":[130],"actual":[132],"solvers":[133]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2022-09-06T00:00:00"}