A modified active set algorithm for transportation discrete network design bi-level problem

详细信息    查看全文

• 作者：Ximing Wang ; Panos M. Pardalos
• 关键词：Discrete network design ; Bi ; level problem ; Binary variable ; Modified active set algorithm ; Binary and ternary numeral system
• 刊名：Journal of Global Optimization
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：67
• 期：1-2
• 页码：325-342
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Optimization; Operation Research/Decision Theory; Real Functions; Computer Science, general;
• 出版者：Springer US
• ISSN：1573-2916
• 卷排序：67

文摘

Transportation discrete network design problem (DNDP) is about how to modify an existing network of roads and highways in order to improve its total system travel time, and the candidate road building or expansion plan can only be added as a whole. DNDP can be formulated into a bi-level problem with binary variables. An active set algorithm has been proposed to solve the bi-level discrete network design problem, while it made an assumption that the capacity increase and construction cost of each road are based on the number of lanes. This paper considers a more general case when the capacity increase and construction cost are specified for each candidate plan. This paper also uses numerical methods instead of solvers to solve each step, so it provides a more direct understanding and control of the algorithm and running procedure. By analyzing the differences and getting corresponding solving methods, a modified active set algorithm is proposed in the paper. In the implementation of the algorithm and the validation, we use binary numeral system and ternary numeral system to avoid too many layers of loop and save storage space. Numerical experiments show the correctness and efficiency of the proposed modified active set algorithm.