{"id":"https://openalex.org/W2120011574","doi":"https://doi.org/10.1109/tase.2010.2090655","title":"An Enhanced Nested Partitions Algorithm Using Solution Value Prediction","display_name":"An Enhanced Nested Partitions Algorithm Using Solution Value Prediction","publication_year":2010,"publication_date":"2010-12-20","ids":{"openalex":"https://openalex.org/W2120011574","doi":"https://doi.org/10.1109/tase.2010.2090655","mag":"2120011574"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2010.2090655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2010.2090655","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","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/A5100367131","display_name":"Weiwei Chen","orcid":"https://orcid.org/0000-0002-7736-3411"},"institutions":[{"id":"https://openalex.org/I4210134512","display_name":"GE Global Research (United States)","ror":"https://ror.org/03e06qt98","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134512"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiwei Chen","raw_affiliation_strings":["GE Global Research Center, Niskayuna, NY, USA","GE Global Research,Niskayuna,NY,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GE Global Research Center, Niskayuna, NY, USA","institution_ids":["https://openalex.org/I4210134512"]},{"raw_affiliation_string":"GE Global Research,Niskayuna,NY,USA","institution_ids":["https://openalex.org/I4210134512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002882677","display_name":"Liang Pi","orcid":null},"institutions":[{"id":"https://openalex.org/I139787848","display_name":"Capital University","ror":"https://ror.org/00jy9e726","country_code":"US","type":"education","lineage":["https://openalex.org/I139787848"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liang Pi","raw_affiliation_strings":["SAC Capital, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SAC Capital, New York, NY, USA","institution_ids":["https://openalex.org/I139787848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101529205","display_name":"Leyuan Shi","orcid":"https://orcid.org/0000-0002-1397-2891"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leyuan Shi","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Wisconsin, Madison, Madison, WI, USA","Dept. of Ind. & Syst. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Wisconsin, Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6133,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86255547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"2","first_page":"412","last_page":"419"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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.9986000061035156,"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/metaheuristic","display_name":"Metaheuristic","score":0.7952945828437805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6550067663192749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5775025486946106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.505068838596344},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4145349860191345},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4120830297470093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2786843180656433},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1355995535850525}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7952945828437805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6550067663192749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5775025486946106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.505068838596344},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4145349860191345},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4120830297470093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2786843180656433},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1355995535850525}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tase.2010.2090655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2010.2090655","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11685431140004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/An-Enhanced-Nested-Partitions-Algorithm-Using/991031758433304646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1500657154","https://openalex.org/W1639032689","https://openalex.org/W1979545432","https://openalex.org/W1982513177","https://openalex.org/W1986790369","https://openalex.org/W1993229675","https://openalex.org/W2005234139","https://openalex.org/W2015483401","https://openalex.org/W2024060531","https://openalex.org/W2039604983","https://openalex.org/W2041055999","https://openalex.org/W2052517439","https://openalex.org/W2069514727","https://openalex.org/W2091113261","https://openalex.org/W2107214544","https://openalex.org/W2108334735","https://openalex.org/W2110063656","https://openalex.org/W2115177464","https://openalex.org/W2137215422","https://openalex.org/W2163428398","https://openalex.org/W2166827312","https://openalex.org/W2336259629","https://openalex.org/W2502759836","https://openalex.org/W4230870880","https://openalex.org/W4253841098"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W4236055036","https://openalex.org/W4381955442","https://openalex.org/W2462483068","https://openalex.org/W1968397678","https://openalex.org/W4367557724","https://openalex.org/W1547053391","https://openalex.org/W4382044826","https://openalex.org/W4387932000","https://openalex.org/W3095745430"],"abstract_inverted_index":{"Metaheuristics":[0],"are":[1,49,70],"an":[2,73],"important":[3],"branch":[4],"of":[5,11,21,56,92,106],"optimization":[6,41],"algorithms":[7],"that":[8],"attract":[9],"lots":[10],"research":[12,20],"and":[13,104],"application":[14],"efforts.":[15],"In":[16],"this":[17],"paper,":[18],"the":[19,53,60,102,107],"predicting":[22],"solution":[23,61],"value":[24],"for":[25,38,83,95],"Nested":[26],"Partitions":[27],"(NP)":[28],"is":[29,32],"proposed,":[30],"which":[31,88],"a":[33,79,90],"newly":[34],"developed":[35,50],"metaheuristic":[36],"algorithm":[37,76,81],"solving":[39],"large-scale":[40,96],"problems.":[42,97],"The":[43,67,98],"lower":[44],"bound":[45],"embedded":[46],"prediction":[47,68,111],"procedures":[48,69,112],"to":[51,77,117],"predict":[52],"future":[54],"performance":[55],"NP":[57,75,84],"based":[58],"on":[59],"values":[62],"obtained":[63],"at":[64,85],"early":[65,86],"iterations.":[66],"used":[71],"in":[72],"enhanced":[74],"select":[78],"proper":[80],"setting":[82],"stage,":[87],"saves":[89],"lot":[91],"computational":[93,99],"resource":[94],"tests":[100],"show":[101],"accuracy":[103],"effectiveness":[105],"proposed":[108],"algorithm.":[109],"These":[110],"can":[113],"be":[114],"also":[115],"applied":[116],"some":[118],"other":[119],"metaheuristics.":[120]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}