An exact method to find the intermodal shortest path (ISP)

Mounir Boussedjra · Christelle Rosse Bloch · Abdellah El Moudni

22 citations0/0 files storedIEEE International Conference on Networking, Sensing and Control (ICNSC)

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 transportation and logistics systems Complexity and Algorithms in Graphs

Abstract

In this paper, we study the problem of finding the origin-destination (O-D) shortest path in intermodal transportation networks, aiming at minimizing the travel time. The transportation network and the corresponding data are modeled by means of a multi-label graph. The intermodal shortest path problem and its definition are briefly described. The algorithm developed to find the path is presented, especially by detailing a label correcting approach that updates some labels associated with the graph nodes. The implementation of this approach and the results it provides show its validity.

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

References

2000An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays 1998A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks 1995Time depending shortest-path problems with applications to railway networks 1997Computer assisted routing of intermodal shipments 2002Reversibility of the time-dependent shortest path problem

Cited by

2013Optimizing itineraries in public transportation with walks between rides 2015A Study on the Paths Choice of Intermodal Transport Based on Reliability

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.