{"id":"https://openalex.org/W3140243172","doi":"https://doi.org/10.1109/ipdps.2006.1639518","title":"A metaheuristic based on fusion and fission for partitioning problems","display_name":"A metaheuristic based on fusion and fission for partitioning problems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3140243172","doi":"https://doi.org/10.1109/ipdps.2006.1639518","mag":"3140243172"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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/A5029459479","display_name":"Charles\u2010Edmond Bichot","orcid":null},"institutions":[{"id":"https://openalex.org/I100296615","display_name":"\u00c9cole Nationale de l\u2019Aviation Civile","ror":"https://ror.org/022zdgq74","country_code":"FR","type":"education","lineage":["https://openalex.org/I100296615","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C.-E. Bichot","raw_affiliation_strings":["Laboratoire d'Optimisation Globale (LOG), DSNA-DTI - ENAC, FRANCE"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Optimisation Globale (LOG), DSNA-DTI - ENAC, FRANCE","institution_ids":["https://openalex.org/I100296615"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029459479"],"corresponding_institution_ids":["https://openalex.org/I100296615"],"apc_list":null,"apc_paid":null,"fwci":0.7522,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77089809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9916999936103821,"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/metaheuristic","display_name":"Metaheuristic","score":0.910959005355835},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.705653727054596},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.6649081707000732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6015588045120239},{"id":"https://openalex.org/keywords/fission","display_name":"Fission","score":0.5502878427505493},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5235773324966431},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46270066499710083},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4326169490814209},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39652907848358154},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35620826482772827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24095267057418823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20523539185523987},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.08433794975280762},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06149742007255554}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.910959005355835},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.705653727054596},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.6649081707000732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6015588045120239},{"id":"https://openalex.org/C12294094","wikidata":"https://www.wikidata.org/wiki/Q929080","display_name":"Fission","level":3,"score":0.5502878427505493},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5235773324966431},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46270066499710083},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4326169490814209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39652907848358154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35620826482772827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24095267057418823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20523539185523987},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.08433794975280762},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06149742007255554},{"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/C152568617","wikidata":"https://www.wikidata.org/wiki/Q2348","display_name":"Neutron","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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":25,"referenced_works":["https://openalex.org/W75813207","https://openalex.org/W1971758446","https://openalex.org/W1979146060","https://openalex.org/W2014875556","https://openalex.org/W2024060531","https://openalex.org/W2030087828","https://openalex.org/W2032591091","https://openalex.org/W2033852356","https://openalex.org/W2057463094","https://openalex.org/W2070232376","https://openalex.org/W2087988271","https://openalex.org/W2107940287","https://openalex.org/W2107941094","https://openalex.org/W2114030927","https://openalex.org/W2118953734","https://openalex.org/W2121947440","https://openalex.org/W2125531986","https://openalex.org/W2127597963","https://openalex.org/W2134737843","https://openalex.org/W2160167256","https://openalex.org/W2161455936","https://openalex.org/W4236269389","https://openalex.org/W6603073774","https://openalex.org/W6658586788","https://openalex.org/W6677275879"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W4236055036","https://openalex.org/W4381955442","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W4381955380","https://openalex.org/W1588949866","https://openalex.org/W1975009952","https://openalex.org/W1939200287","https://openalex.org/W46882622"],"abstract_inverted_index":{"Metaheuristics":[0],"are":[1,58],"very":[2],"useful":[3],"methods":[4,103,110],"because":[5],"they":[6],"can":[7,104],"find":[8],"(approximate)":[9],"solutions":[10],"of":[11,15,18,37,97],"a":[12,28,95],"great":[13],"variety":[14],"problems.":[16,63],"One":[17],"them,":[19],"which":[20,57],"interests":[21],"us,":[22],"is":[23,44],"graph":[24],"partitioning.":[25],"We":[26,79,92],"present":[27,52,66],"new":[29],"metaheuristic":[30],"based":[31],"on":[32,94],"nuclear":[33],"fusion":[34,42,82],"and":[35,54,75],"fission":[36,83],"atoms.":[38],"This":[39],"metaheuristic,":[40],"called":[41],"fission,":[43],"compared":[45,87],"to":[46,60,70,88],"other":[47,90],"classical":[48],"algorithms.":[49,78,91],"First,":[50],"we":[51,65],"spectral":[53],"multilevel":[55],"algorithms":[56],"used":[59],"solve":[61],"partitioning":[62,71],"Secondly,":[64],"two":[67],"metaheuristics":[68,102],"applied":[69],"problems:":[72],"simulated":[73],"annealing":[74],"ant":[76],"colony":[77],"show":[80],"that":[81,101],"gives":[84],"good":[85],"results,":[86],"the":[89],"demonstrate":[93],"problem":[96],"air":[98],"traffic":[99],"control":[100],"give":[105],"better":[106],"results":[107],"than":[108],"specific":[109]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}