A discrete transportation network design problem with combined trip distribution and assignment

D. E. Boyce and B. N. Janson

Transportation Research Part B: Methodological, 1980, vol. 14, issue 1-2, 147-154

Abstract: Three network design problems are formulated for optimizing discrete additions to link capacities. Trip distribution and assignment are functions of travel expenditure in each problem. A reformulation of Wilson's doubly-constrained trip distribution problem, in which entropy instead of total travel expenditure is constrained, provides zone-to-zone flows in each problem. Entropy is interpreted as a measure of zone-to-zone trip-making interaction. Computational results for a toy network are reported.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(80)90040-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:14:y:1980:i:1-2:p:147-154

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().