Hybrid algorithm for solving a multimodal transport problems using a transfer graph model

Hedi Ayed · Zineb Habbas · Carlos Galvez-Fernandez · Djamel Khadraoui

8 citations0/0 files storedGlobal Information Infrastructure and Networking Symposium

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

This paper presents an approach to the shortest path problem in time-dependent multimodal networks. The approach derives, from the initial graph, a more simplified and non-time-dependent structure, called abstract graph, by using ant colony optimization. Then, a time-dependent Dijkstra's algorithm is used to compute the shortest path on the new structure. This approach improves two previous solutions proposed by the authors.

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

References

1998A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks 2001Shortest viable path algorithm in multimodal networks 2008Algorithms for Itinerary Planning in Multimodal Transportation Networks 2005Object modeling and path computation for multimodal travel systems 2008Transfer Graph Approach for Multimodal Transport Problems

Cited by

2013Multimodal Route Planning

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.