SZodixStudyAcademic Library

Shelves Open access

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

Shortest viable hyperpath in multimodal networks · Study

ArticleShelves

ArticleShortest viable hyperpath in multimodal networks

Angélica Lozano2002

Article2002

Shortest viable hyperpath in multimodal networks

Angélica Lozano · Giovanni Storchi

74 citations·0/0 files stored·Transportation Research Part B Methodological

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

References

2000An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays 2001Shortest viable path algorithm in multimodal networks 1998Equilibrium and Advanced Transportation Modelling 1994Network Equilibrium Models with Combined Modes 2001A Modeling Framework for Passenger Assignment on a Transport Network with Timetables 1996Transportation policy analysis with a geographic information system: The virtual network of freight transportation in Europe

Cited by

2010Solving time-dependent multimodal transport problems using a transfer graph model 2017A new time-dependent shortest path algorithm for multimodal transportation network 2016Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling 2015Effects of land-use transport scenarios on travel patterns: a multi-state supernetwork application 2015Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks 2016Dynamic activity-travel assignment in multi-state supernetworks under transport and location capacity constraints

Related works

Explore the map →

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

2010An evolutionary solution for multimodal shortest path problem in metropolisesarticle · 4 shared references 2012Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Timesarticle · 4 shared references 2007An Intermodal Time-Dependent Minimum Cost Path Algorithmchapter · 4 shared references 2014Toward algorithms for multi-modal shortest path problem and their extension in urban transit networkarticle · 4 shared references 2005Object modeling and path computation for multimodal travel systemsarticle · 3 shared references 2007Choice set generation in multi-modal transportation networksthesis · 3 shared references

Details

Year2002

Typearticle

Published2002-10-07

VenueTransportation Research Part B Methodological

ISSN-L0191-2615

Languageen

Citations74

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1016/s0191-2615(01)00038-8

openalex_workW2029969261

Links

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

2012

Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service

2010An evolutionary solution for multimodal shortest path problem in metropolises