A new parallel splitting algorithm is proposed for solving transportation network bal-ance problems with variational inequalities that can be transformed into separable structures.Based on the separable structure of this problem,splitting algorithms have been widely studied to find its solu-tion.The alternating direction method is a classic algorithm for solving variational inequalities.Based on the alternating direction method,it is considered that when the data dimension is large,the parallel splitting algorithm is more effective,and not all sub-variational inequalities can be solved accurately.This paper proposes a new non-exact parallel alternating direction method,proves the convergence of the algorithm under appropriate conditions,and applies it to the traffic network balance problem.Final-ly,the effectiveness of the algorithm is demonstrated through numerical results.
关键词
变分不等式/并行分裂算法/可分离结构/交替方向法
Key words
variational inequalities/parallel splitting algorithm/separable structures/alternating direction method
维普
万方数据