Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle

Performance evaluation of WMN-GA for different mutation and crossover rates considering number of covered users parameter

Node placement problems have been long investigated in the optimization field due to numerous applications in location science and classification. Facility location problems are showing their usefulness to communication networks, and more especially from Wireless Mesh Networks (WMNs) field. Recently, such problems are showing their usefulness to communication networks, where facilities could be servers or routers offering connectivity services to clients. In this paper, we deal with the effect of mutation and crossover operators in GA for node placement problem. We evaluate the performance of the proposed system using different selection operators and different distributions of router nodes considering number of covered users parameter. The simulation results show that for Linear and Exponential ranking methods, the system has a good performance for all rates of crossover and mutation.Peer ReviewedPostprint (published version

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

Supervised ANN vs. unsupervised SOM to classify EEG data for BCI: why can GMDH do better?

Construction of a system for measuring the brain activity (electroencephalogram (EEG)) and recognising thinking patterns comprises significant challenges, in addition to the noise and distortion present in any measuring technique. One of the most major applications of measuring and understanding EGG is the brain-computer interface (BCI) technology. In this paper, ANNs (feedforward back -prop and Self Organising Maps) for EEG data classification will be implemented and compared to abductive-based networks, namely GMDH (Group Methods of Data Handling) to show how GMDH can optimally (i.e. noise and accuracy) classify a given set of BCI’s EEG signals. It is shown that GMDH provides such improvements. In this endeavour, EGG classification based on GMDH will be researched for comprehensible classification without scarifying accuracy. GMDH is suggested to be used to optimally classify a given set of BCI’s EEG signals. The other areas related to BCI will also be addressed yet within the context of this purpose