메뉴 건너뛰기




Volumn 1, Issue 4, 2009, Pages 281-294

A genetic algorithm for bi-level linear programming dynamic network design problem

Author keywords

Dual variable approximation; Dynamic network design; Genetic algorithm

Indexed keywords


EID: 79955472418     PISSN: 19427867     EISSN: 19427875     Source Type: Journal    
DOI: 10.3328/TL.2009.01.04.281-294     Document Type: Article
Times cited : (11)

References (32)
  • 1
    • 16444380029 scopus 로고    scopus 로고
    • Transit route network design using parallel genetic algorithm
    • Agrawal, J., and Mathew, T. (2004) Transit Route Network Design using Parallel Genetic Algorithm. Journal of Computing in Civil Engineering, vol. 18, No.3, pp 248-256.
    • (2004) Journal of Computing in Civil Engineering , vol.18 , Issue.3 , pp. 248-256
    • Agrawal, J.1    Mathew, T.2
  • 3
    • 39449114352 scopus 로고    scopus 로고
    • Improving performance of genetic algorithms for transportation systems: The case of parallel genetic algorithms
    • Presented at, Washington, D.C
    • Chen, H., Abu-Lebdeh, G. and Goodman, E. (2004) Improving Performance of Genetic Algorithms for Transportation Systems: The Case of Parallel Genetic Algorithms. Presented at 83rd Annual Meeting of the Transportation Research Board, Washington, D.C.
    • (2004) 83rd Annual Meeting of the Transportation Research Board
    • Chen, H.1    Abu-Lebdeh, G.2    Goodman, E.3
  • 4
    • 0028481056 scopus 로고
    • The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory
    • Daganzo, C.F. (1994). The Cell Transmission Model: A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory. Transportation Research Part B, vol. 28B, No.4, pp. 269-287.
    • (1994) Transportation Research Part B , vol.28 , Issue.4 , pp. 269-287
    • Daganzo, C.F.1
  • 5
    • 0028803659 scopus 로고
    • The cell transmission model, part II: Network traffic
    • Daganzo, C.F. (1995). The Cell Transmission Model, Part II: Network Traffic. Transportation Research Part B, Vol. 29B, No. 2, pp. 79-93.
    • (1995) Transportation Research Part B , vol.29 , Issue.2 , pp. 79-93
    • Daganzo, C.F.1
  • 6
    • 47249097971 scopus 로고    scopus 로고
    • Genetic computation for road network design and pricing stackelberg games with multi-class users
    • Springer Berlin /Heidelberg
    • Dimitriou, L., Tsekeris, T., Stathopoulos, A. (2008). Genetic Computation for Road Network Design and Pricing Stackelberg Games with Multi-class Users. Lecture Notes in Computer Science. Volume 4974. Springer Berlin /Heidelberg.
    • (2008) Lecture Notes in Computer Science. , vol.4974
    • Dimitriou, L.1    Tsekeris, T.2    Stathopoulos, A.3
  • 7
    • 22944491997 scopus 로고    scopus 로고
    • The design of innovation: Lessons from and for competent genetic algorithms
    • Kluwer Academic Publishers, the Netherlands
    • Goldberg, D. E. (2002) The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Genetic Algorithms and Evolutionary Computation, Vol. 7. Kluwer Academic Publishers, the Netherlands.
    • (2002) Genetic Algorithms and Evolutionary Computation , vol.7
    • Goldberg, D.E.1
  • 10
    • 0029184295 scopus 로고
    • Network design effects of dynamic traffic assignment
    • Janson, B. N. (1995). Network Design Effects of Dynamic Traffic Assignment. Journal of Transportation Engineering, Vol. 121, No. 1, pp. 1-13.
    • (1995) Journal of Transportation Engineering , vol.121 , Issue.1 , pp. 1-13
    • Janson, B.N.1
  • 11
    • 33846853761 scopus 로고    scopus 로고
    • Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem
    • Jeon, K., Lee, J.S., Ukkusuri, S. and Waller, S.T. (2006) Selectorecombinative Genetic Algorithm to Relax Computational Complexity of Discrete Network Design Problem, Transportation Research Record, No. 1964, pp. 91-103.
    • (2006) Transportation Research Record , vol.1964 , pp. 91-103
    • Jeon, K.1    Lee, J.S.2    Ukkusuri, S.3    Waller, S.T.4
  • 12
    • 79953059931 scopus 로고    scopus 로고
    • Heuristic approach for discrete network design problem accounting for dynamic traffic assignment conditions: Formulations, solution methodologies, implementations and computational experiences
    • Washington, D.C
    • Jeon, K., Ukkusuri, S. and Waller, S. T. (2005). Heuristic Approach for Discrete Network Design Problem Accounting for Dynamic Traffic Assignment Conditions: Formulations, Solution Methodologies, Implementations and Computational Experiences. Proceedings of the 84th Annual Meeting of the Transportation Research Board, Washington, D.C.
    • (2005) Proceedings of the 84th Annual Meeting of the Transportation Research Board
    • Jeon, K.1    Ukkusuri, S.2    Waller, S.T.3
  • 13
    • 84986976912 scopus 로고
    • The complexity of the network design problem
    • Johnson, D.S., Lenstra, J. K. and Rinnooy Kan, A. H. G. (1978) The Complexity of the Network Design Problem, Networks, Volume 8, Issue 4, 279-285.
    • (1978) Networks , vol.8 , Issue.4 , pp. 279-285
    • Johnson, D.S.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 14
    • 33645694310 scopus 로고    scopus 로고
    • A comparison of system- and user-optimal stochastic dynamic network design models using monte carlo bounding techniques
    • Karoonsoontawong, A. and Waller, S.T. (2005). A Comparison of System- and User-Optimal Stochastic Dynamic Network Design Models Using Monte Carlo Bounding Techniques. Transportation Research Record, No. 1923, pp. 91-102.
    • (2005) Transportation Research Record , Issue.1923 , pp. 91-102
    • Karoonsoontawong, A.1    Waller, S.T.2
  • 16
    • 33846869300 scopus 로고    scopus 로고
    • Dynamic continuous network design problem: Linear bi-level programming and metaheuristic approaches
    • Karoonsoontawong, A. and Waller, S.T. (2006). Dynamic Continuous Network Design Problem: Linear Bi-level Programming and Metaheuristic Approaches. Transportation Research Record, No. 1964, pp. 104-117.
    • (2006) Transportation Research Record , Issue.1964 , pp. 104-117
    • Karoonsoontawong, A.1    Waller, S.T.2
  • 18
    • 33846868421 scopus 로고    scopus 로고
    • Non-iterative approach to dynamic traffic origin-destination estimation using parallel evolutionary algorithms
    • Kattan, L. and Abdulhai, B. (2006) Non-iterative Approach to Dynamic Traffic Origin-Destination Estimation Using Parallel Evolutionary Algorithms. Journal of Transportation Research Board, Issue 1964, pp. 201-210.
    • (2006) Journal of Transportation Research Board , Issue.1964 , pp. 201-210
    • Kattan, L.1    Abdulhai, B.2
  • 20
    • 0000090588 scopus 로고
    • On kinematic waves II: A theory of traffic flow on long crowded roads. proceedings of the royal society of London. Series A
    • Lighthill, M.J., Whitham, J.B. (1955). On Kinematic Waves II: A Theory of Traffic Flow on Long Crowded roads. Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, Vol. 229, No. 1178, pp. 317-345.
    • (1955) Mathematical and Physical Sciences , vol.229 , Issue.1178 , pp. 317-345
    • Lighthill, M.J.1    Whitham, J.B.2
  • 22
    • 84883339250 scopus 로고    scopus 로고
    • A dantzig-wolfe decomposition based heuristic scheme for off-line capacity calibration of dynamic traffic assignment
    • (Accepted)
    • Lin, D.-Y., Valsaraj, V. and Waller, S.T. (2010) "A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Off-line Capacity Calibration of Dynamic Traffic Assignment" Computer-Aided Civil and Infrastructure Engineering (Accepted).
    • (2010) Computer-Aided Civil and Infrastructure Engineering
    • Lin, D.-Y.1    Valsaraj, V.2    Waller, S.T.3
  • 23
    • 0002842180 scopus 로고
    • Shockwaves on the highway
    • Richards, P.I. (1956) Shockwaves on the highway. Operations Research, Vol. 4, pp. 42-51
    • (1956) Operations Research , vol.4 , pp. 42-51
    • Richards, P.I.1
  • 26
    • 53349141490 scopus 로고    scopus 로고
    • Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
    • Ukkusuri, S. and Waller, S. T. (2008). Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions. Networks and Spatial Economics, Vol. 8, No 4, pp. 383-406.
    • (2008) Networks and Spatial Economics , vol.8 , Issue.4 , pp. 383-406
    • Ukkusuri, S.1    Waller, S.T.2
  • 30
    • 33747814392 scopus 로고    scopus 로고
    • A combinatorial user optimal dynamic traffic assignment algorithm
    • Waller, S.T. and Ziliaskopoulos, A.K. (2006). A Combinatorial User Optimal Dynamic Traffic Assignment Algorithm. Annals of Operations Research, Vol. 144, No. 1.
    • (2006) Annals of Operations Research , vol.144 , Issue.1
    • Waller, S.T.1    Ziliaskopoulos, A.K.2
  • 31
    • 0031829844 scopus 로고    scopus 로고
    • Models and algorithms for road network design: A review and some new developments
    • 32
    • Yang H, Bell M G H, (1998). "Models and algorithms for road network design: a review and some new developments" Transport Review, No. 18, pp. 257 - 278 32.
    • (1998) Transport Review , vol.18 , pp. 257-278
    • Yang, H.1    Bell, M.G.H.2
  • 32
    • 0033904403 scopus 로고    scopus 로고
    • A linear programming model for the single destination system optimum dynamic traffic assignment problem
    • Ziliaskopoulos, A. K. (2000). A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem. Transportation Science, Vol. 34, No. 1, pp. 37-49.
    • (2000) Transportation Science , vol.34 , Issue.1 , pp. 37-49
    • Ziliaskopoulos, A.K.1


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