Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
From MaRDI portal
Publication:948645
DOI10.1016/J.EJOR.2007.09.004zbMath1180.90111OpenAlexW2060490250MaRDI QIDQ948645
Konstantinos N. Androutsopoulos, Konstantinos G. 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
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ 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 ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Dynamic journeying under uncertainty ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme
Cites Work
- Unnamed Item
- A bicriterion shortest path algorithm
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Time dependency in multiple objective dynamic programming
- Algorithms for time-dependent bicriteria shortest path problems
- The shortest route through a network with time-dependent internodal transit times
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- Time-varying shortest path problems with constraints
This page was built for publication: Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
