Previous approaches used to solve the transit route network design problem (TRNDP) can
be classified into three categories:(1) Practical guidelines and ad hoc procedures;(2) …

The shortest path problem is a fundamental problem with numerous applications. In this
paper we study one of the most common variants of the problem, where the goal is to find a …

The problem of identifying the shortest path along a road network is a fundamental problem
in network analysis, ranging from route guidance in a navigation system to solving spatial …

Eco-friendly navigation (aka eco-routing) finds a route from A to B in a road network that
minimizes the greenhouse gas (GHG) emission or fuel/energy consumption of the traveling …

Electric vehicles (EV) powered by batteries will play a significant role in the road traffic of the
future. The unique characteristics of such EVs–limited cruising range, long recharge times …

We study the point-to-point shortest path problem in a setting where preprocessing is
allowed. We improve the reach-based approach of Gutman [17] in several ways. In …

We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of
road networks. We suggest improvements to the algorithm itself and to its preprocessing …

Abstract The International Maritime Organization (IMO) rolled out a set of new regulations
that limit the sulfur content in the fuel oil used by ships, which came into effect from 2020 …

A fundamental approach in finding efficiently best routes or optimal itineraries in traffic
information systems is to reduce the search space (part of graph visited) of the most …

In this paper, we consider Dijkstra's algorithm for the single source single target shortest
paths problem in large sparse graphs. The goal is to reduce the response time for online …