default search action
Tongfei Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Tongfei Li, Mingzheng Lai, Shixian Nie, Haifeng Liu, Zhiyao Liang, Wei Lv:
Tropical cyclone trajectory based on satellite remote sensing prediction and time attention mechanism ConvLSTM model. Big Data Res. 36: 100439 (2024) - [j13]Tongfei Li, Kaihua Che, Jiadong Lu, Yifan Zeng, Wei Lv, Zhiyao Liang:
Tropical cyclone ensemble forecast framework based on spatiotemporal model. Earth Sci. Informatics 17(5): 4791-4807 (2024) - [j12]Guoqiang Cai, Bo Fan, Yiwei Dong, Tongfei Li, Yuan Wu, Yan Zhang:
Task-Efficiency Oriented V2X Communications: Digital Twin Meets Mobile Edge Computing. IEEE Wirel. Commun. 31(2): 149-155 (2024) - 2023
- [j11]Yuchao Jiang
, Jiadong Lu
Enhanced Word-Unit Broad Learning System With Sememes. IEEE Access 11: 109462-109476 (2023) - [j10]Bo Fan
Blockchain-FRL for Vehicular Lane Changing: Toward Traffic, Data, and Training Safety. IEEE Internet Things J. 10(24): 22153-22164 (2023) - 2022
- [j9]Yang Yang
A Train Frequency Optimization Model for the Joint Operation With Two Intersecting Metro Lines. IEEE Access 10: 12365-12373 (2022) - [j8]Feng Li, Xin Guo, Li Zhou, Jianjun Wu
A capacity matching model in a collaborative urban public transport system: integrating passenger and freight transportation. Int. J. Prod. Res. 60(20): 6303-6328 (2022) - [c1]Zhuxuan Cheng, Jie Xiong, Tongfei Li, Yanyan Chen:
Routing Design and Departure Time Determination of Customized Buses Based on Reserved Trip Request. ICITE 2022: 158-163 - 2020
- [j7]Xiao Guo
Modeling the Morning Commute Problem With Stochastic Travel Time in a Bottleneck Model. IEEE Access 8: 149468-149475 (2020) - [j6]Shuqi Xue
Revealing the hidden rules of bidirectional pedestrian flow based on an improved floor field cellular automata model. Simul. Model. Pract. Theory 100: 102044 (2020) - [j5]Shuqi Xue
Corrigendum to 'Revealing the hidden rules of bidirectional pedestrian flow based on an improved floor field cellular automata model' [Simulation Modelling Practice and Theory 100 (2020) 1-16/102044]. Simul. Model. Pract. Theory 103: 102081 (2020)
2010 – 2019
- 2019
- [j4]Fangwei Zhao, Hua Sun, Fangxia Zhao
A Globalized Robust Optimization Approach of Dynamic Network Design Problem With Demand Uncertainty. IEEE Access 7: 115734-115748 (2019) - [j3]Tongfei Li
Analysis of Jobs-Housing Relationship and Commuting Characteristics Around Urban Rail Transit Stations. IEEE Access 7: 175083-175092 (2019) - [j2]Tianchao Guan
Which is More Effective in Guiding Households to Choose Bus Travel-A Transit Subsidy Policy or Discount Policy? IEEE Access 7: 186671-186682 (2019) - [j1]Rui Ding
Optimal Topology of Multilayer Urban Traffic Networks. Complex. 2019: 4230981:1-4230981:19 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: