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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Boyce, D.E. (author) / Janson, B.N. (author)

    Published in:

    Publication date :

    1980-01-01


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English