Low Carbon Footprint Routes for Bird Watching

Directory of Open Access Journals (Sweden)

Wei-Ta Fang

2015-03-01

Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Energy Technology Data Exchange (ETDEWEB)

Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

2011-01-15

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

.... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Evaluation of Shortest Paths in Road Network

Directory of Open Access Journals (Sweden)

Farrukh Shehzad

2009-06-01

Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

Vehicle Routing With User Generated Trajectory Data

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Directory of Open Access Journals (Sweden)

Mario Miler

2014-02-01

Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

Determination of optimal self-drive tourism route using the orienteering problem method

Science.gov (United States)

Hashim, Zakiah; Ismail, Wan Rosmanira; Ahmad, Norfaieqah

2013-04-01

This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

Distribution Route Planning of Clean Coal Based on Nearest Insertion Method

Science.gov (United States)

Wang, Yunrui

2018-01-01

Clean coal technology has made some achievements for several ten years, but the research in its distribution field is very small, the distribution efficiency would directly affect the comprehensive development of clean coal technology, it is the key to improve the efficiency of distribution by planning distribution route rationally. The object of this paper was a clean coal distribution system which be built in a county. Through the surveying of the customer demand and distribution route, distribution vehicle in previous years, it was found that the vehicle deployment was only distributed by experiences, and the number of vehicles which used each day changed, this resulted a waste of transport process and an increase in energy consumption. Thus, the mathematical model was established here in order to aim at shortest path as objective function, and the distribution route was re-planned by using nearest-insertion method which been improved. The results showed that the transportation distance saved 37 km and the number of vehicles used had also been decreased from the past average of 5 to fixed 4 every day, as well the real loading of vehicles increased by 16.25% while the current distribution volume staying same. It realized the efficient distribution of clean coal, achieved the purpose of saving energy and reducing consumption.

The Shortest Path Problems in Battery-Electric Vehicle Dispatching with Battery Renewal

Directory of Open Access Journals (Sweden)

Minfang Huang

2016-06-01

