AbstractRecently introduced optimization formulations of the asymmetric traffic assignment problem are developed. The duality of two formulations is shown, and conditions for convexity and differentiability of the objective functions are given. Convexity conditions are also given for the family of formulations recently introduced by Smith (1983). When the travel cost vector is affine and monotone, all of the formulations are shown to be convex programming problems. Algorithmic implications of the results are discussed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Convex programming formulations of the asymmetric traffic assignment problem


    Contributors:

    Published in:

    Publication date :

    1983-11-15


    Size :

    9 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Simplical decomposition of the asymmetric traffic assignment problem

    Lawphongpanich, Siriphong / Hearn, Donald W. | Elsevier | 1983


    92 INTEGER PROGRAMMING MODEL FORMULATIONS FOR OVER CONSTRAINED FLIGHT - GATE ASSIGNMENT PROBLEM

    Ozturk, Cemalettin / Ornek, Arslan M. / Sugut, Ipek | TIBKAT | 2016


    9 HYPERPATH FORMULATIONS OF TRAFFIC ASSIGNMENT PROBLEMS

    Marcotte, P. / Nguyen, S. / Centre for Research on Transportation | British Library Conference Proceedings | 1998


    Stochastic and deterministic formulations of dynamic traffic assignment

    Heydecker, B. G. / Addison, J. D. / European Transport Forum | British Library Conference Proceedings | 1997


    Convex formulations of air traffic flow optimization problems

    Work, D.B. / Bayen, A.M. | Tema Archive | 2008