{"id":"https://openalex.org/W2750438586","doi":"https://doi.org/10.24017/science.2017.3.15","title":"Optimization Algorithm\u2019s Problems: Comparison Study","display_name":"Optimization Algorithm\u2019s Problems: Comparison Study","publication_year":2017,"publication_date":"2017-08-27","ids":{"openalex":"https://openalex.org/W2750438586","doi":"https://doi.org/10.24017/science.2017.3.15","mag":"2750438586"},"language":"en","primary_location":{"id":"doi:10.24017/science.2017.3.15","doi":"https://doi.org/10.24017/science.2017.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.24017/science.2017.3.15","pdf_url":"http://kjar.spu.edu.iq/index.php/kjar/article/download/80/88","source":{"id":"https://openalex.org/S4210186287","display_name":"Kurdistan Journal of Applied Research","issn_l":"2411-7684","issn":["2411-7684","2411-7706"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310319164","host_organization_name":"Slemani Polytechnic University","host_organization_lineage":["https://openalex.org/P4310319164"],"host_organization_lineage_names":["Slemani Polytechnic University"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kurdistan Journal of Applied Research","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://kjar.spu.edu.iq/index.php/kjar/article/download/80/88","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038305436","display_name":"Rebaz M. Nabi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3133014862","display_name":"Sulaimani Polytechnic University","ror":"https://ror.org/05v9vy052","country_code":"IQ","type":"education","lineage":["https://openalex.org/I3133014862"]},{"id":"https://openalex.org/I4387152906","display_name":"Kurdistan Technical Institute","ror":"https://ror.org/01zzcvm19","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4387152906"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Rebaz M. Nabi","raw_affiliation_strings":["Deputy Dean ,  Kurdistan Technical Institute,    Sulaimani Polytechnic University,   Sulaimani, Iraq","Network Dept,  Technical College of informatics, Sulaimani Polytechnic University ,  Kurdistan Technical Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deputy Dean ,  Kurdistan Technical Institute,    Sulaimani Polytechnic University,   Sulaimani, Iraq","institution_ids":["https://openalex.org/I3133014862","https://openalex.org/I4387152906"]},{"raw_affiliation_string":"Network Dept,  Technical College of informatics, Sulaimani Polytechnic University ,  Kurdistan Technical Institute","institution_ids":["https://openalex.org/I3133014862","https://openalex.org/I4387152906"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103051206","display_name":"Rania Azad","orcid":"https://orcid.org/0000-0002-4492-1069","observed_orcids":["https://orcid.org/0000-0002-4492-1069"]},"institutions":[{"id":"https://openalex.org/I3133014862","display_name":"Sulaimani Polytechnic University","ror":"https://ror.org/05v9vy052","country_code":"IQ","type":"education","lineage":["https://openalex.org/I3133014862"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Rania Azad","raw_affiliation_strings":["Network Department ,  Computer Science Institute  , Sulaimani Polytechnic University , Sulaimani, Iraq"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Network Department ,  Computer Science Institute  , Sulaimani Polytechnic University , Sulaimani, Iraq","institution_ids":["https://openalex.org/I3133014862"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083832355","display_name":"Soran Saeed","orcid":"https://orcid.org/0000-0001-8826-6716","observed_orcids":["https://orcid.org/0000-0001-8826-6716"]},"institutions":[{"id":"https://openalex.org/I3133014862","display_name":"Sulaimani Polytechnic University","ror":"https://ror.org/05v9vy052","country_code":"IQ","type":"education","lineage":["https://openalex.org/I3133014862"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Soran Saeed","raw_affiliation_strings":["Vice president , Sulaimani Polytechnic University, Sulaimani, Iraq"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vice president , Sulaimani Polytechnic University, Sulaimani, Iraq","institution_ids":["https://openalex.org/I3133014862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044274884","display_name":"Rebwar M. Nabi","orcid":"https://orcid.org/0000-0003-2709-7941","observed_orcids":["https://orcid.org/0000-0003-2709-7941"]},"institutions":[{"id":"https://openalex.org/I3133014862","display_name":"Sulaimani Polytechnic University","ror":"https://ror.org/05v9vy052","country_code":"IQ","type":"education","lineage":["https://openalex.org/I3133014862"]},{"id":"https://openalex.org/I4387152906","display_name":"Kurdistan Technical Institute","ror":"https://ror.org/01zzcvm19","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4387152906"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Rebwar M. Nabi","raw_affiliation_strings":["Deputy Dean ,  Kurdistan Technical Institute,    Sulaimani Polytechnic University,   Sulaimani, Iraq","Network Dept,  Technical College of informatics, Sulaimani Polytechnic University ,  Kurdistan Technical Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deputy Dean ,  Kurdistan Technical Institute,    Sulaimani Polytechnic University,   Sulaimani, Iraq","institution_ids":["https://openalex.org/I3133014862","https://openalex.org/I4387152906"]},{"raw_affiliation_string":"Network Dept,  Technical College of informatics, Sulaimani Polytechnic University ,  Kurdistan Technical Institute","institution_ids":["https://openalex.org/I3133014862","https://openalex.org/I4387152906"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":250000,"currency":"IQD","value_usd":null},"apc_paid":null,"fwci":0.4873,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57352839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":"2","issue":"3","first_page":"25","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.001500000013038516,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/optimization-algorithms","display_name":"optimization algorithms","score":0.9810000061988831},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.8420000076293945},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8489999771118164},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.9990000128746033},{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":0.9670000076293945},{"id":"https://openalex.org/keywords/algorithm-limitations","display_name":"algorithm limitations","score":0.5019999742507935},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7509999871253967}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.78218013048172},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6699051260948181},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6182948350906372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5998432040214539},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5086292028427124},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4771568179130554},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.467628538608551},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4528655409812927},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.42734748125076294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3880999684333801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32588475942611694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2390596866607666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21962818503379822},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24017/science.2017.3.15","doi":"https://doi.org/10.24017/science.2017.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.24017/science.2017.3.15","pdf_url":"http://kjar.spu.edu.iq/index.php/kjar/article/download/80/88","source":{"id":"https://openalex.org/S4210186287","display_name":"Kurdistan Journal of Applied Research","issn_l":"2411-7684","issn":["2411-7684","2411-7706"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310319164","host_organization_name":"Slemani Polytechnic University","host_organization_lineage":["https://openalex.org/P4310319164"],"host_organization_lineage_names":["Slemani Polytechnic University"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kurdistan Journal of Applied Research","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:61c00a80110a48aab48ca59830bcfdb7","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/61c00a80110a48aab48ca59830bcfdb7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kurdistan Journal of Applied Research, Vol 2, Iss 3, Pp 25-31 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.24017/science.2017.3.15","doi":"https://doi.org/10.24017/science.2017.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.24017/science.2017.3.15","pdf_url":"http://kjar.spu.edu.iq/index.php/kjar/article/download/80/88","source":{"id":"https://openalex.org/S4210186287","display_name":"Kurdistan Journal of Applied Research","issn_l":"2411-7684","issn":["2411-7684","2411-7706"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310319164","host_organization_name":"Slemani Polytechnic University","host_organization_lineage":["https://openalex.org/P4310319164"],"host_organization_lineage_names":["Slemani Polytechnic University"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kurdistan Journal of Applied Research","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2750438586.pdf","grobid_xml":"https://content.openalex.org/works/W2750438586.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W75740688","https://openalex.org/W1606402766","https://openalex.org/W1794401605","https://openalex.org/W1971123384","https://openalex.org/W1975010687","https://openalex.org/W1975789655","https://openalex.org/W2004061489","https://openalex.org/W2013449471","https://openalex.org/W2020381385","https://openalex.org/W2024518622","https://openalex.org/W2028762849","https://openalex.org/W2054458431","https://openalex.org/W2080844985","https://openalex.org/W2096908543","https://openalex.org/W2112813244","https://openalex.org/W2133544949","https://openalex.org/W2134215165","https://openalex.org/W2147965279","https://openalex.org/W2155852554","https://openalex.org/W2163286715","https://openalex.org/W2164424155","https://openalex.org/W3100933494"],"related_works":["https://openalex.org/W4392389466","https://openalex.org/W7099075351","https://openalex.org/W2902084147","https://openalex.org/W948953662","https://openalex.org/W3179478117","https://openalex.org/W2754127623","https://openalex.org/W2883624576","https://openalex.org/W7135378514","https://openalex.org/W829565004","https://openalex.org/W4408073277"],"abstract_inverted_index":{"Currently,":[0],"in":[1,30,44,80,132],"various":[2,70],"fields":[3],"and":[4,106],"disciplines":[5],"problem":[6,61],"optimization":[7,28],"are":[8,20,73],"used":[9],"commonly.":[10],"In":[11],"this":[12,81,133],"concern,":[13],"we":[14,83],"have":[15],"to":[16,32,40,90],"define":[17],"solutions":[18],"which":[19,56,72],"two":[21],"known":[22],"concepts":[23],"optimal":[24,27],"or":[25],"near":[26],"problems":[29,42],"regards":[31],"some":[33,49,85],"objects.":[34],"Usually,":[35],"it":[36,60],"is":[37,67],"surely":[38],"difficult":[39],"sort":[41,91],"out":[43,92],"only":[45],"one":[46,75],"step,":[47],"but":[48,125],"processes":[50],"can":[51],"be":[52,115,136],"followed":[53],"by":[54],"us":[55,89],"people":[57],"usually":[58],"call":[59],"solving.":[62],"Frequently,":[63],"the":[64,77,97,111,118,127,129],"solution":[65],"process":[66],"split":[68],"into":[69],"steps":[71],"accomplishing":[74],"after":[76],"other.":[78],"Therefore,":[79],"paper":[82],"consider":[84],"algorithms":[86],"that":[87],"help":[88],"problems,":[93],"for":[94],"exemplify,":[95],"finding":[96],"shortest":[98],"path,":[99],"minimum":[100],"spanning":[101],"tree,":[102],"maximum":[103,107],"network":[104],"flows":[105],"matching.":[108],"More":[109],"importantly,":[110],"algorithm":[112],"comparison":[113],"will":[114,135],"presented.":[116],"Additionally,":[117],"limitation":[119],"of":[120],"each":[121],"algorithm.":[122],"The":[123],"last":[124],"not":[126],"least,":[128],"future":[130],"research":[131],"area":[134],"approached.":[137]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2017-08-31T00:00:00"}
