TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM

J E Fernandez Larranaga

57 citations0/0 files storedTraffic engineering & control

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 Vehicle Routing Optimization Methods Transportation and Mobility Innovations

Abstract

The mathematical formulation of the transit assignment problem to minimal routes is presented. Then, an efficient solution algorithm is derived which dramatically reduces the execution time when compared with the traditional Chriqui and Robillard's algorithm and its heuristic simplifications

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

Cited by

1993Solution approaches to the bus operator problem 2014A traffic assignment model for passenger transit on a capacitated network: Bi-layer framework, line sub-models and large-scale application 2004Capacitated transit assignment with loading priorities 2016The Theory of Transit Assignment: Basic Modelling Frameworks 2002Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems 2001A schedule‐based dynamic transit network model — Recent advances and prospective future research 1999A schedule‐based time‐dependent trip assignment model for transit networks 1993A simplicial decomposition method for the transit equilibrium assignment problem

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