Bi-objective bi-level optimization for integrating lane-level closure and reversal in redesigning transportation networks

Qiang Zhang (), Shi Qiang Liu () and Andrea D’Ariano ()
Additional contact information
Qiang Zhang: Fuzhou University
Shi Qiang Liu: Fuzhou University
Andrea D’Ariano: Roma Tre University

Operational Research, 2023, vol. 23, issue 2, No 1, 51 pages

Abstract: Abstract Traditionally, traffic congestion was alleviated through significantly upgrading the infrastructure of transportation networks. However, building new roads or adding more lanes to a main road needs huge expenses. A better cost-effective approach is to redesign and fine-tune transportation networks by closing and reversing existing lanes. This paper aims at developing an optimal scheme for lane-level closure and reversal to improve the performance of existing transportation networks with a fairly tight budget. We call this new problem Lane-level Closure and Reversal Problem (LCRP). By considering the capacities of all lanes of a road, two different bi-objective bi-level programs (called the arc-based and lane-based models) are developed to formulate the LCRP. Furthermore, our proposed formulations consider the elastic traffic demand and the elimination of conflict points resulting from reversing lanes. A hybrid machine learning and bi-objective optimization (MLBO) algorithm is developed to overcome the curse of dimensionality of the bi-level programs, especially for the land-based model that is more general but with higher computational complexity. The proposed methodology is illustrated by a small-size numerical example and verified by a real-world case study from Winnipeg (i.e., a benchmark transportation network). Computational results show that the integrated lane-level closure and reversal model can achieve a 0.52% reduction in the total travel time, which is significantly better than the 0.05% reduction individually obtained by arc-level closure or the 0.10% reduction obtained by arc-level reversal. The proposed methodology is beneficial for the traffic management bureau to make a more precise decision in redesigning transportation networks in practice.

Keywords: Transportation; Traffic congestion; Lane-level closure and reversal problem; Bi-level programming; Integer linear programming; 90B20; 90C06; 90C26 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-023-00756-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:23:y:2023:i:2:d:10.1007_s12351-023-00756-y

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-023-00756-y

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().