In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of transfers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functiona...

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In paper, we use programming find path due their generality, reduction of complexity facilitation numerical computation, simplicity incorporating constraints, onformity stochastic natur...

We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a telephone book, so requests like “give directions from the Lackawanna Diner to the nearest dry cleaner’* (properly specified) can be answered. This problem involves both human factors and algorithmic problems. From the human factors standpoint, what kind of route is best:...

Traveling is a part of every person's day-to-day life. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation when ap...

Rats were repeatedly exposed to an open arena containing two depletable food sources in a discrete-trials procedure. Their movement patterns were recorded and compared to adaptive foraging tactics such as minimizing distance or energy expenditure, thigmotaxis, and trail following. They were also compared to the predictions of the associative route-finder model of Reid and Staddon [Reid, A.K., S...

The road choice behavior of travelers is closely related to their activity planning and location choice. This approach has led to the increasing development of multi-agent and activity-oriented modeling. This work attempts to model travelers’ dynamic departure time/route/destination choice behavior in a queuing network. In this respect, we propose an activity-based predictive dynamic traffic as...

This research presents an optimization technique for route planning using simulated ant agents for dynamic online route planning and optimization of the route. It addresses the issues involved during route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated ant agent system (SAAS) is proposed using modified ant colony optimization algorithm for dealing...

Abstract Extracting a proper dynamic network for modeling time-dependent complex system is an important issue. Building correct model related to finding out critical time points where exhibits considerable change. In this work, we propose measure similarity detect intervals. We develop three metrics, node, link, and neighborhood similarities, any consecutive snapshots of network. Rather than la...

This paper presents methodology and case studies for a system-wide evaluation of an integrated traffic control and route diversion strategy. Experiments are performed for the Central Artery/Tunnel (CA/T) network in Boston and use a microscopic traffic simulator to test and evaluate the traffic control design. The advantage of this microscopic simulation laboratory is that it simulates the inter...