GENETIC ALGORITHM FOR SOLVING DYNAMIC SIMULTANEOUS ROUTE AND DEPARTURE TIME EQUILIBRIUM PROBLEM

Unknown author

9 citations0/0 files storedTransport

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Vehicle Routing Optimization Methods

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 9 citations exist upstream.

References

1993A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem 1990Departure time and route choice for the morning commute 2000Genetic-Algorithms-Based Approach for Bilevel Programming Models 2002Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues 1984The flexibility of departure times for work trips 2003A cell-based simultaneous route and departure time choice model with elastic demand 1995A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem 2004Dynamic departure time and stochastic user equilibrium assignment

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.