File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Simultaneous Optimization Formulation of a Discrete-Continuous Transportation System

TitleSimultaneous Optimization Formulation of a Discrete-Continuous Transportation System
Authors
Issue Date2003
PublisherUS National Research Council, Transportation Research Board. The Journal's web site is located at http://www.trb.org/Publications/Public/PubsTRRJournalPrint.aspx
Citation
The 82nd Annual Meeting of the Transportation Research Board, Washington, DC., 2003. In Transportation Research Record, 2003 n. 1857, p. 11-20 How to Cite?
AbstractConsider a city with a highly compact central business district (CBD) in which commuters' origins are continuously dispersed. The travel demand is dependent on the total travel cost to the CBD. The transportation system is divided into two layers: major freeways and dense surface streets. Whereas the major freeway network is modeled according to the conventional discrete network approach, the dense surface streets are approximated as a continuum. Travelers to the CBD either travel on the continuum (surface streets) and then exchange to the discrete network (freeways) at an interchange (ramp) before moving to the CBD on the discrete network, or they travel directly to the CBD on the continuum. Specific travel cost-flow relationships for the two layers of transportation facilities are considered. A traffic equilibrium model is developed for this discrete-continuous transportation system in which for a particular origin no traveler can reduce his or her individual travel cost to the CBD by unilaterally changing routes. The problem is formulated as a simultaneous optimization program with two subproblems. One subproblem is a traffic assignment problem from the interchanges to the CBD in the discrete network, and the other is a traffic assignment problem with multiple centers (i.e., the interchange points and the CBD) in the continuous system. A Newtonian algorithm based on the sensitivity analyses of the two subproblems is proposed to solve the resultant simultaneous optimization program. A numerical example is given to demonstrate the effectiveness of the proposed methodology.
Persistent Identifierhttp://hdl.handle.net/10722/152126
ISSN
2015 Impact Factor: 0.522
2015 SCImago Journal Rankings: 0.474
References

 

DC FieldValueLanguage
dc.contributor.authorWong, SCen_US
dc.contributor.authorDu, YCen_US
dc.contributor.authorHo, HWen_US
dc.contributor.authorSun, LJen_US
dc.date.accessioned2012-06-26T06:35:23Z-
dc.date.available2012-06-26T06:35:23Z-
dc.date.issued2003en_US
dc.identifier.citationThe 82nd Annual Meeting of the Transportation Research Board, Washington, DC., 2003. In Transportation Research Record, 2003 n. 1857, p. 11-20en_US
dc.identifier.issn0361-1981en_US
dc.identifier.urihttp://hdl.handle.net/10722/152126-
dc.description.abstractConsider a city with a highly compact central business district (CBD) in which commuters' origins are continuously dispersed. The travel demand is dependent on the total travel cost to the CBD. The transportation system is divided into two layers: major freeways and dense surface streets. Whereas the major freeway network is modeled according to the conventional discrete network approach, the dense surface streets are approximated as a continuum. Travelers to the CBD either travel on the continuum (surface streets) and then exchange to the discrete network (freeways) at an interchange (ramp) before moving to the CBD on the discrete network, or they travel directly to the CBD on the continuum. Specific travel cost-flow relationships for the two layers of transportation facilities are considered. A traffic equilibrium model is developed for this discrete-continuous transportation system in which for a particular origin no traveler can reduce his or her individual travel cost to the CBD by unilaterally changing routes. The problem is formulated as a simultaneous optimization program with two subproblems. One subproblem is a traffic assignment problem from the interchanges to the CBD in the discrete network, and the other is a traffic assignment problem with multiple centers (i.e., the interchange points and the CBD) in the continuous system. A Newtonian algorithm based on the sensitivity analyses of the two subproblems is proposed to solve the resultant simultaneous optimization program. A numerical example is given to demonstrate the effectiveness of the proposed methodology.en_US
dc.languageengen_US
dc.publisherUS National Research Council, Transportation Research Board. The Journal's web site is located at http://www.trb.org/Publications/Public/PubsTRRJournalPrint.aspxen_US
dc.relation.ispartofTransportation Research Recorden_US
dc.titleSimultaneous Optimization Formulation of a Discrete-Continuous Transportation Systemen_US
dc.typeConference_Paperen_US
dc.identifier.emailWong, SC: hhecwsc@hku.hken_US
dc.identifier.authorityWong, SC=rp00191en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-2142770343en_US
dc.identifier.hkuros75894-
dc.identifier.hkuros86043-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-2142770343&selection=ref&src=s&origin=recordpageen_US
dc.identifier.issue1857en_US
dc.identifier.spage11en_US
dc.identifier.epage20en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWong, SC=24323361400en_US
dc.identifier.scopusauthoridDu, YC=16021438800en_US
dc.identifier.scopusauthoridHo, HW=7401465335en_US
dc.identifier.scopusauthoridSun, LJ=7403957564en_US
dc.customcontrol.immutablesml 160113 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats