The paper considers the assignment problem when there are junction interactions. We give an objective function which measures the extent to which a traffic distribution departs from equilibrium, and an algorithm which (under certain conditions) calculates equilibria by steadily reducing the objective function to zero. It is shown that the algorithm certainly works if the network cost-flow function is monotone and continuously differentiable, and a boundary condition is satisfied.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 17 (1983) Issue (Month): 4 (August) Pages: 291-303 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).
Related research
Keywords:
Other versions of this item:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)