非可加平衡交通分配问题的列生成算法

为求解非可加平衡交通分配问题，基于列生成算法基本框架，采用K最短路算法生成需要的路径，采用幂罚函数法求解平衡路径流问题，提出一种新的算法，并进行数值模拟，将算法用于求解含路径特定行驶费用和路段容量随机降级下的路径行驶预算2类非可加费用情形。结果表明，所提出的算法能有效求解非可加平衡交通分配问题，并获得高精度的满足 Wardrop用户平衡准则的平衡路径流(误差E≤10-9)，即对于每一个O D对，流量大于0的路径的行驶费用几乎都相等，且等于最小行驶费用。

Column Generation for Non additive Equilibrium Traffic Assignment

In order to solve the non additive equilibrium traffic assignment problem,a new algorithm based on the basic framework of column generation is proposed which uses the K shortest path method to generate the required path and the power penalty method to solve the equilibrium path flow problem.Numerical simulation is then carried out to determine two types of non additive costs:path specific travel cost and path travel cost budget under random degradation of link capacity.Numerical results show that the proposed method can effectively solve the non additive equilibrium traffic assignment problem and obtain high precision equilibrium path flow that satisfies Wardrop user equilibrium principle (error E≤10-9),that is,for each O D pair,the travel cost of the path with flow greater than 0 is almost equal to each other,and equal to the minimum travel cost.