期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Frank-Wolfe算法求解交通分配问题:比较不同流量更新策略和线搜索技术 被引量:12
1
作者 徐猛 屈云超 高自友 《交通运输系统工程与信息》 EI CSCD 2008年第3期14-22,共9页
Frank-Wolfe(FW)算法是一类广泛应用于求解交通分配问题的算法.它具有容易编程实现,所需内存少的特点.但是该算法收敛速度较慢,不能得到路径信息.为了提高算法的效率,本文研究三种流量更新策略(all-at-once,one-origin-at-a-time,one-OD... Frank-Wolfe(FW)算法是一类广泛应用于求解交通分配问题的算法.它具有容易编程实现,所需内存少的特点.但是该算法收敛速度较慢,不能得到路径信息.为了提高算法的效率,本文研究三种流量更新策略(all-at-once,one-origin-at-a-time,one-OD-at-a-time)以及不同的步长搜索策略下的FW算法,其中步长搜索策略包括精确线性搜索方法(包括二分法、黄金分割法、成功失败法)和不精确的线性搜索方法(包括基于Wolfe-Powell收敛准则的搜索方法和Gao等提出的非单调线性搜索方法).最后,本文将上述策略应用于四种不同规模的交通网络中,并给出较适合求解的组合. 展开更多
关键词 交通分配问题 Frank-Wolfe算法 流量更新策略 线搜索
在线阅读 下载PDF
求解交通平衡分配问题的信赖域算法
2
作者 阮正顺 罗艾花 《统计与决策》 CSSCI 北大核心 2011年第10期34-36,共3页
根据Wardrop的用户平衡条件,交通平衡分配问题可视为混合非线性互补问题,在引入合理的假设后,可得到交通平衡分配问题的非线性互补模型。文章分析了该模型解的存在性和唯一性,并结合列生成算法和基于FB函数的信赖域算法,提出了一种修正... 根据Wardrop的用户平衡条件,交通平衡分配问题可视为混合非线性互补问题,在引入合理的假设后,可得到交通平衡分配问题的非线性互补模型。文章分析了该模型解的存在性和唯一性,并结合列生成算法和基于FB函数的信赖域算法,提出了一种修正的信赖域算法。这一算法避免枚举网络中的所有路径,大大降低了问题的规模。文章最后通过数值试验验证了算法的有效性。 展开更多
关键词 交通平衡分配问题 非线性互补问题 列生成算法 信赖域算法 FB函数
在线阅读 下载PDF
Modified origin-based algorithm for traffic equilibrium assignment problems 被引量:1
3
作者 张天然 杨超 陈冬栋 《Journal of Central South University》 SCIE EI CAS 2011年第5期1765-1772,共8页
Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes w... Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications. 展开更多
关键词 traffic assignment origin-based user equilibrium algorithm acyclic network
在线阅读 下载PDF
Allocation optimization of bicycle-sharing stations at scenic spots 被引量:5
4
作者 郭唐仪 张平 +1 位作者 邵飞 刘英舜 《Journal of Central South University》 SCIE EI CAS 2014年第8期3396-3403,共8页
Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the sceni... Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the scenic spot and around its influencing area are focused on. It is found that the terrain, land use, nearby transport network and scenery point distribution have significant impact on the allocation of bicycle-sharing system. While the candidate bicycle-sharing stations installed at the inner scenic points, entrances/exits and metro stations are fixed, the ones installed at bus-stations and other passenger concentration buildings are adjustable. Aiming at minimizing the total cycling distance and overlapping rate, an optimization model is proposed and solved based on the idea of cluster concept and greedy heuristic. A revealed preference/stated preference (RP/SP) combined survey was conducted at Xuanwu Lake in Nanjing, China, to get an insight into the touring trip characteristics and bicycle-sharing tendency. The results reveal that 39.81% visitors accept a cycling distance of 1-3 km and 62.50% respondents think that the bicycle-sharing system should charge an appropriate fee. The sttrvey indicates that there is high possibility to carry out a bicycle-sharing system at Xuanwu Lake. Optimizing the allocation problem cluster by cluster rather than using an exhaustive search method significantly reduces the computing amount from O(2^43) to O(43 2). The 500 m-radius-coverage rate for the alternative optimized by 500 m-radius-cluster and 800 m-radius-cluster is 89.2% and 68.5%, respectively. The final layout scheme will provide decision makers engineering guidelines and theoretical support. 展开更多
关键词 bicycle-sharing allocation optimization scenic spot CLUSTER
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部