Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

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

5 references·9 citing·36 second hop

FromToDepth

this work references cited by second hop

References

2000An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays211 cited
1998A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks171 cited
2001Shortest viable path algorithm in multimodal networks169 cited
2003Models and algorithms for the traffic assignment problem with link capacity constraints168 cited
2005Object modeling and path computation for multimodal travel systems105 cited

Cited by

2025A systematic literature review on the use of metaheuristics for the optimisation of multimodal transportation24 cited
2016A multi-criteria route planning model based on fuzzy preference degrees of stops15 cited
2024Door to door space-time path planning of intercity multimodal transport network using improved ripple-spreading algorithm12 cited
2018Computing Multicriteria Shortest Paths in Stochastic Multimodal Networks Using a Memetic Algorithm11 cited
2021Passenger’s routes planning in stochastic common-lines’ multi-modal transportation network through integrating Genetic Algorithm and Monte Carlo simulation11 cited
2018Decision Making Using Metaheuristic Optimization Methods in Sustainable Transportation11 cited
2018Vehicle scheduling approach and its practice to optimise public bicycle redistribution in Hangzhou10 cited
2015A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

10 cited

2021Risk-Based Formulation of the Transit Priority Network Design7 cited