On the public citation graph

Multimodal and Multicriteria Path Set Computation for Journey Planning in Time-Dependent Mobility as a Service Networks

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0037(199705)29:3<141::aid-net2>3.0.co;2-hopenalex-extracted
Time-varying shortest path problems with constraints
inferredcites →https://doi.org/10.1002/atr.5670390304openalex-extracted
Passenger route guidance system for multi-modal transit networks
inferredcites →https://doi.org/10.1002/net.3230210304openalex-extracted
Minimum weight paths in time‐dependent networks
inferredcites →https://doi.org/10.1006/jmaa.1993.1067openalex-extracted
Time Dependency in Multiple Objective Dynamic Programming
inferredcites →https://doi.org/10.1007/3-540-44688-5_15openalex-extracted
Pareto Shortest Paths is Often Feasible in Practice
inferredcites →https://doi.org/10.1007/978-1-4615-5757-9_11openalex-extracted
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
inferredcites →https://doi.org/10.1007/978-3-319-49487-6_2openalex-extracted
Route Planning in Transportation Networks
inferredcites →https://doi.org/10.1007/978-3-319-51691-2_13openalex-extracted
An Evolutionary Multi-criteria Journey Planning Algorithm for Multimodal Transportation Networks
inferredcites →https://doi.org/10.1007/978-3-540-74247-0_3openalex-extracted
Timetable Information: Models and Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_9openalex-extracted
Efficient Routing in Road Networks with Turn Costs
inferredcites →https://doi.org/10.1007/s10479-006-0072-1openalex-extracted
On the cardinality of the Pareto set in bicriteria shortest path problems
inferredcites →https://doi.org/10.1007/s11116-018-9913-4openalex-extracted
The potential of mobility as a service bundles as a mobility management tool
inferredcites →https://doi.org/10.1007/s13222-017-0252-yopenalex-extracted
Dynamic Event-Activity Networks in Public Transportation
inferredcites →https://doi.org/10.1016/0022-247x(66)90009-6openalex-extracted
The shortest route through a network with time-dependent internodal transit times
inferredcites →https://doi.org/10.1016/0191-2615(95)00024-0openalex-extracted
Dual graph representation of transport networks
inferredcites →https://doi.org/10.1016/0377-2217(84)90077-8openalex-extracted
On a multicriteria shortest path problem
inferredcites →https://doi.org/10.1016/j.cie.2010.05.018openalex-extracted
Solving time-dependent multimodal transport problems using a transfer graph model
inferredcites →https://doi.org/10.1016/j.disopt.2006.05.006openalex-extracted
Algorithms for time-dependent bicriteria shortest path problems
inferredcites →https://doi.org/10.1016/j.ejor.2007.09.004openalex-extracted
Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
inferredcites →https://doi.org/10.1016/j.ejor.2014.06.046openalex-extracted
Finding optimal hyperpaths in large transit networks with realistic headway distributions
inferredcites →https://doi.org/10.1016/j.ejor.2020.07.005openalex-extracted
Objectives and methods in multi-objective routing problems: a survey and classification scheme
inferredcites →https://doi.org/10.1016/j.entcs.2003.12.019openalex-extracted
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
inferredcites →https://doi.org/10.1016/j.procs.2017.05.379openalex-extracted
A new time-dependent shortest path algorithm for multimodal transportation network
inferredcites →https://doi.org/10.1016/j.sbspro.2011.08.037openalex-extracted
A multimodal transport network model for advanced traveler information systems
inferredcites →https://doi.org/10.1016/j.tra.2011.06.010openalex-extracted
Where Is My Bus? Impact of mobile real-time information on the perceived and actual wait time of transit riders
inferredcites →https://doi.org/10.1016/j.tra.2019.09.020openalex-extracted
Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines
inferredcites →https://doi.org/10.1016/j.tra.2019.12.020openalex-extracted
Factors affecting the adoption and use of urban air mobility
inferredcites →https://doi.org/10.1016/j.tranpol.2016.03.007openalex-extracted
Users’ willingness to ride an integrated public-transport service: A literature review
inferredcites →https://doi.org/10.1016/j.trc.2019.12.008openalex-extracted
Shared autonomous vehicle services: A comprehensive review
inferredcites →https://doi.org/10.1016/j.trpro.2017.03.020openalex-extracted
A multimodal transport network model and efficient algorithms for building advanced traveler information systems
inferredcites →https://doi.org/10.1016/s0191-2615(97)00042-8openalex-extracted
A network model of urban taxi services
inferredcites →https://doi.org/10.1016/s0377-2217(99)00388-4openalex-extracted
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
inferredcites →https://doi.org/10.1016/s1369-8478(02)00035-9openalex-extracted
The value of integrated multimodal traveller information and its potential contribution to modal change
inferredcites →https://doi.org/10.1023/a:1020853410145openalex-extracted
Modeling Costs of Turns in Route Planning
inferredcites →https://doi.org/10.1038/234034a0openalex-extracted
Distance between Sets
inferredcites →https://doi.org/10.1049/pbtr006e_ch10openalex-extracted
Mobility and the sharing economy: industry developments and early understanding of impacts
inferredcites →https://doi.org/10.1080/01441640500333677openalex-extracted
Use and Effects of Advanced Traveller Information Services (ATIS): A Review of the Literature
inferredcites →https://doi.org/10.1080/10248079308903779openalex-extracted
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗
inferredcites →https://doi.org/10.1080/15472450.2013.856712openalex-extracted
A Mobile Application for Real-Time Multimodal Routing Under a Set of Users’ Preferences
inferredcites →https://doi.org/10.1080/15568318.2017.1338318openalex-extracted
ICT and transport behavior: A conceptual review
inferredcites →https://doi.org/10.1088/1742-6596/2246/1/012071openalex-extracted
A store-and-forward neural network to solve multicriteria optimal path problem in time-dependent networks
inferredcites →https://doi.org/10.1090/qam/102435openalex-extracted
On a routing problem
inferredcites →https://doi.org/10.1109/itsc.2013.6728545openalex-extracted
Generalised time-dependent graphs for fully multimodal journey planning
inferredcites →https://doi.org/10.1109/tits.2008.915650openalex-extracted
Algorithms for Itinerary Planning in Multimodal Transportation Networks
inferredcites →https://doi.org/10.1109/tits.2016.2577047openalex-extracted
Practical Multicriteria Urban Bicycle Routing
inferredcites →https://doi.org/10.1145/1227161.1227166openalex-extracted
Efficient models for timetable information in public transportation systems
inferredcites →https://doi.org/10.1145/1353343.1353371openalex-extracted
Finding time-dependent shortest paths over large graphs
inferredcites →https://doi.org/10.1145/3358695.3361843openalex-extracted
MultiModal Route Planning in Mobility as a Service
inferredcites →https://doi.org/10.1145/79147.214078openalex-extracted
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
inferredcites →https://doi.org/10.1177/0361198118758630openalex-extracted
Automated Mobility-on-Demand vs. Mass Transit: A Multi-Modal Activity-Driven Agent-Based Simulation Approach
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-extracted
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.1287/trsc.2015.0613openalex-extracted
Adaptive Transit Routing in Stochastic Time-Dependent Networks
inferredcites →https://doi.org/10.13140/rg.2.2.32813.33760openalex-extracted
Mobility-as-a-Service and changes in travel preferences and travel behaviour: a literature review
inferredcites →https://doi.org/10.17265/2328-2142/2016.04.001openalex-extracted
Information Integration for Advanced Travel Information Systems
inferredcites →https://doi.org/10.2495/sc150311openalex-extracted
Transition pathways of e-mobility services
inferredcites →https://doi.org/10.3141/1645-21openalex-extracted
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
inferredcites →https://doi.org/10.3141/2536-01openalex-extracted
Implementing Mobility as a Service
inferredcites →https://doi.org/10.3141/2567-11openalex-extracted
Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-490openalex-extracted
Near Admissible Algorithms for Multiobjective Search
inferredcites →https://doi.org/10.4230/oasics.atmos.2005.657openalex-extracted
Paying Less for Train Connections with MOTIS
inferredcites →https://doi.org/10.4230/oasics.atmos.2013.123openalex-extracted
Result Diversity for Multi-Modal Route Planning
inferredcites →https://doi.org/10.5445/ir/1000030757openalex-extracted
Computing and Evaluating Multimodal Journeys
inferredcites →https://doi.org/10.5860/choice.40-2212openalex-extracted
Supernetworks: decision-making for the information age
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.