Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Computing Multicriteria Shortest Paths in Stochastic Multimodal Networks Using a Memetic Algorithm

9 references·2 citing·47 second hop

FromToDepth

this work references cited by second hop

References

2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks310 cited
1998A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks171 cited
2004GIS and genetic algorithms for HAZMAT route planning with security considerations98 cited
2016An advanced GA–VNS combination for multicriteria route planning in public transit networks74 cited
2009Design and Assessment of an Online Passenger Information System for Integrated Multimodal Trip Planning52 cited
2015Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks37 cited
2012Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms32 cited
2004Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach30 cited
2009Algorithms of Multi-Modal Route Planning Based on the Concept of Switch Point26 cited

Cited by

2021Passenger’s routes planning in stochastic common-lines’ multi-modal transportation network through integrating Genetic Algorithm and Monte Carlo simulation11 cited
2019Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines11 cited

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