 Optimization of the travel ban scheme of cars based on the spatial distribution of the last digit of license platesDongxu Chen, Yu Sun and Zhongzhen Yang Transport Policy, 2020, vol. 94, issue C, 43-53 Abstract: A bi-level programming method for authorities to design car ban schemes is proposed. The problem is formulated as a nonlinear integer bi-level programming problem with the objective of minimizing the total travel time of cars on weekdays. The proposed ban scheme is obtained based on the spatial distribution of the last digits on car license plates and considers the fairness of car users by balancing the daily traffic service levels. A case study is investigated with real data from Dalian city. A comparison of the schemes based on both the proposed method and the traditional method indicates that the scheme of the proposed method can decrease the total car travel time during morning peak hours on weekdays by 134,900 h, which is equivalent to 4.5 min per car per day. Keywords: Traffic; Travel ban of cars; Number plates; Fairness; User equilibrium (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:trapol:v:94:y:2020:i:c:p:43-53 Ordering information: This journal article can be ordered from DOI: 10.1016/j.tranpol.2020.05.005 Access Statistics for this article Transport Policy is currently edited by Y. Hayashi More articles in Transport Policy from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.