A bi-level p-facility network design problem in the presence of congestion

被引:5
|
作者
Zaferanieh, Mehdi [1 ]
Abareshi, Maryam [1 ]
Jafarzadeh, Morteza [1 ]
机构
[1] Hakim Sabzevari Univ, Sabzevar, Iran
基金
美国国家科学基金会;
关键词
Network design problem; Bi-level programming; Traffic assignment problem; Supervised machine learning; OPTIMIZATION; ALGORITHM; MODEL;
D O I
10.1016/j.cie.2023.109010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we propose a bi-level model for a p-facility network design problem in a transportation network in which the effect of congestion is also considered. In order to cope with the traffic burden imposed by the clients of demand nodes, the possibility of rerouting the previously existing origin-destination flows is allowed. In addition, the network designers consider a limited budget for constructing new facilities as well as applying some operational enhancements on network links to alleviate the increased traffic congestion caused by the clients of facilities and avoid inordinate growth in network travel time and corresponding cost. The upper level is dedicated to selecting the location of facilities and link enhancements with the purpose of minimizing the total travel cost, while at the lower level, a pseudo-traffic assignment problem is applied to determine the user-equilibrium path flows. By analyzing the characteristics of the model, the near-optimal solutions are given by an online supervised machine learning algorithm. Finally, the validity of the proposed model and used method is evaluated through some numerical examples.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem
    Farvaresh, Hamid
    Sepehri, Mohammad Mehdi
    NETWORKS & SPATIAL ECONOMICS, 2013, 13 (01) : 67 - 106
  • [2] A bi-level capacitated P-median facility location problem with the most likely allocation solution
    Abareshi, Maryam
    Zaferanieh, Mehdi
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 123 : 1 - 20
  • [3] A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem
    Hamid Farvaresh
    Mohammad Mehdi Sepehri
    Networks and Spatial Economics, 2013, 13 : 67 - 106
  • [4] A bi-level programming for bus lane network design
    Yu Bin
    Kong Lu
    Sun Yao
    Yao Baozhen
    Gao Ziyou
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2015, 55 : 310 - 327
  • [5] Solution algorithm for the bi-level discrete network design problem
    Gao, ZY
    Wu, JJ
    Sun, HJ
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (06) : 479 - 495
  • [6] SOLUTION ALGORITHM FOR A NEW BI-LEVEL DISCRETE NETWORK DESIGN PROBLEM
    Chen, Qun
    Chen, Haibo
    PROMET-TRAFFIC & TRANSPORTATION, 2013, 25 (06): : 513 - 524
  • [7] A single-level mixed integer linear formulation for a bi-level discrete network design problem
    Faivaresh, Hamid
    Sepehri, Mohammad Mehdi
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (05) : 623 - 640
  • [8] Optimization of facility location and size problem based on bi-level multi-objective programming
    Hu, Zhineng
    Wang, Li
    Qin, Jindong
    Lev, Benjamin
    Gan, Lu
    COMPUTERS & OPERATIONS RESEARCH, 2022, 145
  • [9] A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
    Polino, Sahori
    Camacho-Vallejo, Jose-Fernando
    Villegas, Juan G.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (06) : 4025 - 4067
  • [10] A bi-level programming methodology for decentralized mining supply chain network design
    Zhang, Qiang
    Liu, Shi Qiang
    D'Ariano, Andrea
    Chung, Sai-Ho
    Masoud, Mahmoud
    Li, Xiangong
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 250