Solving Shortest Energy and Time-Dependent Travel Time Path Problems on a Small-Sized Road Network

Abstract

Human activities, primarily through greenhouse gas emissions, have accelerated global warming. As the transportation sector accounts for roughly one-quarter of all greenhouse gas emissions, an imperative is to find efficient transport solutions that reduce our footprint. Advancing this goal, in this paper, we leverage state-of-the-art techniques to compute optimal energy and travel time paths on the road network, thus enabling conventional and electric vehicle users to traverse the roads efficiently by reducing time spent in congestion and promoting routes with lower energy consumption. Consequently, significantly reducing their emissions footprint. The results present the opportunity and effectiveness of employing graph theory algorithms to address the identified issues and minimise travel time and energy consumption.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 3 citations exist upstream.

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