Association Journal of CSIAM
Supervised by Ministry of Education of PRC
Sponsored by Xi'an Jiaotong University
ISSN 1005-3085  CN 61-1269/O1

Chinese Journal of Engineering Mathematics ›› 2024, Vol. 41 ›› Issue (2): 279-293.doi: 10.3969/j.issn.1005-3085.2024.02.006

Previous Articles     Next Articles

A Bi-level Programming Model for OD Demand Reconstruction under Congested Network

LI Gaoxi1,2,  REN Yi1   

  1. 1. School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067;
    2. Chongqing Key Laboratory of Social Economy and Applied Statistics, Chongqing 400067
  • Received:2022-12-27 Accepted:2023-09-28 Online:2024-04-15 Published:2024-06-15
  • Contact: Y. Ren. E-mail address: ry991002@163.com
  • Supported by:
    The National Natural Science Foundation of China (11901068); the National Center for Applied Mathematics (ncamc2021-msxm01); the Natural Science Foundation of Chongqing (CSTB2022NSCQ-MSX0606); the Graduate Tutor Team Construction Project of Chongqing (yds223010).

Abstract:

A bi-level programming model to reconstruct origin-destination (OD) demand by using density as the observed variable under congested network is proposed. The upper-levels minimize the errors on the estimated values and observed values, and the lower-levels are user equilibrium model. For a bi-level programming model, KKT condition method is adopted, it is transformed into a mathematical program with equilibrium constraints which is easier to solve, and then Scholtes relaxation method is used to solve the transformed model. The numerical results show that, using density as the observed variable is better than using flow in the OD reconstruction problem under congested network. Meanwhile, for solving method of bi-level programming model, the method of transforming KKT condition into single-level is superior to the upper-lower alternate algorithm.

Key words: OD demand reconstruction, bi-level programming model, KKT-approach, link density, route density

CLC Number: