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.
Spatial allocation on a network with congestion
Transportation Research Part B: Methodological ; 15 , 2 ; 113-126
1980-02-20
14 pages
Article (Journal)
Electronic Resource
English
Management of airport congestion through slot allocation
Online Contents | 2000
|CONGESTION ABATEMENT IN ITS THROUGH CENTRALIZED ROUTE ALLOCATION
Taylor & Francis Verlag | 1995
|Optimal congestion taxes in a time allocation model
Online Contents | 2011
|Optimal congestion taxes in a time allocation model
Elsevier | 2010
|Capacity-Allocation Methods for Reducing Urban Traffic Congestion
British Library Online Contents | 1995
|