{"id":"https://openalex.org/W2761274942","doi":"https://doi.org/10.1177/0037549717733063","title":"A heuristic algorithm based on leaf photosynthate transport","display_name":"A heuristic algorithm based on leaf photosynthate transport","publication_year":2017,"publication_date":"2017-10-06","ids":{"openalex":"https://openalex.org/W2761274942","doi":"https://doi.org/10.1177/0037549717733063","mag":"2761274942"},"language":"en","primary_location":{"id":"doi:10.1177/0037549717733063","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549717733063","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","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/A5025562887","display_name":"Bin Yu","orcid":"https://orcid.org/0000-0002-8332-1939"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yu Bin","raw_affiliation_strings":["School of Transportation Science and Engineering, Beihang University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Transportation Science and Engineering, Beihang University, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103980515","display_name":"Wenxuan Shan","orcid":"https://orcid.org/0000-0001-9763-0671"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shan Wenxuan","raw_affiliation_strings":["School of Transportation Science and Engineering, Beihang University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Transportation Science and Engineering, Beihang University, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103393198","display_name":"Guo Zhen","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guo Zhen","raw_affiliation_strings":["School of Transportation Science and Engineering, Beihang University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Transportation Science and Engineering, Beihang University, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":null,"display_name":"Wang Yunpeng","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wang Yunpeng","raw_affiliation_strings":["School of Transportation Science and Engineering, Beihang University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Transportation Science and Engineering, Beihang University, China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":6.1643,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.95305199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"94","issue":"7","first_page":"593","last_page":"607"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/genetic-algorithm","display_name":"Genetic algorithm","score":0.723562479019165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6158809661865234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6075442433357239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5684899687767029},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5111055970191956},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5055947303771973},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.47866591811180115},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.47648924589157104},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42962005734443665},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4175609350204468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30163419246673584},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18303340673446655},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.17813020944595337},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10108122229576111}],"concepts":[{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.723562479019165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6158809661865234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6075442433357239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5684899687767029},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5111055970191956},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5055947303771973},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.47866591811180115},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.47648924589157104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42962005734443665},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4175609350204468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30163419246673584},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18303340673446655},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.17813020944595337},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10108122229576111},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0037549717733063","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549717733063","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W111725337","https://openalex.org/W1488989473","https://openalex.org/W1834591371","https://openalex.org/W1969967095","https://openalex.org/W1975185484","https://openalex.org/W1975333294","https://openalex.org/W1977021820","https://openalex.org/W1980426183","https://openalex.org/W1980534983","https://openalex.org/W1980976193","https://openalex.org/W1982883486","https://openalex.org/W1996872168","https://openalex.org/W1998325932","https://openalex.org/W2000036920","https://openalex.org/W2000248118","https://openalex.org/W2000900837","https://openalex.org/W2009700296","https://openalex.org/W2009883997","https://openalex.org/W2012003205","https://openalex.org/W2016880844","https://openalex.org/W2023616065","https://openalex.org/W2038030185","https://openalex.org/W2038079205","https://openalex.org/W2052460617","https://openalex.org/W2057983864","https://openalex.org/W2060410323","https://openalex.org/W2068354593","https://openalex.org/W2072059712","https://openalex.org/W2074987215","https://openalex.org/W2078602038","https://openalex.org/W2083218135","https://openalex.org/W2083474188","https://openalex.org/W2086753570","https://openalex.org/W2096405299","https://openalex.org/W2105089563","https://openalex.org/W2107941094","https://openalex.org/W2114903043","https://openalex.org/W2123550810","https://openalex.org/W2136885855","https://openalex.org/W2153851348","https://openalex.org/W2168716674","https://openalex.org/W2171985270","https://openalex.org/W2483705917","https://openalex.org/W2522162070","https://openalex.org/W2590514316","https://openalex.org/W4212899374","https://openalex.org/W4213239898","https://openalex.org/W4253561658"],"related_works":["https://openalex.org/W2142018123","https://openalex.org/W3021058566","https://openalex.org/W2350529693","https://openalex.org/W2359860614","https://openalex.org/W1984896226","https://openalex.org/W2541389358","https://openalex.org/W2348874657","https://openalex.org/W2409589882","https://openalex.org/W2897351886","https://openalex.org/W2207711222"],"abstract_inverted_index":{"Transportation":[0],"network":[1,31,51,67,124,140],"design":[2],"is":[3,26,57,79,117],"non-deterministic":[4],"polynomial-time":[5],"hard":[6],"due":[7],"to":[8,125],"its":[9],"attributes":[10],"of":[11,42,48,73,88,100,111,129],"multi-objects,":[12],"multi-constraints,":[13],"and":[14,44,91,155,163,180],"the":[15,29,37,45,49,54,66,71,85,97,101,106,121,127,130,138,144,151,156,159,172],"non-convexity":[16],"objective":[17,164],"function.":[18],"In":[19],"this":[20],"paper,":[21],"a":[22],"bi-level":[23],"programming":[24],"model":[25],"proposed":[27,82,131,145,173],"for":[28,65],"transportation":[30],"design.":[32],"The":[33,81,133],"upper":[34],"layer":[35,56],"pursues":[36],"minimum":[38],"total":[39,46,139,160],"travel":[40,161],"time":[41,162],"users":[43],"length":[47,141],"road":[50],"simultaneously,":[52],"while":[53],"lower":[55],"an":[58],"equilibrium":[59],"assignment":[60],"model.":[61],"A":[62],"new":[63],"algorithm":[64,83,146,154,174],"optimization":[68],"based":[69],"on":[70,178],"principle":[72],"leaf":[74],"photosynthate":[75],"transport":[76],"in":[77],"nature":[78],"proposed.":[80],"simulates":[84],"natural":[86],"selection":[87],"biological":[89],"evolution":[90],"genetic":[92,98,157],"transmission.":[93],"It":[94],"can":[95],"retain":[96],"idea":[99],"evolutionary":[102],"algorithm,":[103,158],"together":[104],"with":[105,120,150],"heuristic":[107],"information":[108],"update":[109],"mechanism":[110],"swarm":[112],"intelligence.":[113],"Finally,":[114],"empirical":[115],"research":[116],"carried":[118],"out":[119],"Sioux":[122],"Falls":[123],"validate":[126],"performance":[128,177],"algorithm.":[132],"results":[134],"show":[135],"that":[136,171],"although":[137],"obtained":[142],"by":[143],"increases":[147],"slightly":[148],"compared":[149],"ant":[152],"colony":[153],"function":[165],"value":[166],"reduce":[167],"obviously.":[168],"This":[169],"indicates":[170],"has":[175],"good":[176],"topology":[179],"efficiency.":[181]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-18T08:10:14.011955","created_date":"2025-10-10T00:00:00"}