Solving asymmetric network equilibrium problems with genetic algorithms

When we consider the interactions between different types of traffic flows, this yields non-separable link cost functions and a class of asymmetric network equilibrium problem (ANEP). In this paper, a diagonalization algorithm incorporating genetic algorithms (DAGA) is presented to solve an ANEP. The main advantage of using genetic algorithms (GAs) is that the ANEP may be reformulated and solved in a manner that is computationally more efficient than the original problem. Numerical results show that this algorithm can solve this kind of ANEP with the available computing resources. The success of this procedure suggests that the approach may be used as an efficient tool to solve similar transportation problems.