default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTai-Yu Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Tai-Yu Ma, Richard D. Connors, Francesco Viti:
Congestion-Aware Charging Management for Ride-Hailing Systems with Time-Varying Energy Prices. ICSSE 2024: 1-6- 2023
- [c4]Tai-Yu Ma
, Yumeng Fang, Richard D. Connors, Francesco Viti, Haruko Nakao:
A Fast Algorithm to Optimize Electric First-Mile Feeder Services with Charging Synchronization Constraints and Customer Rejections. ITSC 2023: 133-139 - 2022
- [j3]Theodoros P. Pantelidis, Li Li, Tai-Yu Ma, Joseph Y. J. Chow, Saif Eddin G. Jabari:
A Node-Charge Graph-Based Online Carshare Rebalancing Policy with Capacitated Electric Charging. Transp. Sci. 56(3): 654-676 (2022) - 2021
- [i8]Tai-Yu Ma, Sébastien Faye:
Multistep Electric Vehicle Charging Station Occupancy Prediction using Mixed LSTM Neural Networks. CoRR abs/2106.04986 (2021) - [i7]Tai-Yu Ma, Yumeng Fang:
Survey of charging scheduling, fleet management, and location planning of charging stations for electrified demand-responsive transport systems: methodologies and recent developments. CoRR abs/2112.04221 (2021) - [i6]Sébastien Faye, Tai-Yu Ma, Pascal Lhoas, Djamel Khadraoui:
Fusing Wireless Network Data to Analyse Indoor Social Distancing. ERCIM News 2021(124) (2021) - 2020
- [i5]Theodoros Pantelidis, Li Li, Tai-Yu Ma, Joseph Y. J. Chow, Saif Eddin Jabari:
Node-charge graph-based online carshare rebalancing with capacitated electric charging. CoRR abs/2001.07282 (2020) - [i4]Tai-Yu Ma, Joseph Y. J. Chow, Sylvain Klein, Ziyi Ma:
A stochastic user-operator assignment game for microtransit service evaluation: A case study of Kussbus in Luxembourg. CoRR abs/2005.03465 (2020) - [i3]Tai-Yu Ma:
Optimal charging scheduling for dynamic dial-a-ride services using electric vehicles. CoRR abs/2010.01541 (2020)
2010 – 2019
- 2019
- [i2]Tai-Yu Ma, Saeid Rasulkhani, Joseph Y. J. Chow, Sylvain Klein:
A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers. CoRR abs/1901.00760 (2019) - 2017
- [j2]Tai-Yu Ma, Roberta Di Pace:
Comparing paradigms for strategy learning of route choice with traffic information under uncertainty. Expert Syst. Appl. 88: 352-367 (2017) - 2014
- [c3]Tai-Yu Ma:
Distributed Regret Matching Algorithm for a Dynamic Route Guidance. KES-AMSTA 2014: 107-116 - 2013
- [j1]Tai-Yu Ma:
A Hybrid Cross Entropy Algorithm for Solving Dynamic Transit Network Design Problem. J. Inf. Sci. Eng. 29(4): 631-645 (2013) - [c2]Tai-Yu Ma, Philippe Gerber:
A Hybrid Algorithm for Fast Learning Individual Daily Activity Plans for Multiagent Transportation Simulation. TAAI 2013: 122-127 - 2012
- [i1]Tai-Yu Ma:
A hybrid cross entropy algorithm for solving dynamic transit network design problem. CoRR abs/1211.5371 (2012) - 2011
- [c1]Tai-Yu Ma:
A Cross Entropy Multiagent Learning Algorithm for Solving Vehicle Routing Problems with Time Windows. ICCL 2011: 59-73
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-08-16 19:24 CEST 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:
