Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

The Traffic Equilibrium Problem with Nonadditive Path Costs

STEVEN A. GABRIEL and DAVID BERNSTEIN
Transportation Science
Vol. 31, No. 4 (November 1997), pp. 337-348
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/25768788
Page Count: 12
  • More info
  • Cite this Item
The Traffic Equilibrium Problem with Nonadditive Path Costs
Preview not available

Abstract

In this paper we present a version of the (static) traffic equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem, and we also present convergence theory for a generic algorithm for solving nonadditive problems.

Page Thumbnails

  • Thumbnail: Page 
337
    337
  • Thumbnail: Page 
338
    338
  • Thumbnail: Page 
339
    339
  • Thumbnail: Page 
340
    340
  • Thumbnail: Page 
341
    341
  • Thumbnail: Page 
342
    342
  • Thumbnail: Page 
343
    343
  • Thumbnail: Page 
344
    344
  • Thumbnail: Page 
345
    345
  • Thumbnail: Page 
346
    346
  • Thumbnail: Page 
347
    347
  • Thumbnail: Page 
348
    348