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] 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
  • [2] A bi-level programming model for the land use – network design problem
    Jen-Jia Lin
    Cheng-Min Feng
    The Annals of Regional Science, 2003, 37 : 93 - 105
  • [3] SOLUTION ALGORITHM FOR A NEW BI-LEVEL DISCRETE NETWORK DESIGN PROBLEM
    Chen, Qun
    Chen, Haibo
    PROMET-TRAFFIC & TRANSPORTATION, 2013, 25 (06): : 513 - 524
  • [4] A bi-level programming model for the land use - network design problem
    Lin, JJ
    Feng, CM
    ANNALS OF REGIONAL SCIENCE, 2003, 37 (01): : 93 - 105
  • [5] 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
  • [6] 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
  • [7] A bi-level model for logistics network design problem based on SPE
    Sun, HJ
    Gao, ZY
    TRAFFIC AND TRANSPORTATION STUDIES, PROCEEDINGS, 2004, : 555 - 564
  • [8] Bi-level Multi-capacitated Facility location Problem
    Abbal, Khalil
    Benadada, Youssef
    Mohammed, El Amrani
    GOL'20: 2020 5TH INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL), 2020, : 132 - 136
  • [9] Bi-level Planning Model for NIMBY Facility Location Problem
    Gu, Yong
    Zhang, Lie
    Wang, Zhengdu
    Zheng, Yangyang
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 7553 - 7558
  • [10] Bi-level simulated annealing algorithm for facility location problem
    Ren Peng
    Xu Rui-hua
    Qin Jin
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL III, 2008, : 17 - +