{"id":"https://openalex.org/W2968960522","doi":"https://doi.org/10.1109/cec.2019.8789885","title":"QDSOMA: Towards the Utilization of Quantum Computing within SOMA","display_name":"QDSOMA: Towards the Utilization of Quantum Computing within SOMA","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2968960522","doi":"https://doi.org/10.1109/cec.2019.8789885","mag":"2968960522"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8789885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8789885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","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/A5056523918","display_name":"Petr Gajdo\u0161","orcid":"https://orcid.org/0000-0003-1831-3489"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Gajdos","raw_affiliation_strings":["Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083236211","display_name":"Marek B\u011bh\u00e1lek","orcid":"https://orcid.org/0000-0002-9204-2691"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Marek Behalek","raw_affiliation_strings":["Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114803182","display_name":"Jan Janou\u0161ek","orcid":"https://orcid.org/0000-0002-9820-7610"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Janousek","raw_affiliation_strings":["Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088934266","display_name":"Pavel Kr\u00f6mer","orcid":"https://orcid.org/0000-0001-8428-3332"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Kromer","raw_affiliation_strings":["Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, V\u0160B - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09126689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"2900","last_page":"2907"},"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.9991999864578247,"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.9991999864578247,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9941999912261963,"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/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.714270830154419},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.6251936554908752},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.577924370765686},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5560725927352905},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.48907238245010376},{"id":"https://openalex.org/keywords/quantum-phase-estimation-algorithm","display_name":"Quantum phase estimation algorithm","score":0.47199276089668274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4619723856449127},{"id":"https://openalex.org/keywords/quantum-information","display_name":"Quantum information","score":0.45417213439941406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4218669533729553},{"id":"https://openalex.org/keywords/quantum-network","display_name":"Quantum network","score":0.26991021633148193}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.714270830154419},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6251936554908752},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.577924370765686},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5560725927352905},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.48907238245010376},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.47199276089668274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4619723856449127},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.45417213439941406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4218669533729553},{"id":"https://openalex.org/C186468114","wikidata":"https://www.wikidata.org/wiki/Q836478","display_name":"Quantum network","level":4,"score":0.26991021633148193},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2019.8789885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8789885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W134444305","https://openalex.org/W198078190","https://openalex.org/W822749331","https://openalex.org/W1523919182","https://openalex.org/W1541400212","https://openalex.org/W1543488019","https://openalex.org/W1680797894","https://openalex.org/W1879678483","https://openalex.org/W2006751452","https://openalex.org/W2010580381","https://openalex.org/W2011585646","https://openalex.org/W2035518222","https://openalex.org/W2035584134","https://openalex.org/W2122274805","https://openalex.org/W2130874842","https://openalex.org/W2136885049","https://openalex.org/W2402846924","https://openalex.org/W2470788389","https://openalex.org/W2990961515"],"related_works":["https://openalex.org/W3206120658","https://openalex.org/W4388704119","https://openalex.org/W4281550036","https://openalex.org/W3094689058","https://openalex.org/W2409877639","https://openalex.org/W2910123824","https://openalex.org/W2911278742","https://openalex.org/W2103278447","https://openalex.org/W2803326230","https://openalex.org/W3037649077"],"abstract_inverted_index":{"Nowadays,":[0],"a":[1,41,57,61,105],"new":[2,17],"type":[3],"of":[4,19,30,33,49,56,86,94,128,135],"algorithms":[5,100],"inspired":[6],"by":[7,117],"the":[8,31,54,80,87,92,109,129,133,142],"quantum":[9,34,42,58,67,95,106,118],"theory":[10],"has":[11,145],"arisen":[12],"and":[13,73,120],"brought":[14],"to":[15,125],"light":[16],"views":[18],"solving":[20],"standard":[21],"computational":[22],"problems":[23],"like":[24],"searching,":[25],"optimizing,":[26],"scheduling":[27],"etc.":[28],"Some":[29],"principles":[32],"mechanics":[35],"can":[36],"be":[37],"used":[38,124],"even":[39],"if":[40],"computer":[43],"is":[44,52,71,123],"not":[45],"available.":[46],"The":[47,84],"focus":[48],"this":[50,121],"article":[51],"on":[53,79,132],"utilization":[55],"approach":[59],"in":[60,91,98,111],"selected":[62],"algorithm":[63,70,89,144],"called":[64],"DSOMA.":[65],"A":[66],"computing":[68],"based":[69],"described":[72],"all":[74],"suggested":[75],"improvements":[76],"are":[77,101,114],"demonstrated":[78],"flowshop":[81],"optimization":[82],"problem.":[83],"novelty":[85],"proposed":[88],"consists":[90],"use":[93],"data.":[96],"Individuals":[97],"other":[99],"usually":[102],"encoded":[103],"into":[104],"state,":[107],"whereas":[108],"individuals":[110],"our":[112,140],"extension":[113],"just":[115],"enriched":[116],"information,":[119],"data":[122],"improve":[126],"behavior":[127],"algorithm.":[130],"Based":[131],"outcomes":[134],"experiments":[136],"carried":[137],"out":[138],"within":[139],"research":[141],"improved":[143],"achieved":[146],"better":[147],"results.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}