{"id":"https://openalex.org/W3093091588","doi":"https://doi.org/10.1007/s12065-020-00501-w","title":"Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem","display_name":"Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem","publication_year":2020,"publication_date":"2020-10-14","ids":{"openalex":"https://openalex.org/W3093091588","doi":"https://doi.org/10.1007/s12065-020-00501-w","mag":"3093091588"},"language":"en","primary_location":{"id":"doi:10.1007/s12065-020-00501-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12065-020-00501-w","pdf_url":null,"source":{"id":"https://openalex.org/S182392644","display_name":"Evolutionary Intelligence","issn_l":"1864-5909","issn":["1864-5909","1864-5917"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Intelligence","raw_type":"journal-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":null,"display_name":"Binh Huynh Thi Thanh","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Binh Huynh Thi Thanh","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037098654","display_name":"Ph\u1ea1m \u0110\u00ecnh Th\u00e0nh","orcid":"https://orcid.org/0000-0002-2550-9546"},"institutions":[{"id":"https://openalex.org/I4210139842","display_name":"Tay Bac University","ror":"https://ror.org/04j5g5g52","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210139842"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Thanh Pham Dinh","raw_affiliation_strings":["Faculty of Natural Science and Technology, Taybac University, Son La, Vietnam"],"raw_orcid":"https://orcid.org/0000-0002-2550-9546","affiliations":[{"raw_affiliation_string":"Faculty of Natural Science and Technology, Taybac University, Son La, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037098654"],"corresponding_institution_ids":["https://openalex.org/I4210139842"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.8154,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79553524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"15","issue":"1","first_page":"185","last_page":"213"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9922000169754028,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9753999710083008,"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/computer-science","display_name":"Computer science","score":0.7646988034248352},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6734830141067505},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.587931752204895},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.541396975517273},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5338431596755981},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5235564112663269},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44878271222114563},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.437327116727829},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42161881923675537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2957000136375427},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2765270173549652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18134745955467224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12791138887405396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7646988034248352},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6734830141067505},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.587931752204895},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.541396975517273},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5338431596755981},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5235564112663269},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44878271222114563},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.437327116727829},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42161881923675537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2957000136375427},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2765270173549652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18134745955467224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12791138887405396},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12065-020-00501-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12065-020-00501-w","pdf_url":null,"source":{"id":"https://openalex.org/S182392644","display_name":"Evolutionary Intelligence","issn_l":"1864-5909","issn":["1864-5909","1864-5917"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G320586354","display_name":null,"funder_award_id":"W90GQZ-93290007","funder_id":"https://openalex.org/F4320337807","funder_display_name":"U.S. Army Combat Capabilities Development Command"}],"funders":[{"id":"https://openalex.org/F4320337807","display_name":"U.S. Army Combat Capabilities Development Command","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1077212886","https://openalex.org/W1978707544","https://openalex.org/W1986593951","https://openalex.org/W2017927472","https://openalex.org/W2021178645","https://openalex.org/W2031673408","https://openalex.org/W2032789430","https://openalex.org/W2051579561","https://openalex.org/W2058634896","https://openalex.org/W2114809881","https://openalex.org/W2125551682","https://openalex.org/W2126995576","https://openalex.org/W2142146559","https://openalex.org/W2151924821","https://openalex.org/W2158280690","https://openalex.org/W2172255557","https://openalex.org/W2322565568","https://openalex.org/W2373493542","https://openalex.org/W2410677328","https://openalex.org/W2413527939","https://openalex.org/W2526440583","https://openalex.org/W2558771087","https://openalex.org/W2558822484","https://openalex.org/W2579426115","https://openalex.org/W2586910743","https://openalex.org/W2589105738","https://openalex.org/W2724993384","https://openalex.org/W2727592975","https://openalex.org/W2734259173","https://openalex.org/W2804683829","https://openalex.org/W2808464155","https://openalex.org/W2809628845","https://openalex.org/W2883262743","https://openalex.org/W2896215880","https://openalex.org/W2897353395","https://openalex.org/W2910556840","https://openalex.org/W2923639984","https://openalex.org/W2945963656","https://openalex.org/W2963795223","https://openalex.org/W6944241002"],"related_works":["https://openalex.org/W3204184292","https://openalex.org/W3176564347","https://openalex.org/W2347477706","https://openalex.org/W2355833770","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2911578165","https://openalex.org/W2626282817"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}