Traffic assignment problem for a general network

Abstract

A tra ns portatio n network is co ns id e red . The traffic de mands assoc iat ed wit h pairs of nodes and th e (co nvex) trav e ling cos t functions associat ed with th e link s a re assumed give n. Th e twu prob le ms of findin g th e traffi c patt e rn s whi c h e ith er minimize th e total cos t or e quilibrate th e use rs' c os ts are fo rmulat e d , and a lgo rithm s are co ns tru c ted for th e so lutio n of th ese prob lems.