用遗传算法求解考虑通行能力约束的运输网络均衡问题

Genetic Algorithms for Solving Transportation Network Equilibrium Problems with Capacity Constraints

通过使用遗传算法（ＧｅｎｅｔｉｃＡｌｇｏｒｉｔｈｍｓ———ＧＡｓ），消除部分约束，把有通行能力约束的的运输网络均衡配流问题重新组织成一个比原问题简单而有效的模型。数值检验结果表明：ＧＡｓ能够使用现有计算资源有效完成求解运输网络均衡问题。另外，这里介绍的方法可以很方便地推广用于其它运输网络均衡问题。

In this paper, genetic algorithms(GAs)are presented to solve an equilibrium assignment model with capacity constraints The main advantage of using the GAs is that the problem can be reformulated in a manner that is computationally simpler and more efficient than the original problem by eliminating the part of constraints The numerical results show that the procedure of using the GAs can be extended to other transportation network equilibrium problems