A PUBLIC TRANSPORT ASSIGNMENT METHOD

F P Clerq

38 citations0/0 files stored

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

A method is described for finding the shortest route through a public transport network. The algorithm used is an extension of the once-through algorithm. Before the solution is presented the characteristics of the Moore algorithm and the once-through algorithm are mentioned and the difficulties and related assumptions concerning the search of routes through a public transport network are analyzed. Reference is made to methods developed elsewhere to solve these difficulties. An outline is given of the program package in which the algorithm is incorporated. /TRRL/

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 — 38 citations exist upstream.

Cited by

2017Route Design Model of Feeder Bus Service for Urban Rail Transit Stations 2016Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale application 1999A schedule‐based time‐dependent trip assignment model for transit networks 2001A schedule‐based dynamic transit network model — Recent advances and prospective future research 2008Combined Models with Hierarchical Demand Choices: A Multi‐Objective Entropy Optimization Approach 1994Chapter 5 Models in urban and air transportation 2019An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability 2007A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search

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