On the public citation graph

Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network

https://doi.org/10.1016/j.ejor.2007.09.004
0 signed · 68 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-snapshot
Time-varying shortest path problems with constraints
inferredcites →https://doi.org/10.1002/atr.5670180205openalex-snapshot
A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules
inferredcites →https://doi.org/10.1006/jmaa.1993.1067openalex-snapshot
Time Dependency in Multiple Objective Dynamic Programming
inferredcites →https://doi.org/10.1007/978-3-642-48782-8_9openalex-snapshot
Bicriterion Path Problems
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.1016/0191-2615(89)90034-9openalex-snapshot
Optimal strategies: A new assignment model for transit networks
inferredcites →https://doi.org/10.1016/0377-2217(82)90205-3openalex-snapshot
A bicriterion shortest path algorithm
inferredcites →https://doi.org/10.1016/j.cor.2004.11.021openalex-snapshot
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
inferredcites →https://doi.org/10.1016/j.disopt.2006.05.006openalex-snapshot
Algorithms for time-dependent bicriteria shortest path problems
inferredcites →https://doi.org/10.1016/s0191-2615(02)00043-7openalex-snapshot
An extended model and procedural framework for planning multi-modal passenger journeys
inferredcites →https://doi.org/10.1016/s0191-2615(97)00011-8openalex-snapshot
Estimation of time-dependent origin–destination matrices for transit networks
inferredcites →https://doi.org/10.1016/s0191-2615(98)00030-7openalex-snapshot
A stochastic transit assignment model using a dynamic schedule-based network
inferredcites →https://doi.org/10.1016/s0377-2217(97)00376-7openalex-snapshot
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
inferredcites →https://doi.org/10.1016/s0377-2217(99)00388-4openalex-snapshot
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
inferredcites →https://doi.org/10.1016/s0968-090x(00)00016-4openalex-snapshot
Design and development of interactive trip planning for web-based transit information systems
inferredcites →https://doi.org/10.1016/s0968-090x(03)00029-9openalex-snapshot
Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty
inferredcites →https://doi.org/10.1057/jors.1981.141openalex-snapshot
Multiple Criteria Decision Making: Theory and Application
inferredcites →https://doi.org/10.1061/(asce)0733-947x(1996)122:3(218)openalex-snapshot
A Strategy for Solving Static Multiple-Optimal-Path Transit Network Problems
inferredcites →https://doi.org/10.1109/vnis.1991.205816openalex-snapshot
A new route optimization algorithm for rapid decision support
inferredcites →https://doi.org/10.1287/trsc.34.2.198.12304openalex-snapshot
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
inferredcites →https://doi.org/10.3141/1645-21openalex-snapshot
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
inferredcites →https://doi.org/10.3141/1783-18openalex-snapshot
Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems
inferredcites →https://doi.org/10.4271/912818openalex-snapshot
A New Route Optimization Algorithm for Rapid Decision Support

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.4760698openalex-extracted
Multimodal and Multicriteria Path Set Computation for Journey Planning in Time-Dependent Mobility as a Service Networks
inferred← citeshttps://doi.org/10.1002/9781119307822.ch6openalex-snapshot
Modeling and Solving International Journey Planning Problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-5295-8_1openalex-snapshot
A Survey on Multi-criteria Analysis in Logistics: Focus on Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-51222-4_11openalex-snapshot
Smart Tourism System in Calabria
inferred← citeshttps://doi.org/10.1007/978-3-030-78170-5_31openalex-snapshot
A VRP Model to Support Last Mile Maritime Containers
inferred← citeshttps://doi.org/10.1007/978-3-319-01857-7_53openalex-snapshot
Common Route Planning for Carpoolers – Model and Exact Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-46589-0_18openalex-snapshot
The Multiple Criteria Optimization Problem of Joint Matching Carpoolers and Common Route Planning
inferred← citeshttps://doi.org/10.1007/s00170-014-6167-yopenalex-snapshot
Simultaneous functional synthesis of mechanisms with mechanical efficiency and cost
inferred← citeshttps://doi.org/10.1007/s10489-010-0223-6openalex-snapshot
An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing
inferred← citeshttps://doi.org/10.1016/j.apgeog.2011.03.005openalex-snapshot
Design of a user-centric decision support tool for fixed-route bus travel planning
inferred← citeshttps://doi.org/10.1016/j.eap.2018.12.003openalex-snapshot
Modular dynamic ride-sharing transport systems
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.10.027openalex-snapshot
Dynamic journeying under uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.023openalex-snapshot
Itinerary planning with time budget for risk-averse travelers
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.005openalex-snapshot
Objectives and methods in multi-objective routing problems: a survey and classification scheme
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.07.042openalex-snapshot
Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
inferred← citeshttps://doi.org/10.1016/j.envsoft.2014.01.017openalex-snapshot
Designing next generation multimodal traveler information systems to support sustainability-oriented decisions
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.04.025openalex-snapshot
RETRACTED: Time-dependent personal tour planning and scheduling in metropolises
inferred← citeshttps://doi.org/10.1016/j.jmsy.2014.11.016openalex-snapshot
A time-dependent vehicle routing problem in multigraph with FIFO property
inferred← citeshttps://doi.org/10.1016/j.trc.2020.102667openalex-snapshot
Route guidance ranking procedures with human perception consideration for personalized public transport service
inferred← citeshttps://doi.org/10.1016/j.tre.2018.01.016openalex-snapshot
A robust optimization approach for itinerary planning with deadline
inferred← citeshttps://doi.org/10.1061/41186(421)62openalex-snapshot
State Change Based Generalized Cost and Flow Assignment Model on Multimodal Network with Transfer Hub
inferred← citeshttps://doi.org/10.1080/13658816.2018.1459113openalex-snapshot
Quantifying multi-modal public transit accessibility for large metropolitan areas: a time-dependent reliability modeling approach
inferred← citeshttps://doi.org/10.1080/19475683.2016.1276100openalex-snapshot
Time-dependent, activity-based itinerary personal tour planning in multimodal transportation networks
inferred← citeshttps://doi.org/10.1088/1742-6596/2246/1/012071openalex-snapshot
A store-and-forward neural network to solve multicriteria optimal path problem in time-dependent networks
inferred← citeshttps://doi.org/10.1109/iaeac.2017.8054280openalex-snapshot
Multi-UAV coordinate communication path planning based on grid map and ant-algorithm
inferred← citeshttps://doi.org/10.1109/iciev.2016.7759999openalex-snapshot
A hybrid approach to plan itinerary for tourists
inferred← citeshttps://doi.org/10.1109/ictai.2014.25openalex-snapshot
A Numeric PDDL Based Approach for Temporally Constrained Journey Problems
inferred← citeshttps://doi.org/10.1109/indin.2010.5549615openalex-snapshot
A comprehensive model for short-haul and long-haul transportation
inferred← citeshttps://doi.org/10.1109/itsc.2013.6728354openalex-snapshot
A cooperative framework for freight distribution in multimodal corridors
inferred← citeshttps://doi.org/10.1109/tits.2012.2213817openalex-snapshot
Dynamic Journeying in Scheduled Networks
inferred← citeshttps://doi.org/10.1109/tsmc.2016.2573271openalex-snapshot
A Multiobjective Path-Planning Algorithm With Time Windows for Asset Routing in a Dynamic Weather-Impacted Environment
inferred← citeshttps://doi.org/10.1109/wcica.2014.7052754openalex-snapshot
Itinerary planning with deadline in headway-based bus networks minimizing lateness level
inferred← citeshttps://doi.org/10.1142/s0217595916500056openalex-snapshot
Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems
inferred← citeshttps://doi.org/10.1145/3501295openalex-snapshot
Carpooling in Connected and Autonomous Vehicles: Current Solutions and Future Directions
inferred← citeshttps://doi.org/10.1155/2014/185383openalex-snapshot
Floyd‐A∗ Algorithm Solving the Least‐Time Itinerary Planning Problem in Urban Scheduled Public Transport Network
inferred← citeshttps://doi.org/10.1287/trsc.1120.0445openalex-snapshot
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.20334/2305-mopenalex-snapshot
Įvairiarūšių krovinių maršrutų žaliajame transporto koridoriuje tyrimas
inferred← citeshttps://doi.org/10.20944/preprints202008.0627.v1openalex-snapshot
A Discussion on the Evolution of the Pathfinding Algorithms
inferred← citeshttps://doi.org/10.3141/2217-06openalex-snapshot
Effect of Real-Time Transit Information on Dynamic Path Choice of Passengers
inferred← citeshttps://doi.org/10.32657/10356/68868openalex-snapshot
Integrated vehicle scheduling and routing policies for cross-dock systems
inferred← citeshttps://doi.org/10.3390/app15042052openalex-snapshot
Mobility-as-a-Service Personalised Multi-Modal Multi-Objective Journey Planning with Machine-Learning-Guided Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.3390/electronics12163483openalex-snapshot
Path Planning for the Rapid Reconfiguration of a Multi-Robot Formation Using an Integrated Algorithm
inferred← citeshttps://doi.org/10.3390/futuretransp6030119openalex-snapshot
Context-Aware Travel Time Prediction and Route Optimization Using Heterogeneous Traffic and Event Data: A Comprehensive Survey
inferred← citeshttps://doi.org/10.3390/systems12060212openalex-snapshot
Modeling a Multimodal Routing Problem with Flexible Time Window in a Multi-Uncertainty Environment
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3366openalex-snapshot
Partial order approach to compute shortest paths in multimodal networks
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.