Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
DOI10.1016/J.EJOR.2007.09.004zbMATH Open1180.90111OpenAlexW2060490250MaRDI QIDQ948645FDOQ948645
Authors: Konstantinos N. Androutsopoulos, K. Zografos 
Publication date: 17 October 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.004
Recommendations
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Time dependency in multiple objective dynamic programming
- Accelerating time-dependent multi-criteria timetable information is harder than expected
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Least expected time paths in stochastic, time-varying transportation networks
- A bicriterion shortest path algorithm
- The shortest route through a network with time-dependent internodal transit times
- Title not available (Why is that?)
- Algorithms for time-dependent bicriteria shortest path problems
- Time-varying shortest path problems with constraints
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Time dependency in multiple objective dynamic programming
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
Cited In (9)
- Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Itinerary planning with time budget for risk-averse travelers
- Dynamic journeying under uncertainty
- Common route planning for carpoolers -- model and exact algorithm
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network
- Networked timetable stability improvement based on a bilevel optimization programming model
- A time-dependent fuzzy programming approach for the green multimodal routing problem with rail service capacity uncertainty and road traffic congestion
This page was built for publication: Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948645)
