We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [16] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs which reduce vertex reaches. Our modifications greatly reduce both preprocessing and query times. The result...

This is a survey of some recent results on point-to-point shortest path algorithms. This classical optimization problem received a lot of attention lately and significant progress has been made. After an overview of classical results, we study recent heuristics that solve the problem while examining only a small portion of the input graph; the graph can be very big. Note that the algorithms we ...

Self-tuning adaptive control technique has the advantage of being able to track the system operating conditions so that satisfactory control action can always be produced. Self-tuning algorithms can be implemented easily. Because the power systems are usually time varying non-linear systems and their parameters vary, adaptive controllers are very suitable for power systems. Characteristics of a...