File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.ejor.2010.03.013
- Scopus: eid_2-s2.0-77951121544
- WOS: WOS:000278188400008
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A turning restriction design problem in urban road networks
Title | A turning restriction design problem in urban road networks | ||||||
---|---|---|---|---|---|---|---|
Authors | |||||||
Keywords | Bi-level programming Branch and bound method Sensitivity analysis Stochastic user equilibrium Turning restriction design problem | ||||||
Issue Date | 2010 | ||||||
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor | ||||||
Citation | European Journal Of Operational Research, 2010, v. 206 n. 3, p. 569-578 How to Cite? | ||||||
Abstract | Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. In this paper, a bi-level programming model is proposed to formulate the TRDP. The upper level problem is to minimize the total travel cost from the viewpoint of traffic managers, and the lower level problem is to depict travelers' route choice behavior based on stochastic user equilibrium (SUE) theory. We propose a branch and bound method (BBM), based on the sensitivity analysis algorithm (SAA), to find the optimal turning restriction strategy. A branch strategy and a bound strategy are applied to accelerate the solution process of the TRDP. The computational experiments give promising results, showing that the optimal turning restriction strategy can obviously reduce system congestion and are robust to the variations of both the dispersion parameter of the SUE problem and the level of demand. © 2010 Elsevier B.V. All rights reserved. | ||||||
Persistent Identifier | http://hdl.handle.net/10722/91223 | ||||||
ISSN | 2023 Impact Factor: 6.0 2023 SCImago Journal Rankings: 2.321 | ||||||
ISI Accession Number ID |
Funding Information: The authors would like to thank Dr. Shlomo Bekhor for his help on solving the lower level SUE problem, and the anonymous referees for their helpful comments and suggestions on revising this paper. This work is jointly supported by the National Basic Research Program of China (2006CB705500) and the National Natural Science Foundation of China (70631001, 70801004). | ||||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Long, J | en_HK |
dc.contributor.author | Gao, Z | en_HK |
dc.contributor.author | Zhang, H | en_HK |
dc.contributor.author | Szeto, WY | en_HK |
dc.date.accessioned | 2010-09-17T10:15:08Z | - |
dc.date.available | 2010-09-17T10:15:08Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | European Journal Of Operational Research, 2010, v. 206 n. 3, p. 569-578 | en_HK |
dc.identifier.issn | 0377-2217 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/91223 | - |
dc.description.abstract | Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. In this paper, a bi-level programming model is proposed to formulate the TRDP. The upper level problem is to minimize the total travel cost from the viewpoint of traffic managers, and the lower level problem is to depict travelers' route choice behavior based on stochastic user equilibrium (SUE) theory. We propose a branch and bound method (BBM), based on the sensitivity analysis algorithm (SAA), to find the optimal turning restriction strategy. A branch strategy and a bound strategy are applied to accelerate the solution process of the TRDP. The computational experiments give promising results, showing that the optimal turning restriction strategy can obviously reduce system congestion and are robust to the variations of both the dispersion parameter of the SUE problem and the level of demand. © 2010 Elsevier B.V. All rights reserved. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor | en_HK |
dc.relation.ispartof | European Journal of Operational Research | en_HK |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Bi-level programming | en_HK |
dc.subject | Branch and bound method | en_HK |
dc.subject | Sensitivity analysis | en_HK |
dc.subject | Stochastic user equilibrium | en_HK |
dc.subject | Turning restriction design problem | en_HK |
dc.title | A turning restriction design problem in urban road networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0377-2217&volume=206&issue=3&spage=569&epage=578&date=2010&atitle=A+turning+restriction+design+problem+in+urban+road+networks | - |
dc.identifier.email | Szeto, WY:ceszeto@hku.hk | en_HK |
dc.identifier.authority | Szeto, WY=rp01377 | en_HK |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1016/j.ejor.2010.03.013 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77951121544 | en_HK |
dc.identifier.hkuros | 176667 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77951121544&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 206 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 569 | en_HK |
dc.identifier.epage | 578 | en_HK |
dc.identifier.isi | WOS:000278188400008 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Long, J=14033105100 | en_HK |
dc.identifier.scopusauthorid | Gao, Z=7402832776 | en_HK |
dc.identifier.scopusauthorid | Zhang, H=11241285800 | en_HK |
dc.identifier.scopusauthorid | Szeto, WY=7003652508 | en_HK |
dc.identifier.citeulike | 6825937 | - |
dc.identifier.issnl | 0377-2217 | - |