{"id":"https://openalex.org/W2038450342","doi":"https://doi.org/10.1109/icnc.2010.5584023","title":"Hybrid genetic algorithm for searching efficient paths in traffic assignment","display_name":"Hybrid genetic algorithm for searching efficient paths in traffic assignment","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2038450342","doi":"https://doi.org/10.1109/icnc.2010.5584023","mag":"2038450342"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5584023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584023","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-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/A5074022536","display_name":"Xinfeng Yang","orcid":"https://orcid.org/0000-0002-4744-5459"},"institutions":[{"id":"https://openalex.org/I3133134087","display_name":"Lanzhou Jiaotong University","ror":"https://ror.org/03144pv92","country_code":"CN","type":"education","lineage":["https://openalex.org/I3133134087"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinfeng Yang","raw_affiliation_strings":["School of traffic & Transportation Engineering, Lanzhou Jiaotong University, Lanzhou, China","School of traffic & Transportation Engineering, Lanzhou Jiaotong University, China"],"affiliations":[{"raw_affiliation_string":"School of traffic & Transportation Engineering, Lanzhou Jiaotong University, Lanzhou, China","institution_ids":["https://openalex.org/I3133134087"]},{"raw_affiliation_string":"School of traffic & Transportation Engineering, Lanzhou Jiaotong University, China","institution_ids":["https://openalex.org/I3133134087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103145709","display_name":"Yinzhen Li","orcid":"https://orcid.org/0009-0000-2649-8589"},"institutions":[{"id":"https://openalex.org/I3133134087","display_name":"Lanzhou Jiaotong University","ror":"https://ror.org/03144pv92","country_code":"CN","type":"education","lineage":["https://openalex.org/I3133134087"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yinzhen Li","raw_affiliation_strings":["School of traffic & Transportation Engineering, Lanzhou Jiaotong University, Lanzhou, China","School of traffic & Transportation Engineering, Lanzhou Jiaotong University, China"],"affiliations":[{"raw_affiliation_string":"School of traffic & Transportation Engineering, Lanzhou Jiaotong University, Lanzhou, China","institution_ids":["https://openalex.org/I3133134087"]},{"raw_affiliation_string":"School of traffic & Transportation Engineering, Lanzhou Jiaotong University, China","institution_ids":["https://openalex.org/I3133134087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074022536"],"corresponding_institution_ids":["https://openalex.org/I3133134087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51769912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"2374","last_page":"2377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7250560522079468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6801491975784302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5042918920516968},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5042835474014282},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.49997639656066895},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48054414987564087},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.47737929224967957},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4708116948604584},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46961790323257446},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.46802979707717896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4516035318374634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19974637031555176},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17252391576766968},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14524611830711365},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07995018362998962}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7250560522079468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6801491975784302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5042918920516968},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5042835474014282},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.49997639656066895},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48054414987564087},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.47737929224967957},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4708116948604584},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46961790323257446},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.46802979707717896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4516035318374634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19974637031555176},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17252391576766968},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14524611830711365},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07995018362998962},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5584023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584023","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6899999976158142,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1976787244","https://openalex.org/W2158503783","https://openalex.org/W2353055878","https://openalex.org/W2370202869","https://openalex.org/W6683021165"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2014162767","https://openalex.org/W1585212810","https://openalex.org/W4242191701","https://openalex.org/W2353965122"],"abstract_inverted_index":{"The":[0],"selection":[1,16,65],"of":[2,18,30,52,64,77,93,103],"path":[3,15,101],"set":[4],"has":[5],"a":[6,36,122],"great":[7],"influence":[8],"on":[9],"stochastic":[10],"traffic":[11,22],"assignment.":[12],"By":[13],"considering":[14],"character":[17],"road":[19,26],"users":[20],"and":[21,54,61,75,88],"restriction":[23],"in":[24],"real":[25],"network,":[27],"the":[28,50,62,73,91,107,114,129],"concept":[29],"efficient":[31,100],"paths":[32],"is":[33,41,66,125],"redefined.":[34],"Moreover,":[35],"vertices-outdegree-based":[37],"genetic":[38],"algorithm":[39,60,70,81],"(GA)":[40],"designed":[42],"which":[43],"adopts":[44],"positive":[45],"integer":[46],"coding":[47],"method.":[48],"Furthermore,":[49],"probabilities":[51],"crossover":[53],"mutation":[55],"are":[56],"adjusted":[57],"by":[58,117],"adaptive":[59],"process":[63],"adopted":[67],"simulated":[68],"annealing":[69],"to":[71,85],"maintain":[72],"diversity":[74],"convergence":[76],"population.":[78],"Thereby,":[79],"this":[80,110],"does":[82],"not":[83],"need":[84],"repair":[86],"chromosome":[87],"can":[89,112],"cover":[90],"shortages":[92],"priority":[94],"-":[95],"based":[96],"GA.":[97],"While":[98],"finding":[99],"sets":[102],"multi-OD":[104],"(Origination-Destination)":[105],"at":[106],"same":[108],"time,":[109],"method":[111],"improve":[113],"computation":[115],"efficiency":[116],"decoding":[118],"simultaneously.":[119],"At":[120],"last,":[121],"case":[123],"study":[124],"given":[126],"for":[127],"verifying":[128],"efficiency.":[130]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}