Application of Constrained Enumeration Approach to Multimodal Choice Set Generation

Sascha Hoogendoorn-Lanser · Piet H. L. Bovy · Rob van Nes

15 citations0/0 files storedTransportation Research Record Journal of the Transportation Research Board

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 Urban Transport and Accessibility Transportation and Mobility Innovations

Abstract

Collected data often include only information about chosen routes. To gain insight into travelers’ route choice behavior or to predict route shares, one must know the set of alternatives from which travelers have chosen their routes. An alternative approach to choice set generation in mixed multimodal networks is presented. This new algorithm—a run-based, constrained enumeration method that uses branch-and-bound techniques—is suitable for both estimation and prediction. One key characteristic of the algorithm is a set of constraints that reflects observed travel behavior. The proposed algorithm for choice set generation can be applied to a complete multimodal network at once. However, by exploiting knowledge about the structure of multimodal trips, the separate application of the algorithm to partial networks and consecutive concatenation of subroutes into complete door-to-door routes substantially reduce computation times without resulting in incomplete choice sets. This algorithm for choice set generation has been calibrated for and successfully applied to a real-size, mixed multimodal transport network in the Netherlands. A comparison of generated choice sets with reported chosen and known alternatives indicated that the algorithm can generate these alternatives, with high coverage levels as a result. This result clearly indicates that this constrained enumeration approach meets the requirements for choice set generation and thus offers interesting perspectives for route choice analysis and the prediction of route shares. Furthermore, the separate application of the algorithm to partial networks and the consecutive concatenation of subroutes into complete door-to-door trips substantially do not result in incomplete choice sets.

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

References

2003Discrete Choice Methods with Simulation 2001Transportation Systems Engineering: Theory and Methods 1993Transit Assignment for Congested Public Transport Systems: An Equilibrium Model 2006Applying Branch-and-Bound Technique to Route Choice Set Generation 2001Timetable-Based Transit Assignment Using Branch and Bound Techniques 2005Modelling route choice behaviour in multi-modal transport networks 2001Dynamic Trip Assignment-Simulation Model for Intermodal Transportation Networks 1997Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach

Cited by

2020Determining an efficient and precise choice set for public transport based on tracking data 2016Timetable-based simulation method for choice set generation in large-scale public transport networks 2019An assignment model for public transport networks with both schedule- and frequency-based services 2021Public transport path choice estimation based on trip data from dedicated smartphone app survey 2009Multi-class Multi-modal Network Equilibrium with Regular Choice Behaviors: A General Fixed Point Approach

Explore the map →

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

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