咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >A path-based greedy algorithm ... 收藏

A path-based greedy algorithm for multi-objective transit routes design with elastic demand

为多客观的运输的一个基于路径的贪婪算法与有弹性的需求发送设计

作     者:Zarrinmehr, Amirali Saffarzadeh, Mahmoud Seyedabrishami, Seyedehsan Nie, Yu Marco 

作者机构:Tarbiat Modares Univ Dept Civil & Environm Engn Tehran Iran Northwestern Univ Dept Civil & Environm Engn Evanston IL USA 

出 版 物:《PUBLIC TRANSPORT》 (公共运输)

年 卷 期:2016年第8卷第2期

页      面:261-293页

核心收录:

学科分类:08[工学] 0823[工学-交通运输工程] 

基  金:United States National Science Foundation [CMMI-1402911] Div Of Civil, Mechanical, & Manufact Inn Directorate For Engineering Funding Source: National Science Foundation 

主  题:Transit routes design Transit ridership Path-based traffic assignment Greedy algorithm Pareto-optimal 

摘      要:This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework;(2) proposing a greedy algorithm for the multi-objective design problem;(3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分