Full Text Available Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatching falls into the category of the shortest path problem with resource renewal. In this paper, we study the shortest path problems in (1 electric transit bus scheduling and (2 electric truck routing with time windows. In these applications, a fully-charged battery allows running a limited operational distance, and the battery before depletion needs to be quickly charged or exchanged with a fully-charged one at a battery management facility. The limited distance and battery renewal result in a shortest path problem with resource renewal. We develop a label-correcting algorithm with state space relaxation to find optimal solutions. In the computational experiments, real-world road geometry data are used to generate realistic travel distances, and other types of data are obtained from the real world or randomly generated. The computational results show that the label-correcting algorithm performs very well.

Finding the K shortest hyperpaths using reoptimization

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

2006-01-01

The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...... the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully...

Selective epidemic vaccination under the performant routing algorithms

Science.gov (United States)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Personal computer based decision support system for routing nuclear spent fuel

International Nuclear Information System (INIS)

Chin, Shih-Miao; Joy, D.S.; Johnson, P.E.; Bobic, S.M.; Miaou, Shaw-Pin

1989-01-01

An approach has been formulated to route nuclear spent fuel over the US Interstate highway network. This approach involves the generation of alternative routes so that any potential adverse impacts will not only concentrate on regions along the shortest path between the nuclear power plant and repository. Extensive literature research on the shortest path finding algorithms has been carried out. Consequently, an extremely efficient shortest path algorithm has been implemented and significantly increases the overall system performance. State-of-the-art interactive computer graphics is used. In addition to easy-to-use pop-up menus, full color mapping and display capabilities are also incorporated. All of these features have been implemented on commonly available personal computers. 6 figs., 2 tabs

Multi-Objective Weather Routing of Sailing Vessels

Directory of Open Access Journals (Sweden)

Życzkowski Marcin

2017-12-01

Full Text Available The paper presents a multi-objective deterministic method of weather routing for sailing vessels. Depending on a particular purpose of sailboat weather routing, the presented method makes it possible to customize the criteria and constraints so as to fit a particular user’s needs. Apart from a typical shortest time criterion, safety and comfort can also be taken into account. Additionally, the method supports dynamic weather data: in its present version short-term, mid-term and long-term term weather forecasts are used during optimization process. In the paper the multi-objective optimization problem is first defined and analysed. Following this, the proposed method solving this problem is described in detail. The method has been implemented as an online SailAssistance application. Some representative examples solutions are presented, emphasizing the effects of applying different criteria or different values of customized parameters.

A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Matheswaran Saravanan

2014-01-01

Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm

Science.gov (United States)

Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro

This paper addresses the problem of selecting a route to a given destination that traverses several non-specific sites (e.g. a bank, a gas station) as requested by a driver. The proposed solution uses a genetic algorithm that includes viral infection. The method is to generate two populations of viruses as domain specific knowledge in addition to a population of routes. A part of an arterial road is regarded as a main virus, and a road that includes a site is regarded as a site virus. An infection occurs between two points common to a candidate route and the virus, and involves the substitution of the intersections carried by the virus for those on the existing candidate route. Crossover and infection determine the easiest-to-drive and quasi-shortest route through the objective landmarks. Experiments using actual road maps show that this infection-based mechanism is an effective way of solving the problem. Our strategy is general, and can be effectively used in other optimization problems.

Nature-Inspired and Energy Efficient Route Planning

DEFF Research Database (Denmark)

Schlichtkrull, Anders; Christensen, J. B. S.; Feld, T.

2015-01-01

Cars are responsible for substantial CO2 emission worldwide. Computers can help solve this problem by computing shortest routes on maps. A good example of this is the popular Google Maps service. However, such services often require the order of the stops on the route to be fixed. By not enforcing....... The app is aimed at private persons and small businesses. The app works by using a nature-inspired algorithm called Ant Colony Optimization....

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

Directory of Open Access Journals (Sweden)

Zhenghao Xi

2014-01-01

Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Epidemic metapopulation model with traffic routing in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chen, Shengyong

2011-01-01

In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

Eco-sustainable routing in optical networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2013-01-01

infrastructures are now widely recognized to play a fundamental role in the emission of green-house gases (GHG) in the at- mosphere, signicantly aecting the environmental sustainability of new evolutions in network architectures as well as technological developments in communication devices. In this paper......, a novel eco-sustainable Routing and Wavelength Assignment (RWA) algorithm, based on shortest-path routing with an adaptive link weighting function relying on an extension of the OSPF-TE protocol to convey carbon footprint information, has been proposed to decrease the network ecological impact while...

QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

Directory of Open Access Journals (Sweden)

Admir Barolli

2011-01-01

Full Text Available 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.

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

Science.gov (United States)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

Minimization of municipal solid waste transportation route in West Jakarta using Tabu Search method

Science.gov (United States)

Chaerul, M.; Mulananda, A. M.

2018-04-01

Indonesia still adopts the concept of collect-haul-dispose for municipal solid waste handling and it leads to the queue of the waste trucks at final disposal site (TPA). The study aims to minimize the total distance of waste transportation system by applying a Transshipment model. In this case, analogous of transshipment point is a compaction facility (SPA). Small capacity of trucks collects the waste from waste temporary collection points (TPS) to the compaction facility which located near the waste generator. After compacted, the waste is transported using big capacity of trucks to the final disposal site which is located far away from city. Problem related with the waste transportation can be solved using Vehicle Routing Problem (VRP). In this study, the shortest distance of route from truck pool to TPS, TPS to SPA, and SPA to TPA was determined by using meta-heuristic methods, namely Tabu Search 2 Phases. TPS studied is the container type with total 43 units throughout the West Jakarta City with 38 units of Armroll truck with capacity of 10 m3 each. The result determines the assignment of each truck from the pool to the selected TPS, SPA and TPA with the total minimum distance of 2,675.3 KM. The minimum distance causing the total cost for waste transportation to be spent by the government also becomes minimal.

Suppressing traffic-driven epidemic spreading by adaptive routing strategy

International Nuclear Information System (INIS)

Yang, Han-Xin; Wang, Zhen

2016-01-01

The design of routing strategies for traffic-driven epidemic spreading has received increasing attention in recent years. In this paper, we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h. In the case where the traffic is free of congestion, there exists an optimal value of routing parameter h, leading to the maximal epidemic threshold. This means that epidemic spreading can be more effectively controlled by adaptive routing, compared to that of the static shortest path routing scheme. Besides, we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite node-delivering capacity. We expect our work to provide new insights into the effects of dynamic routings on traffic-driven epidemic spreading.

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

Full Text Available Abstrak OSPF (Open Shortest Path First dan EIGRP (Enhanced Interior Gateway Routing Protocol adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi. Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric. Abstract OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost

A new technique for accelerating routing information process in ...

African Journals Online (AJOL)

Previous works on the shortest path are limited to sequential and parallel algorithms on general-purpose architectures. Researchers are increasingly interested in hardware's solutions. In this work , we propose an approach for implementing a routing algorithm which is effective than Dijkstra using a FPGA development ...

An energy-aware engineered control plane for wavelength-routed networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2015-01-01

' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Science.gov (United States)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

INTERLINE, a railroad routing model: program description and user's manual

International Nuclear Information System (INIS)

Peterson, B.E.

1985-11-01

INTERLINE is an interactive computer program that finds likely routes for shipments over the US railroad system. It is based on a shortest path algorithm modified both to reflect the nature of railroad company operations and to accommodate computer resource limitations in dealing with a large transportation network. The first section of the report discusses the nature of railroad operations and routing practices in the United States, including the tendency to concentrate traffic on a limited number of mainlines, the competition for traffic by different companies operating in the same corridors, and the tendency of originating carriers to retain traffic on their systems before transferring it to terminating carriers. The theoretical foundation and operation of shortest path algorithms are described, as well as the techniques used to simulate actual operating practices within this framework. The second section is a user's guide that describes the program operation and data structures, program features, and user access. 11 refs., 11 figs

Shortest triplet clustering: reconstructing large phylogenies using representative sets

Directory of Open Access Journals (Sweden)

Sy Vinh Le

2005-04-01

Full Text Available Abstract Background Understanding the evolutionary relationships among species based on their genetic information is one of the primary objectives in phylogenetic analysis. Reconstructing phylogenies for large data sets is still a challenging task in Bioinformatics. Results We propose a new distance-based clustering method, the shortest triplet clustering algorithm (STC, to reconstruct phylogenies. The main idea is the introduction of a natural definition of so-called k-representative sets. Based on k-representative sets, shortest triplets are reconstructed and serve as building blocks for the STC algorithm to agglomerate sequences for tree reconstruction in O(n2 time for n sequences. Simulations show that STC gives better topological accuracy than other tested methods that also build a first starting tree. STC appears as a very good method to start the tree reconstruction. However, all tested methods give similar results if balanced nearest neighbor interchange (BNNI is applied as a post-processing step. BNNI leads to an improvement in all instances. The program is available at http://www.bi.uni-duesseldorf.de/software/stc/. Conclusion The results demonstrate that the new approach efficiently reconstructs phylogenies for large data sets. We found that BNNI boosts the topological accuracy of all methods including STC, therefore, one should use BNNI as a post-processing step to get better topological accuracy.

A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT

OpenAIRE

A. Nagoorgani; A. Mumtaj Begam

2010-01-01

This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node. Thus the optimum shortest path for the given problem is obtained.

Improved Efficient Routing Strategy on Scale-Free Networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

A reliability-based approach of fastest routes planning in dynamic traffic network under emergency management situation

Directory of Open Access Journals (Sweden)

Ye Sun

2011-12-01

Full Text Available In order to establish an available emergency management system, it is important to conduct effective evacuation with reliable and real time optimal route plans. This paper aims at creating a route finding strategy by considering the time dependent factors as well as uncertainties that may be encountered during the emergency management system. To combine dynamic features with the level of reliability in the process of fastest route planning, the speed distribution of typical intercity roads is studied in depth, and the strategy of modifying real time speed to a more reliable value based on speed distribution is proposed. Two algorithms of route planning have been developed to find three optimal routes with the shortest travel time and the reliability of 0.9. In order to validate the new strategy, experimental implementation of the route planning method is conducted based on road speed information acquired by field study. The results show that the proposed strategy might provide more reliable routes in dynamic traffic networks by conservatively treating roads with large speed discretion or with relative extreme real speed value.

The extended TRIP supporting VoIP routing reservation with distributed QoS

Science.gov (United States)

Wang, Furong; Wu, Ye

2004-04-01

In this paper, an existing protocol, i.e. TRIP (Telephony Routing over IP) is developed to provide distributed QoS when making resource reservations for VoIP services such as H.323, SIP. Enhanced LSs (location servers) are deployed in ITADs (IP Telephony Administrative Domains) to take in charge of intra-domain routing policy because of small propagation price. It is an easy way to find an IP telephone route for intra-domain VoIP media association and simultaneously possess intra-domain load balancing features. For those routing reservations bridging domains, inter-domain routing policy is responsible for finding the shortest inter-domain route with enough resources. I propose the routing preference policy based on QoS price when the session traffic is shaped by a token bucket, related QoS messages, and message cooperation.

Modeling route choice criteria from home to major streets: A discrete choice approach

Directory of Open Access Journals (Sweden)

Jose Osiris Vidana-Bencomo

2018-03-01

Full Text Available A discrete choice model that consists of three sub-models was developed to investigates the route choice criteria of drivers who travel from their homes in the morning to the access point along the major streets that bound the Traffic Analysis Zones (TAZs. The first sub-model is a Nested Logit Model (NLM that estimates the probability of a driver has or has no multiple routes, and if the driver has multiple routes, the route selection criteria are based on the access point’s intersection control type or other factors. The second sub-model is a Mixed Logit (MXL model. It estimates the probabilities of the type of intersection control preferred by a driver. The third sub-model is a NLM that estimates the probabilities of a driver selecting his/her route for its shortest travel time or to avoid pedestrian, and if the aim is to take the fastest route, the decision criteria is based on the shortest distance or minimum stops and turns. Data gathered in a questionnaire survey were used to estimate the sub-models. The attributes of the utility functions of the sub-models are the driver’s demographic and trip characteristics. The model provides a means for transportation planners to distribute the total number of home-based trips generated within a TAZ to the access points along the major streets that bound the TAZ.

An asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

MOBİL TELEFON VE GOOGLE HARİTA DESTEKLİ YEREL SEYAHAT ROTASI OPTİMİZASYONU: BURDUR ÖRNEĞİ / OPTIMIZATION OF LOCAL TRAVELLING ROUTE SUPPORTED WITH MOBILE PHONE AND GOOGLE MAPS: CASE STUDY OF BURDUR

Directory of Open Access Journals (Sweden)

Muhammer İLKUÇAR

2018-05-01

Full Text Available EXTENDED SUMMARY Background: Today, people travel for different purposes, both domestic and abroad, according to their afford. A travel can be consist of different alternatives like beach, sand-sun, adventure, culture, art, history, nature, entertainment, congress, gastronomy, health. Each person has his own travel concept. Someone wandered the streets of the city with other people to feel the senses of the city; the other may like art and exhibitions. Therefore, the travel plan should be personalized. Purpose: In this study, an Android application has been developed to create personalized travel plan via Google maps. A trip plan can be created through Google maps or by selecting from previously identified sightseeing spots. The trip plan can take the form of a tour (starting from one location and back to the starting point by travelling all the sightseeing locations or a route (start from a location to finish at another location. The user should be able to rearrange the routs according to their location. Method: Shortest route or tour of the trip plan is optimized by genetic algorithm. The genes of genetic algorithm consist of sightseeing locations which are selected by the user through Google maps. Locations (genes that can connect to each other constitute the chromosome structure. Thus each chromosome represents a possible tour. Calculation of distances between connected locations yields a length of a tour (fitness. It can also be calculated over a chromosome and shows the chromosome's fitness value. When the calculating the shortest route with genetic algorithm process (select-cross-mutation in the new chromosome are assigned unsuitable paths. In the new chromosome, same location used twice or the next location unsuitable. In this situation is corrected by correction function with the aid of greedy algorithm in feasible alternatives. Thus, the new chromosome is improved and more suitable individuals are obtained. Results and Conclusions: In

Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

Directory of Open Access Journals (Sweden)

Longxiang Li

Full Text Available Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

A Method for Driving Route Predictions Based on Hidden Markov Model

Directory of Open Access Journals (Sweden)

Ning Ye

2015-01-01

Full Text Available We present a driving route prediction method that is based on Hidden Markov Model (HMM. This method can accurately predict a vehicle’s entire route as early in a trip’s lifetime as possible without inputting origins and destinations beforehand. Firstly, we propose the route recommendation system architecture, where route predictions play important role in the system. Secondly, we define a road network model, normalize each of driving routes in the rectangular coordinate system, and build the HMM to make preparation for route predictions using a method of training set extension based on K-means++ and the add-one (Laplace smoothing technique. Thirdly, we present the route prediction algorithm. Finally, the experimental results of the effectiveness of the route predictions that is based on HMM are shown.

Fast and accurate global multiphase arrival tracking: the irregular shortest-path method in a 3-D spherical earth model

Science.gov (United States)

Huang, Guo-Jiao; Bai, Chao-Ying; Greenhalgh, Stewart

2013-09-01

The traditional grid/cell-based wavefront expansion algorithms, such as the shortest path algorithm, can only find the first arrivals or multiply reflected (or mode converted) waves transmitted from subsurface interfaces, but cannot calculate the other later reflections/conversions having a minimax time path. In order to overcome the above limitations, we introduce the concept of a stationary minimax time path of Fermat's Principle into the multistage irregular shortest path method. Here we extend it from Cartesian coordinates for a flat earth model to global ray tracing of multiple phases in a 3-D complex spherical earth model. The ray tracing results for 49 different kinds of crustal, mantle and core phases show that the maximum absolute traveltime error is less than 0.12 s and the average absolute traveltime error is within 0.09 s when compared with the AK135 theoretical traveltime tables for a 1-D reference model. Numerical tests in terms of computational accuracy and CPU time consumption indicate that the new scheme is an accurate, efficient and a practical way to perform 3-D multiphase arrival tracking in regional or global traveltime tomography.

A Shortest-Path-Based Method for the Analysis and Prediction of Fruit-Related Genes in Arabidopsis thaliana.

Science.gov (United States)

Zhu, Liucun; Zhang, Yu-Hang; Su, Fangchu; Chen, Lei; Huang, Tao; Cai, Yu-Dong

2016-01-01

Biologically, fruits are defined as seed-bearing reproductive structures in angiosperms that develop from the ovary. The fertilization, development and maturation of fruits are crucial for plant reproduction and are precisely regulated by intrinsic genetic regulatory factors. In this study, we used Arabidopsis thaliana as a model organism and attempted to identify novel genes related to fruit-associated biological processes. Specifically, using validated genes, we applied a shortest-path-based method to identify several novel genes in a large network constructed using the protein-protein interactions observed in Arabidopsis thaliana. The described analyses indicate that several of the discovered genes are associated with fruit fertilization, development and maturation in Arabidopsis thaliana.

High throughput route selection in multi-rate wireless mesh networks

Institute of Scientific and Technical Information of China (English)

WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de

2008-01-01

Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.

Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.

Science.gov (United States)

Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S

2013-01-01

The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2014-07-01

OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation. Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.

Analyzing multiday route choice behavior of commuters using GPS data

Directory of Open Access Journals (Sweden)

Wenyun Tang

2016-02-01

Full Text Available In this study, accurate global position system and geographic information system data were employed to reveal multiday routes people used and to study multiday route choice behavior for the same origin–destination trips, from home to work. A new way of thinking about route choice modeling is provided in this study. Travelers are classified into three kinds based on the deviation between actual routes and the shortest travel time paths. Based on the classification, a two-stage route choice process is proposed, in which the first step is to classify the travelers and the second one is to model route choice behavior. After analyzing the characteristics of different types of travelers, an artificial neural network was adopted to classify travelers and model route choice behavior. An empirical study using global position systems data collected in Minneapolis–St Paul metropolitan area was carried out. It finds that most travelers follow the same route during commute trips on successive days. And different types of travelers have a significant difference in route choice property. The modeling results indicate that neural network framework can classify travelers and model route choice well.

Matrix-geometric analysis of the shortest queue problem with threshold jockeying

NARCIS (Netherlands)

Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

1993-01-01

In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

STIMULATION METHODS IMPROVEMENT OF EXIT ROUTE ON RAILWAY TRANSPORT

Directory of Open Access Journals (Sweden)

A. I. Verlan

2014-01-01

Full Text Available Purpose. The purpose of the article is to assess the costs, which are redistributed in the system «shipper−railroad−consignee» during routing of rail transportation and the development of tariff simulation methods of shippers to the exit routes formation. Methodology. Using economic and mathematical analysis the distribution of costs among the various participants of transportation process during the exit routes formation is investigated in the article. Findings. For implementation of the tariff simulation methods of exit routes and retention of the existing tariff structure it is proposed to provide in the «Tariff catalogue for freight transportation by railway transport of Ukraine» the discount, differentiated from haulage distance. A new method for determining the fees amount for cars supply and removal on approach tracks by train locomotives was also offered. Originality. As a result of the research a new method for determination of the exit rout efficiency that, unlike the existing one, takes into account the various interests of the individual participants in the transportation process was proposed. The dependence of the correction factors to the tariff for freight transportation in their own cars by direct exit routes from distance haulage was obtained. Implementation of these coefficients provides an approximation of railway tariffs to the traffic handling costs. A method for determination the rate of fees for cars supply and removal on approach tracks by train locomotives was offered. Practical value. InUkraine creation of the tariff discounts system for freight transportation by exit routes consistent with international practice and allows bringing the tariff to the real traffic handling cost. This change on the one hand will provide stimulation for private capital investments in infrastructure development and shunting means of approach tracks, on the other – it will fix the shippers to the railroads and stop their outflow

Bees do not use nearest-neighbour rules for optimization of multi-location routes.

Science.gov (United States)

Lihoreau, Mathieu; Chittka, Lars; Le Comber, Steven C; Raine, Nigel E

2012-02-23

Animals collecting patchily distributed resources are faced with complex multi-location routing problems. Rather than comparing all possible routes, they often find reasonably short solutions by simply moving to the nearest unvisited resources when foraging. Here, we report the travel optimization performance of bumble-bees (Bombus terrestris) foraging in a flight cage containing six artificial flowers arranged such that movements between nearest-neighbour locations would lead to a long suboptimal route. After extensive training (80 foraging bouts and at least 640 flower visits), bees reduced their flight distances and prioritized shortest possible routes, while almost never following nearest-neighbour solutions. We discuss possible strategies used during the establishment of stable multi-location routes (or traplines), and how these could allow bees and other animals to solve complex routing problems through experience, without necessarily requiring a sophisticated cognitive representation of space.

Analysis of the shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

A minimum resource neural network framework for solving multiconstraint shortest path problems.

Science.gov (United States)

Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao

2014-08-01

Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e.g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than  ∼ 2% and 0.5% that of the Dijkstra's algorithm.

UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

Science.gov (United States)

Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

2018-01-01

This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

Euclidean shortest paths exact or approximate algorithms

CERN Document Server

Li, Fajie

2014-01-01

This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.

A shortest-path graph kernel for estimating gene product semantic similarity

Directory of Open Access Journals (Sweden)

Alvarez Marco A

2011-07-01

Full Text Available Abstract Background Existing methods for calculating semantic similarity between gene products using the Gene Ontology (GO often rely on external resources, which are not part of the ontology. Consequently, changes in these external resources like biased term distribution caused by shifting of hot research topics, will affect the calculation of semantic similarity. One way to avoid this problem is to use semantic methods that are "intrinsic" to the ontology, i.e. independent of external knowledge. Results We present a shortest-path graph kernel (spgk method that relies exclusively on the GO and its structure. In spgk, a gene product is represented by an induced subgraph of the GO, which consists of all the GO terms annotating it. Then a shortest-path graph kernel is used to compute the similarity between two graphs. In a comprehensive evaluation using a benchmark dataset, spgk compares favorably with other methods that depend on external resources. Compared with simUI, a method that is also intrinsic to GO, spgk achieves slightly better results on the benchmark dataset. Statistical tests show that the improvement is significant when the resolution and EC similarity correlation coefficient are used to measure the performance, but is insignificant when the Pfam similarity correlation coefficient is used. Conclusions Spgk uses a graph kernel method in polynomial time to exploit the structure of the GO to calculate semantic similarity between gene products. It provides an alternative to both methods that use external resources and "intrinsic" methods with comparable performance.

Determining an optimum inventory route for an areal object: the case of forest inventory in Finland

Directory of Open Access Journals (Sweden)

Henna Etula

2014-03-01

Full Text Available In recent decades, routing based on Geographic Information Systems (GIS has become a major branch of technology, which has been used especially in applications related to transport and logistics. However, in terms of the development of methods, routing in a cross-country environment is more difficult, and hence research into it has been relatively scarce. This is particularly true in the context of complex routing problems involving visits to several locations. A typical example of a problem of this kind is field inventory, which is a data collection procedure used in many application areas, particularly those related to environmental research and the management of natural resources. This study presents a problem in which an efficient inventory route is determined for an areal object, such that the area visible from the route meets a prescribed threshold, while maintaining the shortest possible route. Although this problem, referred to here as the Areal Inventory Problem (AIP, is closely related to a multitude of routing and location allocation methods known in the context of GIS, none of them is very well-suited for solving the AIP. This study describes a general solution procedure for the AIP, and introduces an implementation of a heuristic algorithm that can be used to solve a real-world AIP within a reasonable time frame. The proposed approach is demonstrated with actual data related to field inventory practices carried out by the Finnish Forest Centre.

Evacuation route planning during nuclear emergency using genetic algorithm

International Nuclear Information System (INIS)

Suman, Vitisha; Sarkar, P.K.

2012-01-01

In nuclear industry the routing in case of any emergency is a cause of concern and of great importance. Even the smallest of time saved in the affected region saves a huge amount of otherwise received dose. Genetic algorithm an optimization technique has great ability to search for the optimal path from the affected region to a destination station in a spatially addressed problem. Usually heuristic algorithms are used to carry out these types of search strategy, but due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. Routing problems mainly are search problems for finding the shortest distance within a time limit to cover the required number of stations taking care of the traffics, road quality, population size etc. Lack of any formal mechanisms to help decision-makers explore the solution space of their problem and thereby challenges their assumptions about the number and range of options available. The Genetic Algorithm provides a way to optimize a multi-parameter constrained problem with an ease. Here use of Genetic Algorithm to generate a range of options available and to search a solution space and selectively focus on promising combinations of criteria makes them ideally suited to such complex spatial decision problems. The emergency response and routing can be made efficient, in accessing the closest facilities and determining the shortest route using genetic algorithm. The accuracy and care in creating database can be used to improve the result of the final output. The Genetic algorithm can be used to improve the accuracy of result on the basis of distance where other algorithm cannot be obtained. The search space can be utilized to its great extend

The Shortest QRS Duration of an Electrocardiogram Might Be an Optimal Electrocardiographic Predictor for Response to Cardiac Resynchronization Therapy.

Science.gov (United States)

Chen, Jan-Yow; Lin, Kuo-Hung; Chang, Kuan-Cheng; Chou, Che-Yi

2017-08-03

QRS duration has been associated with the response to cardiac resynchronization therapy (CRT). However, the methods for defining QRS duration to predict the outcome of CRT have discrepancies in previous reports. The aim of this study was to determine an optimal measurement of QRS duration to predict the response to CRT.Sixty-one patients who received CRT were analyzed. All patients had class III-IV heart failure, left ventricular ejection fraction not more than 35%, and complete left bundle branch block. The shortest, longest, and average QRS durations from the 12 leads of each electrocardiogram (ECG) were measured. The responses to CRT were determined using the changes in echocardiography after 6 months. Thirty-five (57.4%) patients were responders and 26 (42.6%) patients were non-responders. The pre-procedure shortest, average, and longest QRS durations and the QRS shortening (ΔQRS) of the shortest QRS duration were significantly associated with the response to CRT in a univariate logistic regression analysis (P = 0.002, P = 0.03, P = 0.04 and P = 0.04, respectively). Based on the measurement of the area under curve of the receiver operating characteristic curve, only the pre-procedure shortest QRS duration and the ΔQRS of the shortest QRS duration showed significant discrimination for the response to CRT (P = 0.002 and P = 0.038, respectively). Multivariable logistic regression showed the pre-procedure shortest QRS duration is an independent predictor for the response to CRT.The shortest QRS duration from the 12 leads of the electrocardiogram might be an optimal measurement to predict the response to CRT.

Finding shortest non-trivial cycles in directed graphs on surfaces

Directory of Open Access Journals (Sweden)

Sergio Cabello

2016-04-01

Full Text Available Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary.  We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing previous results that dealt with undirected graphs.Our first algorithm computes such cycles in $O(n^2\\log n$ time, where $n$ is the total number of vertices and edges of $D$, thus matching the complexity of the best general algorithm in the undirected case.  It revisits and extends Thomassen's 3-path condition; the technique applies to other families of cycles as well.We also provide more efficient algorithms in special cases, such as graphs with small genus or bounded treewidth, using a divide-and-conquer technique that simplifies the graph while preserving the topological properties of its cycles.  Finally, we give an efficient output-sensitive algorithm, whose running time depends on the length of the shortest non-contractible or non-separating cycle.

comparative analysis and implementation of dijkstra's shortest path

African Journals Online (AJOL)

user

path problem requires finding a single shortest-path between given vertices s and t; ... Bridge in 1735, [5 – 10]. This problem led to the .... their advancements from new design paradigms, data structures ..... .

Efficient priority queueing routing strategy on networks of mobile agents

Science.gov (United States)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

DATA-ORIENTED ALGORITHM FOR ROUTE CHOICE SET GENERATION IN A METROPOLITAN AREA WITH MOBILE PHONE GPS DATA

Directory of Open Access Journals (Sweden)

T. Nakamura

2012-07-01

Full Text Available Nowadays, for the estimation of traffic demand or people flow, modelling route choice activity in road networks is an important task and many algorithms have been developed to generate route choice sets. However, developing an algorithm based on a small amount of data that can be applied generally within a metropolitan area is difficult. This is because the characteristics of road networks vary widely. On the other hand, recently, the collection of people movement data has lately become much easier, especially through mobile phones. Lately, most mobile phones include GPS functionality. Given this background, we propose a data-oriented algorithm to generate route choice sets using mobile phone GPS data. GPS data contain a number of measurement errors; hence, they must be adjusted to account for these errors before use in advanced people movement analysis. However, this is time-consuming and expensive, because an enormous amount of daily data can be obtained. Hence, the objective of this study is to develop an algorithm that can easily manage GPS data. Specifically, at first movement data from all GPS data are selected by calculating the speed. Next, the nearest roads in the road network are selected from the GPS location and count such data for each road. Then An algorithm based on the GSP (Gateway Shortest Path algorithm is proposed, which searches the shortest path through a given gateway. In the proposed algorithm, the road for which the utilization volume calculated by GPS data is large is selected as the gateway. Thus, route choice sets that are based on trends in real GPS data are generated. To evaluate the proposed method, GPS data from 0.7 million people a year in Japan and DRM (Digital Road Map as the road network are used. DRM is one of the most detailed road networks in Japan. Route choice sets using the proposed algorithm are generated and the cover rate of the utilization volume of each road under evaluation is calculated. As a

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

1991-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Huang Qiong

2014-01-01

Full Text Available Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Be-safe travel, a web-based geographic application to explore safe-route in an area

Science.gov (United States)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

In large cities in developing countries, the various forms of criminality are often found. For instance, the most prominent crimes in Surabaya, Indonesia is 3C, that is theft with violence (curas), theft by weighting (curat), and motor vehicle theft (curanmor). 3C case most often occurs on the highway and residential areas. Therefore, new entrants in an area should be aware of these kind of crimes. Route Planners System or route planning system such as Google Maps only consider the shortest distance in the calculation of the optimal route. The selection of the optimal path in this study not only consider the shortest distance, but also involves other factors, namely the security level. This research considers at the need for an application to recommend the safest road to be passed by the vehicle passengers while drive an area. This research propose Be-Safe Travel, a web-based application using Google API that can be accessed by people who like to drive in an area, but still lack of knowledge of the pathways which are safe from crime. Be-Safe Travel is not only useful for the new entrants, but also useful for delivery courier of valuables goods to go through the safest streets.

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

A proper choice of route significantly reduces air pollution exposure--a study on bicycle and bus trips in urban streets.

Science.gov (United States)

Hertel, Ole; Hvidberg, Martin; Ketzel, Matthias; Storm, Lars; Stausgaard, Lizzi

2008-01-15

A proper selection of route through the urban area may significantly reduce the air pollution exposure. This is the main conclusion from the presented study. Air pollution exposure is determined for two selected cohorts along the route going from home to working place, and back from working place to home. Exposure is determined with a street pollution model for three scenarios: bicycling along the shortest possible route, bicycling along the low exposure route along less trafficked streets, and finally taking the shortest trip using public transport. Furthermore, calculations are performed for the cases the trip takes place inside as well as outside the traffic rush hours. The results show that the accumulated air pollution exposure for the low exposure route is between 10% and 30% lower for the primary pollutants (NO(x) and CO). However, the difference is insignificant and in some cases even negative for the secondary pollutants (NO(2) and PM(10)/PM(2.5)). Considering only the contribution from traffic in the travelled streets, the accumulated air pollution exposure is between 54% and 67% lower for the low exposure route. The bus is generally following highly trafficked streets, and the accumulated exposure along the bus route is therefore between 79% and 115% higher than the high exposure bicycle route (the short bicycle route). Travelling outside the rush hour time periods reduces the accumulated exposure between 10% and 30% for the primary pollutants, and between 5% and 20% for the secondary pollutants. The study indicates that a web based route planner for selecting the low exposure route through the city might be a good service for the public. In addition the public may be advised to travel outside rush hour time periods.

The time-varying shortest path problem with fuzzy transit costs and speedup

Directory of Open Access Journals (Sweden)

Rezapour Hassan

2016-08-01

Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.

Optimization of routing strategies for data transfer in peer-to-peer networks

International Nuclear Information System (INIS)

Morioka, Atsushi; Igarashi, Akito

2014-01-01

Since peer-to-peer file-sharing systems have become familiar recently, the information traffic in the networks is increasing. Therefore it causes various traffic problems in peer-to-peer networks. In this paper, we model some features of the peer-to-peer networks, and investigate the traffic problems. Peer-to-peer networks have two notable characters. One is that each peer frequently searches for a file and download it from a peer who has the requested file. To decide whether a peer has the requested file or not in modelling of the search and download process, we introduce file-parameter P j , which expresses the amount of files stored in peer j. It is assumed that if P j is large, peer j has many files and can meet other peers' requests with high probability. The other character is that peers leave and join into the network repeatedly. Many researchers address traffic problems of data transfer in computer communication networks. To our knowledge, however, no reports focus on those in peer-to-peer networks whose topology changes with time. For routing paths of data transfer, generally, the shortest paths are used in usual computer networks. In this paper, we introduce a new optimal routing strategy which uses weights of peers to avoid traffic congestion. We find that the new routing strategy is superior to the shortest path strategy in terms of congestion frequency in data transfer

A human-machine cooperation route planning method based on improved A* algorithm

Science.gov (United States)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

To avoid the limitation of common route planning method to blindly pursue higher Machine Intelligence and autoimmunization, this paper presents a human-machine cooperation route planning method. The proposed method includes a new A* path searing strategy based on dynamic heuristic searching and a human cooperated decision strategy to prune searching area. It can overcome the shortage of A* algorithm to fall into a local long term searching. Experiments showed that this method can quickly plan a feasible route to meet the macro-policy thinking.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Directory of Open Access Journals (Sweden)

Vatutin Eduard

2017-12-01

Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Science.gov (United States)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

An adaptive routing strategy for packet delivery in complex networks

International Nuclear Information System (INIS)

Zhang, Huan; Liu, Zonghua; Tang, Ming; Hui, P.M.

2007-01-01

We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages

Shortest Path Problems in a Stochastic and Dynamic Environment

National Research Council Canada - National Science Library

Cho, Jae

2003-01-01

.... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...

Modified Pagerank Algorithm Based Real-Time Metropolitan Vehicular Traffic Routing Using GPS Crowdsourcing Data

Directory of Open Access Journals (Sweden)

Adithya Guru Vaishnav.S

2015-08-01

Full Text Available This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.

Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

Science.gov (United States)

Sun, Zhonghao; Zhou, Xingshe

2016-01-01

The existing transportation sector creates heavily environmental impacts and is a prime cause for the current climate change. The need to reduce emissions from this sector has stimulated efforts to speed up the application of electric vehicles (EVs). A subset of EVs, called plug-in hybrid electric vehicles (PHEVs), backup batteries with combustion engine, which makes PHEVs have a comparable driving range to conventional vehicles. However, this hybridization comes at a cost of higher emissions than all-electric vehicles. This paper studies the routing problem for PHEVs to minimize emissions. The existing shortest-path based algorithms cannot be applied to solving this problem, because of the several new challenges: (1) an optimal route may contain circles caused by detour for recharging; (2) emissions of PHEVs not only depend on the driving distance, but also depend on the terrain and the state of charge (SOC) of batteries; (3) batteries can harvest energy by regenerative braking, which makes some road segments have negative energy consumption. To address these challenges, this paper proposes a green navigation algorithm (GNA) which finds the optimal strategies: where to go and where to recharge. GNA discretizes the SOC, then makes the PHEV routing problem to satisfy the principle of optimality. Finally, GNA adopts dynamic programming to solve the problem. We evaluate GNA using synthetic maps generated by the delaunay triangulation. The results show that GNA can save more than 10 % energy and reduce 10 % emissions when compared to the shortest path algorithm. We also observe that PHEVs with the battery capacity of 10-15 KWh detour most and nearly no detour when larger than 30 KWh. This observation gives some insights when developing PHEVs.

How well do modelled routes to school record the environments children are exposed to?: a cross-sectional comparison of GIS-modelled and GPS-measured routes to school

Science.gov (United States)

2014-01-01

Background The school journey may make an important contribution to children’s physical activity and provide exposure to food and physical activity environments. Typically, Geographic Information Systems (GIS) have been used to model assumed routes to school in studies, but these may differ from those actually chosen. We aimed to identify the characteristics of children and their environments that make the modelled route more or less representative of that actually taken. We compared modelled GIS routes and actual Global Positioning Systems (GPS) measured routes in a free-living sample of children using varying travel modes. Methods Participants were 175 13-14 yr old children taking part in the Sport, Physical activity and Eating behaviour: Environmental Determinants in Young people (SPEEDY) study who wore GPS units for up to 7 days. Actual routes to/from school were extracted from GPS data, and shortest routes between home and school along a road network were modelled in a GIS. Differences between them were assessed according to length, percentage overlap, and food outlet exposure using multilevel regression models. Results GIS routes underestimated route length by 21.0% overall, ranging from 6.1% among walkers to 23.2% for bus users. Among pedestrians food outlet exposure was overestimated by GIS routes by 25.4%. Certain characteristics of children and their neighbourhoods that improved the concordance between GIS and GPS route length and overlap were identified. Living in a village raised the odds of increased differences in length (odds ratio (OR) 3.36 (1.32-8.58)), while attending a more urban school raised the odds of increased percentage overlap (OR 3.98 (1.49-10.63)). However none were found for food outlet exposure. Journeys home from school increased the difference between GIS and GPS routes in terms of food outlet exposure, and this measure showed considerable within-person variation. Conclusions GIS modelled routes between home and school were not

An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

Science.gov (United States)

2015-03-26

47 Appendix A. Shortest Path Code ( VBA ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Appendix B. Quad Chart...efficient shortest path algorithm into the modeling environment, namely Excel VBA . While various algorithms offer the potential for more efficiency in...graphical interface is extremely intuitive and easily accessible to a user with no prior knowledge of the system. Since the Metz model is based on the

External Memory Algorithms for Diameter and All-Pair Shortest-Paths on Sparse Graphs

DEFF Research Database (Denmark)

Arge, Lars; Meyer, Ulrich; Toma, Laura

2004-01-01

We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block-size a...

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone

DEFF Research Database (Denmark)

Kaul, Manohar; Wong, Raymond Chi-Wing; Yang, Bin

2013-01-01

With the increasing availability of terrain data, e.g., from aerial laser scans, the management of such data is attracting increasing at- tention in both industry and academia. In particular, spatial queries, e.g., k -nearest neighbor and reverse nearest neighbor queries, in Euclidean and spatial...... network spaces are being extended to ter- rains. Such queries all rely on an important operation, that of finding shortest surface distances. However, shortest surface dis- tance computation is very time consuming. We propose techniques that enable efficient computation of lower and upper bounds...... of the shortest surface distance, which enable faster query processing by eliminating expensive distance computations. Empirical studies show that our bounds are much tighter than the best-known bounds in many cases and that they enable speedups of up to 43 times for some well-known spatial querie...

COMPOSITE METHOD OF RELIABILITY RESEARCH FOR HIERARCHICAL MULTILAYER ROUTING SYSTEMS

Directory of Open Access Journals (Sweden)

R. B. Tregubov

2016-09-01

Full Text Available The paper deals with the idea of a research method for hierarchical multilayer routing systems. The method represents a composition of methods of graph theories, reliability, probabilities, etc. These methods are applied to the solution of different private analysis and optimization tasks and are systemically connected and coordinated with each other through uniform set-theoretic representation of the object of research. The hierarchical multilayer routing systems are considered as infrastructure facilities (gas and oil pipelines, automobile and railway networks, systems of power supply and communication with distribution of material resources, energy or information with the use of hierarchically nested functions of routing. For descriptive reasons theoretical constructions are considered on the example of task solution of probability determination for up state of specific infocommunication system. The author showed the possibility of constructive combination of graph representation of structure of the object of research and a logic probable analysis method of its reliability indices through uniform set-theoretic representation of its elements and processes proceeding in them.

U-Access: a web-based system for routing pedestrians of differing abilities

Science.gov (United States)

Sobek, Adam D.; Miller, Harvey J.

2006-09-01

For most people, traveling through urban and built environments is straightforward. However, for people with physical disabilities, even a short trip can be difficult and perhaps impossible. This paper provides the design and implementation of a web-based system for the routing and prescriptive analysis of pedestrians with different physical abilities within built environments. U-Access, as a routing tool, provides pedestrians with the shortest feasible route with respect to one of three differing ability levels, namely, peripatetic (unaided mobility), aided mobility (mobility with the help of a cane, walker or crutches) and wheelchair users. U-Access is also an analytical tool that can help identify obstacles in built environments that create routing discrepancies among pedestrians with different physical abilities. This paper discusses the system design, including database, algorithm and interface specifications, and technologies for efficiently delivering results through the World Wide Web (WWW). This paper also provides an illustrative example of a routing problem and an analytical evaluation of the existing infrastructure which identifies the obstacles that pose the greatest discrepancies between physical ability levels. U-Access was evaluated by wheelchair users and route experts from the Center for Disability Services at The University of Utah, USA.

A dynamic routing strategy with limited buffer on scale-free network

Science.gov (United States)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Structural parcellation of the thalamus using shortest-path tractography

DEFF Research Database (Denmark)

Kasenburg, Niklas; Darkner, Sune; Hahn, Ute

2016-01-01

that parcellation of the thalamus results in p-value maps that are spatially coherent across subjects. Comparing to the state-of-the-art parcellation of Behrens et al. [1], we observe some agreement, but the soft segmentation exhibits better stability for voxels connected to multiple target regions.......We demonstrate how structural parcellation can be implemented using shortest-path tractography, thereby addressing some of the shortcomings of the conventional approaches. In particular, our algorithm quantifies, via p-values, the confidence that a voxel in the parcellated region is connected...... to each cortical target region. Calculation of these statistical measures is derived from a rank-based test on the histogram of tract-based scores from all the shortest paths found between the source voxel and each voxel within the target region. Using data from the Human Connectome Project, we show...

Special cases of the quadratic shortest path problem

NARCIS (Netherlands)

Sotirov, Renata; Hu, Hao

2017-01-01

The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP

Enhanced method of fast re-routing with load balancing in software-defined networks

Science.gov (United States)

Lemeshko, Oleksandr; Yeremenko, Oleksandra

2017-11-01

A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.

Revealed Preference Methods for Studying Bicycle Route Choice—A Systematic Review

Directory of Open Access Journals (Sweden)

Ray Pritchard

2018-03-01

Full Text Available One fundamental aspect of promoting utilitarian bicycle use involves making modifications to the built environment to improve the safety, efficiency and enjoyability of cycling. Revealed preference data on bicycle route choice can assist greatly in understanding the actual behaviour of a highly heterogeneous group of users, which in turn assists the prioritisation of infrastructure or other built environment initiatives. This systematic review seeks to compare the relative strengths and weaknesses of the empirical approaches for evaluating whole journey route choices of bicyclists. Two electronic databases were systematically searched for a selection of keywords pertaining to bicycle and route choice. In total seven families of methods are identified: GPS devices, smartphone applications, crowdsourcing, participant-recalled routes, accompanied journeys, egocentric cameras and virtual reality. The study illustrates a trade-off in the quality of data obtainable and the average number of participants. Future additional methods could include dockless bikeshare, multiple camera solutions using computer vision and immersive bicycle simulator environments.

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Directory of Open Access Journals (Sweden)

Huanlin Liu

2014-01-01

Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

DiversePathsJ: diverse shortest paths for bioimage analysis.

Science.gov (United States)

Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

2018-02-01

We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

Directory of Open Access Journals (Sweden)

Fronita Mona

2018-01-01

Full Text Available Traveling Salesman Problem (TSP is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour’s to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

Effective caching of shortest paths for location-based services

DEFF Research Database (Denmark)

Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

2012-01-01

Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.

Directory of Open Access Journals (Sweden)

J R Managbanag

Full Text Available BACKGROUND: Identification of genes that modulate longevity is a major focus of aging-related research and an area of intense public interest. In addition to facilitating an improved understanding of the basic mechanisms of aging, such genes represent potential targets for therapeutic intervention in multiple age-associated diseases, including cancer, heart disease, diabetes, and neurodegenerative disorders. To date, however, targeted efforts at identifying longevity-associated genes have been limited by a lack of predictive power, and useful algorithms for candidate gene-identification have also been lacking. METHODOLOGY/PRINCIPAL FINDINGS: We have utilized a shortest-path network analysis to identify novel genes that modulate longevity in Saccharomyces cerevisiae. Based on a set of previously reported genes associated with increased life span, we applied a shortest-path network algorithm to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single-gene deletion strains corresponding to predicted components of the shortest-path longevity network was determined. Here we report that the single-gene deletion strains identified by our shortest-path longevity analysis are significantly enriched for mutations conferring either increased or decreased replicative life span, relative to a randomly selected set of 564 single-gene deletion strains or to the current data set available for the entire haploid deletion collection. Further, we report the identification of previously unknown longevity genes, several of which function in a conserved longevity pathway believed to mediate life span extension in response to dietary restriction. CONCLUSIONS/SIGNIFICANCE: This work demonstrates that shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity and represents the first application of

Efficiency of Choice Set Generation Methods for Bicycle Routes

DEFF Research Database (Denmark)

Halldórsdóttir, Katrín; Rieser-Schüssler, Nadine; W. Axhausen, Kay

behaviour, observed choices and alternatives composing the choice set of each cyclist are necessary. However, generating the alternative choice sets can prove challenging. This paper analyses the efficiency of various choice set generation methods for bicycle routes in order to contribute to our...... travelling information with GPS loggers, compared to self-reported RP data, is more accurate geographic locations and routes. Also, the GPS traces give more reliable information on times and prevent trip underreporting, and it is possible to collect information on many trips by the same person without...

A case study of heterogeneous fleet vehicle routing problem: Touristic distribution application in Alanya

Directory of Open Access Journals (Sweden)

Kenan Karagül

2014-07-01

Full Text Available In this study, Fleet Size and Mix Vehicle Routing Problem is considered in order to optimize the distribution of the tourists who have traveled between the airport and the hotels in the shortest distance by using the minimum cost. The initial solution space for the related methods are formed as a combination of Savings algorithm, Sweep algorithm and random permutation alignment. Then, two well-known solution methods named as Standard Genetic Algorithms and random search algorithms are used for changing the initial solutions. Computational power of the machine and heuristic algorithms are used instead of human experience and human intuition in order to solve the distribution problem of tourists coming to hotels in Alanya region from Antalya airport. For this case study, daily data of tourist distributions performed by an agency operating in Alanya region are considered. These distributions are then modeled as Vehicle Routing Problem to calculate the solutions for various applications. From the comparisons with the decision of a human expert, it is seen that the proposed methods produce better solutions with respect to human experience and insight. Random search method produces a solution more favorable in terms of time. As a conclusion, it is seen that, owing to the distribution plans offered by the obtained solutions, the agencies may reduce the costs by achieving savings up to 35%.

Adaptive local routing strategy on a scale-free network

International Nuclear Information System (INIS)

Feng, Liu; Han, Zhao; Ming, Li; Yan-Bo, Zhu; Feng-Yuan, Ren

2010-01-01

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies. (general)

A source-initiated on-demand routing algorithm based on the Thorup-Zwick theory for mobile wireless sensor networks.

Science.gov (United States)

Mao, Yuxin; Zhu, Ping

2013-01-01

The unreliability and dynamics of mobile wireless sensor networks make it hard to perform end-to-end communications. This paper presents a novel source-initiated on-demand routing mechanism for efficient data transmission in mobile wireless sensor networks. It explores the Thorup-Zwick theory to achieve source-initiated on-demand routing with time efficiency. It is able to find out shortest routing path between source and target in a network and transfer data in linear time. The algorithm is easy to be implemented and performed in resource-constrained mobile wireless sensor networks. We also evaluate the approach by analyzing its cost in detail. It can be seen that the approach is efficient to support data transmission in mobile wireless sensor networks.

Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths

Directory of Open Access Journals (Sweden)

B. Bhowmik

2011-08-01

Full Text Available In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

Implementasi Algoritma Best-First Search (BeFS pada Penyelesaian Traveling Salesman Problem (TSP (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta

Directory of Open Access Journals (Sweden)

Muchammad Abrori

2015-10-01

Full Text Available Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time. Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.

METHOD OF CHOOSING THE TECHNOLOGY OF VEHICLE OPERATION ON DELIVERY ROUTES

Directory of Open Access Journals (Sweden)

Ye. Nagornyi

2014-10-01

Full Text Available A method for determining the technology of vehicles operation on delivery (team routes, which allows to determine the optimal sequence of cargo delivery to customers by vehicles of certain capacity in order to meet the requirements of cargo owners regarding the conditions of service is offered. Recommendations for creation of an automated system of forming the technology of vehicles operation on delivery routes are developed.

Data Collection Method for Mobile Control Sink Node in Wireless Sensor Network Based on Compressive Sensing

Directory of Open Access Journals (Sweden)

Ling Yongfa

2016-01-01

Full Text Available The paper proposes a mobile control sink node data collection method in the wireless sensor network based on compressive sensing. This method, with regular track, selects the optimal data collection points in the monitoring area via the disc method, calcu-lates the shortest path by using the quantum genetic algorithm, and hence determines the data collection route. Simulation results show that this method has higher network throughput and better energy efficiency, capable of collecting a huge amount of data with balanced energy consumption in the network.

Analysis of the Chinese air route network as a complex network

Science.gov (United States)

Cai, Kai-Quan; Zhang, Jun; Du, Wen-Bo; Cao, Xian-Bin

2012-02-01

The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN). Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems.

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

Science.gov (United States)

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

MARKETING DATABASES – THE SHORTEST WAY TO CLIENT’S HEART

Directory of Open Access Journals (Sweden)

Popa Adela Laura

2008-05-01

Full Text Available The aim of this paper is to present the potential which could be offered by managing databases in direct marketing through gathering the information that could offer the shortest and efficient way to the clients needs. The paper includes the necessary steps to make this activity a real success

Least loaded and route fragmentation aware RSA strategies for elastic optical networks

Science.gov (United States)

Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi

2017-12-01

Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

) method and then develop a novel on-demand routing system named Cross Entropy Accelerated Ant Routing System (CEAARS) for regular constellation LEO satellite networks. By implementing simulations on an Iridium-like satellite network, we compare the proposed CEAARS algorithm with the two approaches to adaptive routing protocols on the Internet: distance-vector (DV) and link-state (LS), as well as with the original Cross Entropy Ant Routing System (CEARS). DV algorithms are based on distributed Bellman Ford algorithm, and LS algorithms are implementation of Dijkstras single source shortest path. The results show that CEAARS not only remarkably improves the convergence speed of achieving optimal or suboptimal paths, but also reduces the number of overhead ants (management packets).

Experiments with the auction algorithm for the shortest path problem

DEFF Research Database (Denmark)

Larsen, Jesper; Pedersen, Ib

1999-01-01

The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform significantly worse than a state-of-the-art Dijkstra-l......-like reference algorithm. Experiments are run on a distributed-memory MIMD class Meiko parallel computer....

A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

A method for selection of spent nuclear fuel (SNF) transportation route considering socioeconomic cost based on contingent valuation method (CVM)

International Nuclear Information System (INIS)

Kim, Young Sik

2008-02-01

A transportation of SNF may cause an additional radiation exposure to human beings. It means that the radiological risk should be estimated and managed quantitatively for the public who live near the shipments route. Before the SNF transportation is performed, the route selection is concluded based on the radiological risk estimated with RADTRAN code in existing method generally. It means the existing method for route selection is based only on the radiological health risk but there are not only the impacts related to the radiological health risk but also the socioeconomic impacts related to the cost. In this study, a new method and its numerical formula for route selection on transporting SNF is proposed based on cost estimation because there are several costs in transporting SNF. The total cost consists of radiological health cost, transportation cost, and socioeconomic cost. Each cost is defined properly to the characteristics of SNF transportation and many coefficients and variables describing the meaning of each cost are obtained or estimated through many surveys. Especially to get the socioeconomic cost, contingent valuation method (CVM) is used with a questionnaire. The socioeconomic cost estimation is the most important part of the total cost originated from transporting SNF because it is a very dominant cost in the total cost. The route selection regarding SNF transportation can be supported with the proposed method reasonably and unnecessary or exhausting controversies about the shipments could be avoided

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

Science.gov (United States)

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

The tomography of human mobility - what do shortest-path trees reveal?

Energy Technology Data Exchange (ETDEWEB)

Thiemann, Christian [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States); Max-Planck-Institute for Dynamics and Self-Organization, Goettingen (Germany); Grady, Daniel; Brockmann, Dirk [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States)

2010-07-01

Similar to illustrating the anatomy of organs using pictures of tissue slices taken at various depths, we construct shortest-path trees of different nodes to create tomograms of large-scale human mobility networks. This tomography allows us to measure global properties of the system conditioned on a reference location in the network to gain a fuller characterization of a node. It also suggests a canonical coordinate system for representing complex networks and dynamical processes thereon in a simplified way, revealing a new symmetry in the human mobility networks we investigated. Furthermore, introducing the notion of tree similarity, we devised a new technique for clustering nodes with similar topological footprint, yielding a unique and efficient method for community identification and topological backbone extraction. We applied these methods to a multi-scale human mobility network obtained from the dollar-bill-tracking site wheresgoerge.com and to the U.S. and world-wide air transportation network.

Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

ESHOPPS: A COMPUTATIONAL TOOL TO AID THE TEACHING OF SHORTEST PATH ALGORITHMS

Directory of Open Access Journals (Sweden)

S. J. de A. LIMA

2015-07-01

Full Text Available The development of a computational tool called EShoPPS – Environment for Shortest Path Problem Solving, which is used to assist students in understanding the working of Dijkstra, Greedy search and A*(star algorithms is presented in this paper. Such algorithms are commonly taught in graduate and undergraduate courses of Engineering and Informatics and are used for solving many optimization problems that can be characterized as Shortest Path Problem. The EShoPPS is an interactive tool that allows students to create a graph representing the problem and also helps in developing their knowledge of each specific algorithm. Experiments performed with 155 students of undergraduate and graduate courses such as Industrial Engineering, Computer Science and Information Systems have shown that by using the EShoPPS tool students were able to improve their interpretation of investigated algorithms.

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Directory of Open Access Journals (Sweden)

Jean Chamberlain Chedjou

2015-01-01

Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.

Exact methods for time constrained routing and related scheduling problems

DEFF Research Database (Denmark)

Kohl, Niklas

1995-01-01

of customers. In the VRPTW customers must be serviced within a given time period - a so called time window. The objective can be to minimize operating costs (e.g. distance travelled), fixed costs (e.g. the number of vehicles needed) or a combination of these component costs. During the last decade optimization......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...... of J?rnsten, Madsen and S?rensen (1986), which has been tested computationally by Halse (1992). Both methods decompose the problem into a series of time and capacity constrained shotest path problems. This yields a tight lower bound on the optimal objective, and the dual gap can often be closed...

A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

Directory of Open Access Journals (Sweden)

A. A. Heidari

2016-06-01

Full Text Available In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

The Resource constrained shortest path problem implemented in a lazy functional language

NARCIS (Netherlands)

Hartel, Pieter H.; Glaser, Hugh

The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in Fortran or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional

Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows

Directory of Open Access Journals (Sweden)

C Hauman

2014-06-01

Full Text Available The vehicle routing problem with time windows is a widely studied problem with many real-world applications. The problem considered here entails the construction of routes that a number of identical vehicles travel to service different nodes within a certain time window. New benchmark problems with multi-objective features were recently suggested in the literature and the multi-objective optimisation cross-entropy method is applied to these problems to investigate the feasibility of the method and to determine and propose reference solutions for the benchmark problems. The application of the cross-entropy method to the multi-objective vehicle routing problem with soft time windows is investigated. The objectives that are evaluated include the minimisation of the total distance travelled, the number of vehicles and/or routes, the total waiting time and delay time of the vehicles and the makespan of a route.

Floyd-warshall algorithm to determine the shortest path based on android

Science.gov (United States)

Ramadiani; Bukhori, D.; Azainil; Dengen, N.

2018-04-01

The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever get lost to a destination even to foreign places or that have never been visited before. The reasons why many institutions and business entities use technology to improve services to consumers and to streamline the production process undertaken and so forth. Speaking of the efficient, there are many elements related to efficiency in navigation systems, and one of them is the efficiency in terms of distance. The shortest distance determination algorithm required in this research is used Floyd-Warshall Algorithm. Floyd-Warshall algorithm is the algorithm to find the fastest path and the shortest distance between 2 nodes, while the program is intended to find the path of more than 2 nodes.

Tramp Ship Routing and Scheduling - Models, Methods and Opportunities

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

of their demand in advance. However, the detailed requirements of these contract cargoes can be subject to ongoing changes, e.g. the destination port can be altered. For tramp operators, a main concern is therefore the efficient and continuous planning of routes and schedules for the individual ships. Due...... and scheduling problem, focus should now be on extending this basic problem to include additional real-world complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new...

Pseudo-Cycle-Based Multicast Routing in Wormhole-Routed Networks

Institute of Scientific and Technical Information of China (English)

SONG JianPing (宋建平); HOU ZiFeng (侯紫峰); XU Ming (许铭)

2003-01-01

This paper addresses the problem of fault-tolerant multicast routing in wormholerouted multicomputers. A new pseudo-cycle-based routing method is presented for constructing deadlock-free multicast routing algorithms. With at most two virtual channels this technique can be applied to any connected networks with arbitrary topologies. Simulation results show that this technique results in negligible performance degradation even in the presence of a large number of faulty nodes.

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2013-01-01

In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2015-01-01

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

Optimization of the Costs and the Safety of Maritime Transport by Routing: The use of Currents Forecast in the Routing of Racing Sail Boats as a Prototype of Rout Optimization for Trading Ships

Science.gov (United States)

Theunynck, Denis; Peze, Thierry; Toumazou, Vincent; Zunquin, Gauthier; Cohen, Olivier; Monges, Arnaud

2005-03-01

It is interesting to see whether the model of routing designed for races and great Navy operations could be transferred to commercial navigation and if so, within which framework.Sail boat routing conquered its letters of nobility during great races like the « Route du Rhum » or the transatlantic race « Jacques Vabre ». It is the ultimate stage of the step begun by the Navy at the time of great operations, like D-day (Overlord )June 6, 1944, in Normandy1.Routing is, from the beginning, mainly based on statistical knowledge and weather forecast, but with the recent availability of reliable currents forecast, sail boats routers and/or skippers now have to learn how to use both winds and currents to obtain the best performance, that is to travel between two points in the shortest time possible in acceptable security conditions.Are the currents forecast only useful to racing sail boat ? Of course not, they are a great help to fisherman for whom the knowledge of currents is also the knowledge of sea temperature who indicates the probability of fish presence. They are also used in offshore work to predict the hardness of the sea during operation.A less developed field of application is the route optimization of trading ships. The idea is to optimize the use of currents to increase the relative speed of ships with no augmentation of fuel expense. This new field will require that currents forecasters learn about the specific needs of another type of clients. There is also a need of teaching because the future customers will have to learn how to use the information they will get.At this point, the introduction of the use of currents forecast in racing sail boats routing is only the first step. It is of great interest because it can rely on a high knowledge in routing.The main difference is of course that the wind direction and its force are of greater importance to a sail boat that they are for a trading ship for whom the point of interest will be the fuel consumption

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

Directory of Open Access Journals (Sweden)

Naixue Xiong

2017-06-01

Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.

Method and System for Dynamic Automated Corrections to Weather Avoidance Routes for Aircraft in En Route Airspace

Science.gov (United States)

McNally, B. David (Inventor); Erzberger, Heinz (Inventor); Sheth, Kapil (Inventor)

2015-01-01

A dynamic weather route system automatically analyzes routes for in-flight aircraft flying in convective weather regions and attempts to find more time and fuel efficient reroutes around current and predicted weather cells. The dynamic weather route system continuously analyzes all flights and provides reroute advisories that are dynamically updated in real time while the aircraft are in flight. The dynamic weather route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

Training shortest-path tractography: Automatic learning of spatial priors

DEFF Research Database (Denmark)

Kasenburg, Niklas; Liptrot, Matthew George; Reislev, Nina Linde

2016-01-01

Tractography is the standard tool for automatic delineation of white matter tracts from diffusion weighted images. However, the output of tractography often requires post-processing to remove false positives and ensure a robust delineation of the studied tract, and this demands expert prior...... knowledge. Here we demonstrate how such prior knowledge, or indeed any prior spatial information, can be automatically incorporated into a shortest-path tractography approach to produce more robust results. We describe how such a prior can be automatically generated (learned) from a population, and we...

Spatial Analysis of Traffic and Routing Path Methods for Tsunami Evacuation

Science.gov (United States)

Fakhrurrozi, A.; Sari, A. M.

2018-02-01

Tsunami disaster occurred relatively very fast. Thus, it has a very large-scale impact on both non-material and material aspects. Community evacuation caused mass panic, crowds, and traffic congestion. A further research in spatial based modelling, traffic engineering and splitting zone evacuation simulation is very crucial as an effort to reduce higher losses. This topic covers some information from the previous research. Complex parameters include route selection, destination selection, the spontaneous timing of both the departure of the source and the arrival time to destination and other aspects of the result parameter in various methods. The simulation process and its results, traffic modelling, and routing analysis emphasized discussion which is the closest to real conditions in the tsunami evacuation process. The method that we should highlight is Clearance Time Estimate based on Location Priority in which the computation result is superior to others despite many drawbacks. The study is expected to have input to improve and invent a new method that will be a part of decision support systems for disaster risk reduction of tsunamis disaster.

Calculating Graph Algorithms for Dominance and Shortest Path

DEFF Research Database (Denmark)

Sergey, Ilya; Midtgaard, Jan; Clarke, Dave

2012-01-01

We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated directly from the definition of the properties by fixed-point fusion of (1) a least fixed point...... expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length. The approach illustrates that reasoning in the style of fixed-point calculus extends gracefully to the domain of graph algorithms. We thereby bridge common practice from the school...... of program calculation with common practice from the school of static program analysis, and build a novel view on iterative graph algorithms as instances of abstract interpretation...

Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

Science.gov (United States)

Kröger, Martin

2005-06-01

We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the

A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce

Science.gov (United States)

Xia, Chao; Sheng, Ying; Jiang, Zhong-Zhong; Tan, Chunqiao; Huang, Min; He, Yuanjian

2015-12-01

In this paper, a novel discrete differential evolution (DDE) algorithm is proposed to solve the vehicle routing problems (VRP) in B2C e-commerce, in which VRP is modeled by the incomplete graph based on the actual urban road system. First, a variant of classical VRP is described and a mathematical programming model for the variant is given. Second, the DDE is presented, where individuals are represented as the sequential encoding scheme, and a novel reparation operator is employed to repair the infeasible solutions. Furthermore, a FLOYD operator for dealing with the shortest route is embedded in the proposed DDE. Finally, an extensive computational study is carried out in comparison with the predatory search algorithm and genetic algorithm, and the results show that the proposed DDE is an effective algorithm for VRP in B2C e-commerce.

The life and times of the Savings Method for Vehicle Routing Problems

African Journals Online (AJOL)

Forty ve years ago, an academic and practitioner from the north of England published a method of tackling the vehicle routing problem (VRP) in an American journal. Little could they have realised how the method they devised would still be a signicant part of the research agenda nearly half a century later. Adaptations of ...

A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

Science.gov (United States)

Dash, S.; Mishra, G. P.

2015-09-01

A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed.

A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

International Nuclear Information System (INIS)

Dash, S; Mishra, G P

2015-01-01

A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed. (paper)

Routing and scheduling of hazardous materials shipments: algorithmic approaches to managing spent nuclear fuel transport

International Nuclear Information System (INIS)

Cox, R.G.

1984-01-01

Much controversy surrounds government regulation of routing and scheduling of Hazardous Materials Transportation (HMT). Increases in operating costs must be balanced against expected benefits from local HMT bans and curfews when promulgating or preempting HMT regulations. Algorithmic approaches for evaluating HMT routing and scheduling regulatory policy are described. A review of current US HMT regulatory policy is presented to provide a context for the analysis. Next, a multiobjective shortest path algorithm to find the set of efficient routes under conflicting objectives is presented. This algorithm generates all efficient routes under any partial ordering in a single pass through the network. Also, scheduling algorithms are presented to estimate the travel time delay due to HMT curfews along a route. Algorithms are presented assuming either deterministic or stochastic travel times between curfew cities and also possible rerouting to avoid such cities. These algorithms are applied to the case study of US highway transport of spent nuclear fuel from reactors to permanent repositories. Two data sets were used. One data set included the US Interstate Highway System (IHS) network with reactor locations, possible repository sites, and 150 heavily populated areas (HPAs). The other data set contained estimates of the population residing with 0.5 miles of the IHS and the Eastern US. Curfew delay is dramatically reduced by optimally scheduling departure times unless inter-HPA travel times are highly uncertain. Rerouting shipments to avoid HPAs is a less efficient approach to reducing delay

An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink.

Science.gov (United States)

Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

2017-04-26

In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

Decision Support from Genetic Algorithms for Ship Collision Avoidance Route Planning and Alerts

Science.gov (United States)

Tsou, Ming-Cheng; Kao, Sheng-Long; Su, Chien-Min

When an officer of the watch (OOW) faces complicated marine traffic, a suitable decision support tool could be employed in support of collision avoidance decisions, to reduce the burden and greatly improve the safety of marine traffic. Decisions on routes to avoid collisions could also consider economy as well as safety. Through simulating the biological evolution model, this research adopts the genetic algorithm used in artificial intelligence to find a theoretically safety-critical recommendation for the shortest route of collision avoidance from an economic viewpoint, combining the international regulations for preventing collisions at sea (COLREGS) and the safety domain of a ship. Based on this recommendation, an optimal safe avoidance turning angle, navigation restoration time and navigational restoration angle will also be provided. A Geographic Information System (GIS) will be used as the platform for display and operation. In order to achieve advance notice of alerts and due preparation for collision avoidance, a Vessel Traffic Services (VTS) operator and the OOW can use this system as a reference to assess collision avoidance at present location.

Approaching the Brachistochrone Using Inclined Planes--Striving for Shortest or Equal Travelling Times

Science.gov (United States)

Theilmann, Florian

2017-01-01

The classical "brachistochrone" problem asks for the path on which a mobile point M just driven by its own gravity will travel in the shortest possible time between two given points "A" and "B." The resulting curve, the cycloid, will also be the "tautochrone" curve, i.e. the travelling time of the mobile…

Dynamic route guidance algorithm based algorithm based on artificial immune system

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.

Application of Muskingum routing method with variable parameters in ungauged basin

Directory of Open Access Journals (Sweden)

Xiao-meng Song

2011-03-01

Full Text Available This paper describes a flood routing method applied in an ungauged basin, utilizing the Muskingum model with variable parameters of wave travel time K and weight coefficient of discharge x based on the physical characteristics of the river reach and flood, including the reach slope, length, width, and flood discharge. Three formulas for estimating parameters of wide rectangular, triangular, and parabolic cross sections are proposed. The influence of the flood on channel flow routing parameters is taken into account. The HEC-HMS hydrological model and the geospatial hydrologic analysis module HEC-GeoHMS were used to extract channel or watershed characteristics and to divide sub-basins. In addition, the initial and constant-rate method, user synthetic unit hydrograph method, and exponential recession method were used to estimate runoff volumes, the direct runoff hydrograph, and the baseflow hydrograph, respectively. The Muskingum model with variable parameters was then applied in the Louzigou Basin in Henan Province of China, and of the results, the percentages of flood events with a relative error of peak discharge less than 20% and runoff volume less than 10% are both 100%. They also show that the percentages of flood events with coefficients of determination greater than 0.8 are 83.33%, 91.67%, and 87.5%, respectively, for rectangular, triangular, and parabolic cross sections in 24 flood events. Therefore, this method is applicable to ungauged basins.

Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

City transport monitoring and routes optimal management system

Directory of Open Access Journals (Sweden)

V. Gargasas

2008-06-01

Full Text Available The article analyses the problem of further development of geographic informational systems with traffic monitoring channel (GIS-TMC in order to present the road users with effective information about the fastest (the shortest in respect of time routes and thus to improve the use of existing city transport infrastructure. To solve this task it is suggested to create dynamic (automatically updated in real time street passing duration base, for support of which a city transport monitoring system operating in real time is necessary, consisting of a network of sensors, a data collection communications system and a data processing system. In the article it is shown that to predict the street passing duration it is enough to measure speed of transport in the characteristic points of the street. Measurements of traffic density do not significantly improve accuracy of forecasting the street passing time. Analytical formulas are presented meant to forecast the street passing time.

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2015-11-01

Full Text Available Most applications of underwater wireless sensor networks (UWSNs demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV-aided efficient data-gathering (AEDG routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

2015-11-17

Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

A performance evaluation of ACO and SA TSP in a supply chain network

Science.gov (United States)

Rao, T. Srinivas

2017-07-01

Supply Chain management and E commerce business solutions are one of the prominent areas of active research. In our paper we have modelled a supply chain model which aggregates all the manufacturers requirement and the products are supplied to all the manufacturer through a common vehicle routing algorithm. An appropriate tsp has been constructed for all the manufacturers which determines the shortest route thru which the aggregated material can be supplied in the shortest possible time. In this paper we have solved the shortest route through constructing a Simulated annealing algorithm and Ant colony algorithm and their performance is evaluated.

An aggregate method to calibrate the reference point of cumulative prospect theory-based route choice model for urban transit network

Science.gov (United States)

Zhang, Yufeng; Long, Man; Luo, Sida; Bao, Yu; Shen, Hanxia

2015-12-01

Transit route choice model is the key technology of public transit systems planning and management. Traditional route choice models are mostly based on expected utility theory which has an evident shortcoming that it cannot accurately portray travelers' subjective route choice behavior for their risk preferences are not taken into consideration. Cumulative prospect theory (CPT), a brand new theory, can be used to describe travelers' decision-making process under the condition of uncertainty of transit supply and risk preferences of multi-type travelers. The method to calibrate the reference point, a key parameter to CPT-based transit route choice model, determines the precision of the model to a great extent. In this paper, a new method is put forward to obtain the value of reference point which combines theoretical calculation and field investigation results. Comparing the proposed method with traditional method, it shows that the new method can promote the quality of CPT-based model by improving the accuracy in simulating travelers' route choice behaviors based on transit trip investigation from Nanjing City, China. The proposed method is of great significance to logical transit planning and management, and to some extent makes up the defect that obtaining the reference point is solely based on qualitative analysis.

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

Directory of Open Access Journals (Sweden)

De-Xin Yu

2013-01-01

Full Text Available Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

Shortest path problem on a grid network with unordered intermediate points

Science.gov (United States)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

A GIS-based decision support system for determining the shortest and safest route to forest fires: a case study in Mediterranean Region of Turkey.

Science.gov (United States)

Akay, Abdullah E; Wing, Michael G; Sivrikaya, Fatih; Sakar, Dursun

2012-03-01

The ability of firefighting vehicles and staff to reach a fire area as quickly as possible is critical in fighting against forest fires. In this study, a Geographical Information System-based decision support system was developed to assist fire managers in determining the fastest and the safest or more reliable access routes from firefighting headquarters to fire areas. The decision support system was tested in the Kahramanmaras Forestry Regional Directoratein the Mediterranean region of Turkey. The study area consisted of forested lands which had been classified according to fire sensitivity. The fire response routing simulations considered firefighting teams located in 20 firefighting headquarter locations. The road network, the locations of the firefighting headquarters, and possible fire locations were mapped for simulation analysis. In alternative application simulations, inaccessible roads which might be closed due to fire or other reasons were indicated in the network analysis so that the optimum route was not only the fastest but also the safest and most reliable path. The selection of which firefighting headquarters to use was evaluated by considering critical response time to potential fire areas based on fire sensitivity levels. Results indicated that new firefighting headquarters should be established in the region in order to provide sufficient firefighting response to all forested lands. In addition, building new fire access roads and increasing the design speed on current roads could also increase firefighting response capabilities within the study area.

External Data Structures for Shortest Path Queries on Planar Digraphs

DEFF Research Database (Denmark)

Arge, Lars; Toma, Laura

2005-01-01

In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...... optimal space-query product O(N2/B). An S space structure can be constructed in O(√S · sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph....

Subset-row inequalities applied to the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

2008-01-01

constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve......This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...... the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed...

The Impact of European Traffic Policy and Traffic Routes on the Development of the Ports of Rijeka and Place

Directory of Open Access Journals (Sweden)

Čedomir Ivaković

2006-03-01

Full Text Available Sea ports are the key segment of the traffic and economicdevelopment of maritime countries. Pan-European transportcorridors include the most important sea pmts and sea routes.They are an extension of the existing land corridors.The most important and the most promising crossings oftraffic corridors between the Central European, Pannonianand Adriatic areas, with the naturally shortest traffic routes directedtowards the Croatian sea ports are Corridor 58 ( Rijeka-Zagreb-Budapest and Corridor 5c (Ploce-Sarajevo-Osijek--Budapest. The primary purpose of this work is to study the importanceof the existing trading conditions and new investmentundertakings in the context of increase in competitiveness of theports of Rijeka and Place.The authors' attention is particularly directed to the constructionof new port terminals to increase the traffic potentialsof the Croatian sea ports. The formed conception with its characteristics,the methodology applied, and research results representthe quality starting points in determining a uniform portpolicy of the Republic of Croatia within the European trafficsystem.

Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

Full Text Available Humans perform many activities indoors and they show a growing need for indoor navigation, especially in unfamiliar buildings such as airports, museums and hospitals. Complexity of such buildings poses many challenges for building managers and visitors. Indoor navigation services play an important role in supporting these indoor activities. Indoor navigation covers extensive topics such as: 1 indoor positioning and localization; 2 indoor space representation for navigation model generation; 3 indoor routing computation; 4 human wayfinding behaviours; and 5 indoor guidance (e.g., textual directories. So far, a large number of studies of pedestrian indoor navigation have presented diverse navigation models and routing algorithms/methods. However, the major challenge is rarely referred to: how to represent the complex indoor environment for pedestrians and conduct routing according to the different roles and sizes of users. Such complex buildings contain irregular shapes, large open spaces, complicated obstacles and different types of passages. A navigation model can be very complicated if the indoors are accurately represented. Although most research demonstrates feasible indoor navigation models and related routing methods in regular buildings, the focus is still on a general navigation model for pedestrians who are simplified as circles. In fact, pedestrians represent different sizes, motion abilities and preferences (e.g., described in user profiles, which should be reflected in navigation models and be considered for indoor routing (e.g., relevant Spaces of Interest and Points of Interest. In order to address this challenge, this thesis proposes an innovative indoor modelling and routing approach – two-level routing. It specially targets the case of routing in complex buildings for distinct users. The conceptual (first level uses general free indoor spaces: this is represented by the logical network whose nodes represent the spaces and edges

Parallel algorithms for network routing problems and recurrences

International Nuclear Information System (INIS)

Wisniewski, J.A.; Sameh, A.H.

1982-01-01

In this paper, we consider the parallel solution of recurrences, and linear systems in the regular algebra of Carre. These problems are equivalent to solving the shortest path problem in graph theory, and they also arise in the analysis of Fortran programs. Our methods for solving linear systems in the regular algebra are analogues of well-known methods for solving systems of linear algebraic equations. A parallel version of Dijkstra's method, which has no linear algebraic analogue, is presented. Considerations for choosing an algorithm when the problem is large and sparse are also discussed

Optimization of municipal solid waste collection and transportation routes

Energy Technology Data Exchange (ETDEWEB)

Das, Swapan, E-mail: swapan2009sajal@gmail.com; Bhattacharyya, Bidyut Kr., E-mail: bidyut53@yahoo.co.in

2015-09-15

Graphical abstract: Display Omitted - Highlights: • Profitable integrated solid waste management system. • Optimal municipal waste collection scheme between the sources and waste collection centres. • Optimal path calculation between waste collection centres and transfer stations. • Optimal waste routing between the transfer stations and processing plants. - Abstract: Optimization of municipal solid waste (MSW) collection and transportation through source separation becomes one of the major concerns in the MSW management system design, due to the fact that the existing MSW management systems suffer by the high collection and transportation cost. Generally, in a city different waste sources scatter throughout the city in heterogeneous way that increase waste collection and transportation cost in the waste management system. Therefore, a shortest waste collection and transportation strategy can effectively reduce waste collection and transportation cost. In this paper, we propose an optimal MSW collection and transportation scheme that focus on the problem of minimizing the length of each waste collection and transportation route. We first formulize the MSW collection and transportation problem into a mixed integer program. Moreover, we propose a heuristic solution for the waste collection and transportation problem that can provide an optimal way for waste collection and transportation. Extensive simulations and real testbed results show that the proposed solution can significantly improve the MSW performance. Results show that the proposed scheme is able to reduce more than 30% of the total waste collection path length.

Optimization of municipal solid waste collection and transportation routes

International Nuclear Information System (INIS)

Das, Swapan; Bhattacharyya, Bidyut Kr.

2015-01-01

Graphical abstract: Display Omitted - Highlights: • Profitable integrated solid waste management system. • Optimal municipal waste collection scheme between the sources and waste collection centres. • Optimal path calculation between waste collection centres and transfer stations. • Optimal waste routing between the transfer stations and processing plants. - Abstract: Optimization of municipal solid waste (MSW) collection and transportation through source separation becomes one of the major concerns in the MSW management system design, due to the fact that the existing MSW management systems suffer by the high collection and transportation cost. Generally, in a city different waste sources scatter throughout the city in heterogeneous way that increase waste collection and transportation cost in the waste management system. Therefore, a shortest waste collection and transportation strategy can effectively reduce waste collection and transportation cost. In this paper, we propose an optimal MSW collection and transportation scheme that focus on the problem of minimizing the length of each waste collection and transportation route. We first formulize the MSW collection and transportation problem into a mixed integer program. Moreover, we propose a heuristic solution for the waste collection and transportation problem that can provide an optimal way for waste collection and transportation. Extensive simulations and real testbed results show that the proposed solution can significantly improve the MSW performance. Results show that the proposed scheme is able to reduce more than 30% of the total waste collection path length

StateGEN/StateNET - A structured method to perform route comparisons

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

StateGEN/StateNET is a modeling structure and routing algorithm designed expressly to address the needs of state and local governments to perform analyses of routing alternatives. StateGEN/StateNET is designed to permit the user to construct a network and assign attributes of interest to the network on a personal computer (PC). The completed network is then transferred via a modem to the TRANSNET system and the preferred route is determined based upon attribute weights assigned by the user. This modeling structure permits the state or local government to perform a routing analysis, such as that required by the US Department of Transportation (DOT) for Highway Route-Controlled Quantity shipments of radioactive materials, with a minimum of resources. StateGEN/StateNET provides a computerized version of the DOT guidelines or allows the user to structure their own network parameters. Sandia National Laboratories (SNL) is the Department of Energy (DOE) lead organization for transportation research and development. The DOE Office of Defense Programs has been the prime sponsor of development of models and associated databases used to analyze the impacts of the transportation of radioactive materials. The routing algorithms used in StateGEN/StateNET were based on the existing models on TRANSNET, a system which was developed to enable outside users to access analytical codes and associated data developed for the DOE

StateGEN/StateNET--A structured method to perform route comparisons

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

StateGEN/StateNET is a modelling structure and routing algorithm designed expressly to address the needs of state and local governments to perform analyses of routing alternatives. StateGEN/StateNET is designed to permit the user to construct a network and assign attributes of interest to the network on a personal computer (PC). The completed network is then transferred via a modem to the TRANSNET system (Cashwell, 1989) and the preferred route is determined based upon attribute weights assigned by the user. This modelling structure permits the state or local to perform a routing analysis, such as that required by the US Department of Transportation (DOT) for Highway Route-Controlled Quantity shipments of radioactive materials, with a minimum of resources. StateGEN/StateNET provides a computerized version of the DOT guidelines (Cashwell, 1989) or allows the user to structure their own network parameters. Sandia national Laboratories (SNL) is the Department of Energy's (DOE) lead organization for transportation research and development. The DOE Office of Defense Programs has been the prime sponsor of development of models and associated databases used to analyze the impacts of the transportation of radioactive materials. The routing algorithms used in StateGEN/StateNET were based on the existing models on TRANSNET, a system which was developed to enable outside users to access analytical codes and associated data developed for the DOE. 2 refs

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

Full Text Available Aiming at the problem of navigation error caused by unified earth model in great circle route planning using sphere model and modern navigation equipment using ellipsoid mode, a method of great ellipse route planning based on space vector is studied. By using space vector algebra method, the vertex of great ellipse is solved directly, and description of great ellipse based on major-axis vector and minor-axis vector is presented. Then calculation formulas of great ellipse azimuth and distance are deduced using two basic vectors. Finally, algorithms of great ellipse route planning are studied, especially equal distance route planning algorithm based on Newton-Raphson(N-R method. Comparative examples show that the difference of route planning between great circle and great ellipse is significant, using algorithms of great ellipse route planning can eliminate the navigation error caused by the great circle route planning, and effectively improve the accuracy of navigation calculation.

Impacts of Different Mobile User Interfaces on Students’ Satisfaction for Learning Dijkstra’s Shortest Path Algorithm

Directory of Open Access Journals (Sweden)

Mazyar Seraj

2014-10-01

Full Text Available This paper describes an experimental study of learning Dijkstra’s shortest path algorithm on mobile devices. The aim of the study is to investigate and compare the impacts of two different mobile screen user interfaces on students’ satisfaction for learning the technical subject. A mobile learning prototype was developed for learning Dijkstra’s shortest path algorithm on Apple iPhone 4 operated on iPhone operating system (iOS, and Acer Inconia Tab operated on an Android operating system. Thirty students, who are either currently studying or had previously studied Computer Networks, were recruited for the usability trial. At the end of each single session, students’ satisfaction interacting with the two mobile devices was measured using QUIS questionnaire. Although there is no significant difference in students’ satisfaction between the two different mobile screen interfaces, the subjective findings indicate that Acer Inconia Tab gained higher scores as compared to Apple iPhone 4.

Study of QoS control and reliable routing method for utility communication network. Application of differentiated service to the network and alternative route establishment by the IP routing protocol; Denryokuyo IP network no QoS seigyo to shinraisei kakuho no hoho. DiffServ ni yoru QoS seigyo no koka to IP ni yoru fuku root ka no kento

Energy Technology Data Exchange (ETDEWEB)

Oba, E.

2000-05-01

QoS control method which satisfies utilities communication network requirement and alternative route establishment method which is for sustaining communication during a failure are studied. Applicability of DiffServ (Differentiated Service), one of the most promising QoS control method on IP network and studying energetically in IETF WG, is studied and it is found most application used in the utility communication network except for relaying system information could he accommodated to the DiffServ network. An example of the napping of the utility communication applications to the DiffServ PHB (Per Hop Behavior) is shown in this paper. Regarding to the alternative route, usual IP routing protocol cannot establish alternative route which doesn't have common links and nodes in their paths for a destination. IP address duplication with some modification of routing protocol enables such alternative route establishment. MPLS, distance vector algorithm and link state algorithm are evaluated qualitatively, and as a result, we found MPLS is promising way to establish the route. Quantitative evaluation will be future work. (author)

Rancang Bangun Transportasi Logistik Kakao Agroindustri Coklat Kabupaten Pidie Jaya Provinsi Aceh

Directory of Open Access Journals (Sweden)

Yusriana Yusriana

2013-02-01

Full Text Available Factual problems of the cocoa bean agroindustry at Pidie Jaya District, Aceh Province were large distances between farmers and processor, thus determining the shortest part route, backhaul location and quality risk becomes critically to the assess. The objective this research are to determine shortest route based on the location of suppliers, back location, and risk quality recommendations. Requirement of shortest part route solved by Algorithm Djisktra, Backhaul location with MPE and Risk management quality by Multi Expert Multi Criteria Decision Making, aggregation criteria with OWA. The result of the study shows that the shortest distance suppliers Aceh Timur District was 282km, Aceh Utara District 116km, Bireuen District 57km, Pidie District 24km and Aceh Tenggara District 391km. Backhaul location sat Aceh Tengah District with a value of MPE(6533. Alternative of quality risk management were direct fermentation, improvement of transport facilities and container with a high rating criteria, thus the agroindustry has to focus on this dimension.

Guidelines for selecting preferred highway routes for highway-route-controlled quantity shipments of radioactive materials

International Nuclear Information System (INIS)

1989-01-01

The document presents guidelines for use by State officials in selecting preferred routes for highway route controlled quantity shipments of radioactive materials. A methodology for analyzing and comparing safety factors of alternative routes is described. Technical information on the impacts of radioactive material transportation needed to apply the methodology is also presented. Application of the methodology will identify the route (or set of routes) that minimizes the radiological impacts from shipments of these radioactive materials within a given State. Emphasis in the document is on practical application of the methodology. Some details of the derivation of the methods and data are presented in the appendices. All references in the body of the report can be found listed in the Bibliography (Appendix F)

THE METHODS OF TRAFFIC ENGINEERING’S OPTIMIZATION IN CASE OF DATA TRANSFER BY TWO ROUTS

Directory of Open Access Journals (Sweden)

Vera Petrovna Khoborova

2018-05-01

Full Text Available To prevent congestion in certain sections of multi-service networks, data flow management, which leads to a more proportional distribution of resources and improved network functioning, is implemented. The task of selecting routes for individual data streams (traffic class, taking into account requirements of QoS, is solved by the methods of traffic engineering. With the help of these methods, it is strived to load all the network resources maximally and balanced, so that the network, with a given level of service quality, has high total capacity as much as possible. However, at the present time, there are no rigorous well-founded solutions for the problem of distributing data flows between the selected routes, taking into account the possibility of additional control over their capacity. The article proposes a method for optimizing the distribution of data flows and the bandwidth of the channels (routes used in each separate information direction, with different coordination of control actions at adjacent levels of the network architecture. We consider scientific and technical proposals for the implementation of the developed method as part of the mechanisms that implement the traffic engineering in modern multiservice networks. Purpose: increasing the efficiency of the multiservice network by optimizing the traffic engineering. Methodology in article analytical methods for solving optimization problems with a non-linear objective function and linear constraints are used. Results: analytical expressions were obtained for the optimal distribution of data flows and bandwidth of the used channels, which provides the minimum values of delay indicators, and the use of these expressions in calculations in the mechanisms of traffic engineering was suggested. Practical implications: the obtained results should be used in modern multiservice networks, which are implemented data flow management through the traffic engineering in order to improve the

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

Multi-Attribute Decision Theory is applied to rank II alternative routes to nuclear proliferation in order of difficulty in acquiring nuclear weapons by nonnuclear countries. The method is based on reducing the various variables affecting the decision to a single function providing a measure for the proliferation route. The results indicate that the most difficult route to obtain atomic weapons is through nuclear power reactors, specifically the liquid-metal fast breeder reactor, heavy water Canada deuterium uranium reactor, and light water reactors such as boiling water and pressurized water reactors. The easiest routes are supercritical centrifuge isotope separation, laser isotope separation, and research reactor. However, nonnuclear routes available that result in substantial damage to life and property are easier than any nuclear route

Influence of drag force upon the shortest time trajectory of an aircraft

Directory of Open Access Journals (Sweden)

Andrei CRAIFALEANU

2015-06-01

Full Text Available The shortest time trajectory of an aircraft between two given locations is determined using a simple mathematical model. By taking into account the drag force (viscous friction force with the air, a problem of variational calculus is obtained which consists in determining two functions that minimize a functional, subject to a non-holonomic constraint. The trajectory is determined directly, by numerical integration of Euler equations with multipliers. Three types of drag forces were considered: constant, linear and quadratic. The results are verified through comparison to the values obtained from numerical minimization of the involved functional approximate forms.

On Intelligent Design and Planning Method of Process Route Based on Gun Breech Machining Process

Science.gov (United States)

Hongzhi, Zhao; Jian, Zhang

2018-03-01

The paper states an approach of intelligent design and planning of process route based on gun breech machining process, against several problems, such as complex machining process of gun breech, tedious route design and long period of its traditional unmanageable process route. Based on gun breech machining process, intelligent design and planning system of process route are developed by virtue of DEST and VC++. The system includes two functional modules--process route intelligent design and its planning. The process route intelligent design module, through the analysis of gun breech machining process, summarizes breech process knowledge so as to complete the design of knowledge base and inference engine. And then gun breech process route intelligently output. On the basis of intelligent route design module, the final process route is made, edited and managed in the process route planning module.

QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network

Directory of Open Access Journals (Sweden)

Chih-Chao Wen

2012-01-01

Full Text Available With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

Science.gov (United States)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

A Genetic Algorithm on Inventory Routing Problem

Directory of Open Access Journals (Sweden)

Nevin Aydın

2014-03-01

Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.

Mapping cattle trade routes in southern Somalia: a method for mobile livestock keeping systems.

Science.gov (United States)

Tempia, S; Braidotti, F; Aden, H H; Abdulle, M H; Costagli, R; Otieno, F T

2010-12-01

The Somali economy is the only one in the world in which more than half the population is dependent on nomadic pastoralism. Trade typically involves drovers trekking animals over long distances to markets. A pilot approach for mapping trade routes was undertaken, using the Afmadow to Garissa routes in southern Somalia. The methodology included conducting a workshop with traders to gather preliminary information about the most-used routes and general husbandry practices and training selected drovers to collect data about key features along the routes, using hand-held global positioning system (GPS) devices, radio collar GPS and pictorial data forms. Collected data were then integrated into geographic information systems for analysis. The resultant spatial maps describe the Afmadow to Garissa routes, the speed of livestock movement along these routes and relevant environmental and social features affecting this speed. These data are useful for identifying critical control points for health screening along the routes, which may enable the establishment of a livestock certification system in nomadic pastoral environments.

Technical note: Quantification of neurocranial shape variation using the shortest paths connecting pairs of anatomical landmarks.

Science.gov (United States)

Morita, Yusuke; Ogihara, Naomichi; Kanai, Takashi; Suzuki, Hiromasa

2013-08-01

Three-dimensional geometric morphometric techniques have been widely used in quantitative comparisons of craniofacial morphology in humans and nonhuman primates. However, few anatomical landmarks can actually be defined on the neurocranium. In this study, an alternative method is proposed for defining semi-landmarks on neurocranial surfaces for use in detailed analysis of cranial shape. Specifically, midsagittal, nuchal, and temporal lines were approximated using Bezier curves and equally spaced points along each of the curves were defined as semi-landmarks. The shortest paths connecting pairs of anatomical landmarks as well as semi-landmarks were then calculated in order to represent the surface morphology between landmarks using equally spaced points along the paths. To evaluate the efficacy of this method, the previously outlined technique was used in morphological analysis of sexual dimorphism in modern Japanese crania. The study sample comprised 22 specimens that were used to generate 110 anatomical semi-landmarks, which were used in geometric morphometric analysis. Although variations due to sexual dimorphism in human crania are very small, differences could be identified using the proposed landmark placement, which demonstrated the efficacy of the proposed method. Copyright © 2013 Wiley Periodicals, Inc.

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2008-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

Optimal routing for efficient municipal solid waste transportation by using ArcGIS application in Chennai, India.

Science.gov (United States)

Sanjeevi, V; Shahabudeen, P

2016-01-01

Worldwide, about US$410 billion is spent every year to manage four billion tonnes of municipal solid wastes (MSW). Transport cost alone constitutes more than 50% of the total expenditure on solid waste management (SWM) in major cities of the developed world and the collection and transport cost is about 85% in the developing world. There is a need to improve the ability of the city administrators to manage the municipal solid wastes with least cost. Since 2000, new technologies such as geographical information system (GIS) and related optimization software have been used to optimize the haul route distances. The city limits of Chennai were extended from 175 to 426 km(2) in 2011, leading to sub-optimum levels in solid waste transportation of 4840 tonnes per day. After developing a spatial database for the whole of Chennai with 200 wards, the route optimization procedures have been run for the transport of solid wastes from 13 wards (generating nodes) to one transfer station (intermediary before landfill), using ArcGIS. The optimization process reduced the distances travelled by 9.93%. The annual total cost incurred for this segment alone is Indian Rupees (INR) 226.1 million. Savings in terms of time taken for both the current and shortest paths have also been computed, considering traffic conditions. The overall savings are thus very meaningful and call for optimization of the haul routes for the entire Chennai. © The Author(s) 2015.

The impact of short term traffic forecasting on the effectiveness of vehicles routes planning in urban areas

Energy Technology Data Exchange (ETDEWEB)

Kubek, D.

2016-07-01

An impossibility to foresee in advance the accurate traffic parameters in face of dynamism phenomena in complex transportation system is a one of the major source of uncertainty. The paper presents an approach to robust optimization of logistics vehicle routes in urban areas on the basis of estimated short-term traffic time forecasts in a selected area of the urban road network. The forecast values of optimization parameters have been determined using the spectral analysis model, taking into account the forecast uncertainty degree. The robust counterparts approach of uncertain bi-criteria shortest path problem formulation is used to determining the robust routes for logistics vehicles in the urban network. The uncertainty set is created on the basis of forecast travel times in chosen sections, estimated by means of spectral analysis. The advantages and the characteristics are exemplified in the actual Krakow road network. The obtained data have been compared with classic approach wherein it is assumed that the optimization parameters are certain and accurate. The results obtained in the simulation example indicate that use of forecasting techniques with robust optimization models has a positive impact on the quality of final solutions. (Author)

Optimizing Departure Times in Vehicle Routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2011-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

Flood routing in ungauged catchments using Muskingum methods ...

African Journals Online (AJOL)

Flood-routing techniques are utilised to estimate the stages, or rates of flow, in order to predict flood wave propagation along river reaches. Models can be developed for gauged catchments and their parameters related to physical characteristics such as slope, reach width, reach length so that the approach can be applied ...

Particle swarm optimization for determining shortest distance to voltage collapse

Energy Technology Data Exchange (ETDEWEB)

Arya, L.D.; Choube, S.C. [Electrical Engineering Department, S.G.S.I.T.S. Indore, MP 452 003 (India); Shrivastava, M. [Electrical Engineering Department, Government Engineering College Ujjain, MP 456 010 (India); Kothari, D.P. [Centre for Energy Studies, Indian Institute of Technology, Delhi (India)

2007-12-15

This paper describes an algorithm for computing shortest distance to voltage collapse or determination of CSNBP using PSO technique. A direction along CSNBP gives conservative results from voltage security view point. This information is useful to the operator to steer the system away from this point by taking corrective actions. The distance to a closest bifurcation is a minimum of the loadability given a slack bus or participation factors for increasing generation as the load increases. CSNBP determination has been formulated as an optimization problem to be used in PSO technique. PSO is a new evolutionary algorithm (EA) which is population based inspired by the social behavior of animals such as fish schooling and birds flocking. It can handle optimization problems with any complexity since mechanization is simple with few parameters to be tuned. The developed algorithm has been implemented on two standard test systems. (author)

Indoor 3D Route Modeling Based On Estate Spatial Data

Science.gov (United States)

Zhang, H.; Wen, Y.; Jiang, J.; Huang, W.

2014-04-01

Indoor three-dimensional route model is essential for space intelligence navigation and emergency evacuation. This paper is motivated by the need of constructing indoor route model automatically and as far as possible. By comparing existing building data sources, this paper firstly explained the reason why the estate spatial management data is chosen as the data source. Then, an applicable method of construction three-dimensional route model in a building is introduced by establishing the mapping relationship between geographic entities and their topological expression. This data model is a weighted graph consist of "node" and "path" to express the spatial relationship and topological structure of a building components. The whole process of modelling internal space of a building is addressed by two key steps: (1) each single floor route model is constructed, including path extraction of corridor using Delaunay triangulation algorithm with constrained edge, fusion of room nodes into the path; (2) the single floor route model is connected with stairs and elevators and the multi-floor route model is eventually generated. In order to validate the method in this paper, a shopping mall called "Longjiang New City Plaza" in Nanjing is chosen as a case of study. And the whole building space is constructed according to the modelling method above. By integrating of existing path finding algorithm, the usability of this modelling method is verified, which shows the indoor three-dimensional route modelling method based on estate spatial data in this paper can support indoor route planning and evacuation route design very well.

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

Science.gov (United States)

Jara, Nicolás; Vallejos, Reinaldo; Rubino, Gerardo

2017-11-01

The design of optical networks decomposes into different tasks, where the engineers must basically organize the way the main system's resources are used, minimizing the design and operation costs and respecting critical performance constraints. More specifically, network operators face the challenge of solving routing and wavelength dimensioning problems while aiming to simultaneously minimize the network cost and to ensure that the network performance meets the level established in the Service Level Agreement (SLA). We call this the Routing and Wavelength Dimensioning (R&WD) problem. Another important problem to be solved is how to deal with failures of links when the network is operating. When at least one link fails, a high rate of data loss may occur. To avoid it, the network must be designed in such a manner that upon one or multiple failures, the affected connections can still communicate using alternative routes, a mechanism known as Fault Tolerance (FT). When the mechanism allows to deal with an arbitrary number of faults, we speak about Multiple Fault Tolerance (MFT). The different tasks before mentioned are usually solved separately, or in some cases by pairs, leading to solutions that are not necessarily close to optimal ones. This paper proposes a novel method to simultaneously solve all of them, that is, the Routing, the Wavelength Dimensioning, and the Multiple Fault Tolerance problems. The method allows to obtain: a) all the primary routes by which each connection normally transmits its information, b) the additional routes, called secondary routes, used to keep each user connected in cases where one or more simultaneous failures occur, and c) the number of wavelengths available at each link of the network, calculated such that the blocking probability of each connection is lower than a pre-determined threshold (which is a network design parameter), despite the occurrence of simultaneous link failures. The solution obtained by the new algorithm is

Optimization of municipal solid waste collection and transportation routes.

Science.gov (United States)

Das, Swapan; Bhattacharyya, Bidyut Kr

2015-09-01

Optimization of municipal solid waste (MSW) collection and transportation through source separation becomes one of the major concerns in the MSW management system design, due to the fact that the existing MSW management systems suffer by the high collection and transportation cost. Generally, in a city different waste sources scatter throughout the city in heterogeneous way that increase waste collection and transportation cost in the waste management system. Therefore, a shortest waste collection and transportation strategy can effectively reduce waste collection and transportation cost. In this paper, we propose an optimal MSW collection and transportation scheme that focus on the problem of minimizing the length of each waste collection and transportation route. We first formulize the MSW collection and transportation problem into a mixed integer program. Moreover, we propose a heuristic solution for the waste collection and transportation problem that can provide an optimal way for waste collection and transportation. Extensive simulations and real testbed results show that the proposed solution can significantly improve the MSW performance. Results show that the proposed scheme is able to reduce more than 30% of the total waste collection path length. Copyright © 2015 Elsevier Ltd. All rights reserved.

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

Directory of Open Access Journals (Sweden)

Baozhen Yao

2014-02-01

Full Text Available This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

Vehicle routing problem in investment fund allocation

Science.gov (United States)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Mohd, Ismail

2013-04-01

Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2014-06-01

Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.

Dynamic shortest path problems : hybrid routing policies considering network disruptions

NARCIS (Netherlands)

Sever, D.; Dellaert, N.P.; Woensel, van T.; Kok, de A.G.

2013-01-01

Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption

Analysing Performance Characteristics of Biomass Haulage in Ireland for Bioenergy Markets with GPS, GIS and Fuel Diagnostic Tools

Directory of Open Access Journals (Sweden)

Amanda Sosa

2015-10-01

Full Text Available In Ireland, truck transport by road dominates and will remain the main transportation mode of biomass. Cost efficiency and flexibility of forest transport can be typically improved by optimising routes. It is important to know every process and attributes within the workflow of roundwood transport. This study aimed to analyse characteristics of timber trucking in Ireland, and to estimate the least-cost route for the distribution of biomass with the use of geographic information systems (GIS. Firstly, a tracking system that recorded the truck’s movements and fuel consumption was installed. A total of 152 trips were recorded, routes were chosen by the truck driver. The recorded information was used to analyse the distances and times travelled loaded and unloaded per road class, breaks, loading and unloading times as well as fuel consumption. Secondly, the routes taken by the truck where compared with routes created using Network Analyst (NA, an extension of ArcGIS. Four scenarios based on route selection criteria were selected: shortest distance (S1, shorted time (S2, and prioritising high-class roads with shortest distance (S3 and time (S4. Results from the analysis of the tracking system data showed that driving both loaded and unloaded occupied on average 69% of the driver’s working shift; with an average time driving loaded of 49%. The travel distance per trip varied from 112 km and 197 km, with the truck driver using mostly national and regional roads. An average 2% of the total distance and 11% of the total time was spent driving on forest roads. In general, the truck’s speed recorded on the different road classes was on average 30% lower than the legal maximum speed. The average fuel consumption was 0.64 L/km. In terms of the route comparison, the driving directions from the truck routes coincided with 77% of the directions of the routes based on shortest driving time (S2 and S4. All the routes chosen by the driver had 22% longer

Cooperative Route Planning for Multiple Aircraft in a Semifree ATC System

Directory of Open Access Journals (Sweden)

Yi Yang

2018-01-01

Full Text Available This paper presents the Semifree Flight theory used in a civil air traffic control (ATC system to improve the capability of the traditional Free Flight mode. The progressiveness and hidden defects of the “Free Flight” model in civil aviation are analysed, and the Semifree Flight ATC system mode is introduced. Moreover, this paper presents the collaborative route planning method, which is the most important method used in the Semifree Flight ATC system. This collaborative route planning method can plan routes for each aircraft (either in flight or just before achieving flight in real time, and the routes can satisfy all the safety constraints. The final numerical simulations verify the correctness and practicability of the Semifree Flight theory and the collaborative route planning method.

Human risk assessment of dermal and inhalation exposures to chemicals assessed by route-to-route extrapolation: the necessity of kinetic data.

Science.gov (United States)

Geraets, Liesbeth; Bessems, Jos G M; Zeilmaker, Marco J; Bos, Peter M J

2014-10-01

In toxicity testing the oral route is in general the first choice. Often, appropriate inhalation and dermal toxicity data are absent. Risk assessment for these latter routes usually has to rely on route-to-route extrapolation starting from oral toxicity data. Although it is generally recognized that the uncertainties involved are (too) large, route-to-route extrapolation is applied in many cases because of a strong need of an assessment of risks linked to a given exposure scenario. For an adequate route-to-route extrapolation the availability of at least some basic toxicokinetic data is a pre-requisite. These toxicokinetic data include all phases of kinetics, from absorption (both absorbed fraction and absorption rate for both the starting route and route of interest) via distribution and biotransformation to excretion. However, in practice only differences in absorption between the different routes are accounted for. The present paper demonstrates the necessity of route-specific absorption data by showing the impact of its absence on the uncertainty of the human health risk assessment using route-to-route extrapolation. Quantification of the absorption (by in vivo, in vitro or in silico methods), particularly for the starting route, is considered essential. Copyright © 2014 Elsevier Inc. All rights reserved.

A new hybrid GA-PSO method for solving multi-period inventory routing problem with considering financial decisions

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2013-09-01

Full Text Available Integration of various logistical components in supply chain management, such as transportation, inventory control and facility location are becoming common practice to avoid sub-optimization in nowadays’ competitive environment. The integration of transportation and inventory decisions is known as inventory routing problem (IRP in the literature. The problem aims to determine the delivery quantity for each customer and the network routes to be used in each period, so that the total inventory and transportation costs are to be minimized. On the contrary of conventional IRP that each retailer can only provide its demand from the supplier, in this paper, a new multi-period, multi-item IRP model with considering lateral trans-shipment, back-log and financial decisions is proposed as a business model in a distinct organization. The main purpose of this paper is applying an applicable inventory routing model with considering real world setting and solving it with an appropriate method.

On line routing per mobile phone

DEFF Research Database (Denmark)

Bieding, Thomas; Görtz, Simon; Klose, Andreas

2009-01-01

On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology....... Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones...

Occurrence of radon in the Polish underground tourist routes

Directory of Open Access Journals (Sweden)

Jerzy Olszewski

2015-08-01

Full Text Available Background: There are about 200 underground tourist routes in Poland. There are caves, mines or underground structures. This paper presents the results of the research intended to identify the extent of the occurrence of radon concentrations in underground areas of tourist routes. Material and Methods: We conducted the measurement of periodic concentrations of radon (1–2 months in the summer using type Tastrak trace detectors. We determined the average concentrations of radon in air in 66 underground tourist routes in Poland. Results: The research results comprise 259 determinations of average radon concentrations in 66 routes. The arithmetic average of the results was 1610 Bqm–3, and the maximum measured concentration was over 20 000 Bqm–3. The minimum concentration was 100 Bqm–3 (threshold method considering the arithmetic average of the measurements. It was found that in 67% of the routes, the average concentration of radon has exceeded 300 Bqm–3 and in 22 underground routes it exceeded 1000 Bqm–3. Conclusions: Radon which occurs in many Polish underground tourist routes may be an organizational, legal and health problem. It is necessary to develop a program of measures to reduce radon concentrations in underground routes, especially routes located in the former mines. Med Pr 2015;66(4:557–563

Routing Unmanned Vehicles in GPS-Denied Environments

OpenAIRE

Sundar, Kaarthik; Misra, Sohum; Rathinam, Sivakumar; Sharma, Rajnikant

2017-01-01

Most of the routing algorithms for unmanned vehicles, that arise in data gathering and monitoring applications in the literature, rely on the Global Positioning System (GPS) information for localization. However, disruption of GPS signals either intentionally or unintentionally could potentially render these algorithms not applicable. In this article, we present a novel method to address this difficulty by combining methods from cooperative localization and routing. In particular, the article...

Computer-based route-definition system for peripheral bronchoscopy.

Science.gov (United States)

Graham, Michael W; Gibbs, Jason D; Higgins, William E

2012-04-01

Multi-detector computed tomography (MDCT) scanners produce high-resolution images of the chest. Given a patient's MDCT scan, a physician can use an image-guided intervention system to first plan and later perform bronchoscopy to diagnostic sites situated deep in the lung periphery. An accurate definition of complete routes through the airway tree leading to the diagnostic sites, however, is vital for avoiding navigation errors during image-guided bronchoscopy. We present a system for the robust definition of complete airway routes suitable for image-guided bronchoscopy. The system incorporates both automatic and semiautomatic MDCT analysis methods for this purpose. Using an intuitive graphical user interface, the user invokes automatic analysis on a patient's MDCT scan to produce a series of preliminary routes. Next, the user visually inspects each route and quickly corrects the observed route defects using the built-in semiautomatic methods. Application of the system to a human study for the planning and guidance of peripheral bronchoscopy demonstrates the efficacy of the system.

Route-Based Signal Preemption Control of Emergency Vehicle

Directory of Open Access Journals (Sweden)

Haibo Mu

2018-01-01

Full Text Available This paper focuses on the signal preemption control of emergency vehicles (EV. A signal preemption control method based on route is proposed to reduce time delay of EV at intersections. According to the time at which EV is detected and the current phase of each intersection on the travelling route of EV, the calculation methods of the earliest start time and the latest start time of green light at each intersection are given. Consequently, the effective time range of green light at each intersection is determined in theory. A multiobjective programming model, whose objectives are the minimal residence time of EV at all intersections and the maximal passing numbers of general society vehicles, is presented. Finally, a simulation calculation is carried out. Calculation results indicate that, by adopting the signal preemption method based on route, the delay of EV is reduced and the number of society vehicles passing through the whole system is increased. The signal preemption control method of EV based on route can reduce the time delay of EV and improve the evacuation efficiency of the system.

Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

Deduction of passengers' route choice from smart card data

NARCIS (Netherlands)

Van Der Hurk, Evelien; Kroon, Leo; Maroti, Gabor; Vervest, Peter

2013-01-01

Deducing passengers' route choice from smart card data provides public transport operators the opportunity to evaluate passenger service. Especially in case of disruptions when route choice models may not be valid this is an advantage. This paper proposes a method for deducing the chosen route of

ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2

Directory of Open Access Journals (Sweden)

David S. Hardin

2013-04-01

Full Text Available As Graphics Processing Units (GPUs have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from CPU to GPU, however, raises the question: how do we know that these new GPU-based algorithms are correct? In order to explore this new verification frontier, we formalized a parallelizable all-pairs shortest path (APSP algorithm for weighted graphs, originally coded in NVIDIA's CUDA language, in ACL2. The ACL2 specification is written using a single-threaded object (stobj and tail recursion, as the stobj/tail recursion combination yields the most straightforward translation from imperative programming languages, as well as efficient, scalable executable specifications within ACL2 itself. The ACL2 version of the APSP algorithm can process millions of vertices and edges with little to no garbage generation, and executes at one-sixth the speed of a host-based version of APSP coded in C – a very respectable result for a theorem prover. In addition to formalizing the APSP algorithm (which uses Dijkstra's shortest path algorithm at its core, we have also provided capability that the original APSP code lacked, namely shortest path recovery. Path recovery is accomplished using a secondary ACL2 stobj implementing a LIFO stack, which is proven correct. To conclude the experiment, we ported the ACL2 version of the APSP kernels back to C, resulting in a less than 5% slowdown, and also performed a partial back-port to CUDA, which, surprisingly, yielded a slight performance increase.

Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent

Directory of Open Access Journals (Sweden)

Petruseva Silvana

2006-01-01

Full Text Available This paper discusses the comparison of the efficiency of two algorithms, by estimation of their complexity. For solving the problem, the Neural Network Crossbar Adaptive Array (NN-CAA is used as the agent architecture, implementing a model of an emotion. The problem discussed is how to find the shortest path in an environment with n states. The domains concerned are environments with n states, one of which is the starting state, one is the goal state, and some states are undesirable and they should be avoided. It is obtained that finding one path (one solution is efficient, i.e. in polynomial time by both algorithms. One of the algorithms is faster than the other only in the multiplicative constant, and it shows a step forward toward the optimality of the learning process. However, finding the optimal solution (the shortest path by both algorithms is in exponential time which is asserted by two theorems. It might be concluded that the concept of subgoal is one step forward toward the optimality of the process of the agent learning. Yet, it should be explored further on, in order to obtain an efficient, polynomial algorithm.

Iconic memory-based omnidirectional route panorama navigation.

Science.gov (United States)

Yagi, Yasushi; Imai, Kousuke; Tsuji, Kentaro; Yachida, Masahiko

2005-01-01

A route navigation method for a mobile robot with an omnidirectional image sensor is described. The route is memorized from a series of consecutive omnidirectional images of the horizon when the robot moves to its goal. While the robot is navigating to the goal point, input is matched against the memorized spatio-temporal route pattern by using dual active contour models and the exact robot position and orientation is estimated from the converged shape of the active contour models.

Synthesis of graphene platelets by chemical and electrochemical route

Energy Technology Data Exchange (ETDEWEB)

Ramachandran, Rajendran; Felix, Sathiyanathan [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Joshi, Girish M. [Materials Physics Division, School of Advanced Sciences, VIT University, Vellore 632014, Tamil Nadu (India); Raghupathy, Bala P.C., E-mail: balapraveen2000@yahoo.com [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Research and Advanced Engineering Division (Materials), Renault Nissan Technology and Business Center India (P) Ltd., Chennai, Tamil Nadu (India); Jeong, Soon Kwan, E-mail: jeongsk@kier.re.kr [Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of); Grace, Andrews Nirmala, E-mail: anirmalagrace@vit.ac.in [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of)

2013-10-15

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH{sub 4} was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide.

Synthesis of graphene platelets by chemical and electrochemical route

International Nuclear Information System (INIS)

Ramachandran, Rajendran; Felix, Sathiyanathan; Joshi, Girish M.; Raghupathy, Bala P.C.; Jeong, Soon Kwan; Grace, Andrews Nirmala

2013-01-01

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH 4 was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide

The QKD network: model and routing scheme

Science.gov (United States)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

Implantable central venous chemoport: camparision of results according to approach routes and methods

International Nuclear Information System (INIS)

Shin, Byung Suck; Ahn, Moon Sang

2003-01-01

To evaluate the results and complications of placement of implantable port according to approach routes and methods. Between April 2001 and October 2002, a total of 103 implantable chemoport was placed in 95 patients for chemotherapy using preconnected type (n=39) and attachable type (n=64). Puncture sites were left subclavian vein (n=35), right subclavian vein (n=5), left internal jugular vein (n=9), right internal jugular vein (n=54). We evaluated duration of catheterization days, complications according to approach routes and methods. Implantable chemoport was placed successfully in all cases. Duration of catheterization ranged from 8 to 554 days(mean 159, total 17,872 catheter days). Procedure related complications occurred transient pulmonary air embolism (n=1), small hematoma (n=1) and malposition in using preconnected type (n=2). Late complications occurred catheter migration (n=5), catheter malfunction (n=3), occlusion (n=1) and infection (n=11). Among them 15 chemoport was removed (14.5%). Catheter migration was occured via subclavian vein in all cases (13%, p=.008). Infection developed in 10.7% of patients(0.61 per 1000 catheter days). There were no catheter-related central vein thrombosis. Implantation of chemoport is a safe procedure. Choice of right internal jugular vein than subclavian vain vein for puncture site has less complications. And selection of attachable type of chemoport is convenient than preconnected type. Adequate care of chemoport is essential for long patency

Analysis on picking plant sequence and route of transplanting robotic for column cultivation%面向立柱栽培的机器人移栽苗序与路径分析

Institute of Scientific and Technical Information of China (English)

刘继展; 刘炜; 毛罕平; 李萍萍

2014-01-01

为有效提高穴盘苗向立柱自动移栽的作业效率，以自主开发的螺旋式栽培立柱及其配套移栽机器人系统为对象，进行了无碰撞最短路径设计，进而对不同取苗-栽植方案的路径长度差异及其影响因素进行了分析。研究表明，面向立柱移栽时，单穴盘对1 m立柱移栽的累计路径长度差异在25%以上。取苗顺序对路径长度具有重要影响，其中“让苗”现象是造成累计路径长度差异的主要因素。立柱栽植顺序对路径长度的影响随立柱高度增加而显著增大，对3 m立柱移栽时16类取苗方案的自上至下植苗平均累计路径长度比自下至上高9.83%。稳定最优方案分别为最近相邻法和近端开始同向逐行或逐列取苗、自下至上栽植方案。研究成果对实现高效的立柱自动移栽具有积极意义。%Column cultivation is a promising high-yield mode in protected agriculture which has been studied and developed for several years. However, its extreme difficulty of manual management has hindered its popularization and application. As a result, an automatic operation of seedling transplanting to column was put forward. A new-type spiral cultivation column and matched seedling transplanting robot that was composed of rail-mounted autonomous vehicle, slide-arm type manipulator, double-needle electromagnet-driven end-effector, and a turning seedling supply device was developed. In view of the frequently repetitive operation of robotic seedling transplanting with changing starting and ending points of routes, the optimal design of a pick-plant sequence and non-collision shortest routing are essential to improving the success rate and efficiency. In robotic seedling transplanting, the route of a manipulator's ending is usually composed of picking an up-down route, a plant up-down route, and a transport route from pick top-point to plant top-point. For column cultivation, the transport route is quite

An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chow, Tommy W S

2010-01-01

An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

Efficiency of choice set generation methods for bicycle routes

DEFF Research Database (Denmark)

Halldórsdóttir, Katrín; Rieser-Schussler, Nadine; Axhausen, Kay W.

2014-01-01

for scenic routes, dedicated cycle lanes, and road type. Data consisted of 778 bicycle trips traced by GPS and carried out by 139 persons living in the Greater Copenhagen Area, in Denmark. Results suggest that both the breadth first search on link elimination and the doubly stochastic generation function...

Solving fuzzy shortest path problem by genetic algorithm

Science.gov (United States)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

Optimising social information by game theory and ant colony method to enhance routing protocol in opportunistic networks

Directory of Open Access Journals (Sweden)

Chander Prabha

2016-09-01

Full Text Available The data loss and disconnection of nodes are frequent in the opportunistic networks. The social information plays an important role in reducing the data loss because it depends on the connectivity of nodes. The appropriate selection of next hop based on social information is critical for improving the performance of routing in opportunistic networks. The frequent disconnection problem is overcome by optimising the social information with Ant Colony Optimization method which depends on the topology of opportunistic network. The proposed protocol is examined thoroughly via analysis and simulation in order to assess their performance in comparison with other social based routing protocols in opportunistic network under various parameters settings.

A Comparison of the Cluster-Span Threshold and the Union of Shortest Paths as Objective Thresholds of EEG Functional Connectivity Networks from Beta Activity in Alzhaimer’s Disease

OpenAIRE

Smith, K; Abasolo, Daniel Emilio; Escudero, J

2016-01-01

The Cluster-Span Threshold (CST) is a recently introduced unbiased threshold for functional connectivity networks. This binarisation technique offers a natural trade-off of sparsity and density of information by balancing the ratio of closed to open triples in the network topology. Here we present findings comparing it with the Union of Shortest Paths (USP), another recently proposed objective method. We analyse standard network metrics of binarised networks for sensitivity to clinical Alzhei...

A Novel Dedicated Route Protection Scheme for Survivability of Link Failure in Elastic Optical Networks

Directory of Open Access Journals (Sweden)

Sridhar Iyer

2017-11-01

Full Text Available The spectrally efficient transportation of the high bit rate(s data is achievable by the Elastic optical networks (EONs. However, in the EONs, owing to the failure occurrence even in an individual simple element, different service(s maybe interrupted. Hence, it is imperative that the schemes for survivability be developed so that the issues due to the possible failure(s can be overcome. In the current work, in view of survivability of the link failure(s in the EONs, we propose the Spectrum Continuity and Contiguity Established DRP (SCC-E-DRP algorithm which is a novel dedicated route protection (DRP scheme that attempts to avoid the problem of trap topology during its exploration for a pair of link disjoint path. Further, to evaluate the link disjoint paths, we resort to the use of the SCC Established Shortest Route (SCC-E-SR algorithm which is a modified Dijkstra’s algorithm based scheme that selects the path(s pair(s based on the end-toend SCC. We conduct extensive simulations considering realistic network topologies, and compare the performance of the SCCE-DRP scheme with the existing techniques. The obtained results show that, compared to the existing schemes, the SCC-E-DRP scheme achieves better results in terms of blocking probability.

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF 3 as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings

Estimating Common Pedestrian Routes through Indoor Path Networks using Position Traces

DEFF Research Database (Denmark)

Prentow, Thor Siiger; Blunck, Henrik; Grønbæk, Kaj

2014-01-01

routes between locations. These methods are sufficiently efficient to provide common routes based on real-time data from thousands of devices simultaneously. Furthermore, we show that the methods operate robustly even on basis of noisy and coarse-grained position estimates as provided by large......Abstract—Accurate information about how people commonly travel in a given large-scale building environment and which routes they take for given start and destination points is essential for applications such as indoor navigation, route prediction, and mobile work planning and logistics...

Optimization of the Municipal Waste Collection Route Based on the Method of the Minimum Pairing

Directory of Open Access Journals (Sweden)

Michal Petřík

2016-01-01

Full Text Available In the present article is shown the use of Maple program for processing of data describing the position of municipal waste sources and topology of collecting area. The data are further processed through the use of graph theory algorithms, which enable creation of collection round proposal. In this case study is described method of waste pick-up solution in a certain village of approx. 1,600 inhabitants and built-up area of approx. 30 hectares. Village has approx. 11.5 kilometers of ride able routes, with approx. 1 kilometer without waste source. The first part shows topology of the village in light of location of waste sources and capacity of the routes. In the second part are topological data converted into data that can be processed by use of the Graph Theory and the correspondent graph is shown. Optimizing collection route in a certain graph means to find the Euler circle. However, this circle can be constructed only on condition that all the vertices of the graph are of an even degree. Practically this means that is necessary to introduce auxiliary edges – paths that will be passed twice. These paths will connect vertices with odd values. The optimal solution then requires that the total length of the inserted edges was minimal possible, which corresponds to the minimum pairing method. As it is a problem of exponential complexity, it is necessary to make some simplifications. These simplifications are depicted graphically and the results are displayed in the conclusion. The resulting graph with embedded auxiliary edges can be used as a basic decision making material for creation of real collection round that respects local limitations such as one way streets or streets where is the waste collection is not possible from both sides at the same time.

Optimizing well intervention routes

Energy Technology Data Exchange (ETDEWEB)

Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

2000-07-01

This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

Science.gov (United States)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Simulation of product distribution at PT Anugrah Citra Boga by using capacitated vehicle routing problem method

Science.gov (United States)

Lamdjaya, T.; Jobiliong, E.

2017-01-01

PT Anugrah Citra Boga is a food processing industry that produces meatballs as their main product. The distribution system of the products must be considered, because it needs to be more efficient in order to reduce the shipment cost. The purpose of this research is to optimize the distribution time by simulating the distribution channels with capacitated vehicle routing problem method. Firstly, the distribution route is observed in order to calculate the average speed, time capacity and shipping costs. Then build the model using AIMMS software. A few things that are required to simulate the model are customer locations, distances, and the process time. Finally, compare the total distribution cost obtained by the simulation and the historical data. It concludes that the company can reduce the shipping cost around 4.1% or Rp 529,800 per month. By using this model, the utilization rate can be more optimal. The current value for the first vehicle is 104.6% and after the simulation it becomes 88.6%. Meanwhile, the utilization rate of the second vehicle is increase from 59.8% to 74.1%. The simulation model is able to produce the optimal shipping route with time restriction, vehicle capacity, and amount of vehicle.

Energy Route Multi-Objective Optimization of Wireless Power Transfer Network: An Improved Cross-Entropy Method

Directory of Open Access Journals (Sweden)

Lijuan Xiang

2017-06-01

Full Text Available This paper identifies the Wireless Power Transfer Network (WPTN as an ideal model for long-distance Wireless Power Transfer (WPT in a certain region with multiple electrical equipment. The schematic circuit and design of each power node and the process of power transmission between the two power nodes are elaborated. The Improved Cross-Entropy (ICE method is proposed as an algorithm to solve for optimal energy route. Non-dominated sorting is introduced for optimization. A demonstration of the optimization result of a 30-nodes WPTN system based on the proposed algorithm proves ICE method to be efficacious and efficiency.

Pharmacokinetics of Alternative Administration Routes of Melatonin

DEFF Research Database (Denmark)

Zetner, D.; Andersen, L. P.H.; Rosenberg, J.

2016-01-01

Background: Melatonin is traditionally administered orally but has a poor and variable bioavailability. This study aims to present an overview of studies investigating the pharmacokinetics of alternative administration routes of melatonin. Methods: A systematic literature search was performed...... and included experimental or clinical studies, investigating pharmacokinetics of alternative administration routes of melatonin in vivo. Alternative administration routes were defined as all administration routes except oral and intravenous. Results: 10 studies were included in the review. Intranasal....... Subcutaneous injection of melatonin displayed a rapid absorption rate compared to oral administration. Conclusion: Intranasal administration of melatonin has a large potential, and more research in humans is warranted. Transdermal application of melatonin has a possible use in a local application, due to slow...

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

Optimizing investment fund allocation using vehicle routing problem framework

Science.gov (United States)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita

2014-07-01

The objective of investment is to maximize total returns or minimize total risks. To determine the optimum order of investment, vehicle routing problem method is used. The method which is widely used in the field of resource distribution shares almost similar characteristics with the problem of investment fund allocation. In this paper we describe and elucidate the concept of using vehicle routing problem framework in optimizing the allocation of investment fund. To better illustrate these similarities, sectorial data from FTSE Bursa Malaysia is used. Results show that different values of utility for risk-averse investors generate the same investment routes.

Effect of crosstalk on component savings in multi-core fiber networks

DEFF Research Database (Denmark)

Nooruzzaman, Md; Morioka, Toshio

2017-01-01

We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks.......We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks....

A study of driver's route choice behavior based on evolutionary game theory.

Science.gov (United States)

Jiang, Xiaowei; Ji, Yanjie; Du, Muqing; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

I/O routing in a multidimensional torus network

Science.gov (United States)

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

2018-04-24

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

LITERATURE SURVEY ON EXISTING POWER SAVING ROUTING METHODS AND TECHNIQUES FOR INCREASING NETWORK LIFE TIME IN MANET

Directory of Open Access Journals (Sweden)

K Mariyappan

2017-06-01

Full Text Available Mobile ad hoc network (MANET is a special type of wireless network in which a collection of wireless mobile devices (called also nodes dynamically forming a temporary network without the need of any pre-existing network infrastructure or centralized administration. Currently, Mobile ad hoc networks (MANETs play a significant role in university campus, advertisement, emergency response, disaster recovery, military use in battle fields, disaster management scenarios, in sensor network, and so on. However, wireless network devices, especially in ad hoc networks, are typically battery-powered. Thus, energy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. This is due to the fact that failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes and sparse network connectivity, leading to a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the node and reduce energy consumption of the network. In this paper detail literature survey on existing energy efficient routing method are studied and compared for their performance under different condition. The result has shown that both the broadcast schemes and energy aware metrics have great potential in overcoming the broadcast storm problem associated with flooding. However, the performances of these approaches rely on either the appropriate selection of the broadcast decision parameter or an energy efficient path. In the earlier proposed broadcast methods, the forwarding probability is selected based on fixed probability or number of neighbors regardless of nodes battery capacity whereas in energy aware schemes energy inefficient node could be part of an established path. Therefore, in an attempt to remedy the paucity of research and to address the gaps identified in this area, a study

LEACH-A: An Adaptive Method for Improving LEACH Protocol

Directory of Open Access Journals (Sweden)

Jianli ZHAO

2014-01-01

Full Text Available Energy has become one of the most important constraints on wireless sensor networks. Hence, many researchers in this field focus on how to design a routing protocol to prolong the lifetime of the network. The classical hierarchical protocols such as LEACH and LEACH-C have better performance in saving the energy consumption. However, the choosing strategy only based on the largest residue energy or shortest distance will still consume more energy. In this paper an adaptive routing protocol named “LEACH-A” which has an energy threshold E0 is proposed. If there are cluster nodes whose residual energy are greater than E0, the node of largest residual energy is selected to communicated with the base station; When all the cluster nodes energy are less than E0, the node nearest to the base station is select to communication with the base station. Simulations show that our improved protocol LEACH-A performs better than the LEACH and the LEACH-C.

Hurricane Evacuation Routes

Data.gov (United States)

Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

Full Text Available The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.

Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

Science.gov (United States)

Liu, Qiang; Wang, Chengen

2012-08-01

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

Directory of Open Access Journals (Sweden)

Ahmad Maleki

2014-09-01

Full Text Available An important issue in ad-hoc on-demand distance vector (AODV routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561 using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

Research on the optimization of vehicle distribution routes in logistics enterprises

Science.gov (United States)

Fan, Zhigou; Ma, Mengkun

2018-01-01

With the rapid development of modern logistics, the vehicle routing problem has become one of the urgent problems in the logistics industry. The rationality of distribution route planning directly affects the efficiency and quality of logistics distribution. This paper first introduces the definition of logistics distribution and the three methods of optimizing the distribution routes, and then analyzes the current vehicle distribution route by using a representative example, finally puts forward the optimization schemes of logistics distribution route.

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Directory of Open Access Journals (Sweden)

Ji Ung Sun

2015-01-01

Full Text Available We consider a capacitated hub location-routing problem (HLRP which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

Research on the Method of Urban Waterlogging Flood Routing Based on Hexagonal Grid

Directory of Open Access Journals (Sweden)

LAI Guangling

2016-12-01

Full Text Available An evolution of the urban waterlogging flood routing was studied in this paper based on the method of hexagonal grid modeling. Using the method of discrete grid, established an urban geometry model on account of the regular multi-scale discrete grid. With the fusion of 3D topographic survey data and 2D building vector data, formed a regular network model of surface. This model took multi special block into account, such as urban terrain and buildings. On this basis, a method of reverse flow deduction was proposed, which was an inverse computation from the state of flood to the evolution process. That is, based on the water depth of flood, made use of the connectivity with the outfall to calculate the range of water logging, and then implemented the urban waterlogging flood simulation deduction. The test indicated that, this method can implement the evolution of urban waterlogging scenario deduction effectively. And the correlational research could provide scientific basis for urban disaster prevention and emergency decision-making.

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

Route selection for the transport of hazardous materials

Energy Technology Data Exchange (ETDEWEB)

Seiler, F A

1988-12-01

The factors governing the risk-weighted selection of routes for transport of hazardous materials are analyzed. Starting from a formulation for the total risk of these transports that assumes complete information, approximations for the more realistic case of partial and uncertain information are discussed. These approximations involve well-known risk assessment techniques and mathematical methods; among the latter, Monte Carlo calculations hold the most promise. The actual route selection is based on an index of total societal cost, evaluated for a set of potential routes. (author)

Capacitated Vehicle Routing with Nonuniform Speeds

DEFF Research Database (Denmark)

Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath

2016-01-01

is the distance traveled divided by its speed.Our algorithm relies on a new approximate minimum spanning tree construction called Level-Prim, which is related to but different from Light Approximate Shortest-path Trees. We also extend the widely used tour-splitting technique to nonuniform speeds, using ideas from...

An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Weiwei Yuan

2013-10-01

Full Text Available Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs. However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP, which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.

Routing of Electric Vehicles: City Distribution in Copenhagen

DEFF Research Database (Denmark)

Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

In this work, a Vehicle Routing Problem with Time Windows considering EV constraints of limited driving range and freight capacity is addressed (EVRPTW). The EVs are allowed to recharge at certain locations, and aspects of intelligent location of these recharging points are considered....... The objective is to find the least cost plan for EV routing and compare this to conventional routing. A heuristic method is developed and tested on data based on real-life collected data on distribution vehicles in central Copenhagen, Denmark. The EVRPTW has so far received little attention in the literature...

Planning routes around the world: International evidence for southern route preferences

NARCIS (Netherlands)

Brunyé, Tad T.; Andonova, Elena; Meneghetti, Chiara; Noordzij, Matthijs Leendert; Pazzaglia, Francesca; Wienemann, Rasmus; Mahoney, Caroline R.; Taylor, Holly A.

2012-01-01

Three studies test whether the southern route preference, which describes the tendency for route planners to disproportionately select south- rather than north-going routes, can be attributed to regional elevation patterns; specifically, we ask whether this effect replicates in three topographically

A Study of Driver’s Route Choice Behavior Based on Evolutionary Game Theory

Directory of Open Access Journals (Sweden)

Xiaowei Jiang

2014-01-01

Full Text Available This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers’ route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver’s route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver’s route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

Standalone Mobile Application for Shipping Services Based on Geographic Information System and A-Star Algorithm

Science.gov (United States)

Gunawan, D.; Marzuki, I.; Candra, A.

2018-03-01

Geographic Information Systems (GIS) plays an essential role in shipping service related application. By utilizing GIS, the courier can find the route to deliver goods for its customer. This research proposes a standalone mobile application to provide the shortest route to the destinations by utilizing geographic information systems with A-Star algorithm. This application is intended to be used although the area has no Internet network available. The developed application can handle several drop off points then calculates the shortest route that passes through all the drop off points. According to the conducted testing, the number of drop off points that can be calculated is influenced by the specification of the smartphone. More destinations require more smartphone resources and time to process.

Sigma Routing Metric for RPL Protocol

Directory of Open Access Journals (Sweden)

Paul Sanmartin

2018-04-01

Full Text Available This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX. However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption.

Software complex for finding the path routings in synchronous digital hierarchy networks

Directory of Open Access Journals (Sweden)

V. A. Bulanov

2014-01-01

Full Text Available Communication network constructions based on the synchronous digital hierarchy (SDH are widely used in design and operation of telephone networks and data transfer ones on the basis of dedicated links. The providing the link for data transmission from one node to another one is a nontrivial objective. The network equipment vendors, as a rule, may provide also a network system control. However, these systems can be used only with the manufacturer's equipment, but are not intended for finding the optimal paths for the current network operation. They serve for examination to choose a network structure at the stage of its development or modernization for the known in advance matrix of connections. From the practice it is seen that the real networks structures use diverse equipment. Therefore to develop a complex to find the paths in SDH-based network is a challenge.Dijkstra algorithm is implemented to find the shortest network path routings in the complex. The use of the classical algorithm is impossible because of the restrictions in providing main and reserve links. There are multiplex sections with no routes to be expected. Such restriction is due to real arrangement of some multiplex sections in the same cables, but in different fibres. When providing the main link, the appropriate structuring sections should be preferable. For example, the link E3 (34 Mbit/s can pass only across the section of relevant configuration. The reserve link cannot pass across those multiplex sections where the main link has passed. This rule is not 'extra' considering the first restriction since the main and reserve link sections cannot crisscross the node. At the dead ends reserving has no sense, and the reserve link has to coincide with the main one to save a multiplex section resource of terminal switching. In implementation all these restrictions have been taken into consideration.In addition to the path routings, complex enables saving information on the network

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

2018-05-01

We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

Transportation routing analysis geographic information system -- TRAGIS, a multimodal transportation routing tool

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

Over 15 years ago, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Subsequent modifications have been made to enhance each of these models. Some of these changes include population density information for routes, HM-164 routing regulations for highway route controlled quantities of radioactive materials (RAM) truck shipments, and inclusion of waterway routing into INTERLINE. The AIRPORT model, developed 2 years after the HIGHWAY and INTERLINE models, serves as an emergency response tool. This model identifies the nearest airports from a designated location. Currently, the AIRPORT model is inactive. The Transportation Management Division of the US Department of Energy held a Baseline Requirements Assessment Session on the HIGHWAY, INTERLINE, and AIRPORT models in April 1994 to bring together many users of these models and other experts in the transportation routing field to discuss these models and to decide on the capabilities that needed to be added. Of the many needs discussed, the primary one was to have the network databases within a geographic information system (GIS). As a result of the Baseline Requirements Session, the development of a new GIS model has been initiated. This paper will discuss the development of the new Transportation Routing Analysis GIS (TRAGIS) model at ORNL

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

Full Text Available The article deals with a scheme for the modern vine route in Bulgaria. Five basic vine routes and one international, between Bulgaria, Macedonia and Greece are defined. All routes consider characteristic varieties of grapes and kinds of vine products. Vine tourist products combined with visits of important natural and anthropological object are in the bases of the defined routes. The described routes are an important contribution to development of alternative tourist products in the country.

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

Full Text Available The aim of this paper was to propose a novel routing protocol for Mobile Adhoc Network communication which reduces the route failure during transmission. The proposed routing protocol uses 3 salient parameters to discover the path which ensure the reliable communication. The quality of the channel, link quality and energy level of the node are the major reasons for unintentional node failure in mobile Adhoc network. So the proposed routing protocol considers these three parameters to select the best forwarder node in the path. The reliable data communication is achieved by transmitting data via path selected by the proposed routing scheme has been proven using network simulator (NS2. Keywords: Channel quality, Link quality, Mobile Adhoc Network (MANET, Residual energy

Pheromone Static Routing Strategy for Complex Networks

Science.gov (United States)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

Metabolic routes along digestive system of licorice: multicomponent sequential metabolism method in rat.

Science.gov (United States)

Zhang, Lei; Zhao, Haiyu; Liu, Yang; Dong, Honghuan; Lv, Beiran; Fang, Min; Zhao, Huihui

2016-06-01

This study was conducted to establish the multicomponent sequential metabolism (MSM) method based on comparative analysis along the digestive system following oral administration of licorice (Glycyrrhiza uralensis Fisch., leguminosae), a traditional Chinese medicine widely used for harmonizing other ingredients in a formulae. The licorice water extract (LWE) dissolved in Krebs-Ringer buffer solution (1 g/mL) was used to carry out the experiments and the comparative analysis was performed using HPLC and LC-MS/MS methods. In vitro incubation, in situ closed-loop and in vivo blood sampling were used to measure the LWE metabolic profile along the digestive system. The incubation experiment showed that the LWE was basically stable in digestive juice. A comparative analysis presented the metabolic profile of each prototype and its corresponding metabolites then. Liver was the major metabolic organ for LWE, and the metabolism by the intestinal flora and gut wall was also an important part of the process. The MSM method was practical and could be a potential method to describe the metabolic routes of multiple components before absorption into the systemic blood stream. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

Rich Vehicle Routing Problems and Applications

DEFF Research Database (Denmark)

Wen, Min

very short computational time on real-life data involving up to 200 pairs of suppliers and customers. The second problem we consider is a dynamic vehicle routing problem with multiple objectives over a planning horizon that consists of multiple periods. In this problem, customer orders are revealed...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints....... The method is implemented and tested on real-life data involving up to 2000 orders. It is shown that the method is able to provide solutions of good quality within reasonable running time....

A set packing inspired method for real-time junction train routing

DEFF Research Database (Denmark)

Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

2013-01-01

Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

A Set Packing Inspired Method for Real-Time Junction Train Routing

DEFF Research Database (Denmark)

Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

Fast reactor calculational route for Pu burning core design

Energy Technology Data Exchange (ETDEWEB)

Hunter, S. [Power Reactor and Nuclear Fuel Development Corp., Oarai, Ibaraki (Japan). Oarai Engineering Center

1998-01-01

This document provides a description of a calculational route, used in the Reactor Physics Research Section for sensitivity studies and initial design optimization calculations for fast reactor cores. The main purpose in producing this document was to provide a description of and user guides to the calculational methods, in English, as an aid to any future user of the calculational route who is (like the author) handicapped by a lack of literacy in Japanese. The document also provides for all users a compilation of information on the various parts of the calculational route, all in a single reference. In using the calculational route (to model Pu burning reactors) the author identified a number of areas where an improvement in the modelling of the standard calculational route was warranted. The document includes comments on and explanations of the modelling assumptions in the various calculations. Practical information on the use of the calculational route and the computer systems is also given. (J.P.N.)

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Science.gov (United States)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Coordinated Platoon Routing in a Metropolitan Network

Energy Technology Data Exchange (ETDEWEB)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

Modeling the Equilibrium Bus Line Choice Behavior and Transit System Design with Oblivious Users

Directory of Open Access Journals (Sweden)

Chuan-Lin Zhao

2014-01-01

Full Text Available In most of transportation literature, users are assumed to be perfectly rational in minimizing their own travel costs or perceived travel costs. However, users may not be perfectly rational in implementing their choices in reality. There exists a kind of boundedly rational users, that is, oblivious users. These oblivious users make their route choices by simple criteria, for example, selecting the shortest (or the most direct route only based on physical distance or simply following routes recommended by a GPS system. This paper investigates how the existence of oblivious users affects the equilibrium bus line choice behavior in a public transit system. And we propose a method to design a more realistic system.

An Improved Differential Evolution Algorithm for Maritime Collision Avoidance Route Planning

Directory of Open Access Journals (Sweden)

Yu-xin Zhao

2014-01-01

Full Text Available High accuracy navigation and surveillance systems are pivotal to ensure efficient ship route planning and marine safety. Based on existing ship navigation and maritime collision prevention rules, an improved approach for collision avoidance route planning using a differential evolution algorithm was developed. Simulation results show that the algorithm is capable of significantly enhancing the optimized route over current methods. It has the potential to be used as a tool to generate optimal vessel routing in the presence of conflicts.

A Subpath-based Logit Model to Capture the Correlation of Routes

Directory of Open Access Journals (Sweden)

Xinjun Lai

2016-06-01

Full Text Available A subpath-based methodology is proposed to capture the travellers’ route choice behaviours and their perceptual correlation of routes, because the original link-based style may not be suitable in application: (1 travellers do not process road network information and construct the chosen route by a link-by-link style; (2 observations from questionnaires and GPS data, however, are not always link-specific. Subpaths are defined as important portions of the route, such as major roads and landmarks. The cross-nested Logit (CNL structure is used for its tractable closed-form and its capability to explicitly capture the routes correlation. Nests represent subpaths other than links so that the number of nests is significantly reduced. Moreover, the proposed method simplifies the original link-based CNL model; therefore, it alleviates the estimation and computation difficulties. The estimation and forecast validation with real data are presented, and the results suggest that the new method is practical.

Simulation of optimal arctic routes using a numerical sea ice model based on an ice-coupled ocean circulation method

Directory of Open Access Journals (Sweden)

Jong-Ho Nam

2013-06-01

Full Text Available Ever since the Arctic region has opened its mysterious passage to mankind, continuous attempts to take advantage of its fastest route across the region has been made. The Arctic region is still covered by thick ice and thus finding a feasible navigating route is essential for an economical voyage. To find the optimal route, it is necessary to establish an efficient transit model that enables us to simulate every possible route in advance. In this work, an enhanced algorithm to determine the optimal route in the Arctic region is introduced. A transit model based on the simulated sea ice and environmental data numerically modeled in the Arctic is developed. By integrating the simulated data into a transit model, further applications such as route simulation, cost estimation or hindcast can be easily performed. An interactive simulation system that determines the optimal Arctic route using the transit model is developed. The simulation of optimal routes is carried out and the validity of the results is discussed.

Route churn: an analysis of low-cost carrier route continuity in Europe

NARCIS (Netherlands)

de Wit, J.G.; Zuidberg, J.

2016-01-01

Discontinuity of air routes is a subject that has been analysed in various ways. For example, the complex network approach focuses on network robustness and resilience due to route interruptions during a relatively short period. Also seasonal interruptions of air routes are a well-documented

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

Science.gov (United States)

Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

2018-01-01

The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

Ship Pipe Routing Design Using NSGA-II and Coevolutionary Algorithm

Directory of Open Access Journals (Sweden)

Wentie Niu

2016-01-01

Full Text Available Pipe route design plays a prominent role in ship design. Due to the complex configuration in layout space with numerous pipelines, diverse design constraints, and obstacles, it is a complicated and time-consuming process to obtain the optimal route of ship pipes. In this article, an optimized design method for branch pipe routing is proposed to improve design efficiency and to reduce human errors. By simplifying equipment and ship hull models and dividing workspace into three-dimensional grid cells, the mathematic model of layout space is constructed. Based on the proposed concept of pipe grading method, the optimization model of pipe routing is established. Then an optimization procedure is presented to deal with pipe route planning problem by combining maze algorithm (MA, nondominated sorting genetic algorithm II (NSGA-II, and cooperative coevolutionary nondominated sorting genetic algorithm II (CCNSGA-II. To improve the performance in genetic algorithm procedure, a fixed-length encoding method is presented based on improved maze algorithm and adaptive region strategy. Fuzzy set theory is employed to extract the best compromise pipeline from Pareto optimal solutions. Simulation test of branch pipe and design optimization of a fuel piping system were carried out to illustrate the design optimization procedure in detail and to verify the feasibility and effectiveness of the proposed methodology.

Modeling Stochastic Route Choice Behaviors with Equivalent Impedance

Directory of Open Access Journals (Sweden)

Jun Li

2015-01-01

Full Text Available A Logit-based route choice model is proposed to address the overlapping and scaling problems in the traditional multinomial Logit model. The nonoverlapping links are defined as a subnetwork, and its equivalent impedance is explicitly calculated in order to simply network analyzing. The overlapping links are repeatedly merged into subnetworks with Logit-based equivalent travel costs. The choice set at each intersection comprises only the virtual equivalent route without overlapping. In order to capture heterogeneity in perception errors of different sizes of networks, different scale parameters are assigned to subnetworks and they are linked to the topological relationships to avoid estimation burden. The proposed model provides an alternative method to model the stochastic route choice behaviors without the overlapping and scaling problems, and it still maintains the simple and closed-form expression from the MNL model. A link-based loading algorithm based on Dial’s algorithm is proposed to obviate route enumeration and it is suitable to be applied on large-scale networks. Finally a comparison between the proposed model and other route choice models is given by numerical examples.

COMPARATIVE ANALYSIS AND IMPLEMENTATION OF ...

African Journals Online (AJOL)

TransRoute: a web-based vehicle route planning application is proposed in this paper. This application leverages existing input-output (I/O) efficient implementations of shortest path algorithms (SPAs) to implement the proposed system that will fundamentally address the problems experienced in moving people, goods and ...

Hazmat Routes (National)

Data.gov (United States)

Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

An Indirect Route for Ethanol Production

Energy Technology Data Exchange (ETDEWEB)

Eggeman, T.; Verser, D.; Weber, E.

2005-04-29

The ZeaChem indirect method is a radically new approach to producing fuel ethanol from renewable resources. Sugar and syngas processing platforms are combined in a novel way that allows all fractions of biomass feedstocks (e.g. carbohydrates, lignins, etc.) to contribute their energy directly into the ethanol product via fermentation and hydrogen based chemical process technologies. The goals of this project were: (1) Collect engineering data necessary for scale-up of the indirect route for ethanol production, and (2) Produce process and economic models to guide the development effort. Both goals were successfully accomplished. The projected economics of the Base Case developed in this work are comparable to today's corn based ethanol technology. Sensitivity analysis shows that significant improvements in economics for the indirect route would result if a biomass feedstock rather that starch hydrolyzate were used as the carbohydrate source. The energy ratio, defined as the ratio of green energy produced divided by the amount of fossil energy consumed, is projected to be 3.11 to 12.32 for the indirect route depending upon the details of implementation. Conventional technology has an energy ratio of 1.34, thus the indirect route will have a significant environmental advantage over today's technology. Energy savings of 7.48 trillion Btu/yr will result when 100 MMgal/yr (neat) of ethanol capacity via the indirect route is placed on-line by the year 2010.

Routes to chaos in continuous mechanical systems. Part 1: Mathematical models and solution methods

International Nuclear Information System (INIS)

Awrejcewicz, J.; Krysko, V.A.; Papkova, I.V.; Krysko, A.V.

2012-01-01

In this work chaotic dynamics of continuous mechanical systems such as flexible plates and shallow shells is studied. Namely, a wide class of the mentioned objects is analyzed including flexible plates and cylinder-like panels of infinite length, rectangular spherical and cylindrical shells, closed cylindrical shells, axially symmetric plates, as well as spherical and conical shells. The considered problems are solved by the Bubnov–Galerkin and higher approximation Ritz methods. Convergence and validation of those methods are studied. The Cauchy problems are solved mainly by the fourth Runge-Kutta method, although all variants of the Runge-Kutta methods are considered. New scenarios of transition from regular to chaotic orbits are detected, analyzed and discussed. First part of the paper is devoted to the validation of results obtained. This is why the same infinite length problem is reduced to that of a finite dimension through the FDM (Finite Difference Method) with the approximation order of O(c 2 ), BGM (Bubnov–Galerkin Method) or RM (Ritz Method) with higher approximations. We pay attention not only to convergence of the mentioned methods regarding the number of partitions of the interval [0, 1] in the FDM or regarding the number of terms in the series applied either in the BGM or RM methods, but we also compare the results obtained via the mentioned different approaches. Furthermore, a so called practical convergence of different Runge-Kutta type methods are tested starting from the second and ending with the eighth order. Second part of the work is devoted to a study of routes to chaos in the so far mentioned mechanical objects. For this purpose the so-called “dynamical charts” are constructed versus control parameters {q 0 , ω p }, where q 0 denotes the loading amplitude, and ω p is the loading frequency. The charts are constructed through analyses of frequency power spectra and the largest Lyapunov exponent (LE). Analysis of the mentioned charts

Elementary students' evacuation route choice in a classroom: A questionnaire-based method

Science.gov (United States)

Chen, Liang; Tang, Tie-Qiao; Huang, Hai-Jun; Song, Ziqi

2018-02-01

Children evacuation is a critical but challenging issue. Unfortunately, existing researches fail to effectively describe children evacuation, which is likely due to the lack of experimental and empirical data. In this paper, a questionnaire-based experiment was conducted with children aged 8-12 years to study children route choice behavior during evacuation from in a classroom with two exits. 173 effective questionnaires were collected and the corresponding data were analyzed. From the statistical results, we obtained the following findings: (1) position, congestion, group behavior, and backtracking behavior have significant effects on children route choice during evacuation; (2) age only affects children backtracking behavior, and (3) no prominent effects based on gender and guidance were observed. The above findings may help engineers design some effective evacuation strategies for children.

a New Model for Fuzzy Personalized Route Planning Using Fuzzy Linguistic Preference Relation

Science.gov (United States)

Nadi, S.; Houshyaripour, A. H.

2017-09-01

This paper proposes a new model for personalized route planning under uncertain condition. Personalized routing, involves different sources of uncertainty. These uncertainties can be raised from user's ambiguity about their preferences, imprecise criteria values and modelling process. The proposed model uses Fuzzy Linguistic Preference Relation Analytical Hierarchical Process (FLPRAHP) to analyse user's preferences under uncertainty. Routing is a multi-criteria task especially in transportation networks, where the users wish to optimize their routes based on different criteria. However, due to the lake of knowledge about the preferences of different users and uncertainties available in the criteria values, we propose a new personalized fuzzy routing method based on the fuzzy ranking using center of gravity. The model employed FLPRAHP method to aggregate uncertain criteria values regarding uncertain user's preferences while improve consistency with least possible comparisons. An illustrative example presents the effectiveness and capability of the proposed model to calculate best personalize route under fuzziness and uncertainty.

Reduction of wind power induced reserve requirements by advanced shortest-term forecasts and prediction intervals

Energy Technology Data Exchange (ETDEWEB)

Dobschinski, Jan; Wessel, Arne; Lange, Bernhard; Bremen, Lueder von [Fraunhofer Institut fuer Windenergie und Energiesystemtechnik (IWES), Kassel (Germany)

2009-07-01

In electricity systems with large penetration of wind power, the limited predictability of the wind power generation leads to an increase in reserve and balancing requirements. At first the present study concentrates on the capability of dynamic day-ahead prediction intervals to reduce the wind power induced reserve and balancing requirements. Alternatively the reduction of large forecast errors of the German wind power generation by using advanced shortest-term predictions has been evaluated in a second approach. With focus on the allocation of minute reserve power the aim is to estimate the maximal remaining uncertainty after trading activities on the intraday market. Finally both approaches were used in a case study concerning the reserve requirements induced by the total German wind power expansion in 2007. (orig.)

PENENTUAN RUTE TRANSPORTASI TERPENDEK UNTUK MEMINIMALKAN BIAYA MENGGUNAKAN METODE SAVING MATRIKS

Directory of Open Access Journals (Sweden)

Noer Ikfan

2013-12-01

Full Text Available This paper presents a case study of vehicle routing problem at CV. Boang Shutlecocok which is engaged in the distribution of Shutlecock. To fulfill market demand, The company operates to transmit Shutlecock to every distributors throughout the eastern Java. Because of Shutlecock distribution is from warehouse to distributors and every distribution are quite far from the warehouse, so that causing the distribution cost incurred by CV. Boang Shuttlecock increased. In this study a method to implement VRP (Vehicle Routing Problem based on saving matrix, in which the method will provide the shortest route to minimize costs, distance and minimizing distribution time spent by the company. Before the implementation of saving matrix method on the company, total distribution costs incurred by the company amounted to Rp.5,882,771/period, after the VRP method applied, obtained a total cost of Rp.5,239,003/period, in order to obtain the distribution cost savings per period of Rp.643,764 or approximately 10.94%.

Optimization for routing vehicles of seafood product transportation

Science.gov (United States)

Soenandi, I. A.; Juan, Y.; Budi, M.

2017-12-01

Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

COORDINATION OF THE WORK OF BUSES IN CITY ROUTES

Directory of Open Access Journals (Sweden)

Fuad DASHDAMIROV

2013-12-01

Full Text Available The paper studied the work of bus routes passing through a street. Optimality criterion was chosen for the development of appropriate models of effective work of buses on the land. The paper proposes a new model costing time passengers at bus stops. A method of technique was developed to coordinate the buses running on the combined section of route.

Benefits Analysis of Multi-Center Dynamic Weather Routes

Science.gov (United States)

Sheth, Kapil; McNally, David; Morando, Alexander; Clymer, Alexis; Lock, Jennifer; Petersen, Julien

2014-01-01

Dynamic weather routes are flight plan corrections that can provide airborne flights more than user-specified minutes of flying-time savings, compared to their current flight plan. These routes are computed from the aircraft's current location to a flight plan fix downstream (within a predefined limit region), while avoiding forecasted convective weather regions. The Dynamic Weather Routes automation has been continuously running with live air traffic data for a field evaluation at the American Airlines Integrated Operations Center in Fort Worth, TX since July 31, 2012, where flights within the Fort Worth Air Route Traffic Control Center are evaluated for time savings. This paper extends the methodology to all Centers in United States and presents benefits analysis of Dynamic Weather Routes automation, if it was implemented in multiple airspace Centers individually and concurrently. The current computation of dynamic weather routes requires a limit rectangle so that a downstream capture fix can be selected, preventing very large route changes spanning several Centers. In this paper, first, a method of computing a limit polygon (as opposed to a rectangle used for Fort Worth Center) is described for each of the 20 Centers in the National Airspace System. The Future ATM Concepts Evaluation Tool, a nationwide simulation and analysis tool, is used for this purpose. After a comparison of results with the Center-based Dynamic Weather Routes automation in Fort Worth Center, results are presented for 11 Centers in the contiguous United States. These Centers are generally most impacted by convective weather. A breakdown of individual Center and airline savings is presented and the results indicate an overall average savings of about 10 minutes of flying time are obtained per flight.

Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

Science.gov (United States)

Teichroeb, Julie A

2015-10-01

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems.

Science.gov (United States)

Yu, Hao; Solvang, Wei Deng

2016-05-31

Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

Directory of Open Access Journals (Sweden)

Hao Yu

2016-05-01

Full Text Available Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

A queueing framework for routing problems with time-dependent travel times

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2007-01-01

Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle

Assessing green waste route by using Network Analysis

Science.gov (United States)

Hasmantika, I. H.; Maryono, M.

2018-02-01

Green waste, such as waste from park need treat proper. One of the main problems of green waste management is how to design optimum collection. This research aims to determine the optimum green waste collection by determining optimum route among park. The route optimum was assessed by using network analysis method. And the region five of Semarang city’s park within 20 parks in chose as case study. To enhancing recycle of green waste, three scenarios of treatment are proposed. Scenario 1 used one integrated treatment facility as terminal for enhancing recycle of green waste, Scenario 2 used two sites and scenario 3 used three sites. According to the assessment, the length of route of scenario 1 is 36.126 km and the time for collection estimated is 46 minutes. In scenario 2, the length of route is 36.471 km with a travel time is 47 minutes. The length of scenario three is 46.934 km and the time of collection is 60 minutes.

Aircraft Route Recovery Based on An Improved GRASP Method

Directory of Open Access Journals (Sweden)

Yang He

2017-01-01

Full Text Available Aircrafts maintenance, temporary airport closures are common factors that disrupt normal flight schedule. The aircraft route recovery aims to recover original schedules by some strategies, including flights swaps, and cancellations, which is a NP-hard problem. This paper proposes an improved heuristic procedure based on Greedy Random Adaptive Search Procedure (GRASP to solve this problem. The effectiveness and high global optimization capability of the heuristic is illustrated through experiments based on large-scale problems. Compared to the original one, it is shown that the improved procedure can find feasible flight recovered schedules with lower cost in a short time.

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

Key management schemes using routing information frames in secure wireless sensor networks

Science.gov (United States)

Kamaev, V. A.; Finogeev, A. G.; Finogeev, A. A.; Parygin, D. S.

2017-01-01

The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suitable for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key management using routing information frames determined by routing methods and the WSN topology are presented.

Understanding individual routing behaviour.

Science.gov (United States)

Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

2016-03-01

Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

An Enhanced Hybrid Social Based Routing Algorithm for MANET-DTN

Directory of Open Access Journals (Sweden)

Martin Matis

2016-01-01

Full Text Available A new routing algorithm for mobile ad hoc networks is proposed in this paper: an Enhanced Hybrid Social Based Routing (HSBR algorithm for MANET-DTN as optimal solution for well-connected multihop mobile networks (MANET and/or worse connected MANET with small density of the nodes and/or due to mobility fragmented MANET into two or more subnetworks or islands. This proposed HSBR algorithm is fully decentralized combining main features of both Dynamic Source Routing (DSR and Social Based Opportunistic Routing (SBOR algorithms. The proposed scheme is simulated and evaluated by replaying real life traces which exhibit this highly dynamic topology. Evaluation of new proposed HSBR algorithm was made by comparison with DSR and SBOR. All methods were simulated with different levels of velocity. The results show that HSBR has the highest success of packet delivery, but with higher delay in comparison with DSR, and much lower in comparison with SBOR. Simulation results indicate that HSBR approach can be applicable in networks, where MANET or DTN solutions are separately useless or ineffective. This method provides delivery of the message in every possible situation in areas without infrastructure and can be used as backup method for disaster situation when infrastructure is destroyed.

Simulation of optimal arctic routes using a numerical sea ice model based on an ice-coupled ocean circulation method

OpenAIRE

Jong-Ho Nam; Inha Park; Ho Jin Lee; Mi Ok Kwon; Kyungsik Choi; Young-Kyo Seo

2013-01-01

Ever since the Arctic region has opened its mysterious passage to mankind, continuous attempts to take advantage of its fastest route across the region has been made. The Arctic region is still covered by thick ice and thus finding a feasible navigating route is essential for an economical voyage. To find the optimal route, it is necessary to establish an efficient transit model that enables us to simulate every possible route in advance. In this work, an enhanced algorithm to determine the o...

Identifying and prioritizing ungulate migration routes for landscape-level conservation

Science.gov (United States)

Sawyer, Hall; Kauffman, Matthew J.; Nielson, Ryan M.; Horne, Jon S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood.

Comparing the efficiency of transport routes and corridors

Directory of Open Access Journals (Sweden)

Liviu Gabriel GHIŢULEASA

2011-03-01

Full Text Available In the broader context of the importance granted to accessibility by the European spatial planning policies, comparing the efficiency of European and national transportation routes and corridors constitutes an issue of particular relevance for Romania. In order to resolve it, this paper proposes a methodology based on potential accessibility, determined by the total population served, and the efficiency of the path, by analogy with the least squares method. Both approaches were applied to internal and European routes.

Vehicle routing for the eco-efficient collection of household plastic waste.

Science.gov (United States)

Bing, Xiaoyun; de Keizer, Marlies; Bloemhof-Ruwaard, Jacqueline M; van der Vorst, Jack G A J

2014-04-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of other waste, although plastic is different than other waste in terms of volume to weight ratio. This paper aims for redesigning the collection routes and compares the collection options of plastic waste using eco-efficiency as performance indicator. Eco-efficiency concerns the trade-off between environmental impacts, social issues and costs. The collection problem is modeled as a vehicle routing problem. A tabu search heuristic is used to improve the routes. Collection alternatives are compared by a scenario study approach. Real distances between locations are calculated with MapPoint. The scenario study is conducted based on real case data of the Dutch municipality Wageningen. Scenarios are designed according to the collection alternatives with different assumptions in collection method, vehicle type, collection frequency and collection points, etc. Results show that the current collection routes can be improved in terms of eco-efficiency performance by using our method. The source-separation drop-off collection scenario has the best performance for plastic collection assuming householders take the waste to the drop-off points in a sustainable manner. The model also shows to be an efficient decision support tool to investigate the impacts of future changes such as alternative vehicle type and different response rates. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

SAFEBIKE: A Bike-sharing Route Recommender with Availability Prediction and Safe Routing

OpenAIRE

Zhong, Weisheng; Chen, Fanglan; Fu, Kaiqun; Lu, Chang-Tien

2017-01-01

This paper presents SAFEBIKE, a novel route recommendation system for bike-sharing service that utilizes station information to infer the number of available bikes in dock and recommend bike routes according to multiple factors such as distance and safety level. The system consists of a station level availability predictor that predicts bikes and docks amount at each station, and an efficient route recommendation service that considers safety and bike/dock availability factors. It targets use...

Personal continuous route pattern mining

Institute of Scientific and Technical Information of China (English)

Qian YE; Ling CHEN; Gen-cai CHEN

2009-01-01

In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

Chemical Routes to Colloidal Chalcogenide Nanosheets

Energy Technology Data Exchange (ETDEWEB)

Schaak, Raymond E. [Pennsylvania State Univ., University Park, PA (United States)

2014-11-25

This project began with an emphasis on developing new low-­temperature synthetic routes to intermetallic alloys in order to advance the synthesis and processing science of superconducting materials, as well as to potentially discover new materials that would be inaccessible using more traditional higher-­temperature methods. Our initial target materials, chosen as model systems for developing new low-­temperature solution-­based synthetic platforms, were based on well known superconducting alloys, including Nb₃M (M = Ga, Ge, Sn), Bi-­M (M = In, Cu), and MgCNi₃. Several key, fundamental synthetic challenges that underpinned the formation of these materials using solution chemistry routes were identified and investigated.

Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun

2005-01-01

consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...

Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators

Science.gov (United States)

Nadi, S.; Delavar, M. R.

2011-06-01

This paper presents a generic model for using different decision strategies in multi-criteria, personalized route planning. Some researchers have considered user preferences in navigation systems. However, these prior studies typically employed a high tradeoff decision strategy, which used a weighted linear aggregation rule, and neglected other decision strategies. The proposed model integrates a pairwise comparison method and quantifier-guided ordered weighted averaging (OWA) aggregation operators to form a personalized route planning method that incorporates different decision strategies. The model can be used to calculate the impedance of each link regarding user preferences in terms of the route criteria, criteria importance and the selected decision strategy. Regarding the decision strategy, the calculated impedance lies between aggregations that use a logical "and" (which requires all the criteria to be satisfied) and a logical "or" (which requires at least one criterion to be satisfied). The calculated impedance also includes taking the average of the criteria scores. The model results in multiple alternative routes, which apply different decision strategies and provide users with the flexibility to select one of them en-route based on the real world situation. The model also defines the robust personalized route under different decision strategies. The influence of different decision strategies on the results are investigated in an illustrative example. This model is implemented in a web-based geographical information system (GIS) for Isfahan in Iran and verified in a tourist routing scenario. The results demonstrated, in real world situations, the validity of the route planning carried out in the model.

Class network routing

Science.gov (United States)

Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

2009-09-08

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

mizuRoute version 1: A river network routing tool for a continental domain water resources applications

Science.gov (United States)

Mizukami, Naoki; Clark, Martyn P.; Sampson, Kevin; Nijssen, Bart; Mao, Yixin; McMillan, Hilary; Viger, Roland; Markstrom, Steven; Hay, Lauren E.; Woods, Ross; Arnold, Jeffrey R.; Brekke, Levi D.

2016-01-01

This paper describes the first version of a stand-alone runoff routing tool, mizuRoute. The mizuRoute tool post-processes runoff outputs from any distributed hydrologic model or land surface model to produce spatially distributed streamflow at various spatial scales from headwater basins to continental-wide river systems. The tool can utilize both traditional grid-based river network and vector-based river network data. Both types of river network include river segment lines and the associated drainage basin polygons, but the vector-based river network can represent finer-scale river lines than the grid-based network. Streamflow estimates at any desired location in the river network can be easily extracted from the output of mizuRoute. The routing process is simulated as two separate steps. First, hillslope routing is performed with a gamma-distribution-based unit-hydrograph to transport runoff from a hillslope to a catchment outlet. The second step is river channel routing, which is performed with one of two routing scheme options: (1) a kinematic wave tracking (KWT) routing procedure; and (2) an impulse response function – unit-hydrograph (IRF-UH) routing procedure. The mizuRoute tool also includes scripts (python, NetCDF operators) to pre-process spatial river network data. This paper demonstrates mizuRoute's capabilities to produce spatially distributed streamflow simulations based on river networks from the United States Geological Survey (USGS) Geospatial Fabric (GF) data set in which over 54 000 river segments and their contributing areas are mapped across the contiguous United States (CONUS). A brief analysis of model parameter sensitivity is also provided. The mizuRoute tool can assist model-based water resources assessments including studies of the impacts of climate change on streamflow.

IMPLEMENTASI ALGORITMA TSP DALAM PENYELESAIAN TRACKING PAKET PADA UNIT PROCESSING CENTER POS INDONESIA KOTA LHOKSEUMAWE ACEH

Directory of Open Access Journals (Sweden)

Richki Hardi

2015-04-01

Full Text Available Traveling salesperson problem-TSP problem is an optimization problem to find the optimal way for the traveling salesman who wants to visit several cities, and returned to the original departure city. TSP is a difficult problem when viewed from the point of computing. Several methods have been used to solve these problems but until now not been found mangkus algorithms to solve them. The easiest way to solve TSP is to try all possible routes and find the optimal route. However, at the time of the very practical now required to complete an algorithm that quickly so that the TSP solution obtained near optimal solutions.TSP is very precise algorithm used for solving complex optimization problems and solved difficult conventional methods. Route and distance data used to determine the optimal route in the system is obtained from the survey results at the post office Lhokseumawe. The results showed that the algorithm is the shortest route from the post office to post office Lhokseumawe, Meulaboh, Lhokseumawe is through the route - Bireun-Simpang Tiga-Takengon-Meulaboh with a total distance of 326 kilometers. The implementation of this system using the programming language PHP, MySQL, and Macromedia Flash.

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

A Dynamic Travel Time Estimation Model Based on Connected Vehicles

Directory of Open Access Journals (Sweden)

Daxin Tian

2015-01-01

Full Text Available With advances in connected vehicle technology, dynamic vehicle route guidance models gradually become indispensable equipment for drivers. Traditional route guidance models are designed to direct a vehicle along the shortest path from the origin to the destination without considering the dynamic traffic information. In this paper a dynamic travel time estimation model is presented which can collect and distribute traffic data based on the connected vehicles. To estimate the real-time travel time more accurately, a road link dynamic dividing algorithm is proposed. The efficiency of the model is confirmed by simulations, and the experiment results prove the effectiveness of the travel time estimation method.

Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

Science.gov (United States)

Korayem, L.; Khorsid, M.; Kassem, S. S.

2015-05-01

The capacitated vehicle routing problem (CVRP) is a class of the vehicle routing problems (VRPs). In CVRP a set of identical vehicles having fixed capacities are required to fulfill customers' demands for a single commodity. The main objective is to minimize the total cost or distance traveled by the vehicles while satisfying a number of constraints, such as: the capacity constraint of each vehicle, logical flow constraints, etc. One of the methods employed in solving the CVRP is the cluster-first route-second method. It is a technique based on grouping of customers into a number of clusters, where each cluster is served by one vehicle. Once clusters are formed, a route determining the best sequence to visit customers is established within each cluster. The recently bio-inspired grey wolf optimizer (GWO), introduced in 2014, has proven to be efficient in solving unconstrained, as well as, constrained optimization problems. In the current research, our main contributions are: combining GWO with the traditional K-means clustering algorithm to generate the ‘K-GWO’ algorithm, deriving a capacitated version of the K-GWO algorithm by incorporating a capacity constraint into the aforementioned algorithm, and finally, developing 2 new clustering heuristics. The resulting algorithm is used in the clustering phase of the cluster-first route-second method to solve the CVR problem. The algorithm is tested on a number of benchmark problems with encouraging results.

Robustness of airline route networks

Science.gov (United States)

Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

2016-03-01

Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

Waste Collection Vehicle Routing Problem: Literature Review

Directory of Open Access Journals (Sweden)

Hui Han

2015-08-01

Full Text Available Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP in literature. Based on a classification of waste collection (residential, commercial and industrial, firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

Commercial vehicle route tracking using video detection.

Science.gov (United States)

2010-10-31

Interstate commercial vehicle traffic is a major factor in the life of any road surface. The ability to track : these vehicles and their routes through the state can provide valuable information to planning : activities. We propose a method using vid...

Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte

to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. This thesis therefore aims at developing new mathematical models and solution methods...... for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...

Systems configured to distribute a telephone call, communication systems, communication methods and methods of routing a telephone call to a service representative

Science.gov (United States)

Harris, Scott H.; Johnson, Joel A.; Neiswanger, Jeffery R.; Twitchell, Kevin E.

2004-03-09

The present invention includes systems configured to distribute a telephone call, communication systems, communication methods and methods of routing a telephone call to a customer service representative. In one embodiment of the invention, a system configured to distribute a telephone call within a network includes a distributor adapted to connect with a telephone system, the distributor being configured to connect a telephone call using the telephone system and output the telephone call and associated data of the telephone call; and a plurality of customer service representative terminals connected with the distributor and a selected customer service representative terminal being configured to receive the telephone call and the associated data, the distributor and the selected customer service representative terminal being configured to synchronize, application of the telephone call and associated data from the distributor to the selected customer service representative terminal.

Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses

NARCIS (Netherlands)

Dijkstra, Arjan; Roodbergen, Kees Jan

2017-01-01

Order picking is one of the most time-critical processes in warehouses. We focus on the combined effects of routing methods and storage location assignment on process performance. We present exact formulas for the average route length under any storage location assignment for four common routing

River routing at the continental scale: use of globally-available data and an a priori method of parameter estimation

Directory of Open Access Journals (Sweden)

P. Naden

1999-01-01

Full Text Available Two applications of a river routing model based on the observed river network and a linearised solution to the convective-diffusion equation are presented. One is an off-line application to part of the Amazon basin (catchment area 2.15 M km2 using river network data from the Digital Chart of the World and GCM-generated runoff at a grid resolution of 2.5 degrees latitude and 3.75 degrees longitude. The other application is to the Arkansas (409,000 km2 and Red River (125,500 km2 basins as an integrated component of a macro-scale hydrological model, driven by observed meteorology and operating on a 17 km grid. This second application makes use of the US EPA reach data to construct the river network. In both cases, a method of computing parameter values a priori has been applied and shows some success, although some interpretation is required to derive `correct' parameter values and further work is needed to develop guidelines for use of the method. The applications, however, do demonstrate the possibilities for applying the routing model at the continental scale, with globally-available data and a priori parameter estimation, and its value for validating GCM output against observed flows.

Seeded Growth Route to Noble Calcium Carbonate Nanocrystal.

Directory of Open Access Journals (Sweden)

Aminul Islam

Full Text Available A solution-phase route has been considered as the most promising route to synthesize noble nanostructures. A majority of their synthesis approaches of calcium carbonate (CaCO3 are based on either using fungi or the CO2 bubbling methods. Here, we approached the preparation of nano-precipitated calcium carbonate single crystal from salmacis sphaeroides in the presence of zwitterionic or cationic biosurfactants without external source of CO2. The calcium carbonate crystals were rhombohedron structure and regularly shaped with side dimension ranging from 33-41 nm. The high degree of morphological control of CaCO3 nanocrystals suggested that surfactants are capable of strongly interacting with the CaCO3 surface and control the nucleation and growth direction of calcium carbonate nanocrystals. Finally, the mechanism of formation of nanocrystals in light of proposed routes was also discussed.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

Science.gov (United States)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths.

Science.gov (United States)

Olariu, Victor; Manesso, Erica; Peterson, Carsten

2017-06-01

Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis-Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming.

Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Adamu Murtala Zungeru

2013-01-01

Full Text Available The main problem for event gathering in wireless sensor networks (WSNs is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR algorithm, based on the ant colony optimization (ACO metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1 a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2 intelligent update of routing tables in case of a node or link failure, and (3 reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC and Beesensor.

Small flow rate can supply inwardly migrating shortest-period planets

Directory of Open Access Journals (Sweden)

Taylor S.F.

2013-04-01

Full Text Available The number of exoplanets found with periods as short as one day and less was surprising given how fast these planets had been expected to migrate into the star due to the tides raised on the star by planets at such close distances. It has been seen as improbable that we would find planets in such a small final fraction of their lives [1]. The favored solution has been that the tidal dissipation is much weaker than expected, which would mean that the final infall would be a larger fraction of the planets’ life. We find no reason, however, to exclude the explanation that a small number of planets are continuously sent migrating inwards such that these planets indeed are in the last fraction of their lives. Following the observation that the distribution of medium planets disfavors tidal dissipation being significantly weaker than has been found from observations of binary stars [2], we now show that the numbers of planets in such a “flow” of excess planets migrating inwards is low enough that even depletion of the three-day pileup is a plausible source. Then the shortest period occurrence distribution would be shaped by planets continuously being sent into the star, which may explain the depletion of the pileup in the Kepler field relative to the solar neighborhood [3]. Because Kepler observes above the galactic plan, [3] suggested the Kepler field may include an older population of stars. The tidal dissipation strength in stars due to giant planets may be not greatly weaker than it is in binary stars.

Southern states' routing agency report

International Nuclear Information System (INIS)

1989-02-01

The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

1990-03-01

The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

Cost and risk tradeoff for routing nuclear spent fuel movements

International Nuclear Information System (INIS)

Chin, S.M.

1988-01-01

In the transportation industry, much effort has been devoted to finding the least cost routes for shipping goods from their production sites to the market areas. In addition to cost, the decision maker must take the risk of an incident into consideration for transportation routing involving hazardous materials. The transportation of spent nuclear fuel from reactor sites to repositories is an example. Given suitable network information, existing routing methods can readily determine least cost or least risk routes for any shipment. These two solutions, however, represent the extremes of a large number of alternatives with different combinations of risk and cost. In the selection of routes and also in the evaluation of alternative storage sites it is not enough to know which is the lease cost or lowest risk. Intelligent decision-marking requires knowledge of how much it will cost to lower risk by a certain amount. The objective of this study is to develop an automated system to evaluate the tradeoff between transportation cost and potential population at risk under different nuclear spent fuel transportation strategies

Location-routing Problem with Fuzzy time windows and Traffic time

Directory of Open Access Journals (Sweden)

Shima Teimoori

2014-05-01

Full Text Available The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.

Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption

OpenAIRE

Kenichiro Hida; Shin-Ichi Kuribayashi

2016-01-01

In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and locations without any constraints. This paper focuses on the allocation of NFV-based routing functions...

Strategies for Selecting Routes through Real-World Environments: Relative Topography, Initial Route Straightness, and Cardinal Direction.

Directory of Open Access Journals (Sweden)

Tad T Brunyé

Full Text Available Previous research has demonstrated that route planners use several reliable strategies for selecting between alternate routes. Strategies include selecting straight rather than winding routes leaving an origin, selecting generally south- rather than north-going routes, and selecting routes that avoid traversal of complex topography. The contribution of this paper is characterizing the relative influence and potential interactions of these strategies. We also examine whether individual differences would predict any strategy reliance. Results showed evidence for independent and additive influences of all three strategies, with a strong influence of topography and initial segment straightness, and relatively weak influence of cardinal direction. Additively, routes were also disproportionately selected when they traversed relatively flat regions, had relatively straight initial segments, and went generally south rather than north. Two individual differences, extraversion and sense of direction, predicted the extent of some effects. Under real-world conditions navigators indeed consider a route's initial straightness, cardinal direction, and topography, but these cues differ in relative influence and vary in their application across individuals.

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Tran Dinh Hieu

2016-05-01

Full Text Available A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio.

Transportation Routing Analysis Geographic Information System -- TRAGIS, progress on improving a routing tool

International Nuclear Information System (INIS)

Johnson, P.E.; Lester, P.B.

1998-05-01

The Transportation Routing Analysis Geographic Information System (TRAGIS) model provides a useful tool to calculate and analyze transportation routes for radioactive materials within the continental US. This paper outlines some of the features available in this model

Route Scherrer and Route Einstein closed for construction work

CERN Multimedia

2015-01-01

Please note that Route Scherrer will be inaccessible for two and a half months from the beginning of March and that part of Route Einstein will be closed for two weeks from the end of February.   Figure 1. The part of Route Scherrer between Building 510 and Building 53 (see Figure 1) will be closed from the beginning of March until mid-May for civil engineering works.   The superheated water pipes supplying the buildings in this area date back to 1959 and therefore present a significant risk of leakage. In order to ensure the reliable supply of superheated water, and, by extension, heating, to all premises near the Main Building (i.e. Buildings 500, 501, 503, 60, 62, 63 and 64), a new buried service duct will be installed between the basements of Buildings 53 and 61 to house a new superheated water pipe. Figure 2. The following car parks will, however, remain accessible for the duration of the works: the Cèdres car park, the car park for Buildings 4 and 5, and the ca...

Highway route controlled quantity shipment routing reports - An overview

International Nuclear Information System (INIS)

Cashwell, J.W.; Welles, B.W.; Welch, M.J.

1989-01-01

US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

US Hazardous Materials Routes, Geographic WGS84, BTS (2006) [hazardous_material_routes_BTS_2006

Data.gov (United States)

Louisiana Geographic Information Center — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes were developed using the 2004 First Edition TIGER/Line files. The routes are...

A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR PROTOCOL IN MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

Full Text Available Mobile Ad-hoc networks (MANETs involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general.

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

This report addresses a methodology for route-specific analysis, of which route-selection is one aspect. Identification and mitigation of specific hazards along a chosen route is another important facet of route-specific analysis. Route-selection and route-specific mitigation are two tools to be used in minimizing the risk of radioactive materials transportation and promoting public confidence. Other tools exist to improve the safety of transportation under the Nuclear Waste Policy Act. Selection of a transportation mode and other, non-route-specific measures, such as improved driver training and improved cask designs, are additional tools to minimize transportation risk and promote public confidence. This report addresses the route-specific analysis tool and does not attempt to evaluate its relative usefulness as compared to other available tools. This report represents a preliminary attempt to develop a route-specific analysis methodlogy. The Western Interstate Energy Board High-Level Waste Committee has formed a Route-Specific Analysis Task Force which will build upon the methodology proposed in this Staff Report. As western states continue to investigate route-specific analysis issues, it is expected that the methodology will evolve into a more refined product representing the views of a larger group of interested parties in the West

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

Krianto Sulaiman, Oris; Mahmud Siregar, Amir; Nasution, Khairuddin; Haramaini, Tasliyah

2018-04-01

In a large scale network need a routing that can handle a lot number of users, one of the solutions to cope with large scale network is by using a routing protocol, There are 2 types of routing protocol that is static and dynamic, Static routing is manually route input based on network admin, while dynamic routing is automatically route input formed based on existing network. Dynamic routing is efficient used to network extensively because of the input of route automatic formed, Routing Information Protocol (RIP) is one of dynamic routing that uses the bellman-ford algorithm where this algorithm will search for the best path that traversed the network by leveraging the value of each link, so with the bellman-ford algorithm owned by RIP can optimize existing networks.

Analog integrated circuit design automation placement, routing and parasitic extraction techniques

CERN Document Server

Martins, Ricardo; Horta, Nuno

2017-01-01

This book introduces readers to a variety of tools for analog layout design automation. After discussing the placement and routing problem in electronic design automation (EDA), the authors overview a variety of automatic layout generation tools, as well as the most recent advances in analog layout-aware circuit sizing. The discussion includes different methods for automatic placement (a template-based Placer and an optimization-based Placer), a fully-automatic Router and an empirical-based Parasitic Extractor. The concepts and algorithms of all the modules are thoroughly described, enabling readers to reproduce the methodologies, improve the quality of their designs, or use them as starting point for a new tool. All the methods described are applied to practical examples for a 130nm design process, as well as placement and routing benchmark sets. Introduces readers to hierarchical combination of Pareto fronts of placements; Presents electromigration-aware routing with multilayer multiport terminal structures...

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.; Clarke, D.B.; McGuire, S.C.

1981-01-01

Oak Ridge National Laboratory (ORNL) has been involved in transportation logistics of radioactive wastes as part of the overall waste transportation program. A Spent Fuel Logistics Model (SFLM), was developed to predict overall material balances representing the flow of spent fuel assemblies from reactors to away-from-reactor storage facilities and/or to federal repositories. The transportation requirements to make these shipments are also itemized. The next logical step in the overall transportation project was the development of a set of computer codes which would predict likely transportation routes for waste shipments. Two separate routing models are now operational at ORNL. Routes for truck transport can be estimated with the HIGHWAY program, and rail and barge routes can be predicted with the INTERLINE model. This paper discusses examples of the route estimates and applications of the routing models

Endoscopic Ultrasound-guided Rendezvous Technique after Failed Endoscopic Retrograde Cholangiopancreatography: Which Approach Route Is the Best?

Science.gov (United States)

Okuno, Nozomi; Hara, Kazuo; Mizuno, Nobumasa; Hijioka, Susumu; Tajika, Masahiro; Tanaka, Tsutomu; Ishihara, Makoto; Hirayama, Yutaka; Onishi, Sachiyo; Niwa, Yasumasa; Yamao, Kenji

2017-12-01

Objective The endoscopic ultrasound-guided rendezvous technique (EUS-RV) is a salvage method for failed selective biliary cannulation. Three puncture routes have been reported, with many comparisons between the intra-hepatic and extra-hepatic biliary ducts. We used the trans-esophagus (TE) and trans-jejunum (TJ) routes. In the present study, the utility of EUS-RV for biliary access was evaluated, focusing on the approach routes. Methods and Patients In 39 patients, 42 puncture routes were evaluated in detail. EUS-RV was performed between January 2010 and December 2014. The patients were prospectively enrolled, and their clinical data were retrospectively collected. Results The patients' median age was 71 (range 29-84) years. The indications for endoscopic retrograde cholangiopancreatography (ERCP) were malignant biliary obstruction in 24 patients and benign biliary disease in 15. The technical success rate was 78.6% (33/42) and was similar among approach routes (p=0.377). The overall complication rate was 16.7% (7/42) and was similar among approach routes (p=0.489). However, mediastinal emphysema occurred in 2 TE route EUS-RV patients. No EUS-RV-related deaths occurred. Conclusion EUS-RV proved reliable after failed ERCP. The selection of the appropriate route based on the patient's condition is crucial.

RSRP: A Robust Secure Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Sinha Ditipriya

2014-05-01

Full Text Available In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs. This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR, secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

Zone routing in a torus network

Science.gov (United States)

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

2013-01-29

A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

The Pyramidal Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Lysgaard, Jens

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...

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

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...

Routed planar networks

Directory of Open Access Journals (Sweden)

David J. Aldous

2016-04-01

Full Text Available Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\\em routes} rather than {\\em edges} as primitives. This article is intended to introduce the relevant (discrete setting notion of {\\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.

Road Routes for Waste Disposal - MDC_RecyclingRoute

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

Porcelain tiles by the dry route

International Nuclear Information System (INIS)

Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

2010-01-01

In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality. (Author) 7 refs.

VANET Routing Protocols: Pros and Cons

OpenAIRE

Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

2012-01-01

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

Effect of exposure routes on the relationships of lethal toxicity to rats from oral, intravenous, intraperitoneal and intramuscular routes.

Science.gov (United States)

Ning, Zhong H; Long, Shuang; Zhou, Yuan Y; Peng, Zi Y; Sun, Yi N; Chen, Si W; Su, Li M; Zhao, Yuan H

2015-11-01

The lethal toxicity values (log 1/LD(50)) of 527 aliphatic and aromatic compounds in oral, intravenous, intramuscular and intraperitoneal routes were used to investigate the relationships of log 1/LD(50) from different exposure routes. Regression analysis shows that the log 1/LD(50) values are well correlated between intravenous and intraperitoneal or intramuscular injections. However, the correlations between oral and intravenous or intraperitoneal routes are relatively poor. Comparison of the average residuals indicates that intravenous injection is the most sensitive exposure route and oral administration is the least sensitive exposure route. This is attributed to the difference in kinetic process of toxicity testing. The toxic effect of a chemical can be similar or significantly different between exposure routes, depending on the absorption rates of chemicals into blood. Inclusion of hydrophobic parameter and fractions of ionic forms can improve the correlations between intravenous and intraperitoneal or oral routes, but not between intraperitoneal and oral routes. This is due to the differences of absorption rate in different exposure environments from different routes. Several factors, such as experimental uncertainty, metabolism and toxic kinetics, can affect the correlations between intravenous and intraperitoneal or oral routes. Copyright © 2015 Elsevier Inc. All rights reserved.

Route planning of raw materials transportation in the industrial hub of Mariupol city

Directory of Open Access Journals (Sweden)

Юлія Вікторівна Булгакова

2017-07-01

Full Text Available The multi-modal freight transportation routes planning problem is viewed in this paper. The case study of iron ore deliveries to the metallurgical enterprises of Mariupol from Kryvyi Rih is presented. Based on the analysis of Ukrainian railroads and sea ports infrastructures six possible routes of multi-modal iron ore transportation are built. The paper presents a short review of route planning problem in multi-modal freight transportations, which are use sea and land parts together, regarding decision support methods of routes evaluation and selection. The lack of studies dedicated to fuzzy logic theory application for solving the stated problems is identified. The relevance of fuzzy set application to the route planning problem is proved. Taking into account the peculiarities of iron ore transportations technology, the following criterions of routes evaluation are chosen: «transportation costs», «delivery times», «transportation risks». The model of multicriterion decision-making of routes evaluation and the optimal route selection, based on fuzzy logic theory, is developed. Criteria of routes evaluation are set by three terms Gaussian and sigmoidal membership functions. The approach to each function construction is practice-based and executed together with iron ore supply chain manager. The model is created in MATLAB Fuzzy Logic Tool Box environment using Mamdani’s fuzzy inference

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Directory of Open Access Journals (Sweden)

Sungwook Kim

2014-01-01

Full Text Available Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

Directory of Open Access Journals (Sweden)

Dianjie Lu

2014-05-01

Full Text Available Wireless Sensor Networks (WSNs are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple sessions since different source-destination pairs may pass the same link which makes the flow distribution of each link uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Since it is hard to build a global addressing scheme due to the great number of sensor nodes, we propose a Distributed Energy Efficient Routing protocol (D2ER. In D2ER, we employ the transportation method which can optimize the flow distribution with minimal energy consumption. Simulation results demonstrate that our optimal algorithm can save energy drastically.

Behavioural Models for Route Choice of Passengers in Multimodal Public Transport Networks

DEFF Research Database (Denmark)

Anderson, Marie Karen

in the estimation of route choice models of public transport users based upon observed choices. Public transport route choice models have not benefitted from the same technological enhancements as car models because of the necessity (i) to collect additional information concerning lines and transfers, and (ii...... modes, public transport modes, lines, transfers, egress modes) is large. This thesis proposes a doubly stochastic approach for generating alternative routes that are relevant to travellers, since the method allows accounting for both perceived costs of the network elements and heterogeneity......The subject of this thesis is behavioural models for route choice of passengers in multimodal public transport networks. While research in sustainable transport has dedicated much attention toward the determinants of choice between car and sustainable travel options, it has devoted less attention...

Detours in long-distance migration across the Qinghai-Tibetan Plateau: individual consistency and habitat associations.

Science.gov (United States)

Liu, Dongping; Zhang, Guogang; Jiang, Hongxing; Lu, Jun

2018-01-01

Migratory birds often follow detours when confronted with ecological barriers, and understanding the extent and the underlying drivers of such detours can provide important insights into the associated cost to the annual energy budget and the migration strategies. The Qinghai-Tibetan Plateau is the most daunting geographical barrier for migratory birds because the partial pressure of oxygen is dramatically reduced and flight costs greatly increase. We analyzed the repeated migration detours and habitat associations of four Pallas's Gulls Larus ichthyaetus across the Qinghai-Tibetan Plateau over 22 migration seasons. Gulls exhibited notable detours, with the maximum distance being more than double that of the expected shortest route, that extended rather than reduced the passage across the plateau. The extent of longitudinal detours significantly increased with latitude, and detours were longer in autumn than in spring. Compared with the expected shortest routes, proximity to water bodies increased along autumn migration routes, but detour-habitat associations were weak along spring migration routes. Thus, habitat availability was likely one, but not the only, factor shaping the extent of detours, and migration routes were determined by different mechanisms between seasons. Significant between-individual variation but high individual consistency in migration timing and routes were revealed in both seasons, indicating a stronger influence of endogenous schedules than local environmental conditions. Gulls may benefit from repeated use of familiar routes and stopover sites, which may be particularly significant in the challenging environment of the Qinghai-Tibetan Plateau.

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Gaurantees

Directory of Open Access Journals (Sweden)

Srinivasan Murali

2007-01-01

Full Text Available Networks on Chips (NoCs are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average and power consumption (30.51% on average compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area. Hence, it is practical to be used in the on-chip domain.

Highway and interline transportation routing models

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.

1994-01-01

The potential impacts associated with the transportation of hazardous materials are important issues to shippers, carriers, and the general public. Since transportation routes are a central characteristic in most of these issues, the prediction of likely routes is the first step toward the resolution of these issues. In addition, US Department of Transportation requirements (HM-164) mandate specific routes for shipments of highway controlled quantities of radioactive materials. In response to these needs, two routing models have been developed at Oak Ridge National Laboratory under the sponsorship of the U.S. Department of Energy (DOE). These models have been designated by DOE's Office of Environmental Restoration and Waste Management, Transportation Management Division (DOE/EM) as the official DOE routing models. Both models, HIGHWAY and INTERLINE, are described

Road and street smart lighting control systems as a new application area of the hot-potato protocol

DEFF Research Database (Denmark)

Kiedrowski, Piotr; Gutierrez Lopez, Jose Manuel; Boniewicz, Piotr

2014-01-01

This paper presents the new application area of the hot-potato routing protocol, which is a “last-mile” communication network for controlling systems of road and street lighting. Four variants of the hot-potato protocol are analyzed with use of the graph theory. For the assessment of the traffic ...... parameters the ETX parameter is used in relation to the length of the shortest path. Proposed methods are independent of the media type and can be implemented either in wireless or PLC....

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

Science.gov (United States)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

On joint power allocation and multipath routing in femto-relay networks

OpenAIRE

Hoteit , Sahar; Duhamel , Pierre; Lasaulce , Samson

2016-01-01

International audience; —Transmit power allocation techniques are very important to manage interference in small-cell networks. While available power allocation algorithms in the literature rely on a predefined routing protocol, we propose in this paper a power-efficient two-step algorithm that allows power allocation and routing to be performed jointly in femto-relay networks. First, we propose an interference-based partitioning method to cluster the femto-relays, then we adopt an iterative ...

Whirlpool routing for mobility

KAUST Repository

Lee, Jung Woo

2010-01-01

We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

Tramp ship routing and scheduling with voyage separation requirements

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

2017-01-01

In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found in the s......In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found...... that our algorithm in general finds optimal solutions very quickly and performs much faster compared to an earlier a priori path generation method. Finally, we compare our method to an earlier adaptive large neighbourhood search heuristic and find that on similar-sized instances our approach generally uses...... less time to find the optimal solution than the adaptive large neighbourhood search method uses to find a heuristic solution....

On the chemical synthesis route to bulk-scale skutterudite materials

DEFF Research Database (Denmark)

Tafti, Mohsen Y.; Saleemi, Mohsin; Han, Li

2016-01-01

In this article an alternative high yield route for the synthesis of CoSb3-based unfilled skutterudites is presented. Using low-melting temperature salts of the constituents, melting and mixing them homogeneously in a hydrophobic liquid with postprocessing of the powders we achieve a more intimat......, compaction of the powders with SPS technique provided a safe route to maintaining the nanopowder size and achieving low thermal conductivity (3 W/mK). The proposed method can easily be scaled up and adopted by the industry.......In this article an alternative high yield route for the synthesis of CoSb3-based unfilled skutterudites is presented. Using low-melting temperature salts of the constituents, melting and mixing them homogeneously in a hydrophobic liquid with postprocessing of the powders we achieve a more...

Branch-pipe-routing approach for ships using improved genetic algorithm

Science.gov (United States)

Sui, Haiteng; Niu, Wentie

2016-09-01

Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

A multi-objective location routing problem using imperialist competitive algorithm

Directory of Open Access Journals (Sweden)

Amir Mohammad Golmohammadi

2016-06-01

Full Text Available Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

Full Text Available MANET (short for Mobile Ad-Hoc Network consists of a set of mobile network nodes, network configuration changes very fast. In content based routing, data is transferred from source node to request nodes is not based on destination addresses. Therefore, it is very flexible and reliable, because source node does not need to know destination nodes. If We can find multiple paths that satisfies bandwidth requirement, split the original message into multiple smaller messages to transmit concurrently on these paths. On destination nodes, combine separated messages into the original message. Hence it can utilize better network resources, causes data transfer rate to be higher, load balancing, failover. Service Oriented Routing is inherited from the model of content based routing (CBR, combined with several advanced techniques such as Multicast, multiple path routing, Genetic algorithm to increase the data rate, and data encryption to ensure information security. Fuzzy logic is a logical field study evaluating the accuracy of the results based on the approximation of the components involved, make decisions based on many factors relative accuracy based on experimental or mathematical proof. This article presents some techniques to support multiple path routing from one network node to a set of nodes with guaranteed quality of service. By using these techniques can decrease the network load, congestion, use network resources efficiently.

ADAPTIVE CLUSTER BASED ROUTING PROTOCOL WITH ANT COLONY OPTIMIZATION FOR MOBILE AD-HOC NETWORK IN DISASTER AREA

Directory of Open Access Journals (Sweden)

Enrico Budianto

2012-07-01

Full Text Available In post-disaster rehabilitation efforts, the availability of telecommunication facilities takes important role. However, the process to improve telecommunication facilities in disaster area is risky if it is done by humans. Therefore, a network method that can work efficiently, effectively, and capable to reach the widest possible area is needed. This research introduces a cluster-based routing protocol named Adaptive Cluster Based Routing Protocol (ACBRP equipped by Ant Colony Optimization method, and its implementation in a simulator developed by author. After data analysis and statistical tests, it can be concluded that routing protocol ACBRP performs better than AODV and DSR routing protocol. Pada upaya rehabilitasi pascabencana, ketersediaan fasilitas telekomunikasi memiliki peranan yang sangat penting. Namun, proses untuk memperbaiki fasilitas telekomunikasi di daerah bencana memiliki resiko jika dilakukan oleh manusia. Oleh karena itu, metode jaringan yang dapat bekerja secara efisien, efektif, dan mampu mencapai area seluas mungkin diperlukan. Penelitian ini memperkenalkan sebuah protokol routing berbasis klaster bernama Adaptive Cluster Based Routing Protocol (ACBRP, yang dilengkapi dengan metode Ant Colony Optimization, dan diimplementasikan pada simulator yang dikembangkan penulis. Setelah data dianalisis dan dilakukan uji statistik, disimpulkan bahwa protokol routing ACBRP beroperasi lebih baik daripada protokol routing AODV maupun DSR.

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

Science.gov (United States)

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Two Chaotic Patterns of Dynamic Risk Definition for Solving Hazardous Materials Routing Problem

Directory of Open Access Journals (Sweden)

Abbas Mahmoudabadi

2015-01-01

Full Text Available In the case of determining routes for hazardous material transportation, risk is considered as a main attribute. Transport risk, which is usually combined with other attributes such as cost or travel time, plays a significant role in determining paths for hazardous materials transportation. Since, risk is chaotically affected by road incidents, decision makers are dealing with selecting a method for defining chaotic risk factors in hazmat transportation. In this paper, transport risk has been defined as a chaotic variable using two different methods of generating chaotic patterns. In an experimental road network, which consists of eighty-nine nodes and one hundred and one two-way links, two different methods of generating chaotic variables have been used for applying the proposed procedure. In addition, results for different amounts of risk and cost have also been analyzed in case study. Results revealed that different cost and risk priorities change the frequencies of selected paths determined for hazmat transportation, but the route convergence of the route to chaos method is better than that of the logistic map equation.

Improvement and modification of the routing system for the health-care waste collection and transportation in Istanbul

International Nuclear Information System (INIS)

Alagoez, Aylin Zeren; Kocasoy, Guenay

2008-01-01

and the cost-benefit analyses of the existing and the proposed optimum transportation routes are investigated and the most feasible routes from the point of view of efficiency and economy have been determined. In order to solve the scheduling and route optimization problem, special software programs called MapInfo and Roadnet were used. For the program, the geocodes of hospital locations, data about the amount of the health-care wastes generated, the loading and unloading process times, and the capacity of the collecting vehicles were taken into account. The new systems developed aim at the daily collection of the health-care wastes from the institutions and their transportation directly to the final disposal area/facility by using the shortest and the most efficient routes to resolve the routing and scheduling problem and to reduce the cost arising from the transportation

A Hybrid 3D Path Planning Method for UAVs

DEFF Research Database (Denmark)

Ortiz-Arroyo, Daniel

2015-01-01

This paper presents a hybrid method for path planning in 3D spaces. We propose an improvement to a near-optimal 2D off-line algorithm and a flexible normalized on-line fuzzy controller to find shortest paths. Our method, targeted to low altitude domains, is simple and efficient. Our preliminary resu...

Flow Routing in River Yala Using the Muskingum Technique | Opere ...

African Journals Online (AJOL)

The magnitude and frequency of occurrence of extreme hydrological events is of great importance due to the reasons of communication, water supply, power generation, agriculture and others. Due to population ... Forecasting through flow routing is achieved in this study using the Muskingum method. In this method ...

Route selection issues for NWPA shipments

International Nuclear Information System (INIS)

Hill, C.V.; Harrison, I.G.

1993-01-01

Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Wang Tao

2014-04-01

Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

Science.gov (United States)

Khan, Anwar; Ali, Ihsan; Ghani, Abdullah; Khan, Nawsher; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-05-18

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described

Port Authority of Allegheny County Transit Routes

Data.gov (United States)

Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

Environmental factors along the Northern Sea Route

International Nuclear Information System (INIS)

Fjeld, P.E.

1993-01-01

The Northern Sea Route runs ca 5,600 nautical miles across the top of Russia from Murmansk to Vladivostok, and includes half of the Arctic basin. An environmental impact assessment is needed for this route because of the potential for commercial shipping to disturb the vulnerable Arctic environment along the route. For example, Russian development of oil and gas resources in the area served by the route is expected to rise dramatically in the near future. Drilling in the route area offshore has already begun, and potential blowouts or tanker spills are of concern. A pilot study on the environment along this route was conducted in 1990/91, focusing on a study of the literature and communications with Russian scientists working on Arctic ecology. Existing data seem to be insufficient and generally only cover the westernmost and easternmost parts of the route. A five-year research plan is proposed to provide an inventory of Arctic species in the route area and levels of contaminants present, to assess the environmental sensitivity of the area, and analyze impacts that increased shipping might have on the environment. Protection measures will also be suggested. 1 fig

Topographic recording of the Slalom racing route in snow

Directory of Open Access Journals (Sweden)

V.F. Giovanis

2018-02-01

Full Text Available Purpose: The purpose of the present research was the study and evaluation of the theodolite’s (topographic speedometer use in tracing a path in slalom racing on snow conditions with 58 gates and also to record the optimal method of tracing a slalom route in relation to: a the "velocity" of the race track (degree of difficulty of slalom, b safety of tracing the slalom route. Methods: This research was based on methodology and measurements of a race track in giant slalom with 35 gates in the ski resort "3-5 Pigadia" of Naoussa - Greece. The topographic speedometer was fixed in place at the start of the route. From this point, measurements were taken, for the placement of all 58 gates throughout the route. The measurement was taken using the pole-prism, placed in each interior gate turn, at which the theodolite was aimed. With the help of topographic speedometer the following geometrical parameters have been registered: distance between the gates (Δs, altitude difference of points (Δh with an accuracy up to 1cm, terrain slope (θ, gate angular deviation (δ with an accuracy of up to 1 minute of the angle (°. This allows the creation of the top-view, side-view (profile and three-dimensional aspect of the track, under race conditions on snow and not on dry ground. Results: The correlation coefficient (r between the geometry factor (V.gs and average the above geometry parameters had the following respective values: V.gs -Ms = 0,15, V.gs -Mθ = - 0,52, V.gs -Mδ = - 0,29 for 58 gates on a level of statistical significance of p < 0,05. Conclusions: The first part comprised of 10 gates was the "fastest" (V.gs = 18 degrees of the total slalom route in Naoussa with 58 gates (V.gs = 14 degrees. With the above criteria, slaloms will be compared to each other and will be evaluated against age and safety.

Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices

Directory of Open Access Journals (Sweden)

Mazyar Seraj

2014-06-01

Full Text Available In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs, Tablet PCs, mobile phones and other mobile equipment have been used as parts of electronic learning environments to facilitate learning and teaching for both lecturers and students. However, there is still a dearth of study investigating the effects of small screen interfaces on mobile-based learning environments. This study aims to address two objectives: (i investigate lecturer and student difficulties encountered in teaching-learning process in traditional face-to-face classroom settings, and (ii to explore lecturer and student perceptions about learning the subject through mobile devices. This paper presents the results of a qualitative study using structured interviews to investigate lecturer and student experiences and perceptions on teaching and learning Dijkstra’s shortest path algorithm via mobile devices. The interview insights were then used as inputs to define user requirements for a mobile learning prototype. The findings show that the lecturers and students raised many issues about interactivity and the flexibility of effective learning applications on small screen devices, especially for a technical subject.

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

Pheromone based alternative route planning

Directory of Open Access Journals (Sweden)

Liangbing Feng

2016-08-01

Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.

Route planning algorithms: Planific@ Project

Directory of Open Access Journals (Sweden)

Gonzalo Martín Ortega

2009-12-01

Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

Why aircraft will fly more fuel-efficiently on FRIDAY : The FRIDAY route charges method

NARCIS (Netherlands)

Verbeek, R.J.D.; Visser, H.G.; Lovell, D.; Fricke, H.

2016-01-01

The Single European Sky is being introduced to improve the efficiency of flight and traffic operations by reforming the air traffic management system. Despite all of these technical advances, airlines choose detours to avoid high route charges. This mechanism is intensified when fuel prices are low.

Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

Science.gov (United States)

Raoufi, R.; Beighley, E.; Lee, H.

2017-12-01

Lake and reservoir dynamics can influence local to regional water cycles but are often not well represented in hydrologic models. One challenge that limits their inclusion in models is the need for detailed storage-discharge behavior that can be further complicated in reservoirs where specific operation rules are employed. Here, the Hillslope River Routing (HRR) model is combined with a remotely sensed based Reservoir Routing (RR) method and applied to the Congo River Basin. Given that topographic data are often continuous over the entire terrestrial surface (i.e., does not differentiate between land and open water), the HRR-RR model integrates topographic derived river networks and catchment boundaries (e.g., HydroSHEDs) with water boundary extents (e.g., Global Lakes and Wetlands Database) to develop the computational framework. The catchments bordering lakes and reservoirs are partitioned into water and land portions, where representative flowpath characteristics are determined and vertical water balance and lateral routings is performed separately on each partition based on applicable process models (e.g., open water evaporation vs. evapotranspiration). To enable reservoir routing, remotely sensed water surface elevations and extents are combined to determine the storage change time series. Based on the available time series, representative storage change patterns are determined. Lake/reservoir routing is performed by combining inflows from the HRR-RR model and the representative storage change patterns to determine outflows. In this study, a suite of storage change patterns derived from remotely sensed measurements are determined representative patterns for wet, dry and average conditions. The HRR-RR model dynamically selects and uses the optimal storage change pattern for the routing process based on these hydrologic conditions. The HRR-RR model results are presented to highlight the importance of lake attenuation/routing in the Congo Basin.

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

Navigable windows of the Northwest Passage

Science.gov (United States)

Liu, Xing-he; Ma, Long; Wang, Jia-yue; Wang, Ye; Wang, Li-na

2017-09-01

Artic sea ice loss trends support a greater potential for Arctic shipping. The information of sea ice conditions is important for utilizing Arctic passages. Based on the shipping routes given by ;Arctic Marine Shipping Assessment 2009 Report;, the navigable windows of these routes and the constituent legs were calculated by using sea ice concentration product data from 2006 to 2015, by which a comprehensive knowledge of the sea ice condition of the Northwest Passage was achieved. The results showed that Route 4 (Lancaster Sound - Barrow Strait - Prince Regent Inlet and Bellot Strait - Franklin Strait - Larsen Sound - Victoria Strait - Queen Maud Gulf - Dease Strait - Coronation Gulf - Dolphin and Union Strait - Amundsen Gulf) had the best navigable expectation, Route 2 (Parry Channel - M'Clure Strait) had the worst, and the critical legs affecting the navigation of Northwest Passage were Viscount Melville Sound, Franklin Strait, Victoria Strait, Bellot Strait, M'Clure Strait and Prince of Wales Strait. The shortest navigable period of the routes of Northwest Passage was up to 69 days. The methods used and the results of the study can help the selection and evaluation of Arctic commercial routes.

Aircraft route forecasting under adverse weather conditions

Directory of Open Access Journals (Sweden)

Thomas Hauf

2017-04-01

Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

Fine particles and NO{sub 2}. Development and validation of a method for the immission-relevant, dynamic re-routing of traffic; Feinstaub und NO{sub 2}. Entwicklung und Validierung einer Methode zur immissionsabhaengigen dynamischen Verkehrssteuerung

Energy Technology Data Exchange (ETDEWEB)

Ludes, G.; Siebers, B. [simuPlan, Dorsten (Germany); Kuhlbusch, T.; Quass, U.; Beyer, M. [Institut fuer Energie- und Umwelttechnik, Duisburg (Germany); Weber, F. [Stadt Hagen (Germany)

2010-05-15

Due to the coming into effect of the twenty-second BImSchV comprehensive investigations on the ambient air quality have been carried out in the city of Hagen in recent years by means of measurement and modelling. High concentrations of nitrogen dioxide and respirable dust have been found along the main streets and the roads belonging to the city ring road system. Main cause of the present situation is road traffic, esp. heavy duty vehicles (HDV). Therefore the concept of measures for the implementation of the air monitoring plan and the action plan set up by the project group includes a HDV-routing system and dynamic, immission-relevant re-routing of traffic. Through this research project the practicability and the effects on air quality of the dynamic, immission-relevant re-routing of HDV-traffic will especially be examined within the highly polluted area of the ''Maerkischer Ring''. By making use of the control programme simDRIVE this innovative concept allows temporary closures of the ''Maerkischer Ring'' for HDV-traffic if transgression of critical limit values is prognosticated due to traffic volume and meteorological circumstances. During these closure periods HDV-traffic will be diverted to alternative and previously determined routes by dynamic and static traffic signs in order to guarantee that intended destinations can be reached. With the help of this research project it should be demonstrated in addition (a) if and how this particular method for NO{sub 2} can also be applied on the reduction of respirable dust, (b) how this measure affects the situation of air pollution regarding respirable dust in other parts of Hagen and (c) if the transfer of methods for the use in other cities is possible. (orig.)

Computing a ground appropriateness index for route selection in permafrost regions

Directory of Open Access Journals (Sweden)

Chi Zhang

2017-10-01

Full Text Available The reasonable calculation of ground appropriateness index in permafrost region is the precondition of highway route design in permafrost region. The theory of knowledge base and fuzzy mathematics are applied, and the damage effect of permafrost is considered in the paper. Based on the idea of protecting permafrost the calculation method of ground appropriateness index is put forward. Firstly, based on the actual environment conditions, the paper determines the factors affecting the road layout in permafrost areas by qualitative and quantitative analysis, including the annual slope, the average annual ground temperature of permafrost, the amount of ice in frozen soil, and the interference engineering. Secondly, based on the knowledge base theory and the use of Delphi method, the paper establishes the knowledge base, the rule base of the permafrost region and inference mechanism. The method of selecting the road in permafrost region is completed and realized by using the software platform. Thirdly, taking the Tuotuo River to Kaixin Mountain section of permafrost region as an example, the application of the method is studied by using an ArcGIS platform. Results show that the route plan determined by the method of selecting the road in permafrost region can avoid the high temperature and high ice content area, conform the terrain changes and evade the heat disturbance among the existing projects. A reasonable route plan can be achieved, and it can provide the basis for the next engineering construction.

THE INFLUENCE OF SEXUAL VIOLENCE CODE EXPOSURE TOWARD PARENTS’ COGNITION ROUTES

Directory of Open Access Journals (Sweden)

Rahmiati D.

2017-11-01

Full Text Available Messages and sign have certain influence toward humans’ cognition, yet different person might perceive them differently. Persuasive message appears to be one type of messages which has the strongest potential in modifying ones’ behavior. Children and anything about them are parents’ biggest proximity. Regarding to the massive exposure of sexual violence cases happened to children, parents demand access to know more information on this issue. This research is intended to see the effect of the exposure on news about sexual violence in children toward cognition route of parents who have daughters, and to see if there is any different cognition route between fathers and mothers in perceiving news related to sexual violence on children. This research employed an experimental method using the one group pre-post test design. This research involved 15 parents who have daughters who were chosen using an accidental sampling method. This reseach was conducted in the computer laboratory of FISIP UB. Sexual violence codes were displayed in some videos which showed some news on sexual violence happened to children. After that, an instrument in the form of central code and peripheral cognition route scale which was developed from the elaboration likegood model (ELM was given to the samples in the form of questionnaires after they watched some persuasive messages. The results of the data were analyzed using t-test of SPSS 22.0 program. The result of this reseach shows that there is an effect of sexual violence news toward parents’ congition route at 0.820 in a level of significance 0.000, while the congiton route of mothers shows higher mean value at 104.66 than fathers at 91.73.

The Silk Route from Land to Sea

Directory of Open Access Journals (Sweden)

Jack Weatherford

2018-04-01

Full Text Available The Silk Route reached its historic and economic apogee under the Mongol Empire (1207–1368, as a direct result of the policies of Chinggis Khan (Genghis Khan and his successors. Because the land network proved inefficient for the amount of goods needing transport from one part of the empire to another, the Mongols expanded the Silk Route to ocean shipping and thus created the first Maritime Silk Route. The sea traffic initially expanded the land routes but soon strangled them. With the expansion of the Maritime Silk Route through the fourteenth century, the land connections reverted to local networks and lost their global importance.

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

Fatigue mitigation effects of en-route napping on commercial airline pilots flying international routes

Science.gov (United States)

Baldwin, Jarret Taylor

The introduction of ultra-long range commercial aircraft and the evolution of the commercial airline industry has provided new opportunities for air carriers to fly longer range international route segments while deregulation, industry consolidation, and the constant drive to reduce costs wherever possible has pressured airline managements to seek more productivity from their pilots. At the same time, advancements in the understanding of human physiology have begun to make their way into flight and duty time regulations and airline scheduling practices. In this complex and ever changing operating environment, there remains an essential need to better understand how these developments, and other daily realities facing commercial airline pilots, are affecting their fatigue management strategies as they go about their rituals of getting to and from their homes to work and performing their flight assignments. Indeed, the need for commercial airline pilots to have access to better and more effective fatigue mitigation tools to combat fatigue and insure that they are well rested and at the top of their game when flying long-range international route segments has never been greater. This study examined to what extent the maximum fatigue states prior to napping, as self-accessed by commercial airline pilots flying international route segments, were affected by a number of other common flight assignment related factors. The study also examined to what extent the availability of scheduled en-route rest opportunities, in an onboard crew rest facility, affected the usage of en-route napping as a fatigue mitigation strategy, and to what extent the duration of such naps affected the perceived benefits of such naps as self-accessed by commercial airline pilots flying international route segments. The study utilized an online survey tool to collect data on crew position, prior flight segments flown in the same duty period, augmentation, commuting, pre-flight rest obtained in the

Perception bias in route choice

NARCIS (Netherlands)

Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

2014-01-01

Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

Full Text Available The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

2001-01-01

In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

Branch and price for the time-dependent vehicle routing problem with time windows

DEFF Research Database (Denmark)

Dabia, Said; Dabia, Said; Van Woensel, Tom

2013-01-01

of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances...... solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a setpartitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means...... with 25 customers, 38% of the instances with 50 customers, and 15% of the instances with 100 customers. © 2013 INFORMS....

Vehicle routing for the eco-efficient collection of household plastic waste

NARCIS (Netherlands)

Bing, X.; Keizer, de M.; Bloemhof, J.M.; Vorst, van der J.G.A.J.

2014-01-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of

Policy Gradient SMDP for Resource Allocation and Routing in Integrated Services Networks

Science.gov (United States)

Vien, Ngo Anh; Viet, Nguyen Hoang; Lee, Seunggwan; Chung, Taechoong

In this paper, we solve the call admission control (CAC) and routing problem in an integrated network that handles several classes of calls of different values and with different resource requirements. The problem of maximizing the average reward (or cost) of admitted calls per unit time is naturally formulated as a semi-Markov Decision Process (SMDP) problem, but is too complex to allow for an exact solution. Thus in this paper, a policy gradient algorithm, together with a decomposition approach, is proposed to find the dynamic (state-dependent) optimal CAC and routing policy among a parameterized policy space. To implement that gradient algorithm, we approximate the gradient of the average reward. Then, we present a simulation-based algorithm to estimate the approximate gradient of the average reward (called GSMDP algorithm), using only a single sample path of the underlying Markov chain for the SMDP of CAC and routing problem. The algorithm enhances performance in terms of convergence speed, rejection probability, robustness to the changing arrival statistics and an overall received average revenue. The experimental simulations will compare our method's performance with other existing methods and show the robustness of our method.

The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann; Madsen, Oli B.G.

2009-01-01

This paper introduces the double travelling salesman problem with multiple stacks and presents four different metaheuristic approaches to its solution. The double TSP with multiple stacks is concerned with determining the shortest route performing pickups and deliveries in two separated networks...

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules

Directory of Open Access Journals (Sweden)

Michaeli Shulamit

2007-10-01

Full Text Available Abstract Background In recent years, RNA molecules that are not translated into proteins (ncRNAs have drawn a great deal of attention, as they were shown to be involved in many cellular functions. One of the most important computational problems regarding ncRNA is to predict the secondary structure of a molecule from its sequence. In particular, we attempted to predict the secondary structure for a set of unaligned ncRNA molecules that are taken from the same family, and thus presumably have a similar structure. Results We developed the RNAspa program, which comparatively predicts the secondary structure for a set of ncRNA molecules in linear time in the number of molecules. We observed that in a list of several hundred suboptimal minimal free energy (MFE predictions, as provided by the RNAsubopt program of the Vienna package, it is likely that at least one suggested structure would be similar to the true, correct one. The suboptimal solutions of each molecule are represented as a layer of vertices in a graph. The shortest path in this graph is the basis for structural predictions for the molecule. We also show that RNA secondary structures can be compared very rapidly by a simple string Edit-Distance algorithm with a minimal loss of accuracy. We show that this approach allows us to more deeply explore the suboptimal structure space. Conclusion The algorithm was tested on three datasets which include several ncRNA families taken from the Rfam database. These datasets allowed for comparison of the algorithm with other methods. In these tests, RNAspa performed better than four other programs.

An auxiliary optimization method for complex public transit route network based on link prediction

Science.gov (United States)

Zhang, Lin; Lu, Jian; Yue, Xianfei; Zhou, Jialin; Li, Yunxuan; Wan, Qian

2018-02-01

Inspired by the missing (new) link prediction and the spurious existing link identification in link prediction theory, this paper establishes an auxiliary optimization method for public transit route network (PTRN) based on link prediction. First, link prediction applied to PTRN is described, and based on reviewing the previous studies, the summary indices set and its algorithms set are collected for the link prediction experiment. Second, through analyzing the topological properties of Jinan’s PTRN established by the Space R method, we found that this is a typical small-world network with a relatively large average clustering coefficient. This phenomenon indicates that the structural similarity-based link prediction will show a good performance in this network. Then, based on the link prediction experiment of the summary indices set, three indices with maximum accuracy are selected for auxiliary optimization of Jinan’s PTRN. Furthermore, these link prediction results show that the overall layout of Jinan’s PTRN is stable and orderly, except for a partial area that requires optimization and reconstruction. The above pattern conforms to the general pattern of the optimal development stage of PTRN in China. Finally, based on the missing (new) link prediction and the spurious existing link identification, we propose optimization schemes that can be used not only to optimize current PTRN but also to evaluate PTRN planning.

Route Choice in Subway Station during Morning Peak Hours: A Case of Guangzhou Subway

Directory of Open Access Journals (Sweden)

Jie Xu

2015-01-01

Full Text Available This paper is aimed at crowding phenomenon in the subway. As passengers are inclined to choose the route with minimum disutility, we put forward a route choice model which is constructed to achieve minimum objective function of feasibility for the optimal solution. Meanwhile we set passenger volume threshold values according to capacity of facilities. In the case of actual capacity exceeding the threshold, the decision node of constrained route will be selected; computing procedure about searching decision points will be presented. Then we should set rational restrictions at the decision node of the minimum utility function route to prevent too many passengers’ access to platform. Through certification, this series of methods can effectively ensure the safety of the station efficient operation.

Operating Time Division for a Bus Route Based on the Recovery of GPS Data

Directory of Open Access Journals (Sweden)

Jian Wang

2017-01-01

Full Text Available Bus travel time is an important source of data for time of day partition of the bus route. However, in practice, a bus driver may deliberately speed up or slow down on route so as to follow the predetermined timetable. The raw GPS data collected by the GPS device equipped on the bus, as a result, cannot reflect its real operating conditions. To address this concern, this study first develops a method to identify whether there is deliberate speed-up or slow-down movement of a bus. Building upon the relationships between the intersection delay, link travel time, and traffic flow, a recovery method is established for calculating the real bus travel time. Using the dwell time at each stop and the recovered travel time between each of them as the division indexes, a sequential clustering-based time of day partition method is proposed. The effectiveness of the developed method is demonstrated using the data of bus route 63 in Harbin, China. Results show that the partition method can help bus enterprises to design reasonable time of day intervals and significantly improve their level of service.

Estimation of uncertainty of wind energy predictions with application to weather routing and wind power generation

CERN Document Server

Zastrau, David

2017-01-01

Wind drives in combination with weather routing can lower the fuel consumption of cargo ships significantly. For this reason, the author describes a mathematical method based on quantile regression for a probabilistic estimate of the wind propulsion force on a ship route.

A Machine Learning Concept for DTN Routing

Science.gov (United States)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

Reserving Charging Decision-Making Model and Route Plan for Electric Vehicles Considering Information of Traffic and Charging Station

Directory of Open Access Journals (Sweden)

Haoming Liu

2018-04-01

Full Text Available With the advance of battery energy technology, electric vehicles (EV are catching more and more attention. One of the influencing factors of electric vehicles large-scale application is the availability of charging stations and convenience of charging. It is important to investigate how to make reserving charging strategies and ensure electric vehicles are charged with shorter time and lower charging expense whenever charging request is proposed. This paper proposes a reserving charging decision-making model for electric vehicles that move to certain destinations and need charging services in consideration of traffic conditions and available charging resources at the charging stations. Besides, the interactive mechanism is described to show how the reserving charging system works, as well as the rolling records-based credit mechanism where extra charges from EV is considered to hedge default behavior. With the objectives of minimizing driving time and minimizing charging expenses, an optimization model with two objective functions is formulated. Then the optimizations are solved by a K shortest paths algorithm based on a weighted directed graph, where the time and distance factors are respectively treated as weights of corresponding edges of transportation networks. Case studies show the effectiveness and validity of the proposed route plan and reserving charging decision-making model.

Management of Energy Consumption on Cluster Based Routing Protocol for MANET

Science.gov (United States)

Hosseini-Seno, Seyed-Amin; Wan, Tat-Chee; Budiarto, Rahmat; Yamada, Masashi

The usage of light-weight mobile devices is increasing rapidly, leading to demand for more telecommunication services. Consequently, mobile ad hoc networks and their applications have become feasible with the proliferation of light-weight mobile devices. Many protocols have been developed to handle service discovery and routing in ad hoc networks. However, the majority of them did not consider one critical aspect of this type of network, which is the limited of available energy in each node. Cluster Based Routing Protocol (CBRP) is a robust/scalable routing protocol for Mobile Ad hoc Networks (MANETs) and superior to existing protocols such as Ad hoc On-demand Distance Vector (AODV) in terms of throughput and overhead. Therefore, based on this strength, methods to increase the efficiency of energy usage are incorporated into CBRP in this work. In order to increase the stability (in term of life-time) of the network and to decrease the energy consumption of inter-cluster gateway nodes, an Enhanced Gateway Cluster Based Routing Protocol (EGCBRP) is proposed. Three methods have been introduced by EGCBRP as enhancements to the CBRP: improving the election of cluster Heads (CHs) in CBRP which is based on the maximum available energy level, implementing load balancing for inter-cluster traffic using multiple gateways, and implementing sleep state for gateway nodes to further save the energy. Furthermore, we propose an Energy Efficient Cluster Based Routing Protocol (EECBRP) which extends the EGCBRP sleep state concept into all idle member nodes, excluding the active nodes in all clusters. The experiment results show that the EGCBRP decreases the overall energy consumption of the gateway nodes up to 10% and the EECBRP reduces the energy consumption of the member nodes up to 60%, both of which in turn contribute to stabilizing the network.

Satellite Image Analysis along the Kuala Selangor to Sabak Bernam Rural Tourism Routes

Science.gov (United States)

Ibrahim, I.; Zakariya, K.; Wahab, N. A.

2018-02-01

This research focuses on the analysis of land cover map using satellite imagery along the rural routes. The aim of this research is to study the landscape features that can be seen by the tourists around the rural routes. The objectives of the study are twofold: (i) to analyse the land cover types along the rural routes and (ii) to create a tourist map along the rural routes. The method adopted was to use Supervised Classification by creating multiple polygons to ensure that each information is sufficient to create appropriate spectral signatures. The finding shows that 80% of the landscape features along the Point of Interest (POI) are paddy field. According to the analysis using the indicators criteria for choosing the rural routes, this research shows that this area has the potential to be part of a tourism area because it has many historical and cultural elements that can be exposed to tourists. Future research will be a factor analysis on the significance of the criteria to rural tourism attraction.

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

Full Text Available This article continues “Warehouse order-picking process” cycle and describes order-picker routing sub-problem of a warehouse order-picking process. It draws analogies between the orderpickers’ routing problem and traveling salesman’s problem, shows differences between the standard problem statement of a traveling salesman and routing problem of warehouse orderpickers, and gives the particular Steiner’s problem statement of a traveling salesman.Warehouse layout with a typical order is represented by a graph, with some its vertices corresponding to mandatory order-picker’s visits and some other ones being noncompulsory. The paper describes an optimal Ratliff-Rosenthal algorithm to solve order-picker’s routing problem for the single-block warehouses, i.e. warehouses with only two crossing aisles, defines seven equivalent classes of partial routing sub-graphs and five transitions used to have an optimal routing sub-graph of a order-picker. An extension of optimal Ratliff-Rosenthal order-picker routing algorithm for multi-block warehouses is presented and also reasons for using the routing heuristics instead of exact optimal algorithms are given. The paper offers algorithmic description of the following seven routing heuristics: S-shaped, return, midpoint, largest gap, aisle-by-aisle, composite, and combined as well as modification of combined heuristics. The comparison of orderpicker routing heuristics for one- and two-block warehouses is to be described in the next article of the “Warehouse order-picking process” cycle.

Routing algorithms in networks-on-chip

CERN Document Server

Daneshtalab, Masoud

2014-01-01

This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation.  Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.   ·         Provides a comprehensive overview of routing algorithms for Networks-on-Chip and NoC-based, manycore systems; ·         Describe...

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

2012-01-01

instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

Science.gov (United States)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

Shortest loops are pacemakers in random networks of electrically coupled axons

Directory of Open Access Journals (Sweden)

Nikita eVladimirov

2012-04-01

Full Text Available High-frequency oscillations (HFOs are an important part of brain activity in health and disease. However, their origins remain obscure and controversial. One possible mechanism depends on the presence of sparsely distributed gap junctions that electrically couple the axons of principal cells. A plexus of electrically coupled axons is modeled as a random network with bidirectional connections between its nodes. Under certain conditions the network can demonstrate one of two types of oscillatory activity. Type I oscillations (100-200 Hz are predicted to be caused by spontaneously spiking axons in a network with strong (high-conductance gap junctions. Type II oscillations (200-300 Hz require no spontaneous spiking and relatively weak (low-conductance gap junctions, across which spike propagation failures occur. The type II oscillations are reentrant and self-sustained. Here we examine what determines the frequency of type II oscillations. Using simulations we show that the distribution of loop lengths is the key factor for determining frequency in type II network oscillations. We first analyze spike failure between two electrically coupled cells using a model of anatomically reconstructed CA1 pyramidal neuron. Then network oscillations are studied by a cellular automaton model with random network connectivity, in which we control loop statistics. We show that oscillation periods can be predicted from the network's loop statistics. The shortest loop, around which a spike can travel, is the most likely pacemaker candidate.The principle of one loop as a pacemaker is remarkable, because random networks contain a large number of loops juxtaposed and superimposed, and their number rapidly grows with network size. This principle allows us to predict the frequency of oscillations from network connectivity and visa versa. We finally propose that type I oscillations may correspond to ripples, while type II oscillations correspond to so-called fast ripples.

On the relationship between travel time and travel distance of commuters

NARCIS (Netherlands)

Rietveld, P.; Zwart, A.P.; Wee, van G.P.; Hoorn, van der T.

1999-01-01

This paper gives a detailed empirical analysis of the relationships between different indicators of costs of commuting trips by car: difference as the crow flies, shortest travel time according to route planner, corresponding travel distance, and reported travel time. Reported travel times are

On the relationship between travel time and travel distance in the Netherlands

NARCIS (Netherlands)

Rietveld, P.; Zwart, B.; van Wee, B.; van der Hoorn, A.I.J.M.

1999-01-01

This paper gives a detailed empirical analysis of the relationships between different indicators of costs of commuting trips by car: difference as the crow flies, shortest travel time according to route planner, corresponding travel distance, and reported travel time. Reported travel times are

A simple urea-based route to ternary metal oxynitride nanoparticles

International Nuclear Information System (INIS)

Gomathi, A.; Reshma, S.; Rao, C.N.R.

2009-01-01

Ternary metal oxynitrides are generally prepared by heating the corresponding metal oxides with ammonia for long durations at high temperatures. In order to find a simple route that avoids use of gaseous ammonia, we have employed urea as the nitriding agent. In this method, ternary metal oxynitrides are obtained by heating the corresponding metal carbonates and transition metal oxides with excess urea. By this route, ternary metal oxynitrides of the formulae MTaO 2 N (M=Ca, Sr or Ba), MNbO 2 N (M=Sr or Ba), LaTiO 2 N and SrMoO 3-x N x have been prepared successfully. The oxynitrides so obtained were generally in the form of nanoparticles, and were characterized by various physical techniques. - Graphical abstract: Nanoparticles of ternary metal oxynitrides can be synthesized by means of urea route. Given is the TEM image of the nanoparticles of CaTaO 2 N so obtained and the insets show the SAED pattern and HREM image of the nanoparticles

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Directory of Open Access Journals (Sweden)

Yingcheng Xu

2013-01-01

Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

Route Generation for a Synthetic Character (BOT) Using a Partial or Incomplete Knowledge Route Generation Algorithm in UT2004 Virtual Environment

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

This paper presents a new Route Generation Algorithm that accurately and realistically represents human route planning and navigation for Military Operations in Urban Terrain (MOUT). The accuracy of this algorithm in representing human behavior is measured using the Unreal Tournament(Trademark) 2004 (UT2004) Game Engine to provide the simulation environment in which the differences between the routes taken by the human player and those of a Synthetic Agent (BOT) executing the A-star algorithm and the new Route Generation Algorithm can be compared. The new Route Generation Algorithm computes the BOT route based on partial or incomplete knowledge received from the UT2004 game engine during game play. To allow BOT navigation to occur continuously throughout the game play with incomplete knowledge of the terrain, a spatial network model of the UT2004 MOUT terrain is captured and stored in an Oracle 11 9 Spatial Data Object (SOO). The SOO allows a partial data query to be executed to generate continuous route updates based on the terrain knowledge, and stored dynamic BOT, Player and environmental parameters returned by the query. The partial data query permits the dynamic adjustment of the planned routes by the Route Generation Algorithm based on the current state of the environment during a simulation. The dynamic nature of this algorithm more accurately allows the BOT to mimic the routes taken by the human executing under the same conditions thereby improving the realism of the BOT in a MOUT simulation environment.

Dealing with the white death: avalanche risk management for traffic routes.

Science.gov (United States)

Rheinberger, Christoph M; Bründl, Michael; Rhyner, Jakob

2009-01-01

This article discusses mitigation strategies to protect traffic routes from snow avalanches. Up to now, mitigation of snow avalanches on many roads and railways in the Alps has relied on avalanche sheds, which require large initial investments resulting in high opportunity costs. Therefore, avalanche risk managers have increasingly adopted organizational mitigation measures such as warning systems and closure policies instead. The effectiveness of these measures is, however, greatly dependent on human decisions. In this article, we present a method for optimizing avalanche mitigation for traffic routes in terms of both their risk reduction impact and their net benefit to society. First, we introduce a generic framework for assessing avalanche risk and for quantifying the impact of mitigation. This allows for sound cost-benefit comparisons between alternative mitigation strategies. Second, we illustrate the framework with a case study from Switzerland. Our findings suggest that site-specific characteristics of avalanche paths, as well as the economic importance of a traffic route, are decisive for the choice of optimal mitigation strategies. On routes endangered by few avalanche paths with frequent avalanche occurrences, structural measures are most efficient, whereas reliance on organizational mitigation is often the most appropriate strategy on routes endangered by many paths with infrequent or fuzzy avalanche risk. Finally, keeping a traffic route open may be very important for tourism or the transport industry. Hence, local economic value may promote the use of a hybrid strategy that combines organizational and structural measures to optimize the resource allocation of avalanche risk mitigation.

Location aware event driven multipath routing in Wireless Sensor Networks: Agent based approach

Directory of Open Access Journals (Sweden)

A.V. Sutagundar

2013-03-01

Full Text Available Wireless Sensor Networks (WSNs demand reliable and energy efficient paths for critical information delivery to sink node from an event occurrence node. Multipath routing facilitates reliable data delivery in case of critical information. This paper proposes an event triggered multipath routing in WSNs by employing a set of static and mobile agents. Every sensor node is assumed to know the location information of the sink node and itself. The proposed scheme works as follows: (1 Event node computes the arbitrary midpoint between an event node and the sink node by using location information. (2 Event node establishes a shortest path from itself to the sink node through the reference axis by using a mobile agent with the help of location information; the mobile agent collects the connectivity information and other parameters of all the nodes on the way and provides the information to the sink node. (3 Event node finds the arbitrary location of the special (middle intermediate nodes (above/below reference axis by using the midpoint location information given in step 1. (4 Mobile agent clones from the event node and the clones carry the event type and discover the path passing through special intermediate nodes; the path above/below reference axis looks like an arc. While migrating from one sensor node to another along the traversed path, each mobile agent gathers the node information (such as node id, location information, residual energy, available bandwidth, and neighbors connectivity and delivers to the sink node. (5 The sink node constructs a partial topology, connecting event and sink node by using the connectivity information delivered by the mobile agents. Using the partial topology information, sink node finds the multipath and path weight factor by using link efficiency, energy ratio, and hop distance. (6 The sink node selects the number of paths among the available paths based upon the criticalness of an event, and (7 if the event is non

The Route Analysis Based On Flight Plan

Science.gov (United States)

Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

2016-02-01

Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhi Chen

2015-01-01

Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

A Plasma-Assisted Route to the Rapid Preparation of Transition-Metal Phosphides for Energy Conversion and Storage

KAUST Repository

Liang, Hanfeng; Alshareef, Husam N.

2017-01-01

with the method of preparation as the electronic, catalytic, and magnetic properties of the metal phosphides strongly depend on their synthesis routes. Commonly practiced processes such as solid-state synthesis and ball milling have proven to be reliable routes

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Directory of Open Access Journals (Sweden)

Dongshuang Li

2018-05-01

Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

2014-01-01

Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

Honey buzzards don't always make a beeline.

Science.gov (United States)

Chapman, Jason W

2017-03-01

(a) European honey buzzards breeding in Western Europe primarily use soaring flight to make annual long-range migrations via the Strait of Gibraltar to winter in West Africa; this adult male was photographed on migration near Gibraltar. Photo: Javier Elloriaga. (b) Autumn migration routes of 12 satellite tagged adult European honey buzzards (colour-coded lines); compared with the shortest possible straight-line routes (dashed lines), most routes involved substantial westerly detours in Africa. Adapted from Vansteelant et al. (2016). (c) In contrast, Montagu's harriers predominantly use flapping flight during their migrations; this adult male is carrying a satellite transmitter. Photo: Theo van Kooten. (d) Autumn migration routes of 34 satellite tagged adult Montagu's harriers; migratory tracks more closely approached straight-line routes, and typically involved longer sea crossings, than seen in European honey buzzards. Adapted from Trierweiler et al. (). In Focus: Vansteelant, W.M.G., Shamoun-Baranes, J., van Manen, W., van Diermen, J. & Bouten, W. (2017) Seasonal detours by soaring migrants shaped by wind regimes along the East Atlantic Flyway. Journal of Animal Ecology, 86, 179-191. Migratory birds often make substantial detours from the shortest possible route during their annual migrations, which may potentially increase the duration and energetic cost of their journeys. Vansteelant et al. () investigate repeated migrations of adult European honey buzzards between the Netherlands and sub-Saharan Africa, and find that they make large westerly detours in Africa on both the spring and autumn routes. These detours allow migrants to capitalise on more favourable winds further along the route, thus reducing energy expenditure. Lifelong tracking studies will allow researchers to identify how migration routes have evolved to exploit predictable atmospheric and oceanic circulation patterns. © 2017 The Author. Journal of Animal Ecology © 2017 British Ecological

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

Using geospatial techniques to develop an emergency referral transport system for suspected sepsis patients in Bangladesh

Science.gov (United States)

Haider, Rafiqul; Abdullah, Abu Yousuf Md; Christou, Aliki; Ali, Nabeel Ashraf; Rahman, Ahmed Ehsnaur; Iqbal, Afrin; Bari, Sanwarul; Hoque, D. M. Emdadul; Arifeen, Shams El; Kissoon, Niranjan; Larson, Charles P.

2018-01-01

Background A geographic information system (GIS)-based transport network within an emergency referral system can be the key to reducing health system delays and increasing the chances of survival, especially during an emergency. We employed a GIS to design an emergency transport system for the rapid transfer of pregnant or early post-partum women, newborns, and children under 5 years of age with suspected sepsis under the Interrupting Pathways to Sepsis Initiative (IPSI) project. Methods A GIS database was developed by mapping the villages, roads, and relevant physical features of the study area. A travel-time algorithm was developed to incorporate the time taken by different modes of local transport to reach the health complexes. These were used in a network analysis to identify the shortest routes to the hospitals from the villages, which were categorized into green, yellow, and red zones based on their proximity to the nearest hospitals to provide transport facilities. An emergency call-in centre established for the project managed the transport system, and its data was used to assess the uptake of this transport system amongst distant communities. Results Fifteen pre-existing and two new routes were identified as the shortest routes to the health complexes. The call-in centre personnel used this route information to direct both patients and transport drivers to the nearest transport hubs or pick-up points. Adherence with referral advice was high in areas where the IPSI transport operated. Over the study period, the utilisation of the project’s transport doubled and referral compliance from distant zones similarly increased. Conclusions The GIS system created for this study facilitated rapid referral of patients in emergency from distant zones, using locally available transport and resources. The methodology described in this study to develop and implement an emergency transport system can be applied in similar, rural, low-income country settings. PMID

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

Wu Bin; Kristiansen, E.; Skaali, B.; Bogaerts, A.; )

1994-03-01

The report deals with a particular class of multistage Scalable Coherent Interface (SCI) network systems and two important routing algorithms, namely self-routing and table-look up routing. The effect of routing delay on system performance is investigated by simulations. Adaptive routing and deadlock-free routing are studied. 8 refs., 11 figs., 1 tab

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

Haines, K.; Melia, N.; Hawkins, E.; Day, J. J.

2017-12-01

In our previous work [1] we showed how trans-Arctic shipping routes would become more available through the 21st century as sea ice declines, using CMIP5 models with means and stds calibrated to PIOMAS sea ice observations. Sea ice will continue to close shipping routes to open water vessels through the winter months for the foreseeable future so the availability of open sea routes will vary greatly from year to year. Here [2] we look at whether the trans-Arctic shipping season period can be predicted in seasonal forecasts, again using several climate models, and testing both perfect and imperfect knowledge of the initial sea ice conditions. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts may show lower skill before a May `predictability barrier'. Focussing on the northern sea route (NSR) off Siberia, the date of opening of this sea route is twice as variable as the closing date, and this carries through to reduced predictability at the start of the season. Under climate change the later freeze-up date accounts for 60% of the lengthening season, Fig1 We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than for average ice years. Forecasting the exact timing of route open periods is harder (more weather dependent) under average ice conditions while in high and low ice years the season is more controlled by the initial ice conditions from spring onwards. This could be very useful information for companies planning vessel routing for the coming season. We tested this dependence on the initial ice conditions by changing the initial ice state towards climatologically average conditions and show directly that early summer sea-ice thickness information is crucial to obtain skilful forecasts of the coming shipping season. Mechanisms for this are discussed. This strongly suggests that good sea ice thickness observations

Exploring bikeability in a metropolitan setting: stimulating and hindering factors in commuting route environments

Directory of Open Access Journals (Sweden)

Wahlgren Lina

2012-03-01

Full Text Available Abstract Background Route environments may influence people's active commuting positively and thereby contribute to public health. Assessments of route environments are, however, needed in order to better understand the possible relationship between active commuting and the route environment. The aim of this study was, therefore, to assess the potential associations between perceptions of whether the route environment on the whole hinders or stimulates bicycle commuting and perceptions of environmental factors. Methods The Active Commuting Route Environment Scale (ACRES was used for the assessment of bicycle commuters' perceptions of their route environments in the inner urban parts of Greater Stockholm, Sweden. Bicycle commuters (n = 827 were recruited by advertisements in newspapers. Simultaneous multiple regression analyses were used to assess the relation between predictor variables (such as levels of exhaust fumes, noise, traffic speed, traffic congestion and greenery and the outcome variable (hindering - stimulating route environments. Two models were run, (Model 1 without and (Model 2 with the item traffic: unsafe or safe included as a predictor. Results Overall, about 40% of the variance of hindering - stimulating route environments was explained by the environmental predictors in our models (Model 1, R2 = 0.415, and Model 2, R 2= 0.435. The regression equation for Model 1 was: y = 8.53 + 0.33 ugly or beautiful + 0.14 greenery + (-0.14 course of the route + (-0.13 exhaust fumes + (-0.09 congestion: all types of vehicles (p ≤ 0.019. The regression equation for Model 2 was y = 6.55 + 0.31 ugly or beautiful + 0.16 traffic: unsafe or safe + (-0.13 exhaust fumes + 0.12 greenery + (-0.12 course of the route (p ≤ 0.001. Conclusions The main results indicate that beautiful, green and safe route environments seem to be, independently of each other, stimulating factors for bicycle commuting in inner urban areas. On the other hand, exhaust

Lessons learned by southern states in designating alternative routes

International Nuclear Information System (INIS)

1989-08-01

The purpose of this report is to discuss the ''lessons learned'' by the five states within the southem region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations. Under DOT regulations (49 CFR 177.826), carriers of highway route controlled quantities of radioactive materials (which include spent nuclear fuel and high-level waste) must use preferred routes selected to reduce time in transit. Such preferred routes consist of (1) an interstate system highway with use of an interstate system bypass or beltway around cities when available, and (2) alternate routes selected by a ''state routing agency.''

Risk assessment of the entry of canine-rabies into Papua New Guinea via sea and land routes.

Science.gov (United States)

Brookes, Victoria J; Keponge-Yombo, Andy; Thomson, David; Ward, Michael P

2017-09-15

Canine-rabies is endemic in parts of Indonesia and continues to spread eastwards through the Indonesian archipelago. Papua New Guinea (PNG) has a land border with Papua Province, Indonesia, as well as logging and fishing industry connections throughout Asia. PNG has a Human Development Index of 0.505; therefore, an incursion of canine-rabies could have devastating impacts on human (7.5 million) and animal populations. Given the known difficulties of rabies elimination in resource-scarce environments, an incursion of rabies into PNG would also likely compromise the campaign for global elimination of rabies. A previous qualitative study to determine routes for detailed risk assessment identified logging, fishing and three land-routes (unregulated crossers ["shopper-crossers"], traditional border crossers and illegal hunters) as potential high risk routes for entry of rabies-infected dogs into PNG. The objective of the current study was to quantify and compare the probability of entry of a rabies-infected dog via these routes into PNG and to identify the highest risk provinces and border districts to target rabies prevention and control activities. Online questionnaires were used to elicit expert-opinion about quantitative model parameter values. A quantitative, stochastic model was then used to assess risk, and parameters with the greatest influence on the estimated mean number of rabies-infected dogs introduced/year were identified via global sensitivity analysis (Sobol method). Eight questionnaires - including 7 online - were implemented and >220 empirical distributions were parameterised using >2900 expert-opinions. The highest risk provinces for combined sea routes were West Sepik, Madang and Western Province, driven by the number of vessels and the probability of bringing dogs. The highest risk border districts for combined land routes were Vanimo-Green River and South Fly, driven by the number of people crossing the border and the number of dogs (with hunters

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

Full Text Available The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Development of safe routes for children in urban environment

Science.gov (United States)

Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

2018-01-01

The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks

Directory of Open Access Journals (Sweden)

Kai Lin

2010-01-01

Full Text Available As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing.

Insensitive versus efficient dynamic load balancing in networks without blocking

NARCIS (Netherlands)

Jonckheere, M.

2006-01-01

So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing policies such as joining the shortest queue. In the present paper, we turn the attention to networks without blocking. To

Routing architecture and security for airborne networks

Science.gov (United States)