{"id":"https://openalex.org/W1993796847","doi":"https://doi.org/10.1080/00207729608929213","title":"Application of genetic algorithm to a parallel path selection problem","display_name":"Application of genetic algorithm to a parallel path selection problem","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W1993796847","doi":"https://doi.org/10.1080/00207729608929213","mag":"1993796847"},"language":"en","primary_location":{"id":"doi:10.1080/00207729608929213","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207729608929213","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Systems Science","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":"https://openalex.org/A5045136776","display_name":"Nobuo Sannomiya","orcid":null},"institutions":[{"id":"https://openalex.org/I27429435","display_name":"Kyoto Institute of Technology","ror":"https://ror.org/00965ax52","country_code":"JP","type":"education","lineage":["https://openalex.org/I27429435"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"NOBUO SANNOMIYA","raw_affiliation_strings":["Department of Electronics and Information Science , Kyoto Institute of Technology , Sakyo-ku, Kyoto, 606, Japan","Department of Electronics and Information Science, Kyoto Institute of Technology, Sakyo-ku, Kyoto 606, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Information Science , Kyoto Institute of Technology , Sakyo-ku, Kyoto, 606, Japan","institution_ids":["https://openalex.org/I27429435"]},{"raw_affiliation_string":"Department of Electronics and Information Science, Kyoto Institute of Technology, Sakyo-ku, Kyoto 606, Japan","institution_ids":["https://openalex.org/I27429435"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058321725","display_name":"Kyoichi TATEMURA","orcid":null},"institutions":[{"id":"https://openalex.org/I135705104","display_name":"Nippon Steel (Japan)","ror":"https://ror.org/016vzmc05","country_code":"JP","type":"company","lineage":["https://openalex.org/I135705104"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"KYOICHI TATEMURA","raw_affiliation_strings":["Nippon Steel Information and Communication Systems Inc , Chuo-ku, Tokyo, 104, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nippon Steel Information and Communication Systems Inc , Chuo-ku, Tokyo, 104, Japan","institution_ids":["https://openalex.org/I135705104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.19176232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"2","first_page":"269","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9641000032424927,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9641000032424927,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T14470","display_name":"Advanced Data Processing Techniques","score":0.9408000111579895,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9282000064849854,"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/path","display_name":"Path (computing)","score":0.6936503052711487},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.6406799554824829},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6378383636474609},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5620729923248291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5568931102752686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5288910269737244},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5202797055244446},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5153228640556335},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5065404176712036},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5026791095733643},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46846550703048706},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45065873861312866},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.43582648038864136},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4251222312450409},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3534935712814331},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20945137739181519},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12045750021934509},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.116204172372818},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06356674432754517}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6936503052711487},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.6406799554824829},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6378383636474609},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5620729923248291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5568931102752686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5288910269737244},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5202797055244446},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5153228640556335},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5065404176712036},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5026791095733643},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46846550703048706},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45065873861312866},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.43582648038864136},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4251222312450409},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3534935712814331},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20945137739181519},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12045750021934509},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.116204172372818},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06356674432754517},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207729608929213","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207729608929213","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Systems Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1639032689","https://openalex.org/W2169528473","https://openalex.org/W2318027824","https://openalex.org/W2320178513","https://openalex.org/W2913091258","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2360981904","https://openalex.org/W2767202586","https://openalex.org/W2353519994","https://openalex.org/W2156431668","https://openalex.org/W2388410942","https://openalex.org/W2030169809","https://openalex.org/W2384965074"],"abstract_inverted_index":{"Optimal":[0],"selection":[1],"of":[2,21,33,46,91,94],"multiple":[3,26],"parallel":[4],"paths":[5],"connecting":[6],"the":[7,19,22,34,47,53,61,73,83,89,92,95,98],"starting":[8],"and":[9,58,97],"arrival":[10],"nodes":[11,35],"is":[12,16,30,40,50,70,77,86],"considered.":[13],"The":[14,28,43,67],"objective":[15],"to":[17,37,51,59],"minimize":[18],"length":[20],"longest":[23],"path":[24,39,63],"among":[25],"paths.":[27],"constraint":[29],"that":[31,82],"duplication":[32],"belonging":[36],"each":[38,65],"not":[41],"allowed.":[42],"basic":[44],"idea":[45],"proposed":[48,84],"method":[49,85],"decompose":[52],"network":[54],"into":[55],"several":[56],"subnetworks":[57],"obtain":[60],"shortest":[62],"for":[64,72],"subnetwork.":[66],"genetic":[68],"algorithm":[69],"applied":[71],"decomposition":[74],"procedure.":[75],"It":[76],"observed":[78],"from":[79,88],"numerical":[80],"results":[81],"efficient":[87],"viewpoints":[90],"accuracy":[93],"solution":[96],"computation":[99],"time":[100]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}