AbstractThis article formalizes the land use design problem as a discrete-convex programming problem integrating within a quadratic assignment framework a realistic representation of transportation behavior (automobile congestion and variable demand for travel) as modelled by a combined trip distribution trip assignment model. Hill-climbing algorithms are proposed to solve the resulting optimization problem. Their performance is compared and evaluated on a set of test problems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Spatial allocation on a network with congestion


    Contributors:
    Los, Marc (author) / Nguyen, Sang (author)

    Published in:

    Publication date :

    1980-02-20


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Management of airport congestion through slot allocation

    Abeyratne, R.I.R. | Online Contents | 2000


    CONGESTION ABATEMENT IN ITS THROUGH CENTRALIZED ROUTE ALLOCATION

    Gazis, Denos C. | Taylor & Francis Verlag | 1995


    Optimal congestion taxes in a time allocation model

    Borger, Bruno De | Online Contents | 2011



    Capacity-Allocation Methods for Reducing Urban Traffic Congestion

    Johnston, R. A. / Lund, J. R. / Craig, P. P. | British Library Online Contents | 1995