Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem

    Shu-Guang Li Info
DOI: https://doi.org/10.3846/1648-4142.2008.23.73-77

Abstract

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

Keywords:

genetic algorithm, route choices, departure time choices

How to Cite

Li, S.-G. (2008). Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem. Transport, 23(1), 73-77. https://doi.org/10.3846/1648-4142.2008.23.73-77

Share

Published in Issue
March 31, 2008
Abstract Views
568
PDF Downloads
388

License

Copyright (c) 2008 The Author(s). Published by Vilnius Gediminas Technical University.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

View article in other formats

  • PDF

CrossMark check

CrossMark logo

Published

2008-03-31

Issue

Vol 23 No 1 (2008)

Section

Original Article

Copyright

Copyright (c) 2008 The Author(s). Published by Vilnius Gediminas Technical University.

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Li, S.-G. (2008). Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem. Transport, 23(1), 73-77. https://doi.org/10.3846/1648-4142.2008.23.73-77

Share