Land use oriented bi-level discrete road network design

被引:3
|
作者
Wang, Zhongqi [1 ]
Han, Qi [1 ]
de Vries, Bauke [1 ]
机构
[1] Eindhoven Univ Technol, POB 513, NL-5600 MB Eindhoven, Netherlands
来源
21ST EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT 2018) | 2019年 / 37卷
关键词
discrete network design; bi-level programming; land use oriented; accessibility; OPTIMIZATION; EQUILIBRIUM; FORMULATION;
D O I
10.1016/j.trpro.2018.12.163
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Although there is a broad consensus that integrating land use and transport will facilitate sustainable development, land use element is barely considered in network design problem. This paper proposes accessibility to quantitatively describe transport characteristics of a location. With assumptions about the relationship between land use/land cover types and accessibility, this paper introduces a bi-level programming model for land use oriented discrete network design problem (DNDP) and develops a genetic algorithm (GA)-based solution procedure which incorporates Frank-Wolf algorithm for user equilibrium (UE) assignment and Dijkstra algorithm for accessibility measurement. A numerical example is provided to demonstrate the applicability of the model and algorithm. The results indicate that the accessibility of the target traffic zone is improved to meet the demands of commercial areas. (C) 2019 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:35 / 42
页数:8
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] A bi-level programming for bus lane network design
    Yu Bin
    Kong Lu
    Sun Yao
    Yao Baozhen
    Gao Ziyou
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2015, 55 : 310 - 327
  • [4] SOLUTION ALGORITHM FOR A NEW BI-LEVEL DISCRETE NETWORK DESIGN PROBLEM
    Chen, Qun
    Chen, Haibo
    PROMET-TRAFFIC & TRANSPORTATION, 2013, 25 (06): : 513 - 524
  • [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 single-level mixed integer linear formulation for a bi-level discrete network design problem
    Faivaresh, Hamid
    Sepehri, Mohammad Mehdi
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (05) : 623 - 640
  • [7] A modified active set algorithm for transportation discrete network design bi-level problem
    Ximing Wang
    Panos M. Pardalos
    Journal of Global Optimization, 2017, 67 : 325 - 342
  • [8] A modified active set algorithm for transportation discrete network design bi-level problem
    Wang, Ximing
    Pardalos, Panos M.
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 67 (1-2) : 325 - 342
  • [9] Model and solution algorithm for the bi-level discrete network design problem with link capacity constraints
    Zhao, T
    Gao, ZY
    PROCEEDINGS OF 2003 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2003, : 487 - 490
  • [10] A bi-level p-facility network design problem in the presence of congestion
    Zaferanieh, Mehdi
    Abareshi, Maryam
    Jafarzadeh, Morteza
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 176