OBTAINING NETWORK COST(S) FROM ONE LINKS OUTPUT

被引:4
作者
FRANK, M [1 ]
机构
[1] STANFORD UNIV,STANFORD,CA 94305
关键词
D O I
10.1287/trsc.26.1.27
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Consider user-optimization on a directed network whose link costs remain unevaluated, but are assumed to be positive affine symmetric functions of link flows. We focus instead on the equilibrium output variations, locally, of one arbitrary link resulting from variations in either its intrinsic cost or in the demand of the Origin/Destination pair under consideration. With only this local information as output, our algorithm generates, for that particular O/D-pair, the user equilibrium cost as a complete (piecewise-linear) function of O/D-demand, from any one initiating segment: such a segment may be obtained by an independent decomposition procedure.
引用
收藏
页码:27 / 35
页数:9
相关论文
共 20 条
[1]  
Beckmann M., 1956, STUDIES EC TRANSPORT
[2]  
Braess D, 1968, UNTERNEHMENSFORSCHUN, V12, P258, DOI [10.1007/BF01918335, DOI 10.1007/BF01918335]
[3]   AN ITERATIVE SCHEME FOR VARIATIONAL-INEQUALITIES [J].
DAFERMOS, S .
MATHEMATICAL PROGRAMMING, 1983, 26 (01) :40-47
[4]   TRAFFIC EQUILIBRIUM AND VARIATIONAL-INEQUALITIES [J].
DAFERMOS, S .
TRANSPORTATION SCIENCE, 1980, 14 (01) :42-54
[5]   ON SOME TRAFFIC EQUILIBRIUM-THEORY PARADOXES [J].
DAFERMOS, S ;
NAGURNEY, A .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1984, 18 (02) :101-110
[6]   SENSITIVITY ANALYSIS FOR THE ASYMMETRIC NETWORK EQUILIBRIUM PROBLEM [J].
DAFERMOS, S ;
NAGURNEY, A .
MATHEMATICAL PROGRAMMING, 1984, 28 (02) :174-184
[7]  
DAFERMOS S, 1969, NBS B, V37, P91
[8]  
Fiacco A. V., 1983, INTRO SENSITIVITY ST
[9]   THE BRAESS PARADOX [J].
FRANK, M .
MATHEMATICAL PROGRAMMING, 1981, 20 (03) :283-302
[10]   THE EQUILIBRIUM WORTH OF A NETWORK LINK [J].
FRANK, M .
TRANSPORTATION SCIENCE, 1989, 23 (02) :125-138