File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0032219178
- WOS: WOS:000077507900005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Multi-commodity traffic assignment by continuum approximation of network flow with variable demand
Title | Multi-commodity traffic assignment by continuum approximation of network flow with variable demand |
---|---|
Authors | |
Keywords | Continuum modeling Multi-commodity Traffic assignment Variable demand |
Issue Date | 1998 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb |
Citation | Transportation Research Part B: Methodological, 1998, v. 32B n. 8, p. 567-581 How to Cite? |
Abstract | Consider a city with several highly compact central business districts (CBD), and the commuters' destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out each other as in conventional fluid flow problems albeit travelling in different directions, the traffic flows from a CBD to the destinations over the city are considered as one commodity. The interaction of the traffic flows among different commodities is governed by a cost-flow relationship. The case of variable demand is considered. The primal formulation of the continuum equilibrium model is given and proved to satisfy the user optimal conditions, and the dual formulation of the problem and its complementary conditions are also discussed. A finite element method is then employed to solve the continuum problem. A numerical example is given to illustrate the effectiveness of the proposed method. |
Persistent Identifier | http://hdl.handle.net/10722/71615 |
ISSN | 2023 Impact Factor: 5.8 2023 SCImago Journal Rankings: 2.660 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, SC | en_HK |
dc.date.accessioned | 2010-09-06T06:33:36Z | - |
dc.date.available | 2010-09-06T06:33:36Z | - |
dc.date.issued | 1998 | en_HK |
dc.identifier.citation | Transportation Research Part B: Methodological, 1998, v. 32B n. 8, p. 567-581 | en_HK |
dc.identifier.issn | 0191-2615 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71615 | - |
dc.description.abstract | Consider a city with several highly compact central business districts (CBD), and the commuters' destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out each other as in conventional fluid flow problems albeit travelling in different directions, the traffic flows from a CBD to the destinations over the city are considered as one commodity. The interaction of the traffic flows among different commodities is governed by a cost-flow relationship. The case of variable demand is considered. The primal formulation of the continuum equilibrium model is given and proved to satisfy the user optimal conditions, and the dual formulation of the problem and its complementary conditions are also discussed. A finite element method is then employed to solve the continuum problem. A numerical example is given to illustrate the effectiveness of the proposed method. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb | en_HK |
dc.relation.ispartof | Transportation Research Part B: Methodological | en_HK |
dc.subject | Continuum modeling | en_HK |
dc.subject | Multi-commodity | en_HK |
dc.subject | Traffic assignment | en_HK |
dc.subject | Variable demand | en_HK |
dc.title | Multi-commodity traffic assignment by continuum approximation of network flow with variable demand | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0191-2615&volume=32B&spage=567 &epage= 581&date=1998&atitle=Multi-commodity+traffic+assignment+by+continuum+approximation+of+network+flow+with+variable+demand | en_HK |
dc.identifier.email | Wong, SC:hhecwsc@hku.hk | en_HK |
dc.identifier.authority | Wong, SC=rp00191 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-0032219178 | en_HK |
dc.identifier.hkuros | 39930 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0032219178&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 32B | en_HK |
dc.identifier.issue | 8 | en_HK |
dc.identifier.spage | 567 | en_HK |
dc.identifier.epage | 581 | en_HK |
dc.identifier.isi | WOS:000077507900005 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Wong, SC=24323361400 | en_HK |
dc.identifier.issnl | 0191-2615 | - |