{"id":"https://openalex.org/W146175182","doi":null,"title":"A new Genetic Algorithm for minimum span frequency assignment using permutation and clique","display_name":"A new Genetic Algorithm for minimum span frequency assignment using permutation and clique","alternate_titles":[],"publication_year":2000,"publication_date":"2000-07-10","ids":{"openalex":"https://openalex.org/W146175182","mag":"146175182"},"language":"en","primary_location":{"id":"mag:146175182","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2000/RW025.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Genetic and Evolutionary Computation Conference (GECCO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Genetic and Evolutionary Computation Conference","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W146175182"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5109934142","display_name":"Shouichi Matsui","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130416959","display_name":"Central Research Institute of Electric Power Industry","ror":"https://ror.org/041jswc25","country_code":"JP","type":"nonprofit","lineage":["https://openalex.org/I130416959"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shouichi Matsui","raw_affiliation_strings":["Communication and Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication and Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan#TAB#","institution_ids":["https://openalex.org/I130416959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043181800","display_name":"Ken\u2010ichi Tokoro","orcid":"https://orcid.org/0000-0001-5074-8250","observed_orcids":["https://orcid.org/0000-0001-5074-8250"]},"institutions":[{"id":"https://openalex.org/I130416959","display_name":"Central Research Institute of Electric Power Industry","ror":"https://ror.org/041jswc25","country_code":"JP","type":"nonprofit","lineage":["https://openalex.org/I130416959"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken\u2010ichi Tokoro","raw_affiliation_strings":["Communication and Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5074-8250","affiliations":[{"raw_affiliation_string":"Communication and Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan#TAB#","institution_ids":["https://openalex.org/I130416959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130416959"],"apc_list":null,"apc_paid":null,"fwci":0.7596,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.7129862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"682","last_page":"689"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.8827999830245972,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.8827999830245972,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.05429999902844429,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.016100000590085983,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8040000200271606},{"id":"https://openalex.org/keywords/frequency-assignment-problem","display_name":"frequency assignment","score":0.6710000038146973},{"id":"https://openalex.org/keywords/graph-theory","display_name":"graph theory","score":0.6399999856948853},{"id":"https://openalex.org/keywords/search-space-reduction","display_name":"search space reduction","score":0.7160000205039978},{"id":"https://openalex.org/keywords/spectrum-management","display_name":"spectrum management","score":0.36800000071525574}],"concepts":[{"id":"https://openalex.org/C2776628324","wikidata":"https://www.wikidata.org/wiki/Q22222748","display_name":"Frequency assignment","level":2,"score":0.7227492928504944},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.635680615901947},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5606727004051208},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5471224188804626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5401780009269714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5001020431518555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48646780848503113},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.4648745357990265},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4643780291080475},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.4224357604980469},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4110831618309021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3694012761116028},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.3311772048473358},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.15903723239898682},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07365792989730835},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:146175182","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2000/RW025.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Genetic and Evolutionary Computation Conference (GECCO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Genetic and Evolutionary Computation Conference","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.575.3620","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.575.3620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2000/RW025.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1482722110","https://openalex.org/W1860191225","https://openalex.org/W1969176623","https://openalex.org/W1970485930","https://openalex.org/W1974105863","https://openalex.org/W1998532385","https://openalex.org/W2026320281","https://openalex.org/W2034111852","https://openalex.org/W2049886566","https://openalex.org/W2052912429","https://openalex.org/W2056979696","https://openalex.org/W2108583366","https://openalex.org/W2111716442","https://openalex.org/W2124871721","https://openalex.org/W2158646012"],"related_works":["https://openalex.org/W1860191225","https://openalex.org/W2531224636","https://openalex.org/W187566696","https://openalex.org/W7096100422","https://openalex.org/W2098181636","https://openalex.org/W1998532385","https://openalex.org/W2038691637","https://openalex.org/W1969176623","https://openalex.org/W1485400391","https://openalex.org/W2126903266"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,30,33,50],"new":[3],"Genetic":[4],"Algorithm":[5],"(GA)":[6],"for":[7,47],"solving":[8],"the":[9,20,23,45,82,91],"minimum":[10],"span":[11],"frequency":[12],"assignment":[13,53],"problem":[14],"(MSFAP).":[15],"The":[16,37],"MSFAP":[17],"is":[18,87],"minimizing":[19],"range":[21],"of":[22,35,44,84],"frequencies":[24],"assigned":[25],"to":[26,62,77],"each":[27],"transmitter":[28],"in":[29,49],"region":[31],"satisfying":[32],"number":[34],"constraints.":[36],"proposed":[38],"method":[39],"involves":[40],"find-ing":[41],"and":[42,55,81],"ordering":[43],"transmitters":[46],"use":[48],"greedy":[51],"(sequential)":[52],"process,":[54],"it":[56],"also":[57],"utilizes":[58],"graph":[59],"theoretic":[60],"constraint":[61],"reduce":[63],"search":[64],"space.":[65],"Results":[66],"are":[67],"given":[68],"which":[69],"show":[70],"that":[71],"our":[72,85],"GA":[73,86],"produces":[74],"optimal":[75],"solutions":[76],"several":[78],"practical":[79],"problems,":[80],"performance":[83],"far":[88],"better":[89],"than":[90],"existing":[92],"GAs.":[93],"1":[94]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W146175182","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
