On the public citation graph

Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time

https://doi.org/10.3141/1645-21
0 signed · 304 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/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1002/net.3230210304openalex-snapshot
Minimum weight paths in time‐dependent networks
inferredcites →https://doi.org/10.1007/978-1-4615-5203-1_1openalex-snapshot
Transportation Science
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01585517openalex-snapshot
Implementation and efficiency of Moore-algorithms for the shortest route problem
inferredcites →https://doi.org/10.1007/bf02288320openalex-snapshot
Shortest path algorithms
inferredcites →https://doi.org/10.1016/0022-247x(66)90009-6openalex-snapshot
The shortest route through a network with time-dependent internodal transit times
inferredcites →https://doi.org/10.1057/jors.1991.81openalex-snapshot
Vehicle-routeing with Time Windows and Time-varying Congestion
inferredcites →https://doi.org/10.1080/10248079308903779openalex-snapshot
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.5555/3226663.3227073openalex-snapshot
Shortest paths algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.344442openalex-extracted
Dynamic Shortest Paths Minimizing Travel Times and Costs
inferred← citeshttps://doi.org/10.2139/ssrn.4760698openalex-extracted
Multimodal and Multicriteria Path Set Computation for Journey Planning in Time-Dependent Mobility as a Service Networks
inferred← citeshttps://doi.org/10.5281/zenodo.1327835openalex-extracted
Optimal Path Planning Under Priori Information In Stochastic, Time-Varying Networks
inferred← citeshttps://doi.org/10.1002/1097-0037(200101)37:1<35::aid-net4>3.0.co;2-gopenalex-snapshot
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
inferred← citeshttps://doi.org/10.1002/atr.5670390205openalex-snapshot
Counting the different efficient paths for transportation networks and its applications
inferred← citeshttps://doi.org/10.1002/cpe.5644openalex-snapshot
A parallel time‐varying earliest arrival path algorithm for evacuation planning of underground mine water inrush accidents
inferred← citeshttps://doi.org/10.1002/nav.21492openalex-snapshot
Optimal path finding in direction, location, and time dependent environments
inferred← citeshttps://doi.org/10.1002/net.10072openalex-snapshot
Dynamic shortest paths minimizing travel times and costs
inferred← citeshttps://doi.org/10.1002/net.20013openalex-snapshot
Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies
inferred← citeshttps://doi.org/10.1002/net.20438openalex-snapshot
BidirectionalA* search on time‐dependent road networks
inferred← citeshttps://doi.org/10.1002/net.21501openalex-snapshot
Computation of the optimal value function in time‐dependent networks
inferred← citeshttps://doi.org/10.1002/net.21524openalex-snapshot
Finding least fuel emission paths in a network with time‐varying speeds
inferred← citeshttps://doi.org/10.1007/11556114_6openalex-snapshot
Shortest Path Search from a Physical Perspective
inferred← citeshttps://doi.org/10.1007/11590064_24openalex-snapshot
Analyzing Shortest and Fastest Paths with GIS and Determining Algorithm Running Time
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_15openalex-snapshot
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
inferred← citeshttps://doi.org/10.1007/978-0-387-35973-1_403openalex-snapshot
Fastest-Path Computation
inferred← citeshttps://doi.org/10.1007/978-0-387-71722-7_6openalex-snapshot
An Intermodal Time-Dependent Minimum Cost Path Algorithm
inferred← citeshttps://doi.org/10.1007/978-0-387-71722-7_7openalex-snapshot
Real-Time Emergency Response Fleet Deployment: Concepts, Systems, Simulation & Case Studies
inferred← citeshttps://doi.org/10.1007/978-0-387-84812-9_3openalex-snapshot
Multi-day dynamic transit assignment
inferred← citeshttps://doi.org/10.1007/978-1-4614-6243-9_10openalex-snapshot
Dynamic Navigation in Direction-Dependent Environments
inferred← citeshttps://doi.org/10.1007/978-1-4614-6794-6_4openalex-snapshot
The Effect of Weather Systems in Hazmat Transportation Modeling
inferred← citeshttps://doi.org/10.1007/978-3-030-43024-5_14openalex-snapshot
Freight Train Scheduling in Railway Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-56689-0_4openalex-snapshot
Optimization Techniques in Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-89672-0_7openalex-snapshot
Data Analytics and Models for Understanding and Predicting Travel Patterns in Urban Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-030-92905-3_11openalex-snapshot
Routing Vehicles on Highways by Augmenting Traffic Flow Network: A Review on Speed Up Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-21127-0_45openalex-snapshot
Adaptive Routing Potential in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-64769-7_5openalex-snapshot
Traffic and Demand Management in the Era of Connected Vehicles
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_403openalex-snapshot
Fastest-Path Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_15openalex-snapshot
A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_403-2openalex-snapshot
Fastest-Path Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-41618-2_1openalex-snapshot
Flow Tasks in Networks in Crisp Conditions
inferred← citeshttps://doi.org/10.1007/978-3-319-46922-5_11openalex-snapshot
Finding Least On-Road Travel Time on Road Network
inferred← citeshttps://doi.org/10.1007/978-3-319-67771-2_3openalex-snapshot
Representational Models for Spatio-Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_21openalex-snapshot
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30231-5_19openalex-snapshot
Towards a Temporal Extension of Spatial Allocation Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-00312-7_30openalex-snapshot
Stochastic Motion Planning and Applications to Traffic
inferred← citeshttps://doi.org/10.1007/978-3-642-12038-1_20openalex-snapshot
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-15364-8_36openalex-snapshot
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-16339-5_23openalex-snapshot
Research on the Optimal Transit Route Selection Model and Automatic Inquiry System
inferred← citeshttps://doi.org/10.1007/978-3-642-23857-4_36openalex-snapshot
A Memetic Algorithm for Routing in Urban Public Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23935-9_23openalex-snapshot
An Evolutionary Algorithm for the Urban Public Transportation
inferred← citeshttps://doi.org/10.1007/978-3-642-53878-0_10openalex-snapshot
Evolutionary Algorithm with Geographic Heuristics for Urban Public Transportation
inferred← citeshttps://doi.org/10.1007/978-94-017-9205-9_6openalex-snapshot
Spatio-temporal Networks: Modeling, Storing, and Querying Temporally-Detailed Roadmaps
inferred← citeshttps://doi.org/10.1007/s00291-020-00609-6openalex-snapshot
A novel vehicle routing problem for vaccine distribution using SIR epidemic model
inferred← citeshttps://doi.org/10.1007/s00453-012-9714-7openalex-snapshot
On the Complexity of Time-Dependent Shortest Paths
inferred← citeshttps://doi.org/10.1007/s00778-018-0499-4openalex-snapshot
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory
inferred← citeshttps://doi.org/10.1007/s10287-008-0079-yopenalex-snapshot
Optimal routing of vehicles with communication capabilities in disasters
inferred← citeshttps://doi.org/10.1007/s10288-010-0121-0openalex-snapshot
Point-to-point shortest paths on dynamic time-dependent road networks
inferred← citeshttps://doi.org/10.1007/s10589-008-9172-yopenalex-snapshot
Fast paths in large-scale dynamic road networks
inferred← citeshttps://doi.org/10.1007/s10852-011-9163-3openalex-snapshot
Snapshot Centrality Indices in Dynamic FIFO Networks
inferred← citeshttps://doi.org/10.1007/s10922-019-09498-9openalex-snapshot
Mechanism Design for Exchanging Resources in Federated Networks
inferred← citeshttps://doi.org/10.1007/s10951-017-0535-zopenalex-snapshot
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
inferred← citeshttps://doi.org/10.1007/s10957-012-0121-7openalex-snapshot
Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications
inferred← citeshttps://doi.org/10.1007/s11042-022-12066-0openalex-snapshot
Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
inferred← citeshttps://doi.org/10.1007/s11067-007-9022-yopenalex-snapshot
Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback
inferred← citeshttps://doi.org/10.1007/s11067-013-9207-5openalex-snapshot
Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding
inferred← citeshttps://doi.org/10.1007/s11069-016-2336-7openalex-snapshot
Simultaneous optimization of evacuation route and departure time based on link-congestion mitigation
inferred← citeshttps://doi.org/10.1007/s11116-017-9835-6openalex-snapshot
Joint travel problem in space–time multi-state supernetworks
inferred← citeshttps://doi.org/10.1007/s11590-009-0162-5openalex-snapshot
Dynamic shortest path problems with time-varying costs
inferred← citeshttps://doi.org/10.1007/s12544-015-0168-2openalex-snapshot
Working with the daily variation in infrastructure performance on territorial accessibility. The cases of Madrid and Barcelona
inferred← citeshttps://doi.org/10.1007/s12597-012-0063-8openalex-snapshot
A new approach for solving the network problems
inferred← citeshttps://doi.org/10.1007/s13369-020-04606-3openalex-snapshot
A Parallel Fully Dynamic Iterative Bio-Inspired Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/s13676-012-0004-yopenalex-snapshot
A bi-objective time-dependent vehicle routing and scheduling problem for hazardous materials distribution
inferred← citeshttps://doi.org/10.1007/s40864-018-0083-7openalex-snapshot
Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems
inferred← citeshttps://doi.org/10.1007/s41109-016-0011-2openalex-snapshot
Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis
inferred← citeshttps://doi.org/10.1016/b978-008043924-2/50039-0openalex-snapshot
Iterative Demand Generation for Transportation Simulations
inferred← citeshttps://doi.org/10.1016/bs.atpp.2019.07.003openalex-snapshot
Travel modeling under foreseeable communications-and-mobility technologies: Part I (short-term view)
inferred← citeshttps://doi.org/10.1016/j.amar.2023.100277openalex-snapshot
Real-time safest route identification: Examining the trade-off between safest and fastest routes
inferred← citeshttps://doi.org/10.1016/j.comcom.2021.12.002openalex-snapshot
Route recommendation for evacuation networks using MMPP/M/1/N queueing models
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110451openalex-snapshot
A novel method for solving the multi-commodity flow problem on evolving networks
inferred← citeshttps://doi.org/10.1016/j.cor.2005.06.005openalex-snapshot
Routing of a hazmat truck in the presence of weather systems
inferred← citeshttps://doi.org/10.1016/j.cor.2007.10.023openalex-snapshot
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.05.006openalex-snapshot
Algorithms for time-dependent bicriteria shortest path problems
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.10.344openalex-snapshot
An Intelligent Optimizing Approach for Spinning Process Based on Immune Neural Network Expert System
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.003openalex-snapshot
Multicriteria adaptive paths in stochastic, time-varying networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.019openalex-snapshot
The dynamic shortest path problem with anticipation
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.09.004openalex-snapshot
Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.10.027openalex-snapshot
Dynamic journeying under uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.10.044openalex-snapshot
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.06.008openalex-snapshot
Staggered routing in autonomous mobility-on-demand systems
inferred← citeshttps://doi.org/10.1016/j.eswa.2009.09.030openalex-snapshot
An intelligent traffic management expert system with RFID technology
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115193openalex-snapshot
A solution method for the shared resource-constrained multi-shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ins.2013.07.009openalex-snapshot
Processing time-dependent shortest path queries without pre-computed speed information on road networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.003openalex-snapshot
Parallel implementation of a transportation network model
inferred← citeshttps://doi.org/10.1016/j.jtrangeo.2017.05.014openalex-snapshot
The impacts of congestion on automobile accessibility. What happens in large European cities?
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.02.068openalex-snapshot
Benchmarking a recurrent neural network based efficient shortest path problem (SPP) solver concept under difficult dynamic parameter settings conditions
inferred← citeshttps://doi.org/10.1016/j.orl.2008.07.003openalex-snapshot
Solving the -shortest path problem with time windows in a time varying network
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.425openalex-snapshot
Fire Hazard Safety Optimization
inferred← citeshttps://doi.org/10.1016/j.sbspro.2012.03.134openalex-snapshot
An Approach for Solving Vehicle Routing Problem with Link Cost Variability in the Time
inferred← citeshttps://doi.org/10.1016/j.sbspro.2012.03.136openalex-snapshot
Reactive and Proactive Routing Strategies with Real-Time Traffic Information
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.05.024openalex-snapshot
Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths
inferred← citeshttps://doi.org/10.1016/j.trb.2005.02.001openalex-snapshot
Optimal routing policy problems in stochastic time-dependent networks
inferred← citeshttps://doi.org/10.1016/j.trb.2008.01.001openalex-snapshot
A variational inequality formulation for inferring dynamic origin–destination travel demands
inferred← citeshttps://doi.org/10.1016/j.trb.2012.02.008openalex-snapshot
System-optimal dynamic traffic assignment with and without queue spillback: Its path-based formulation and solution via approximate path marginal cost
inferred← citeshttps://doi.org/10.1016/j.trb.2013.06.011openalex-snapshot
Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths
inferred← citeshttps://doi.org/10.1016/j.trb.2014.09.002openalex-snapshot
Approximating dynamic equilibrium conditions with macroscopic fundamental diagrams
inferred← citeshttps://doi.org/10.1016/j.trb.2016.02.005openalex-snapshot
Solving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms
inferred← citeshttps://doi.org/10.1016/j.trb.2016.03.009openalex-snapshot
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
inferred← citeshttps://doi.org/10.1016/j.trb.2016.10.010openalex-snapshot
Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decomposition
inferred← citeshttps://doi.org/10.1016/j.trb.2017.01.002openalex-snapshot
Joint optimization of high-speed train timetables and speed profiles: A unified modeling approach using space-time-speed grid networks
inferred← citeshttps://doi.org/10.1016/j.trb.2018.10.017openalex-snapshot
Dynamic traffic assignment using the macroscopic fundamental diagram: A Review of vehicular and pedestrian flow models
inferred← citeshttps://doi.org/10.1016/j.trb.2019.08.001openalex-snapshot
Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods
inferred← citeshttps://doi.org/10.1016/j.trb.2019.09.015openalex-snapshot
A cumulative service state representation for the pickup and delivery problem with transfers
inferred← citeshttps://doi.org/10.1016/j.trb.2020.05.013openalex-snapshot
Algorithms for most reliable routes on stochastic and time-dependent networks
inferred← citeshttps://doi.org/10.1016/j.trb.2021.11.009openalex-snapshot
Integrated line planning and train timetabling through price-based cross-resolution feedback mechanism
inferred← citeshttps://doi.org/10.1016/j.trc.2009.04.015openalex-snapshot
Reverse time-restricted shortest paths: Application to air traffic management
inferred← citeshttps://doi.org/10.1016/j.trc.2009.12.002openalex-snapshot
Solving the bicriterion routing and scheduling problem for hazardous materials distribution
inferred← citeshttps://doi.org/10.1016/j.trc.2011.09.007openalex-snapshot
Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks
inferred← citeshttps://doi.org/10.1016/j.trc.2013.07.001openalex-snapshot
On the computation of the energy-optimal route dependent on the traffic load in Ingolstadt
inferred← citeshttps://doi.org/10.1016/j.trc.2014.08.021openalex-snapshot
Long-term congestion anticipation and aversion in pedestrian simulation using floor field cellular automata
inferred← citeshttps://doi.org/10.1016/j.trc.2014.10.011openalex-snapshot
Dynamic system optimal model for multi-OD traffic networks with an advanced spatial queuing model
inferred← citeshttps://doi.org/10.1016/j.trc.2015.05.009openalex-snapshot
Equilibrium analysis and route guidance in large-scale networks with MFD dynamics
inferred← citeshttps://doi.org/10.1016/j.trc.2015.08.014openalex-snapshot
Estimating the most likely space–time paths, dwell times and path uncertainties from vehicle trajectory data: A time geographic method
inferred← citeshttps://doi.org/10.1016/j.trc.2015.09.010openalex-snapshot
Large-scale transit itinerary planning under uncertainty
inferred← citeshttps://doi.org/10.1016/j.trc.2016.05.011openalex-snapshot
Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling
inferred← citeshttps://doi.org/10.1016/j.trc.2017.05.005openalex-snapshot
Controlling road congestion via a low-complexity route reservation approach
inferred← citeshttps://doi.org/10.1016/j.trc.2017.10.009openalex-snapshot
Variable guidance for pedestrian evacuation considering congestion, hazard, and compliance behavior
inferred← citeshttps://doi.org/10.1016/j.trc.2019.05.011openalex-snapshot
A general formulation for multi-modal dynamic traffic assignment considering multi-class vehicles, public transit and parking
inferred← citeshttps://doi.org/10.1016/j.trc.2020.02.012openalex-snapshot
Yard crane and AGV scheduling in automated container terminal: A multi-robot task allocation framework
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103187openalex-snapshot
Dedicated bus lane network design under demand diversion and dynamic traffic congestion: An aggregated network and continuous approximation model approach
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103477openalex-snapshot
A practical approach to assignment-free Dynamic Origin–Destination Matrix Estimation problem
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104081openalex-snapshot
An ADMM-based dual decomposition mechanism for integrating crew scheduling and rostering in an urban rail transit line
inferred← citeshttps://doi.org/10.1016/j.trc.2026.105714openalex-snapshot
A passenger equilibrium assignment model considering fare-free reward scheme for railway services
inferred← citeshttps://doi.org/10.1016/j.trd.2016.04.002openalex-snapshot
Routing aspects of electric vehicle drivers and their effects on network performance
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102305openalex-snapshot
A double time-scale passenger assignment model for high-speed railway networks with continuum capacity approximation
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102321openalex-snapshot
A stochastic optimization model for staged hospital evacuation during hurricanes
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103757openalex-snapshot
Constructing a routable multimodal, multi-cost, time-dependent network model with all emerging mobility options: Methodology and case studies
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103883openalex-snapshot
Integrated task assignment and path planning for multi-type robots in an intelligent warehouse system
inferred← citeshttps://doi.org/10.1016/j.treng.2022.100153openalex-snapshot
Dynamic user optimal route choice problem on a signalized transportation network
inferred← citeshttps://doi.org/10.1016/j.trip.2021.100395openalex-snapshot
Adaptive routing behavior with real-time information under multiple travel objectives
inferred← citeshttps://doi.org/10.1016/j.trpro.2015.01.011openalex-snapshot
Using the General Link Transmission Model in a Dynamic Traffic Assignment to Simulate Congestion on Urban Networks
inferred← citeshttps://doi.org/10.1016/j.trpro.2015.07.011openalex-snapshot
Equilibrium Analysis and Route Guidance in Large-scale Networks with MFD Dynamics
inferred← citeshttps://doi.org/10.1016/j.trpro.2017.03.082openalex-snapshot
Analysis and Operational Challenges of Dynamic Ride Sharing Demand Responsive Transportation Models
inferred← citeshttps://doi.org/10.1016/j.trpro.2019.05.047openalex-snapshot
A general formulation for multi-modal dynamic traffic assignment considering multi-class vehicles, public transit and parking
inferred← citeshttps://doi.org/10.1016/j.trpro.2020.03.115openalex-snapshot
Fast estimation of point-to-point travel times for real-time vehicle routing
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00106-5openalex-snapshot
Parallel implementation of the TRANSIMS micro-simulation
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)32412-6openalex-snapshot
A New Framework for Shortest Path Algorithms and its Applications
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80524-3openalex-snapshot
Routing in Very Large Multi-Modal Time Dependent Networks
inferred← citeshttps://doi.org/10.1023/b:jmma.0000026708.57419.6dopenalex-snapshot
On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks
inferred← citeshttps://doi.org/10.1049/itr2.12331openalex-snapshot
Short‐term traffic travel time forecasting using ensemble approach based on long short‐term memory networks
inferred← citeshttps://doi.org/10.1061/41139(387)128openalex-snapshot
Diversion Strategies for Commercial Vehicle Using Real-Time and Future Traffic Information
inferred← citeshttps://doi.org/10.1061/ajrua6.0001033openalex-snapshot
Routing in a Stochastic Network with Nonrecurrent Incidents: Behavioral Interpretation of Dynamic Traffic Assignment
inferred← citeshttps://doi.org/10.1061/jhtrcq.0000172openalex-snapshot
Optimum Path Algorithm for In-vehicle Navigation System in Distributed Structure with Un-completed Dynamic Information
inferred← citeshttps://doi.org/10.1063/1.4995893openalex-snapshot
Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length
inferred← citeshttps://doi.org/10.1080/01441647.2014.921797openalex-snapshot
Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective
inferred← citeshttps://doi.org/10.1080/03081060.2012.745720openalex-snapshot
A dynamic route choice model for public transport networks with boarding queues
inferred← citeshttps://doi.org/10.1080/03155986.2021.1973785openalex-snapshot
The time-dependent shortest path and vehicle routing problem
inferred← citeshttps://doi.org/10.1080/10556780903239121openalex-snapshot
Minimum cost time-varying network flow problems
inferred← citeshttps://doi.org/10.1080/13658810601079759openalex-snapshot
A shortest path algorithm with novel heuristics for dynamic transportation networks
inferred← citeshttps://doi.org/10.1080/13658816.2018.1563300openalex-snapshot
Space–time prism bounds of activity programs: a goal-directed search in multi-state supernetworks
inferred← citeshttps://doi.org/10.1080/15472450.2012.671708openalex-snapshot
A Multimodal Trip Planning System With Real-Time Traffic and Transit Information
inferred← citeshttps://doi.org/10.1080/15472450.2013.806753openalex-snapshot
A Variable Time-Discretization Strategies-Based, Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment
inferred← citeshttps://doi.org/10.1080/15472450.2019.1699077openalex-snapshot
Integrating safety and mobility for pathfinding using big data generated by connected vehicles
inferred← citeshttps://doi.org/10.1080/15472450.2020.1871339openalex-snapshot
Smartphone-based parking guidance algorithm and implementation
inferred← citeshttps://doi.org/10.1080/15472450600981033openalex-snapshot
Evaluation of the Potential Benefits of Advanced Traveler Information Systems
inferred← citeshttps://doi.org/10.1080/17445647.2017.1305301openalex-snapshot
The daily dynamic potential accessibility by car in London on Wednesdays
inferred← citeshttps://doi.org/10.1080/17489725.2017.1421779openalex-snapshot
Location- and time-dependent meeting point recommendations for shared interurban rides
inferred← citeshttps://doi.org/10.1080/19475683.2011.602026openalex-snapshot
Multimodal, multicriteria dynamic route choice: a GIS-microscopic traffic simulation approach
inferred← citeshttps://doi.org/10.1108/9781781902868-022openalex-snapshot
Making Real-Time Fleet Management Decisions Under Time-Dependent Conditions in Urban Freight Distribution
inferred← citeshttps://doi.org/10.1109/6979.994796openalex-snapshot
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks
inferred← citeshttps://doi.org/10.1109/acc.2011.5991156openalex-snapshot
Decentralized flight path planning for air traffic management
inferred← citeshttps://doi.org/10.1109/access.2022.3179383openalex-snapshot
Development of Reinforcement Learning-Based Traffic Predictive Route Guidance Algorithm Under Uncertain Traffic Environment
inferred← citeshttps://doi.org/10.1109/access.2022.3205736openalex-snapshot
Combined Prediction of Short-Term Travel Time of Expressway Based on CEEMDAN Decomposition
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028431openalex-snapshot
Optimized path planning for electric vehicle routing and charging
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004308openalex-snapshot
On scaling time dependent shortest path computations for Dynamic Traffic Assignment
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260067openalex-snapshot
Least travel time paths in deterministic and time-varying transportation networks considering the attribute of nodes
inferred← citeshttps://doi.org/10.1109/cisim.2007.66openalex-snapshot
The Theoretical Framework of the Optimization of Public Transport Travel
inferred← citeshttps://doi.org/10.1109/cisim.2008.43openalex-snapshot
Two Methods of Quasi-Optimal Routes Generation in Public Transportation Network
inferred← citeshttps://doi.org/10.1109/cit.2012.60openalex-snapshot
Centrality Indices Computation in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683433openalex-snapshot
Quality Evaluation of Vehicle Navigation with Cyber Physical Systems
inferred← citeshttps://doi.org/10.1109/glocom.2012.6503645openalex-snapshot
Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809023openalex-snapshot
Meliorated Approach for Efficient Computation of Shortest Path on Edge Based Data Structure
inferred← citeshttps://doi.org/10.1109/icaict.2016.7991679openalex-snapshot
Approach to defining the maximum amount of flow in dynamic fuzzy network with the given vitality degree
inferred← citeshttps://doi.org/10.1109/icaict.2016.7991833openalex-snapshot
Parallelizing shortest path algorithm for time dependent graphs with flow speed model
inferred← citeshttps://doi.org/10.1109/icc.2016.7511189openalex-snapshot
HBA-histogram based algorithm for real time route forecasting in urban area
inferred← citeshttps://doi.org/10.1109/iccis.2006.252342openalex-snapshot
Motion Coordination of Multiple Autonomous Vehicles in Dynamic and Strictly Constrained Environments
inferred← citeshttps://doi.org/10.1109/iccsa.2007.14openalex-snapshot
Energy Efficient Routing in Multiple Sink Sensor Networks
inferred← citeshttps://doi.org/10.1109/iccsa.2007.88openalex-snapshot
An Approach to a Real World Dynamic Route Guidance Problem
inferred← citeshttps://doi.org/10.1109/icdabi56818.2022.10041510openalex-snapshot
A system thinking approach for evacuation during fire incidents considering systems dynamics
inferred← citeshttps://doi.org/10.1109/icde.2006.71openalex-snapshot
Finding Fastest Paths on A Road Network with Speed Patterns
inferred← citeshttps://doi.org/10.1109/icicic.2006.219openalex-snapshot
A Reliable Routing Algorithm with Real Time and Historical Information
inferred← citeshttps://doi.org/10.1109/icnsc.2004.1297096openalex-snapshot
An exact method to find the intermodal shortest path (ISP)
inferred← citeshttps://doi.org/10.1109/ictai.2017.00110openalex-snapshot
Weather Routing Optimization: A New Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461987openalex-snapshot
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2015.66openalex-snapshot
Distributed Programming over Time-Series Graphs
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.50openalex-snapshot
Toward Flexible and Fast Routing Strategies for Dynamic Network Provisioning
inferred← citeshttps://doi.org/10.1109/ispdc.2009.33openalex-snapshot
A Dynamic Model for Fire Emergency Evacuation Based on Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/itsc.2002.1041277openalex-snapshot
Optimal routing policy problems in stochastic time-dependent networks. I. Framework and taxonomy
inferred← citeshttps://doi.org/10.1109/itsc.2002.1041278openalex-snapshot
Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms
inferred← citeshttps://doi.org/10.1109/itsc.2002.1041329openalex-snapshot
Robust passenger itinerary planning using transit AVL data
inferred← citeshttps://doi.org/10.1109/itsc.2003.1252669openalex-snapshot
An integrated GIS and micro-simulation system for dynamic routing
inferred← citeshttps://doi.org/10.1109/itsc.2003.1252759openalex-snapshot
A vehicle-centric logic for decentralized and hybrid route guidance
inferred← citeshttps://doi.org/10.1109/itsc.2006.1707402openalex-snapshot
Path-based system optimal dynamic traffic assignment models: formulations and solution methods
inferred← citeshttps://doi.org/10.1109/itsc.2009.5309878openalex-snapshot
Optimal path in dynamic and stochastic networks
inferred← citeshttps://doi.org/10.1109/itsc.2011.6083070openalex-snapshot
Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems
inferred← citeshttps://doi.org/10.1109/itsc.2015.340openalex-snapshot
Congestion Free Vehicle Scheduling Using a Route Reservation Strategy
inferred← citeshttps://doi.org/10.1109/itst.2011.6060121openalex-snapshot
Shortest paths and probabilities on time-dependent graphs — Applications to transport networks
inferred← citeshttps://doi.org/10.1109/ivs.2008.4621289openalex-snapshot
Route guidance: State of the art vs. state of the practice
inferred← citeshttps://doi.org/10.1109/ivs.2016.7535537openalex-snapshot
Reliable routing in stochastic time-dependent network with the use of actual and forecast information of the traffic flows
inferred← citeshttps://doi.org/10.1109/jproc.2011.2161243openalex-snapshot
A Hierarchical Flight Planning Framework for Air Traffic Management
showing the first 200 of 293
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.