Models and algorithms for road network design: a review and some new developments

Models and algorithms for road network design: a review and some new developments
复制标题

DOI:
10.1080/01441649808717016
复制
发表时间:
1998-07-01
期刊:
影响因子:
9.8
通讯作者:
Bell, MGH
Bell, MGH
中科院分区:
工程技术1区
文献类型:
--
作者:
Yang, H;Bell, MGH

文献摘要

被引文献

相似文献

网络设计问题(NDP)一直被认为是最困难和最具挑战性的问题之一,在运输。在过去的二十年中,我们已经目睹了一个庞大的,越来越多的研究机构的发展,重点是制定和解决方案的NDP程序,这涉及到选择连接改善或连接添加到现有的道路网络,从每个起点到每个目的地的给定需求。我们的目标是作出最佳的投资决策,以尽量减少在网络中的总旅行成本,同时考虑到网络用户的路线选择行为。本文对该领域现有文献进行了概述,并介绍了模型公式的一些新进展。我们将出行需求弹性纳入NDP,并寻求基于经济的目标函数进行优化。我们还提出了混合网络设计问题,涉及同时选择的链接添加和能力的提高,这被认为是更明智的道路网络。此外,我们介绍了网络储备容量的概念,提高能力的计划,并提出和澄清一些有趣的问题有关的NDP和Braess的悖论。最后,根据调查结果和本文提出的新建议,我们对未来的研究提出了一些展望。
The Network Design Problem (NDP) has long been recognized to be one of the most difficult and challenging problems in transport. In the past two decades, we have witnessed the development of a vast, growing body of research focused on formulations and solution procedures for the NDPs, which deal with the selection of either link improvements or link additions to an existing road network, with given demand from each origin to each destination. The objective is to make an optimal investment decision in order to minimize the total travel cost in the network, while accounting for the route choice behaviour of network users. In this paper, we present a general survey of existing literature in this area, and present some new developments in model formulations. We incorporate the elasticity of travel demand into the NDP and seek the economic-based objective function for optimization. We also pose the mixed network design problem involving simultaneous choice of link addition and capacity improvement which is considered more sensible for road networks. In addition, we introduce the network reserve capacity concept for a capacity improvement plan, and raise and clarify some interesting issues relating to NDP and Braess's paradoxes. Finally, from the survey and the new proposal made herein, we offer some perspectives on future research.