用于求解路径交通流量的改进Frank-Wolfe算法-计算机工程与应用.PDF

Computer Engineering and Applications 计算机工程与应用 2018 ，54（9 ） 213 用于求解路径交通流量的改进Frank-Wolfe 算法 用 1，2 2 2 1，3 柴 获 ，何瑞春 ，马昌喜 ，代存杰 应 1，2 2 2 1，3 CHAI Huo , HE Ruichun , MA Changxi , DAI Cunjie 与 1. 兰州交通大学 机电技术研究所，兰州 730070 程 2. 兰州交通大学 交通运输学院，兰州 730070 g 3. 甘肃省物流及运输装备信息化工程技术研究中心，兰州 730070 r 工 o 1.Mechatronics Technology and Research Institute, Lanzhou Jiaotong University, Lanzhou 730070, China . j 2.School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China 机 a 3.Engineering Technology Center for Informatization of Logistics Transport Equipment, Lanzhou 730070, China 算 e c . CHAI Huo, HE Ruichun, MA Changxi, et al. Improved Frank-Wolfe algorithm for path traffic flows in traffic 计 assignment problems. Computer Engineering and Applications, 2018, 54 （9 ）：213-217. ww Abstract ：Frank-Wolfe algorithm is classic algorithm for traffic assignment problem, but cannot get the path traffic flow w because it is a link- based algorithm, an improved algorithm is proposed for the path traffic flow computing based on Frank- Wolfe algorithm. The correspondent module for path traffic flow computing is added to the original algorithm, which is used to update traffic flow of all paths between source and destination （OD ）by the traffic flow step size from all or nothing assignment procedure in each iteration,