The traffic equilibrium problem with nonadditive path costs

PDF Version Also Available for Download.

Description

In this paper the authors present a version of the (static) traffic equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. The authors motivate this nonadditive version of the problem by describing several situations in which the classical additivity assumption fails. They also present an algorithm for solving nonadditive problems that is based on the recent NE/SQP algorithm, a fast and robust method for the nonlinear complementarity problem. Finally, they present a small example that illustrates both the importance of using nonadditive costs and ... continued below

Physical Description

49 p.

Creation Information

Gabriel, S.A. & Bernstein, D. August 21, 1995.

Context

This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Authors

  • Gabriel, S.A. Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
  • Bernstein, D. Princeton Univ., NJ (United States). Dept. of Civil Engineering and Operations Research

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Description

In this paper the authors present a version of the (static) traffic equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. The authors motivate this nonadditive version of the problem by describing several situations in which the classical additivity assumption fails. They also present an algorithm for solving nonadditive problems that is based on the recent NE/SQP algorithm, a fast and robust method for the nonlinear complementarity problem. Finally, they present a small example that illustrates both the importance of using nonadditive costs and the effectiveness of the NE/SQP method.

Physical Description

49 p.

Notes

OSTI as DE97007857

Source

  • Other Information: PBD: 21 Aug 1995

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • Other: DE97007857
  • Report No.: MCS-P--533-0895
  • Grant Number: W-31109-ENG-38
  • DOI: 10.2172/510386 | External Link
  • Office of Scientific & Technical Information Report Number: 510386
  • Archival Resource Key: ark:/67531/metadc691725

Collections

This report is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this report?

When

Dates and time periods associated with this report.

Creation Date

  • August 21, 1995

Added to The UNT Digital Library

  • Aug. 14, 2015, 8:43 a.m.

Description Last Updated

  • Dec. 16, 2015, 4:48 p.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 2
Total Uses: 10

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Gabriel, S.A. & Bernstein, D. The traffic equilibrium problem with nonadditive path costs, report, August 21, 1995; Illinois. (digital.library.unt.edu/ark:/67531/metadc691725/: accessed August 20, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.