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 条
  • [41] A bi-level programming problem for transporting hazardous materials with a bi-modal transportation network
    Ketabi, Akbar
    Ghaderi, Abdolsalam
    Mahmoodi, Anwar
    INTERNATIONAL JOURNAL OF SHIPPING AND TRANSPORT LOGISTICS, 2022, 15 (3-4) : 355 - 381
  • [42] 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
  • [43] Robust bi-level optimization for green opportunistic supply chain network design problem against uncertainty and environmental
    Golpira, Heris
    Najafi, Esmaeil
    Zandieh, Mostafa
    Sadi-Nezhad, Soheil
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 107 : 301 - 312
  • [44] Feature construction as a bi-level optimization problem
    Marwa Hammami
    Slim Bechikh
    Ali Louati
    Mohamed Makhlouf
    Lamjed Ben Said
    Neural Computing and Applications, 2020, 32 : 13783 - 13804
  • [45] Feature construction as a bi-level optimization problem
    Hammami, Marwa
    Bechikh, Slim
    Louati, Ali
    Makhlouf, Mohamed
    Ben Said, Lamjed
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (17): : 13783 - 13804
  • [46] Approximation Algorithms for a Bi-level Knapsack Problem
    Chen, Lin
    Zhang, Guochuan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 399 - 410
  • [47] A bi-level maximal covering location problem
    Martha-Selene Casas-Ramírez
    José-Fernando Camacho-Vallejo
    Juan A. Díaz
    Dolores E. Luna
    Operational Research, 2020, 20 : 827 - 855
  • [49] Approximation algorithms for a bi-level knapsack problem
    Chen, Lin
    Zhang, Guochuan
    THEORETICAL COMPUTER SCIENCE, 2013, 497 : 1 - 12
  • [50] Android malware detection as a Bi-level problem
    Jerbi, Manel
    Dagdia, Zaineb Chelly
    Bechikh, Slim
    Ben Said, Lamjed
    COMPUTERS & SECURITY, 2022, 121