18,363 research outputs found
Cloud Enabled Emergency Navigation Using Faster-than-real-time Simulation
State-of-the-art emergency navigation approaches are designed to evacuate
civilians during a disaster based on real-time decisions using a pre-defined
algorithm and live sensory data. Hence, casualties caused by the poor decisions
and guidance are only apparent at the end of the evacuation process and cannot
then be remedied. Previous research shows that the performance of routing
algorithms for evacuation purposes are sensitive to the initial distribution of
evacuees, the occupancy levels, the type of disaster and its as well its
locations. Thus an algorithm that performs well in one scenario may achieve bad
results in another scenario. This problem is especially serious in
heuristic-based routing algorithms for evacuees where results are affected by
the choice of certain parameters. Therefore, this paper proposes a
simulation-based evacuee routing algorithm that optimises evacuation by making
use of the high computational power of cloud servers. Rather than guiding
evacuees with a predetermined routing algorithm, a robust Cognitive Packet
Network based algorithm is first evaluated via a cloud-based simulator in a
faster-than-real-time manner, and any "simulated casualties" are then re-routed
using a variant of Dijkstra's algorithm to obtain new safe paths for them to
exits. This approach can be iterated as long as corrective action is still
possible.Comment: Submitted to PerNEM'15 for revie
The Pyramidal Capacitated Vehicle Routing Problem
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is de ned as a route on which the vehicle rst visits customers in increasing order of customer index, and on the remaining part of the route visits customers in decreasing order of customer index. Provided that customers are indexed in nondecreasing order of distance from the depot, the shape of a pyramidal route is such that its traversal can be divided in two parts, where on the rst part of the route, customers are visited in nondecreasing distance from the depot, and on the remaining part of the route, customers are visited in nonincreasing distance from the depot. Such a route shape is indeed found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to nd an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each of the routes in the PCVRP solution. This paper develops an exact branch-and-cut-and-price (BCP) algorithm for the PCVRP. At the pricing stage, elementary routes can be computed in pseudo-polynomial time in the PCVRP, unlike in the CVRP. We have therefore implemented pricing algorithms that generate only elementary routes. Computational results suggest that PCVRP solutions are highly useful for obtaining near-optimal solutions to the CVRP. Moreover, pricing of pyramidal routes may due to its eciency prove to be very useful in column generation for the CVRP.vehicle routing; pyramidal traveling salesman; branch-and-cut-and-price
Walking Through Waypoints
We initiate the study of a fundamental combinatorial problem: Given a
capacitated graph , find a shortest walk ("route") from a source to a destination that includes all vertices specified by a set
: the \emph{waypoints}. This waypoint routing problem
finds immediate applications in the context of modern networked distributed
systems. Our main contribution is an exact polynomial-time algorithm for graphs
of bounded treewidth. We also show that if the number of waypoints is
logarithmically bounded, exact polynomial-time algorithms exist even for
general graphs. Our two algorithms provide an almost complete characterization
of what can be solved exactly in polynomial-time: we show that more general
problems (e.g., on grid graphs of maximum degree 3, with slightly more
waypoints) are computationally intractable
Optimal Topology Design for Disturbance Minimization in Power Grids
The transient response of power grids to external disturbances influences
their stable operation. This paper studies the effect of topology in linear
time-invariant dynamics of different power grids. For a variety of objective
functions, a unified framework based on norm is presented to analyze the
robustness to ambient fluctuations. Such objectives include loss reduction,
weighted consensus of phase angle deviations, oscillations in nodal frequency,
and other graphical metrics. The framework is then used to study the problem of
optimal topology design for robust control goals of different grids. For radial
grids, the problem is shown as equivalent to the hard "optimum communication
spanning tree" problem in graph theory and a combinatorial topology
construction is presented with bounded approximation gap. Extended to loopy
(meshed) grids, a greedy topology design algorithm is discussed. The
performance of the topology design algorithms under multiple control objectives
are presented on both loopy and radial test grids. Overall, this paper analyzes
topology design algorithms on a broad class of control problems in power grid
by exploring their combinatorial and graphical properties.Comment: 6 pages, 3 figures, a version of this work will appear in ACC 201
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
- âŚ