{"id":"https://openalex.org/W4391306339","doi":"https://doi.org/10.1109/auteee60196.2023.10408155","title":"An Enumeration-Based Deterministic Algorithm for Solving optimization Problem","display_name":"An Enumeration-Based Deterministic Algorithm for Solving optimization Problem","publication_year":2023,"publication_date":"2023-12-15","ids":{"openalex":"https://openalex.org/W4391306339","doi":"https://doi.org/10.1109/auteee60196.2023.10408155"},"language":"en","primary_location":{"id":"doi:10.1109/auteee60196.2023.10408155","doi":"https://doi.org/10.1109/auteee60196.2023.10408155","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/auteee60196.2023.10408155","pdf_url":null,"source":{"id":"https://openalex.org/S4363608018","display_name":"IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","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":"2023 IEEE 6th International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4391306339"],"child_works_count":0,"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/A5040120584","display_name":"Changlin Yang","orcid":"https://orcid.org/0000-0003-1352-7429","observed_orcids":["https://orcid.org/0000-0003-1352-7429"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Changlin Yang","raw_affiliation_strings":["Aeronautics Computing Technology Research Institute,Process Management Office,Xi\u2019an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aeronautics Computing Technology Research Institute,Process Management Office,Xi\u2019an,China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5040120584"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"403","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0005000000237487257,"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/search-trees","display_name":"search trees","score":0.734000027179718},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.8109999895095825},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"job shop scheduling","score":0.9850000143051147},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":1.0},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9649999737739563},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.9629999995231628},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.5609999895095825},{"id":"https://openalex.org/keywords/swarm-intelligence-comparison","display_name":"swarm intelligence comparison","score":0.6600000262260437}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6902555227279663},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.53947913646698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5348784923553467},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5275934338569641},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.507614254951477},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4960716664791107},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4830789864063263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46706944704055786},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.4539905786514282},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43910977244377136},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.42801952362060547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4226433336734772},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4218539595603943},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.413080096244812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/auteee60196.2023.10408155","doi":"https://doi.org/10.1109/auteee60196.2023.10408155","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/auteee60196.2023.10408155","pdf_url":null,"source":{"id":"https://openalex.org/S4363608018","display_name":"IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","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":"2023 IEEE 6th International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","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":7,"referenced_works":["https://openalex.org/W2187603356","https://openalex.org/W2366358324","https://openalex.org/W2367281410","https://openalex.org/W2392297449","https://openalex.org/W2394235892","https://openalex.org/W2744990899","https://openalex.org/W3041378068"],"related_works":["https://openalex.org/W2079809585","https://openalex.org/W4233276565","https://openalex.org/W165725277","https://openalex.org/W4206259961","https://openalex.org/W2175193248","https://openalex.org/W2741408991","https://openalex.org/W7096642763","https://openalex.org/W1974868713","https://openalex.org/W3215443135","https://openalex.org/W2059363010"],"abstract_inverted_index":{"An":[0],"enumeration-based":[1,152],"deterministic":[2,139,153],"algorithm":[3,70,97,140,154],"is":[4,19,37,54,66,71,141],"proposed":[5,69],"for":[6,15,73,110,125],"solving":[7],"optimization":[8,41,78,105],"problem.":[9,162],"Discretization":[10],"of":[11,42,47,64,76,102,135],"the":[12,28,40,58,62,95,111,122,133],"feasible":[13,123],"region":[14,36,124],"each":[16,126],"decision":[17,127],"variable":[18],"applied":[20,72],"to":[21,56,158],"establish":[22],"search":[23,35,48,59],"tree":[24],"so":[25],"that":[26,109,144,151],"all":[27],"solutions":[29],"could":[30,117,155],"be":[31,118,156],"enumerated.":[32],"A":[33],"new":[34,96],"established":[38],"from":[39,138,145],"previous":[43],"literation.":[44],"Meanwhile,":[45],"adjustment":[46],"step":[49],"with":[50,100],"exponential":[51],"decay":[52],"function":[53],"conducive":[55],"reducing":[57],"scope":[60],"until":[61],"convergence":[63,115],"result":[65],"realized.":[67],"The":[68,91],"three":[74],"kinds":[75],"typical":[77],"problem,":[79,132],"including":[80],"Non-linear":[81],"Programing":[82],"Problem,":[83],"Job-Shop":[84],"Scheduling":[85],"Problem":[86],"and":[87],"Traveling":[88],"Salesman":[89],"Problem.":[90],"results":[92,101,136],"obtained":[93,137],"by":[94,120],"are":[98],"compared":[99],"swarm":[103],"intelligent":[104],"algorithm.":[106],"Results":[107],"indicate":[108],"combinational":[112],"optimization,":[113],"high":[114],"rate":[116],"realized":[119],"adjusting":[121],"variable.":[128],"For":[129],"non-linear":[130],"programming":[131],"accuracy":[134],"better":[142],"than":[143],"self-organizing":[146],"migrating":[147],"algorithm,":[148],"which":[149],"infers":[150],"used":[157],"solve":[159],"NP":[160],"hard":[161]},"counts_by_year":[],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2024-01-30T00:00:00"}