SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences
5 references·1 citing·26 second hop
Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences (2013)Research on Large-Scale Road Network Part…State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths (2012)State-based accelerations and…Hierarchy Decomposition for Faster User Equilibria on Road Networks (2011)Hierarchy Decomposition for F…Optimization of transit priority in the transportation network using a decomposition methodology (2010)Optimization of transit prior…Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (2007)Using ACCPM in a simplicial d…An adaptive routing algorithm for in-vehicle route guidance systems with real-time information (2001)An adaptive routing algorithm…Multimodal Network Equilibrium with Stochastic Travel Times (2014)Multimodal Network Equilibriu…Studies in the Economics of Transportation. (1956)Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)Algorithmic Game Theory (2007)Accelerating Traffic Assignment with Customizable Contraction Hierarchies (2020)Probability Concepts in Engineering Planning and Design (1975)The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)Expected shortest paths in dynamic and stochastic traffic networks (1998)Shortest paths in stochastic networks with correlated link costs (2005)Finding Reliable Shortest Paths in Road Networks Under Uncertainty (2012)Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem (2013)Network Design and Transportation Planning: Models and Algorithms (1984)The Traffic Assignment Problem: Models and Methods (1994)Efficient Transit Schedule Design of timing points: A comparison of Ant Colony and Genetic Algorithms (2011)Bicycle lane priority: Promoting bicycle as a green mode even in congested urban area (2016)A multi-stage stochastic optimization approach to the stop-skipping and bus lane reservation schemes (2020)A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (1998)An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays (2000)Shortest viable path algorithm in multimodal networks (2001)An Algorithmic Framework for Computing Shortest Routes in Urban Multimodal Networks with Different Criteria (2014)Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines (2019)Passenger’s routes planning in stochastic common-lines’ multi-modal transportation network through integrating Genetic Algorithm and Monte Carlo simulation (2021)Traffic Equilibrium and Variational Inequalities (1980)An Algorithm for the Discrete Network Design Problem (1975)Network with degradable links: capacity analysis and design (2003)Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion (2005)Multiple Equilibrium Behaviors considering Human Exposure to Vehicular Emissions (2018)
this work references cited by second hop

References

  • 2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information149 cited
  • 2010Optimization of transit priority in the transportation network using a decomposition methodology83 cited
  • 2012State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths22 cited
  • 2011Hierarchy Decomposition for Faster User Equilibria on Road Networks12 cited
  • 2007Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem7 cited

Cited by

  • 2014Multimodal Network Equilibrium with Stochastic Travel Times5 cited

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