We consider the problem of computing a set meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent route scenario, we present novel query algorithm, called Time-Dependent Alternative Graph (TDAG), that exploits outcome time-consuming preprocessing phase to create...

The possibility of applying the traditional navigation parameters used in pilotage (bearing and distance), as well their sum difference for planning controlling ship curvilinear route coastal waters is being investigated. Mathematical apparatus based on classical methods such theory isolines, lines position, principles planning, approximation route. mathematical justification circle arcs, ellip...

This paper presents an approach for the automated design of learning routes, based on the application of AI techniques. Our educational planning system is composed of two main modules: an instructor-oriented graphical authoring tool to model the key elements of a course and an automated planner to compute a learning route for a specific student profile or a customised learning route for a group...

In this work, we study a special semi-Markov decision process that formalizes a route-planning problem in stochastic transportation networks. We explore two versions of the planning problem: one in which the planner knows the initial traffic situation but does not have access to further information once it begins executing the plan (open-loop), and one in which the planner receives continuous t...

This document is disseminated under the sponsorship of the Department of Transportation, Federal Aviation Administration, in the interest of information exchange. The United States Government assumes no liability for its contents or use thereof. Thunderstorms are a leading cause of delay in the National Airspace System (NAS), and significant research has been conducted to predict the areas pilo...

We study multi-modal route planning allowing arbitrary (meaningful) combinations of public transportation, walking, and taking a car / taxi. In the straightforward model, the number of Pareto-optimal solutions explodes. It turns out that many of them are similar to each other or unreasonable. We introduce a new filtering procedure, Types aNd Thresholds (TNT), which leads to a small yet represen...