SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Finding the K shortest paths in a schedule-based transit network · Study

ArticleShelves

ArticleFinding the K shortest paths in a schedule-based transit network

Wangtu Ato Xu2010

Article2010

Finding the K shortest paths in a schedule-based transit network

Wangtu Ato Xu · Shiwei He · Rui Song · Sohail S. Chaudhry

67 citations·0/0 files stored·Computers & Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 67 citations exist upstream.

References

1989Optimal strategies: A new assignment model for transit networks 2001A Doubly Dynamic Schedule-based Assignment Model for Transit Networks 1999A stochastic transit assignment model using a dynamic schedule-based network 2006Optimal Slack Time for Schedule-Based Transit Operations 2001A Modeling Framework for Passenger Assignment on a Transport Network with Timetables 1998Estimation of time-dependent origin–destination matrices for transit networks 2001Timetable-Based Transit Assignment Using Branch and Bound Techniques 1984A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules

Cited by

2017An efficient General Transit Feed Specification (GTFS) enabled algorithm for dynamic transit accessibility analysis 2020Route guidance ranking procedures with human perception consideration for personalized public transport service 2013Multimodal Public Transit Trip Planner with Real-time Transit Data 2015Inferring the route-use patterns of metro passengers based only on travel-time data within a Bayesian framework using a reversible-jump Markov chain Monte Carlo (MCMC) simulation

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2004The Schedule-Based Approach in Dynamic Transit Modelling: A General Overviewchapter · 6 shared references 2012A Review on Transit Assignment Modelling Approaches to Congested Networks: A New Perspectiveother · 5 shared references 2019An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probabilityarticle · 5 shared references 2002Transit Path Choice and Assignment Model Approaches(°)chapter · 5 shared references 2023Schedule-based transit assignment with online bus arrival informationarticle · 5 shared references 2020Train Operation Diagram–Based Equilibrium Model for an Urban Rail Transit Network with Transfer Constraintsarticle · 5 shared references

Details

Year2010

Typearticle

Published2010-03-03

VenueComputers & Operations Research

ISSN-L0305-0548

Languageen

Citations67

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1016/j.cor.2010.02.005

openalex_workW2048848130

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2019

Internet GIS-Based Multimodal Public Transport Trip Planning Information System for Travelers in Lithuania

2017Measuring the expected locational accessibility of urban transit network for commuting trips

2017Itinerary planning with time budget for risk-averse travelers

2018A robust optimization approach for itinerary planning with deadline