default search action
Saeed Asadi Bagloee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Iman Taheri Sarteshnizi, Saeed Asadi Bagloee, Majid Sarvi, Neema Nassir:
Traffic Anomaly Detection: Exploiting Temporal Positioning of Flow-Density Samples. IEEE Trans. Intell. Transp. Syst. 25(5): 4166-4180 (2024) - [c2]Xiao Zheng, Saeed Asadi Bagloee, Majid Sarvi:
RecVAE-GBRT: Memory-Fused XGBoost for Time-Series Forecasting. IJCNN 2024: 1-8 - 2022
- [j11]Azadeh Emami, Majid Sarvi, Saeed Asadi Bagloee:
Network-Wide Traffic State Estimation and Rolling Horizon-Based Signal Control Optimization in a Connected Vehicle Environment. IEEE Trans. Intell. Transp. Syst. 23(6): 5840-5858 (2022) - 2020
- [j10]Azadeh Emami, Majid Sarvi, Saeed Asadi Bagloee:
Short-term traffic flow prediction based on faded memory Kalman Filter fusing data from connected vehicles and Bluetooth sensors. Simul. Model. Pract. Theory 102: 102025 (2020)
2010 – 2019
- 2019
- [j9]Saeed Asadi Bagloee, Karl Henrik Johansson, Mohsen Asadi:
A hybrid machine-learning and optimization method for contraflow design in post-disaster cases and traffic management scenarios. Expert Syst. Appl. 124: 67-81 (2019) - [j8]Saeed Asadi Bagloee, Madjid Tavana, Glenn Withers, Michael Patriksson, Mohsen Asadi:
Tradable mobility permit with Bitcoin and Ethereum - A Blockchain application in transportation. Internet Things 8 (2019) - 2018
- [j7]Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson, Mohsen Asadi:
Optimization for Roads' Construction: Selection, Prioritization, and Scheduling. Comput. Aided Civ. Infrastructure Eng. 33(10): 833-848 (2018) - [j6]Saeed Asadi Bagloee, Mohsen Asadi, Majid Sarvi, Michael Patriksson:
A hybrid machine-learning and optimization method to solve bi-level problems. Expert Syst. Appl. 95: 142-152 (2018) - [j5]Saeed Asadi Bagloee, Mohsen Asadi, Michael Patriksson:
Minimization of water pumps' electricity usage: A hybrid approach of regression models with optimization. Expert Syst. Appl. 107: 222-242 (2018) - 2017
- [j4]Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson:
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem. Comput. Aided Civ. Infrastructure Eng. 32(4): 319-343 (2017) - [j3]Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson, Abbas Rajabifard:
A Mixed User-Equilibrium and System-Optimal Traffic Flow for Connected Vehicles Stated as a Complementarity Problem. Comput. Aided Civ. Infrastructure Eng. 32(7): 562-580 (2017) - [j2]Saeed Asadi Bagloee, Majid Sarvi, Avishai Ceder:
Transit priority lanes in the congested road networks. Public Transp. 9(3): 571-599 (2017) - 2016
- [c1]Saeed Asadi Bagloee, Majid Sarvi, Abbas Rajabifard, Russell George Thompson, Meead Saberi:
A solution to the road network design problem for multimodal flow. ITSC 2016: 235-240 - 2014
- [j1]Saeed Asadi Bagloee, Mohsen Asadi, Cyrus Mohebbi:
A Model for Screening Vulnerability in the Loan Market in the Context of Credit Rationing. Int. J. Strateg. Decis. Sci. 5(1): 59-75 (2014)
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-10-07 21: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