A hybrid multiagent learning algorithm for solving the dynamic simulation-based continuous transit network design problem

被引:4
|
作者
Ma, Tai-Yu [1 ]
机构
[1] Univ Lyon 2, CNRS, Transport Econ Lab, Lyon, France
关键词
multiagent; learning; network design; transit system; simulation; MODEL;
D O I
10.1109/TAAI.2011.27
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a hybrid multiagent learning algorithm for solving the dynamic simulation-based bilevel network design problem. The objective is to determine the optimal frequency of a multimodal transit network, which minimizes total users' travel cost and operation cost of transit lines. The problem is formulated as a bilevel programming problem with equilibrium constraints describing noncooperative Nash equilibrium in a dynamic simulation-based transit assignment context. A hybrid algorithm combing the cross entropy multiagent learning algorithm and Hooke-Jeeves algorithm is proposed. Computational results are provided on a small network to illustrate the performance of the proposed algorithm.
引用
收藏
页码:113 / 118
页数:6
相关论文
共 50 条
  • [21] A simulation-based approach for solving assembly line balancing problem
    Wu, Xiaoyu
    2017 2ND INTERNATIONAL SEMINAR ON ADVANCES IN MATERIALS SCIENCE AND ENGINEERING, 2017, 231
  • [22] Simulation-based problem-solving environments for conflict studies
    Yilmaz, Levent
    Oren, Tuncer, I
    Ghasem-Aghaee, Nasser
    SIMULATION & GAMING, 2006, 37 (04) : 534 - 556
  • [23] An approach for solving a modification of the extended rapid transit network design problem
    L. F. Escudero
    S. Muñoz
    TOP, 2009, 17 : 320 - 334
  • [24] Robust dynamic continuous network design problem
    Karoonsoontawong, Ampol
    Waller, S. Travis
    TRANSPORTATION RESEARCH RECORD, 2007, (2029) : 58 - 71
  • [25] An approach for solving a modification of the extended rapid transit network design problem
    Escudero, L. F.
    Munoz, S.
    TOP, 2009, 17 (02) : 320 - 334
  • [26] Multiagent-based evolutionary algorithm for dynamic knapsack problem
    Yan, Yang
    Wang, Ding-Wei
    Wang, Da-Zhi
    Wang, Hong-Feng
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2009, 30 (07): : 948 - 951
  • [27] Heuristic algorithm for solving the discrete network design problem
    Chang, Chia-Juch
    Chang, Sheng Hsiung
    Transportation Planning and Technology, 1993, 17 (01)
  • [28] A Simulation-Based Algorithm for the Probabilistic Traveling Salesman Problem
    Li, Weiqi
    EVOLVE - A BRIDGE BETWEEN PROBABILITY, SET ORIENTED NUMERICS AND EVOLUTIONARY COMPUTATION VII, 2017, 662 : 157 - 183
  • [29] Hybrid Artificial Bee Colony Algorithm for Transit Network Design
    Szeto, W. Y.
    Jiang, Yu
    TRANSPORTATION RESEARCH RECORD, 2012, (2284) : 47 - 56
  • [30] A route set construction algorithm for the transit network design problem
    Mauttone, Antonio
    Urquhart, Maria E.
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (08) : 2440 - 2449