default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Sun 0002
Person information
- affiliation: Shandong University of Finance and Economics, School of Management Science and Engineering, Jinan, China
- affiliation: Beijing Jiaotong University, School of Traffic and Transportation, China
- affiliation: China Academy of Railway Sciences, Transportation and Economics Research Institute, Beijing, China
Other persons with the same name
- Yan Sun — disambiguation page
- Yan Lindsay Sun
![[0000-0002-9582-1578]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9582-1578")
(aka: Yan Sun 0001) — University of Rhode Island, Department of Electrical, Computer and Biomedical Engineering, Kingston, RI, USA - Yan Sun 0003 — University of Erlangen-Nuremberg, Institute for Digital Communications, Erlangen, Germany
- Yan Sun 0004 — Beijing University of Posts and Telecommunications, School of Computer Science, China (and 1 more)
- Yan Sun 0005 — Queen Mary University of London, Department of Electronic Engineering and Computer Science, UK
- Yan Sun 0006 — Huawei Technologies, Santa Clara, CA, USA (and 1 more)
- Yan Sun 0007 — Cisco, USA (and 1 more)
- Yan Sun 0008 — Tableau Software, Seattle, WA, USA (and 1 more)
- Yan Sun 0009 — Shanghai Normal University, Department Of Mathematics, China (and 1 more)
- Yan Sun 0010 — Shanghai Jiao Tong University, China
- Yan Sun 0011 — Purdue University, Department of Statistics, West Lafayette, IN, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Cevin Zhang, Yan Sun, Hong Lu:
Games for Health in Transportation Systems. IEEE Access 12: 95529-95547 (2024)- [j16]Xinya Li, Yan Sun, Jinfeng Qi, Danzhu Wang:
Chance-Constrained Optimization for a Green Multimodal Routing Problem with Soft Time Window under Twofold Uncertainty. Axioms 13(3): 200 (2024) - [j15]Jie Ge, Yan Sun:
Solving a Multimodal Routing Problem with Pickup and Delivery Time Windows under LR Triangular Fuzzy Capacity Constraints. Axioms 13(4): 220 (2024) - [j14]Yan Ge, Yan Sun, Chen Zhang:
Modeling a Multimodal Routing Problem with Flexible Time Window in a Multi-Uncertainty Environment. Syst. 12(6): 212 (2024) - [j13]Yan Sun, Yan Ge, Min Li, Chen Zhang:
Low-Carbon Water-Rail-Road Multimodal Routing Problem with Hard Time Windows for Time-Sensitive Goods Under Uncertainty: A Chance-Constrained Programming Approach. Syst. 12(11): 468 (2024) - 2023
- [j12]Yan Sun, Guohua Sun, Baoliang Huang, Jie Ge:
Modeling a Carbon-Efficient Road-Rail Intermodal Routing Problem with Soft Time Windows in a Time-Dependent and Fuzzy Environment by Chance-Constrained Programming. Syst. 11(8): 403 (2023) - 2022
- [j11]Yan Sun:
A Robust Possibilistic Programming Approach for a Road-Rail Intermodal Routing Problem with Multiple Time Windows and Truck Operations Optimization under Carbon Cap-and-Trade Policy and Uncertainty. Syst. 10(5): 156 (2022) - 2021
- [j10]Yan Sun, Chengxi Liu, Chen Zhang:
Mobile Technology and Studies on Transport Behavior: A Literature Analysis, Integrated Research Model, and Future Research Agenda. Mob. Inf. Syst. 2021: 9309904:1-9309904:24 (2021) - [j9]Xia Liang, Jie Guo, Yan Sun, Xiaoxiao Liu:
A Method of Product Selection Based on Online Reviews. Mob. Inf. Syst. 2021: 9656315:1-9656315:16 (2021) - 2020
- [j8]Yue Lu, Maoxiang Lang, Yan Sun, Shiqi Li:
A Fuzzy Intercontinental Road-Rail Multimodal Routing Model With Time and Train Capacity Uncertainty and Fuzzy Programming Approaches. IEEE Access 8: 27532-27548 (2020) - [j7]Yan Sun:
A Fuzzy Multi-Objective Routing Model for Managing Hazardous Materials Door-to-Door Transportation in the Road-Rail Multimodal Network With Uncertain Demand and Improved Service Level. IEEE Access 8: 172808-172828 (2020) - [j6]Zhijuan Hong, Ruhai Wu, Yan Sun, Kunxiang Dong:
Buyer preferences for auction pricing rules in online outsourcing markets: fixed price vs. open price. Electron. Mark. 30(1): 163-179 (2020) - [j5]Yan Sun:
Fuzzy Approaches and Simulation-Based Reliability Modeling to Solve a Road-Rail Intermodal Routing Problem with Soft Delivery Time Windows When Demand and Capacity are Uncertain. Int. J. Fuzzy Syst. 22(7): 2119-2148 (2020)
2010 – 2019
- 2019
- [j4]Yan Sun, Xia Liang, Xinya Li, Chen Zhang:
A Fuzzy Programming Method for Modeling Demand Uncertainty in the Capacitated Road-Rail Multimodal Routing Problem with Time Windows. Symmetry 11(1): 91 (2019) - 2018
- [j3]Yan Sun, Martin Hrusovský, Chen Zhang, Maoxiang Lang:
A Time-Dependent Fuzzy Programming Approach for the Green Multimodal Routing Problem with Rail Service Capacity Uncertainty and Road Traffic Congestion. Complex. 2018: 8645793:1-8645793:22 (2018) - [j2]Yan Sun, Guijie Zhang, Zhijuan Hong, Kunxiang Dong:
How Uncertain Information on Service Capacity Influences the Intermodal Routing Decision: A Fuzzy Programming Perspective. Inf. 9(1): 24 (2018) - 2016
- [j1]Yan Sun, Maoxiang Lang, Jiaxi Wang:
On Solving the Fuzzy Customer Information Problem in Multicommodity Multimodal Routing with Schedule-Based Services. Inf. 7(1): 13 (2016)
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 2024-12-26 01:54 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:
