[go: up one dir, main page]

Rambha, 2012 - Google Patents

Adaptive routing in schedule based stochastic time-dependent transit networks

Rambha, 2012

View PDF
Document ID
15569005531419317422
Author
Rambha T
Publication year

External Links

Snippet

In this thesis, an adaptive transit routing (ATR) problem in a schedule based stochastic time- dependent transit network is defined and formulated as a finite horizon Markov Decision Process (MDP). The transit link travel times are assumed to be random with known …
Continue reading at repositories.lib.utexas.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G06Q10/047—Optimisation of routes, e.g. "travelling salesman problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3484—Personalized, e.g. from learned user behaviour or user-defined profiles
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3469—Fuel consumption; Energy use; Emission aspects
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/28—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30—Map- or contour-matching

Similar Documents

Publication Publication Date Title
Schmöcker et al. Generation and calibration of transit hyperpaths
US9536146B2 (en) Determine spatiotemporal causal interactions in data
US20140012610A1 (en) System and method for itinerary planning
US20100063715A1 (en) Method and structure for vehicular traffic prediction with link interactions and missing real-time data
Rambha et al. Adaptive transit routing in stochastic time-dependent networks
Chen et al. Online route planning over time-dependent road networks
Kumari et al. A survey on shortest path routing algorithms for public transport travel
Ma et al. A hyperpath-based network generalized extreme-value model for route choice under uncertainties
Ni et al. DEPART: Dynamic route planning in stochastic time-dependent public transit networks
Ding et al. Routing policy choice set generation in stochastic time-dependent networks: Case studies for Stockholm, Sweden, and Singapore
Hame et al. Dynamic journeying in scheduled networks
Rambha Adaptive routing in schedule based stochastic time-dependent transit networks
Fonzone Bounded rationality in hyperpath assignment: the locally rational traveller model
Kaparias et al. ICNavS: a tool for reliable dynamic route guidance
Böhmová et al. Robust routing in urban public transportation: Evaluating strategies that learn from the past
Yang et al. Stochastic scenario-based time-stage optimization model for the least expected time shortest path problem
Gao et al. Predictive traffic assignment: A new method and system for optimal balancing of road traffic
Filcek et al. Common route planning for carpoolers–model and exact algorithm
Mukai et al. Optimizing travel routes using temporal networks constructed from GPS data
Jin et al. Optimal routing of vehicles with communication capabilities in disasters
Aguiar-Melgarejo A constraint programming approach for the time dependent traveling salesman problem
Karoń et al. Problems of modelling of ITS services in transportation models
Ma et al. Hyperpath or shortest path: An evaluation method and a case study with gps probe data
Vo et al. Finding alternative paths in city bus networks
Hasuike et al. Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places