File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A turning restriction design problem in urban road networks

TitleA turning restriction design problem in urban road networks
Authors
KeywordsBi-level programming
Branch and bound method
Sensitivity analysis
Stochastic user equilibrium
Turning restriction design problem
Issue Date2010
PublisherElsevier 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?
AbstractTurning 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 Identifierhttp://hdl.handle.net/10722/91223
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
Funding AgencyGrant Number
National Basic Research Program of China2006CB705500
National Natural Science Foundation of China70631001
70801004
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 FieldValueLanguage
dc.contributor.authorLong, Jen_HK
dc.contributor.authorGao, Zen_HK
dc.contributor.authorZhang, Hen_HK
dc.contributor.authorSzeto, WYen_HK
dc.date.accessioned2010-09-17T10:15:08Z-
dc.date.available2010-09-17T10:15:08Z-
dc.date.issued2010en_HK
dc.identifier.citationEuropean Journal Of Operational Research, 2010, v. 206 n. 3, p. 569-578en_HK
dc.identifier.issn0377-2217en_HK
dc.identifier.urihttp://hdl.handle.net/10722/91223-
dc.description.abstractTurning 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.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_HK
dc.relation.ispartofEuropean Journal of Operational Researchen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectBi-level programmingen_HK
dc.subjectBranch and bound methoden_HK
dc.subjectSensitivity analysisen_HK
dc.subjectStochastic user equilibriumen_HK
dc.subjectTurning restriction design problemen_HK
dc.titleA turning restriction design problem in urban road networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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.emailSzeto, WY:ceszeto@hku.hken_HK
dc.identifier.authoritySzeto, WY=rp01377en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.ejor.2010.03.013en_HK
dc.identifier.scopuseid_2-s2.0-77951121544en_HK
dc.identifier.hkuros176667-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77951121544&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume206en_HK
dc.identifier.issue3en_HK
dc.identifier.spage569en_HK
dc.identifier.epage578en_HK
dc.identifier.isiWOS:000278188400008-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridLong, J=14033105100en_HK
dc.identifier.scopusauthoridGao, Z=7402832776en_HK
dc.identifier.scopusauthoridZhang, H=11241285800en_HK
dc.identifier.scopusauthoridSzeto, WY=7003652508en_HK
dc.identifier.citeulike6825937-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats