A Genetic Algorithm to Seek the Minimum Spanning Tree

Name: Work Video:
Duration: 3 min 30 s
Description: Based on the graphic theory and genetic algorithm,an improved algorithm to encode node is introduced to search the minimum spanning tree.The algorithm is efficient and very simple and therefore easy to program.It can obtain a group of minimum or less spanning trees in order to provide more choices for decision making,while the traditional algorithms usually only get a minimum spanning tree.
Zhu Yan-ting
{'id': 'https://openalex.org/W2363076693', 'doi': None, 'title': 'A Genetic Algorithm to Seek the Minimum Spanning Tree', 'display_name': 'A Genetic Algorithm to Seek the Minimum Spanning Tree', 'publication_year': 2012, 'publication_date': '2012-01-01', 'ids': {'openalex': 'https://openalex.org/W2363076693', 'mag': '2363076693'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-QZDX201202011.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764552206', 'display_name': 'Journal of Qiongzhou University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5033340462', 'display_name': 'Zhu Yan-ting', 'orcid': None}, 'institutions': [], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Zhu Yan-ting', 'raw_affiliation_strings': ['Department of Computer Science,Guangxi Modern Polytechnic College,Hechi Guangxi 547000,China)'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science,Guangxi Modern Polytechnic College,Hechi Guangxi 547000,China)', 'institution_ids': []}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5033340462'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 64}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T13734', 'display_name': 'Advanced Computational Techniques and Applications', 'score': 0.927, '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/T13734', 'display_name': 'Advanced Computational Techniques and Applications', 'score': 0.927, '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/T12601', 'display_name': 'Web Applications and Data Management', 'score': 0.9202, 'subfield': {'id': 'https://openalex.org/subfields/1710', 'display_name': 'Information Systems'}, '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/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.84191716}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.72144276}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.4551863}], 'concepts': [{'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.8782896}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8697859}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.84191716}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8261014}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.82035184}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.72144276}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.5298248}, {'id': 'https://openalex.org/C62611344', 'wikidata': 'https://www.wikidata.org/wiki/Q1062658', 'display_name': 'Node (physics)', 'level': 2, 'score': 0.4950749}, {'id': 'https://openalex.org/C8880873', 'wikidata': 'https://www.wikidata.org/wiki/Q187787', 'display_name': 'Genetic algorithm', 'level': 2, 'score': 0.46468854}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.4586513}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.4551863}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.41975296}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.3892665}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.34138137}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.19884697}, {'id': 'https://openalex.org/C127413603', 'wikidata': 'https://www.wikidata.org/wiki/Q11023', 'display_name': 'Engineering', 'level': 0, 'score': 0.107640654}, {'id': 'https://openalex.org/C66938386', 'wikidata': 'https://www.wikidata.org/wiki/Q633538', 'display_name': 'Structural engineering', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-QZDX201202011.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764552206', 'display_name': 'Journal of Qiongzhou University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [{'id': 'https://metadata.un.org/sdg/16', 'score': 0.79, 'display_name': 'Peace, justice, and strong institutions'}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W2477124885', 'https://openalex.org/W2417562192', 'https://openalex.org/W2394325171', 'https://openalex.org/W2391455976', 'https://openalex.org/W2388143981', 'https://openalex.org/W2381994259', 'https://openalex.org/W2371157450', 'https://openalex.org/W2370558602', 'https://openalex.org/W2369385743', 'https://openalex.org/W2360537044', 'https://openalex.org/W2360026231', 'https://openalex.org/W2358746580', 'https://openalex.org/W2356372944', 'https://openalex.org/W2355706734', 'https://openalex.org/W2353822696', 'https://openalex.org/W2349955314', 'https://openalex.org/W2116534421', 'https://openalex.org/W2095166134', 'https://openalex.org/W1951163065', 'https://openalex.org/W1722002583'], 'abstract_inverted_index': {'Based': [0], 'on': [1], 'the': [2, 17, 51], 'graphic': [3], 'theory': [4], 'and': [5, 24, 27], 'genetic': [6], 'algorithm,an': [7], 'improved': [8], 'algorithm': [9, 21], 'to': [10, 15, 30, 44], 'encode': [11], 'node': [12], 'is': [13, 22], 'introduced': [14], 'search': [16], 'minimum': [18, 37, 58], 'spanning': [19, 40, 59], 'tree.The': [20], 'efficient': [23], 'very': [25], 'simple': [26], 'therefore': [28], 'easy': [29], 'program.It': [31], 'can': [32], 'obtain': [33], 'a': [34, 57], 'group': [35], 'of': [36], 'or': [38], 'less': [39], 'trees': [41], 'in': [42], 'order': [43], 'provide': [45], 'more': [46], 'choices': [47], 'for': [48], 'decision': [49], 'making,while': [50], 'traditional': [52], 'algorithms': [53], 'usually': [54], 'only': [55], 'get': [56], 'tree.': [60]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2363076693', 'counts_by_year': [], 'updated_date': '2024-12-13T19:39:09.840706', 'created_date': '2016-06-24'}
Publication Information

Basic Information

Access and Citation

AI Researcher Chatbot

Primary Location

Authors

Topics

Keywords

Related Works
