메뉴 건너뛰기




Volumn 217, Issue 7, 2010, Pages 3020-3031

Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs

Author keywords

Bicriteria shortest path; Nonlinear complementarity problem; Traffic equilibrium

Indexed keywords

BI-CRITERIA; GENERALIZED COST; NONLINEAR COMPLEMENTARITY PROBLEM; NUMERICAL EXPERIMENTS; SHORTEST PATH; TRAFFIC EQUILIBRIUM; TRAVEL DEMAND; TRAVEL TIME; TWO-COMPONENT; VARIABLE DEMANDS;

EID: 78049276206     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2010.08.035     Document Type: Article
Times cited : (37)

References (33)
  • 1
    • 0031273029 scopus 로고    scopus 로고
    • The traffic equilibrium problem with nonadditive path costs
    • S. Gabriel, and D. Bernstein The traffic equilibrium problem with nonadditive path costs Transportation Science 31 4 1997 337 348
    • (1997) Transportation Science , vol.31 , Issue.4 , pp. 337-348
    • Gabriel, S.1    Bernstein, D.2
  • 2
    • 0030149460 scopus 로고    scopus 로고
    • Bicriterion traffic assignment: Basic theory and elementary algorithms
    • R. Dial Bicriterion traffic assignment: basic theory and elementary algorithms Transportation Science 30 2 1996 93 111
    • (1996) Transportation Science , vol.30 , Issue.2 , pp. 93-111
    • Dial, R.1
  • 3
    • 0031257994 scopus 로고    scopus 로고
    • Bicriterion traffic assignment efficient algorithms plus examples
    • R. Dial Bicriterion traffic assignment efficient algorithms plus examples Transportation Research Part B 31 1997 357 379
    • (1997) Transportation Research Part B , vol.31 , pp. 357-379
    • Dial, R.1
  • 5
    • 0034254399 scopus 로고    scopus 로고
    • A multiclass, multicriteria traffic network equilibrium model
    • A. Nagurney A multiclass, multicriteria traffic network equilibrium model Mathematical and Computer Modelling 32 2000 393 411
    • (2000) Mathematical and Computer Modelling , Issue.32 , pp. 393-411
    • Nagurney, A.1
  • 6
    • 0036605001 scopus 로고    scopus 로고
    • A multiclass, multicriteria traffic network equilibrium model with elastic demand
    • A. Nagurney, and J. Dong A multiclass, multicriteria traffic network equilibrium model with elastic demand Transportation Research Part B 36B 2002 445 469
    • (2002) Transportation Research Part B , vol.36 , pp. 445-469
    • Nagurney, A.1    Dong, J.2
  • 9
    • 0031542397 scopus 로고    scopus 로고
    • A new merit function for nonlinear complementarity problems and a related algorithm
    • F. Facchinei, and J. Soares A new merit function for nonlinear complementarity problems and a related algorithm SIAM Journal of Optimization 7 1997 225 247
    • (1997) SIAM Journal of Optimization , vol.7 , pp. 225-247
    • Facchinei, F.1    Soares, J.2
  • 10
    • 0034121259 scopus 로고    scopus 로고
    • Traffic equilibrium problem with route-specific costs: Formulation and algorithms
    • H.K. Lo, and A. Chen Traffic equilibrium problem with route-specific costs: formulation and algorithms Transportation Research Part B 34 2000 493 513
    • (2000) Transportation Research Part B , vol.34 , pp. 493-513
    • Lo, H.K.1    Chen, A.2
  • 11
    • 0035900284 scopus 로고    scopus 로고
    • A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
    • A. Chen, H.K. Lo, and H. Yang A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs European Journal of Operational Research 135 2001 27 41
    • (2001) European Journal of Operational Research , vol.135 , pp. 27-41
    • Chen, A.1    Lo, H.K.2    Yang, H.3
  • 14
    • 34250641619 scopus 로고    scopus 로고
    • The traffic equilibrium problem with nonadditive costs and its monotone mixed complementarity problem formulation
    • R. Agdeppa, N. Yamashita, and M. Fukushima The traffic equilibrium problem with nonadditive costs and its monotone mixed complementarity problem formulation Transportation Research Part B 41 2007 862 874
    • (2007) Transportation Research Part B , vol.41 , pp. 862-874
    • Agdeppa, R.1    Yamashita, N.2    Fukushima, M.3
  • 15
    • 3142557595 scopus 로고    scopus 로고
    • Equilibrium, games, and pricing in transportation and telecommunication networks
    • E. Altman, and L. Wynter Equilibrium, games, and pricing in transportation and telecommunication networks Networks and Spatial Economics 4 2004 7 21
    • (2004) Networks and Spatial Economics , vol.4 , pp. 7-21
    • Altman, E.1    Wynter, L.2
  • 16
    • 0030819777 scopus 로고    scopus 로고
    • A class of projection and contraction methods for monotone variational inequalities
    • B.S. He A class of projection and contraction methods for monotone variational inequalities Applied Mathematics & Optimization 35 1997 69 76
    • (1997) Applied Mathematics & Optimization , vol.35 , pp. 69-76
    • He, B.S.1
  • 24
    • 0000527168 scopus 로고
    • A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
    • B.S. He A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming Applied Mathematics & Optimization 25 1992 247 262
    • (1992) Applied Mathematics & Optimization , vol.25 , pp. 247-262
    • He, B.S.1
  • 25
    • 0002477155 scopus 로고    scopus 로고
    • A modified projection and contraction method for a class of linear complementarity problems
    • B.S. He A modified projection and contraction method for a class of linear complementarity problems Journal of Computational Mathematics 14 1 1996 54 63
    • (1996) Journal of Computational Mathematics , vol.14 , Issue.1 , pp. 54-63
    • He, B.S.1
  • 26
    • 0028767587 scopus 로고
    • A new method for a class of linear variational inequalities
    • B.S. He A new method for a class of linear variational inequalities Mathematical Programming 66 1994 137 144
    • (1994) Mathematical Programming , vol.66 , pp. 137-144
    • He, B.S.1
  • 27
    • 21344492689 scopus 로고
    • Solving a class of linear projection equations
    • B.S. He Solving a class of linear projection equations Numerische Mathematik 68 1994 71 80
    • (1994) Numerische Mathematik , vol.68 , pp. 71-80
    • He, B.S.1
  • 28
    • 0000005603 scopus 로고
    • The extra gradient method for finding saddle points and other problems
    • G.M. Korpelevich The extra gradient method for finding saddle points and other problems Matekon 12 1977 35 49
    • (1977) Matekon , vol.12 , pp. 35-49
    • Korpelevich, G.M.1
  • 29
    • 0001227131 scopus 로고
    • A projection and contraction method for the nonlinear complementarity problem and its extensions
    • D.F. Sun A projection and contraction method for the nonlinear complementarity problem and its extensions Mathematica Numerica Sinica 16 1994 183 194
    • (1994) Mathematica Numerica Sinica , vol.16 , pp. 183-194
    • Sun, D.F.1
  • 30
    • 0030243756 scopus 로고    scopus 로고
    • Modified projection-type methods for monotone variational inequalities
    • M.V. Solodov, and P. Tseng Modified projection-type methods for monotone variational inequalities SIAM Journal of Control and Optimization 34 1996 1814 1830
    • (1996) SIAM Journal of Control and Optimization , vol.34 , pp. 1814-1830
    • Solodov, M.V.1    Tseng, P.2
  • 31
    • 0030506603 scopus 로고    scopus 로고
    • A class of iterative methods for solving nonlinear projection equations
    • D.F. Sun A class of iterative methods for solving nonlinear projection equations Journal of Optimization Theory and Applications 91 1996 123 140
    • (1996) Journal of Optimization Theory and Applications , vol.91 , pp. 123-140
    • Sun, D.F.1
  • 32
    • 0026822031 scopus 로고
    • Simplicial decomposition with disaggregated representation for the traffic assignment problem
    • T. Larsson, and M. Patriksson Simplicial decomposition with disaggregated representation for the traffic assignment problem Transportation Science 26 1992 4 17
    • (1992) Transportation Science , vol.26 , pp. 4-17
    • Larsson, T.1    Patriksson, M.2
  • 33
    • 78049298313 scopus 로고
    • An efficient method to solving the road network traffic assignment problem
    • L. LeBlanc, E. Morlok, and W. Pierskalla An efficient method to solving the road network traffic assignment problem Transportation Research 9 1975 185 202
    • (1975) Transportation Research , vol.9 , pp. 185-202
    • Leblanc, L.1    Morlok, E.2    Pierskalla, W.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.