Itinerary planning with time budget for risk-averse travelers
type: Item
instance of: scholarly article
title: Itinerary planning with time budget for risk-averse travelers
zbMATH Open document ID: 1403.90191
author: Yu Zhang
author: Jiafu Tang
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6876645
zbMATH Keywords: uncertainty modeling
zbMATH Keywords: itinerary planning with time budget
zbMATH Keywords: utility theory
zbMATH Keywords: decomposition
zbMATH Keywords: network modification
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.11.023
OpenAlex ID: W2769563554
cites work: Entropic value-at-risk: a new coherent risk measure
cites work: Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
cites work: An Economic Index of Riskiness
cites work: AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
cites work: Robust discrete optimization and network flows
cites work: Time-dependent networks as models to achieve fast exact time-table queries
cites work: Goal-Driven Optimization
cites work: Transit Assignment for Congested Public Transport Systems: An Equilibrium Model
cites work: A note on two problems in connexion with graphs
cites work: User-constrained multimodal route planning
cites work: ENTROPIC RISK MEASURES: COHERENCE VS. CONVEXITY, MODEL AMBIGUITY AND ROBUST LARGE DEVIATIONS
cites work: Shortest Paths in Probabilistic Graphs
cites work: Managing Underperformance Risk in Project Portfolio Selection
cites work: Dynamic journeying under uncertainty
cites work: A comment on ``Computational complexity of stochastic programming problems''
cites work: Routing optimization under uncertainty
cites work: Principal component analysis.
cites work: Q3523756
cites work: Trip-based path algorithms using the transit network hierarchy
cites work: Finding optimal hyperpaths in large transit networks with realistic headway distributions
cites work: Optimal paths in graphs with stochastic or multidimensional weights
cites work: Least expected time paths in stochastic, time-varying transportation networks
cites work: Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: Convex Approximations of Chance Constrained Programs
cites work: Equilibrium traffic assignment for large scale transit networks
cites work: Efficient models for timetable information in public transportation systems
cites work: Q5403484
cites work: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
cites work: Q5605051
cites work: Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
cites work: Finding the \(K\) shortest paths in a schedule-based transit network
cites work: On the robust shortest path problem.
cites work: Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network
DOI: 10.1016/J.EJOR.2017.11.023
Recommended article: Cruise itineraries optimal scheduling
Recommended article: Balancing travel satisfaction algorithm for multi-day trip planning
description: scientific article; zbMATH DE number 6876645