NON-CONVEX TRAFFIC ASSIGNMENT ON A RECTANGULAR GRID NETWORK

This paper considers an idealized infinite rectangular grid of roads with a translationally symmetric O-D distribution. The total cost of travel on all links approaching each junction is approximated by a quadratic function of the four flows N, S, E, and W at that junction. If any of the four eigenvalues of this quadratic form is negative, the system optimal assignment problem is non-convex. The first possibility is that the cost of travel per trip on any link is a decreasing function of the flow on that link. The second possibility arises if the cost of travel per trips is an increasing function of the flows but the cost of travel N, for example, is more sensitive to the flows E or W than to the flow N. The third possible cause of non-convex behavior arises if the cost of travel N, for example, is more sensitive to the flow S than to the flow N.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Newell, G F
  • Publication Date: 1996-2

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00720576
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Apr 26 1996 12:00AM