16,086 research outputs found
Fuzzy linear assignment problem: an approach to vehicle fleet deployment
This paper proposes and examines a new approach using fuzzy logic to vehicle fleet deployment. Fleet deployment is viewed as a fuzzy linear assignment problem. It assigns each travel request to an available service vehicle through solving a linear assignment matrix of defuzzied cost entries. Each cost entry indicates the cost value of a travel request that "fuzzily aggregates" multiple criteria in simple rules incorporating human dispatching expertise. The approach is examined via extensive simulations anchored in a representative scenario of taxi deployment, and compared to the conventional case of using only distances (each from the taxi position to the source point and finally destination point of a travel request) as cost entries. Discussion in the context of related work examines the performance and practicality of the proposed approach
Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network
Following on from our work concerning travellersâ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms. Stochasticity greatly increases the complexity of the route finding problem, so greater algorithmic efficiency becomes imperative. Public transportation networks (buses, trains) have two important features: edges can only be traversed at certain points in time and the weights of these edges change in a day and have an uncertainty associated with them. These features determine that a public transportation network is a stochastic and time-dependent network. Finding multiple shortest paths in a both stochastic and time-dependent network is currently regarded as the most difficult task in the route finding problems (Loui, 1983). This paper discusses the use of k-shortest-paths (KSP) algorithms to find optimal route(s) through a network in which the edge weights are defined by probability distributions. A comprehensive review of shortest path(s) algorithms with probabilistic graphs was conducted
Deep Learning for Link Prediction in Dynamic Networks using Weak Estimators
Link prediction is the task of evaluating the probability that an edge exists in a network, and it has useful applications in many domains. Traditional approaches rely on measuring the similarity between two nodes in a static context. Recent research has focused on extending link prediction to a dynamic setting, predicting the creation and destruction of links in networks that evolve over time. Though a difficult task, the employment of deep learning techniques have shown to make notable improvements to the accuracy of predictions. To this end, we propose the novel application of weak estimators in addition to the utilization of traditional similarity metrics to inexpensively build an effective feature vector for a deep neural network. Weak estimators have been used in a variety of machine learning algorithms to improve model accuracy, owing to their capacity to estimate changing probabilities in dynamic systems. Experiments indicate that our approach results in increased prediction accuracy on several real-world dynamic networks
From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data
One way to analyze complicated non-autonomous flows is through trying to
understand their transport behavior. In a quantitative, set-oriented approach
to transport and mixing, finite time coherent sets play an important role.
These are time-parametrized families of sets with unlikely transport to and
from their surroundings under small or vanishing random perturbations of the
dynamics. Here we propose, as a measure of transport and mixing for purely
advective (i.e., deterministic) flows, (semi)distances that arise under
vanishing perturbations in the sense of large deviations. Analogously, for
given finite Lagrangian trajectory data we derive a discrete-time and space
semidistance that comes from the "best" approximation of the randomly perturbed
process conditioned on this limited information of the deterministic flow. It
can be computed as shortest path in a graph with time-dependent weights.
Furthermore, we argue that coherent sets are regions of maximal farness in
terms of transport and mixing, hence they occur as extremal regions on a
spanning structure of the state space under this semidistance---in fact, under
any distance measure arising from the physical notion of transport. Based on
this notion we develop a tool to analyze the state space (or the finite
trajectory data at hand) and identify coherent regions. We validate our
approach on idealized prototypical examples and well-studied standard cases.Comment: J Nonlinear Sci, 201
QoS routing in ad-hoc networks using GA and multi-objective optimization
Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version
- âŠ