A Metaheuristic Approach to the Discrete Network Design Problem Based on the Demand Uncertainty

摘要：

The discrete network design problem (DNDP) aims to construct new routes or improve existing routes in order to enhance the performance of a traffic network system under the condition of limited budgets and network constraints. It is a complex multi-constrained and NP-Hard problem can prove both time consuming and challenging. Due to these difficulties, metaheuristic approaches are highly suitable for solving the DNDP. Usually the fixed demand is used in the model of the DNDP. However, our paper introduces a framework for solving a bi-level model of DNDP based on the uncertain demand, and also presents some key procedures of metaheuristic approaches improved on the previous published 1, such as the representation, initialization and neighborhood. At the same time, our approach is validated using a simple simulated annealing algorithm. In addition, our method solves the Nguyen-Dupuis benchmark problem.

关键词： Discrete network design problem Metaheuristic Simulated annealing

作者: Lang Fan Xinxin Yu Changzhi Bian Huapu Lu

作者单位: Department of Civil Engineering, Tsinghua University Institute of Transportation Engineering Beijing, China

会议类型: 国际会议

会议名称: 2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

会议地点: 上海

会议语种:英文

页码: 1930-1934

在线出版日期: 2011-07-26（万方平台首次上网日期，不代表论文的发表时间）