![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Rahim F. Benekohal
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j4]Ali Hajbabaie
, Rahim F. Benekohal:
A Program for Simultaneous Network Signal Timing Optimization and Traffic Assignment. IEEE Trans. Intell. Transp. Syst. 16(5): 2573-2586 (2015) - [c9]Juan C. Medina, Rahim F. Benekohal:
Vehicle Detection Design (Coverage and Accuracy) and the Performance of Congested Traffic Networks. ITSC 2015: 179-184 - [c8]Hani Ramezani, Rahim F. Benekohal:
Optimized Speed Harmonization with Connected Vehicles for Work Zones. ITSC 2015: 1081-1086 - 2012
- [c7]Juan C. Medina, Rahim F. Benekohal:
Traffic signal control using reinforcement learning and the max-plus algorithm as a coordinating strategy. ITSC 2012: 596-601 - 2011
- [c6]Ali Hajbabaie
, Rahim F. Benekohal:
Does traffic metering improve network performance efficiency? ITSC 2011: 1114-1119 - [c5]Juan C. Medina, Ali Hajbabaie
, Rahim F. Benekohal:
A comparison of approximate dynamic programming and simple genetic algorithm for traffic control in oversaturated conditions - Case study of a simple symmetric network. ITSC 2011: 1815-1820 - 2010
- [c4]Ali Hajbabaie
, Juan C. Medina, Rahim F. Benekohal:
Effects of ITS-based left turn policies on network performance. ITSC 2010: 80-84 - [c3]Juan C. Medina, Ali Hajbabaie
, Rahim F. Benekohal:
Arterial traffic control using reinforcement learning agents and information from adjacent intersections in the state and reward structure. ITSC 2010: 525-530
2000 – 2009
- 2009
- [c2]Ali Hajbabaie, Rahim F. Benekohal:
Evolution Strategies Compared to Genetic Algorithms in Finding Optimal Signal Timing for Oversaturated Transportation Network. IJCCI 2009: 298-301 - 2007
- [j3]Ghassan Abu-Lebdeh, Hui Chen, Rahim F. Benekohal:
Modeling Traffic Output for Design of Dynamic Multi-Cycle Control in Congested Conditions. J. Intell. Transp. Syst. 11(1): 25-40 (2007) - 2006
- [j2]Dazhi Sun, Rahim F. Benekohal, S. Travis Waller
:
Bi-level Programming Formulation and Heuristic Solution Approach for Dynamic Traffic Signal Optimization. Comput. Aided Civ. Infrastructure Eng. 21(5): 321-333 (2006) - 2004
- [j1]Montty Girianna, Rahim F. Benekohal:
Using Genetic Algorithms to Design Signal Coordination for Oversaturated Networks. J. Intell. Transp. Syst. 8(2): 117-129 (2004) - 2003
- [c1]Dazhi Sun, Rahim F. Benekohal, S. Travis Waller:
Multi-objective Traffic Signal Timing Optimization Using Non-dominated Sorting Genetic Algorithm II. GECCO 2003: 2420-2421
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint