We present a genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem. Not only can a flow‐swapping process in the algorithm guarantee the flow conservation constraints between OD pair, but also accelerate the convergence velocity of the algorithm. Finally, a simulation example shows feasibility and validity of genetic algorithm. First published online: 27 Oct 2010
Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem
2008
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem
DOAJ | 2008
|British Library Conference Proceedings | 2003
|Existence of simultaneous route and departure choice dynamic user equilibrium
Online Contents | 2013
|An alternative formulation of the simultaneous route and departure-time choice equilibrium problem
Online Contents | 1996
|