{"id":"https://openalex.org/W4391808753","doi":"https://doi.org/10.1007/978-3-031-53966-4_15","title":"A Hybrid Steady-State Genetic Algorithm for\u00a0the\u00a0Minimum Conflict Spanning Tree Problem","display_name":"A Hybrid Steady-State Genetic Algorithm for\u00a0the\u00a0Minimum Conflict Spanning Tree Problem","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4391808753","doi":"https://doi.org/10.1007/978-3-031-53966-4_15"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-53966-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-53966-4_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5082313994","display_name":"Punit Kumar Chaubey","orcid":null},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Punit Kumar Chaubey","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042284939","display_name":"Shyam Sundar","orcid":"https://orcid.org/0000-0001-9679-0892"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shyam Sundar","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042284939"],"corresponding_institution_ids":["https://openalex.org/I38335241"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2292,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70951121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9915000200271606,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9800000190734863,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.83824223279953},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6951992511749268},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6892381906509399},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6512838006019592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5916741490364075},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5799973011016846},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5147116780281067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.505954921245575},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4902859032154083},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.46991387009620667},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45488548278808594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41296544671058655},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.411668598651886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30948108434677124},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1883840560913086},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17316308617591858}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.83824223279953},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6951992511749268},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6892381906509399},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6512838006019592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5916741490364075},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5799973011016846},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5147116780281067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.505954921245575},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4902859032154083},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.46991387009620667},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45488548278808594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41296544671058655},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.411668598651886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30948108434677124},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1883840560913086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17316308617591858},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-53966-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-53966-4_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W56005042","https://openalex.org/W179052057","https://openalex.org/W1203281980","https://openalex.org/W1881940886","https://openalex.org/W1977673015","https://openalex.org/W1982713256","https://openalex.org/W2000840218","https://openalex.org/W2015718828","https://openalex.org/W2017927472","https://openalex.org/W2046709864","https://openalex.org/W2050524721","https://openalex.org/W2060095317","https://openalex.org/W2116638623","https://openalex.org/W2140043891","https://openalex.org/W2142146559","https://openalex.org/W2166843422","https://openalex.org/W2766939754","https://openalex.org/W2916470116","https://openalex.org/W2946338515","https://openalex.org/W3001552150","https://openalex.org/W3104695357","https://openalex.org/W3177843672","https://openalex.org/W4324257830"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}