Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms (Q1930787)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
scientific article

    Statements

    Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2013
    0 references
    metaheuristic algorithms
    0 references
    multimodal networks
    0 references
    K-shortest path problem
    0 references
    bi-direction search
    0 references
    congestion level
    0 references
    \texttt{CPLEX 12.1}
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references