{"id":"https://openalex.org/W2100137329","doi":"https://doi.org/10.1145/2330784.2330928","title":"Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity","display_name":"Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2100137329","doi":"https://doi.org/10.1145/2330784.2330928","mag":"2100137329"},"language":"en","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-020701664","is_oa":false,"landing_page_url":"http://deposit.dnb.de/cgi-bin/dokserv?id=3537168&prov=M&dok_var=1&dok_ext=htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/caba503d-1768-440d-97ce-6826b1ea3bec","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Neumann, Frank","raw_affiliation_strings":["The University of Adelaide, Adelaide, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Witt, Carsten","raw_affiliation_strings":["Technical University of Denmark, Kgs, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kgs, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":32.4098,"has_fulltext":false,"cited_by_count":335,"citation_normalized_percentile":{"value":0.99748095,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9746999740600586,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9746999740600586,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9732999801635742,"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.9721999764442444,"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/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.66339111328125},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6477333307266235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5930811762809753},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5605923533439636},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5302422046661377},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.52447909116745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5073410868644714},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4880567789077759},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.46452295780181885},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45999017357826233},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4387434124946594},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43258392810821533},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4104645550251007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38985002040863037},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33233726024627686},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.328826367855072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25714993476867676},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.21271634101867676}],"concepts":[{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.66339111328125},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6477333307266235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5930811762809753},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5605923533439636},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5302422046661377},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.52447909116745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5073410868644714},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4880567789077759},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.46452295780181885},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45999017357826233},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4387434124946594},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43258392810821533},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4104645550251007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38985002040863037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33233726024627686},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.328826367855072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25714993476867676},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.21271634101867676},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-020701664","is_oa":false,"landing_page_url":"http://deposit.dnb.de/cgi-bin/dokserv?id=3537168&prov=M&dok_var=1&dok_ext=htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/92927","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/92927","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/2330784.2330928","raw_type":"Conference item"},{"id":"pmh:oai:edoc.mpg.de:536791","is_oa":false,"landing_page_url":"http://edoc.mpg.de/536791","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book"},{"id":"pmh:oai:pure.atira.dk:publications/9bdb225d-6de7-4613-afdc-65ddffb088ff","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/9bdb225d-6de7-4613-afdc-65ddffb088ff","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann , F & Witt , C 2012 , Bioinspired computation in combinatorial optimization: algorithms and their computational complexity . in Proceedings of the fourteenth international conference on Genetic and evolutionary computation : Companion . Association for Computing Machinery , pp. 1035-1058 , 2012 Genetic and Evolutionary Computation Conference , Philadelphia , Pennsylvania , United States , 07/07/2012 . https://doi.org/10.1145/2330784.2330928","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/caba503d-1768-440d-97ce-6826b1ea3bec","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/caba503d-1768-440d-97ce-6826b1ea3bec","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann , F & Witt , C 2013 , Bioinspired computation in combinatorial optimization - Algorithms and their computational complexity . in Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation . Association for Computing Machinery , pp. 567-590 , 2013 Genetic and Evolutionary Computation Conference , Amsterdam , Netherlands , 06/07/2013 . https://doi.org/10.1145/2464576.2466738","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/fcdecc9e-5f3c-4f78-bb29-51fb737f98f2","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/fcdecc9e-5f3c-4f78-bb29-51fb737f98f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann , F & Witt , C 2014 , Bioinspired computation in combinatorial optimization - Algorithms and their computational complexity . in Proceedings of the sixteenth conference on genetic and evolutionary computation . Association for Computing Machinery , pp. 647-686 , 2014 Genetic and Evolutionary Computation Conference , Vancouver , British Columbia , Canada , 12/07/2014 . https://doi.org/10.1145/2598394.2605353","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.mpg.de:item_1323826","is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-000F-161B-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/book"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/caba503d-1768-440d-97ce-6826b1ea3bec","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/caba503d-1768-440d-97ce-6826b1ea3bec","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann , F & Witt , C 2013 , Bioinspired computation in combinatorial optimization - Algorithms and their computational complexity . in Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation . Association for Computing Machinery , pp. 567-590 , 2013 Genetic and Evolutionary Computation Conference , Amsterdam , Netherlands , 06/07/2013 . https://doi.org/10.1145/2464576.2466738","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":72,"referenced_works":["https://openalex.org/W124424457","https://openalex.org/W184098108","https://openalex.org/W1497256448","https://openalex.org/W1508419498","https://openalex.org/W1510977876","https://openalex.org/W1511990050","https://openalex.org/W1514875444","https://openalex.org/W1517570823","https://openalex.org/W1519655831","https://openalex.org/W1522890465","https://openalex.org/W1529671703","https://openalex.org/W1537382387","https://openalex.org/W1540953389","https://openalex.org/W1552383524","https://openalex.org/W1553838525","https://openalex.org/W1559942958","https://openalex.org/W1560446172","https://openalex.org/W1574390288","https://openalex.org/W1581232621","https://openalex.org/W1583434898","https://openalex.org/W1586104616","https://openalex.org/W1591939288","https://openalex.org/W1605768620","https://openalex.org/W1635549461","https://openalex.org/W1683332710","https://openalex.org/W1781730958","https://openalex.org/W1801849579","https://openalex.org/W1928381443","https://openalex.org/W1954404225","https://openalex.org/W1965680834","https://openalex.org/W1981898306","https://openalex.org/W1983804795","https://openalex.org/W1985318592","https://openalex.org/W2001426248","https://openalex.org/W2003159902","https://openalex.org/W2007458506","https://openalex.org/W2011904305","https://openalex.org/W2016296961","https://openalex.org/W2016700350","https://openalex.org/W2017927472","https://openalex.org/W2021272950","https://openalex.org/W2024281442","https://openalex.org/W2039865013","https://openalex.org/W2042096932","https://openalex.org/W2042401648","https://openalex.org/W2052328625","https://openalex.org/W2053913299","https://openalex.org/W2063375245","https://openalex.org/W2069230977","https://openalex.org/W2073850430","https://openalex.org/W2077823485","https://openalex.org/W2090677529","https://openalex.org/W2091824805","https://openalex.org/W2097724176","https://openalex.org/W2101034509","https://openalex.org/W2104680817","https://openalex.org/W2120012538","https://openalex.org/W2120043459","https://openalex.org/W2121555757","https://openalex.org/W2138304862","https://openalex.org/W2142146559","https://openalex.org/W2144585681","https://openalex.org/W2151554678","https://openalex.org/W2151612665","https://openalex.org/W2153401898","https://openalex.org/W2157529519","https://openalex.org/W2158185717","https://openalex.org/W2171776966","https://openalex.org/W2295428206","https://openalex.org/W2543580944","https://openalex.org/W2585305412","https://openalex.org/W2798451029"],"related_works":["https://openalex.org/W3122779104","https://openalex.org/W2165220807","https://openalex.org/W2084149434","https://openalex.org/W1843453084","https://openalex.org/W1632066424","https://openalex.org/W1605768620","https://openalex.org/W2499441210","https://openalex.org/W2102044362","https://openalex.org/W1970025632","https://openalex.org/W2153401898","https://openalex.org/W2161238506","https://openalex.org/W2151612665","https://openalex.org/W1970101133","https://openalex.org/W1593495653","https://openalex.org/W1510977876","https://openalex.org/W1981898306","https://openalex.org/W3100597221","https://openalex.org/W2295428206","https://openalex.org/W2005317641","https://openalex.org/W1522890465"],"abstract_inverted_index":{"Bioinspired":[0],"computation":[1,97,122],"methods,":[2],"such":[3,68],"as":[4,69],"evolutionary":[5],"algorithms":[6],"and":[7,18,22,77,79,108],"ant":[8],"colony":[9],"optimization,":[10],"are":[11],"being":[12],"applied":[13,98],"successfully":[14],"to":[15,99,118],"complex":[16],"engineering":[17],"combinatorial":[19,62,105],"optimization":[20,85,106,115,125],"problems,":[21,107],"it":[23],"is":[24,86,128],"very":[25],"important":[26,41],"that":[27],"we":[28],"understand":[29],"the":[30,39,92,103,135,138,144],"computational":[31,93],"complexity":[32,94],"of":[33,95,102],"these":[34],"algorithms.":[35],"This":[36],"tutorials":[37],"explains":[38],"most":[40],"results":[42],"achieved":[43],"in":[44,55,59,109],"this":[45],"area.The":[46],"presenters":[47],"show":[48,112],"how":[49,113],"runtime":[50],"behavior":[51],"can":[52,116,146],"be":[53,147],"analyzed":[54],"a":[56,131],"rigorous":[57],"way,":[58],"particular":[60,110],"for":[61,123],"optimization.":[63],"They":[64,89],"present":[65],"well-known":[66],"problems":[67],"minimum":[70],"spanning":[71],"trees,":[72],"shortest":[73],"paths,":[74],"maximum":[75],"matching,":[76],"covering":[78],"scheduling":[80],"problems.":[81],"Classical":[82],"single":[83],"objective":[84],"examined":[87],"first.":[88],"then":[90],"investigate":[91],"bioinspired":[96,121],"multiobjective":[100,114],"variants":[101],"considered":[104],"they":[111],"help":[117],"speed":[119],"up":[120],"single-objective":[124],"problems.The":[126],"tutorial":[127],"based":[129],"on":[130],"book":[132,145],"written":[133],"by":[134],"authors":[136],"with":[137],"same":[139],"title.":[140],"Further":[141],"information":[142],"about":[143],"found":[148],"at":[149],"www.bioinspiredcomputation.com.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":31},{"year":2015,"cited_by_count":33},{"year":2014,"cited_by_count":30},{"year":2013,"cited_by_count":31},{"year":2012,"cited_by_count":28}],"updated_date":"2026-07-16T13:24:37.021932","created_date":"2025-10-10T00:00:00"}