{"id":"https://openalex.org/W4200101239","doi":"https://doi.org/10.1109/iscmi53840.2021.9654824","title":"Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems","display_name":"Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems","publication_year":2021,"publication_date":"2021-11-26","ids":{"openalex":"https://openalex.org/W4200101239","doi":"https://doi.org/10.1109/iscmi53840.2021.9654824"},"language":"en","primary_location":{"id":"doi:10.1109/iscmi53840.2021.9654824","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscmi53840.2021.9654824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","raw_type":"proceedings-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/A5046903095","display_name":"Bishad Ghimire","orcid":"https://orcid.org/0000-0002-2170-1530"},"institutions":[{"id":"https://openalex.org/I154300980","display_name":"University of Bridgeport","ror":"https://ror.org/01rf3yp57","country_code":"US","type":"education","lineage":["https://openalex.org/I154300980"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bishad Ghimire","raw_affiliation_strings":["Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA","institution_ids":["https://openalex.org/I154300980"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005346248","display_name":"Ausif Mahmood","orcid":"https://orcid.org/0000-0002-8991-4268"},"institutions":[{"id":"https://openalex.org/I154300980","display_name":"University of Bridgeport","ror":"https://ror.org/01rf3yp57","country_code":"US","type":"education","lineage":["https://openalex.org/I154300980"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ausif Mahmood","raw_affiliation_strings":["Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA","institution_ids":["https://openalex.org/I154300980"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070765307","display_name":"Khaled Elleithy","orcid":"https://orcid.org/0000-0001-9239-5035"},"institutions":[{"id":"https://openalex.org/I154300980","display_name":"University of Bridgeport","ror":"https://ror.org/01rf3yp57","country_code":"US","type":"education","lineage":["https://openalex.org/I154300980"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khaled Elleithy","raw_affiliation_strings":["Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA","institution_ids":["https://openalex.org/I154300980"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046903095"],"corresponding_institution_ids":["https://openalex.org/I154300980"],"apc_list":null,"apc_paid":null,"fwci":0.4079,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69964667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"108","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998000264167786,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908000230789185,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.98580002784729,"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/optimization-problem","display_name":"Optimization problem","score":0.6592410802841187},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6465447545051575},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6356921195983887},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6221082806587219},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6020796298980713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6000242829322815},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.583148181438446},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5565669536590576},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.45491480827331543},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.433313250541687},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.41144752502441406},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.3915095329284668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3067811131477356}],"concepts":[{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6592410802841187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6465447545051575},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6356921195983887},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6221082806587219},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6020796298980713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000242829322815},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.583148181438446},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5565669536590576},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.45491480827331543},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.433313250541687},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.41144752502441406},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3915095329284668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3067811131477356},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscmi53840.2021.9654824","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscmi53840.2021.9654824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1568345435","https://openalex.org/W1752349928","https://openalex.org/W1965444148","https://openalex.org/W1985123706","https://openalex.org/W2053913299","https://openalex.org/W2161685427","https://openalex.org/W2258158792","https://openalex.org/W2754868542","https://openalex.org/W2908403308","https://openalex.org/W2982304552","https://openalex.org/W2995980576","https://openalex.org/W3003257958","https://openalex.org/W3080889453","https://openalex.org/W3098268180","https://openalex.org/W3100894865","https://openalex.org/W4288831398","https://openalex.org/W4289283645","https://openalex.org/W4297573534","https://openalex.org/W4298109276","https://openalex.org/W4312954623","https://openalex.org/W6634007516","https://openalex.org/W6637997583","https://openalex.org/W6692458951","https://openalex.org/W6697071954","https://openalex.org/W6751528541","https://openalex.org/W6756444570","https://openalex.org/W6758376739","https://openalex.org/W6780202537","https://openalex.org/W6782392032","https://openalex.org/W6791636327","https://openalex.org/W6910786960","https://openalex.org/W7008583937"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W1604040598","https://openalex.org/W2146364482","https://openalex.org/W2369428395","https://openalex.org/W3013791021","https://openalex.org/W2572756133","https://openalex.org/W1581626193","https://openalex.org/W4386961012","https://openalex.org/W2373784230"],"abstract_inverted_index":{"Quantum":[0,32,121,140],"computing":[1],"is":[2,56,165],"a":[3,49,63,127,133,139,163,171,180],"promising":[4],"technology":[5],"that":[6],"may":[7],"provide":[8],"breakthrough":[9],"solutions":[10],"to":[11,30,43,99,109,167],"today\u2019s":[12],"difficult":[13],"problems":[14,47,85],"such":[15,86],"as":[16,31,52,87],"breaking":[17],"encryption":[18],"and":[19,113,142,196,207],"solving":[20],"large-scale":[21],"combinatorial":[22,72],"optimization":[23,73,84,148,153,161],"problems.":[24],"A":[25],"class":[26],"of":[27,66,70,82,117,132,154,162,211],"algorithms":[28],"referred":[29],"Approximate":[33],"Optimization":[34,184],"Algorithm":[35,185],"(QAOA)":[36],"have":[37,96],"been":[38,77,97],"recently":[39],"proposed.":[40],"QAOA":[41,75,101],"attempts":[42,95],"approximately":[44],"solve":[45],"hard":[46],"using":[48,62,179],"protocol":[50],"know":[51],"bang-bang.":[53],"The":[54],"technique":[55],"based":[57],"on":[58,138],"the":[59,67,71,80,103,118,143,146,155,159,212],"unitary":[60],"evolution":[61],"Hamiltonian":[64],"encoding":[65],"objective":[68],"function":[69],"problem.":[74],"has":[76],"explored":[78],"in":[79,151,170],"context":[81],"several":[83],"Max-Cut":[88],"problem,":[89],"variational":[90],"Eigenvalue":[91],"problem":[92,177],"etc.":[93],"Recently,":[94],"made":[98],"create":[100],"for":[102,200,215],"Traveling":[104],"Salesman":[105],"Problem":[106],"(TSP).":[107],"Due":[108],"small":[110],"node":[111],"size":[112],"limited":[114],"solution":[115,214],"capability":[116],"currently":[119],"available":[120],"computers":[122],"and/or":[123],"simulators,":[124],"we":[125,174],"develop":[126],"hybrid":[128],"approach":[129],"where":[130],"subgraphs":[131],"TSP":[134],"tour":[135],"are":[136,149,194],"executed":[137],"computer":[141],"results":[144,193,199],"from":[145],"quantum":[147],"combined":[150],"further":[152],"whole":[156],"tour.":[157],"Since":[158],"local":[160,172],"subgraph":[164],"prone":[166],"getting":[168],"stuck":[169],"minima,":[173],"overcome":[175],"this":[176],"by":[178],"parallel":[181],"Ant":[182],"Colony":[183],"with":[186,202,217],"periodic":[187],"pheromone":[188],"exchange":[189],"between":[190],"colonies.":[191],"Our":[192],"encouraging":[195],"yield":[197],"optimum":[198],"benchmarks":[201,216],"less":[203],"than":[204],"50":[205],"nodes,":[206],"usually":[208],"within":[209],"1%":[210],"optimal":[213],"around":[218],"200":[219],"nodes.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}