{"id":"https://openalex.org/W976828814","doi":"https://doi.org/10.1007/978-3-642-30665-5_15","title":"Insect Swarm Algorithms for Dynamic MAX-SAT Problems","display_name":"Insect Swarm Algorithms for Dynamic MAX-SAT Problems","publication_year":2012,"publication_date":"2012-08-11","ids":{"openalex":"https://openalex.org/W976828814","doi":"https://doi.org/10.1007/978-3-642-30665-5_15","mag":"976828814"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-30665-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30665-5_15","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"},"type":"book-chapter","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/A5041180169","display_name":"Pedro Contreiras Pinto","orcid":"https://orcid.org/0000-0002-5723-0750"},"institutions":[{"id":"https://openalex.org/I14197495","display_name":"MBDA (Germany)","ror":"https://ror.org/05nz79105","country_code":"DE","type":"company","lineage":["https://openalex.org/I14197495","https://openalex.org/I4210103610"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Pedro C. Pinto","raw_affiliation_strings":["Department T3R, Bayern Chemie GmbH, MBDA Deutschland, Liebigstr. 15-17, D-84544, Aschau am Inn, Germany"],"affiliations":[{"raw_affiliation_string":"Department T3R, Bayern Chemie GmbH, MBDA Deutschland, Liebigstr. 15-17, D-84544, Aschau am Inn, Germany","institution_ids":["https://openalex.org/I14197495"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002518694","display_name":"Thomas A. Runkler","orcid":"https://orcid.org/0000-0002-5465-198X"},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas A. Runkler","raw_affiliation_strings":["Intelligent Systems and Control, CT T IAT ISC, Siemens AG, Corporate Technology, Otto-Hahn-Ring 6, 81730, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Intelligent Systems and Control, CT T IAT ISC, Siemens AG, Corporate Technology, Otto-Hahn-Ring 6, 81730, Munich, Germany","institution_ids":["https://openalex.org/I1325886976"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068474295","display_name":"Jo\u00e3o M. C. Sousa","orcid":"https://orcid.org/0000-0002-8030-4746"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o M. C. Sousa","raw_affiliation_strings":["Instituto Superior T\u00e9cnico, Dep. of Mechanical Engineering, IDMEC-LAETA, Technical University of Lisbon, Avenida Rovisco Pais, 1049-001, Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"Instituto Superior T\u00e9cnico, Dep. of Mechanical Engineering, IDMEC-LAETA, Technical University of Lisbon, Avenida Rovisco Pais, 1049-001, Lisbon, Portugal","institution_ids":["https://openalex.org/I141596103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041180169"],"corresponding_institution_ids":["https://openalex.org/I14197495"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13033897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9976000189781189,"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.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9927999973297119,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9919000267982483,"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/metaheuristic","display_name":"Metaheuristic","score":0.6285198330879211},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5983181595802307},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5688909292221069},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5523868799209595},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5351624488830566},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5239434242248535},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.502110481262207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49695447087287903},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.491421103477478},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4904787242412567},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47731122374534607},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4592224955558777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4572978913784027},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.44964727759361267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38199689984321594},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.106610506772995}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6285198330879211},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5983181595802307},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5688909292221069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5523868799209595},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5351624488830566},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5239434242248535},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.502110481262207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49695447087287903},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.491421103477478},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4904787242412567},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47731122374534607},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4592224955558777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4572978913784027},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44964727759361267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38199689984321594},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.106610506772995}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-30665-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30665-5_15","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.5,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W92685995","https://openalex.org/W117011241","https://openalex.org/W156009831","https://openalex.org/W171692803","https://openalex.org/W1003043155","https://openalex.org/W1487100330","https://openalex.org/W1499423768","https://openalex.org/W1516430219","https://openalex.org/W1523189495","https://openalex.org/W1529539254","https://openalex.org/W1537794297","https://openalex.org/W1566650019","https://openalex.org/W1573676079","https://openalex.org/W1595295153","https://openalex.org/W1598011955","https://openalex.org/W1613162423","https://openalex.org/W1620410031","https://openalex.org/W1725516486","https://openalex.org/W1833106254","https://openalex.org/W1865464712","https://openalex.org/W1964146567","https://openalex.org/W1977287297","https://openalex.org/W1986964870","https://openalex.org/W2006563247","https://openalex.org/W2010187598","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2036265926","https://openalex.org/W2053225543","https://openalex.org/W2074156066","https://openalex.org/W2107631366","https://openalex.org/W2107941094","https://openalex.org/W2113043717","https://openalex.org/W2116583232","https://openalex.org/W2132463752","https://openalex.org/W2137392640","https://openalex.org/W2142344913","https://openalex.org/W2145508886","https://openalex.org/W2146992348","https://openalex.org/W2150528082","https://openalex.org/W2156708389","https://openalex.org/W2162125251","https://openalex.org/W2171964388","https://openalex.org/W2227758766","https://openalex.org/W2339500526","https://openalex.org/W2484814948","https://openalex.org/W2485414348","https://openalex.org/W4285719527","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2102364390"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}