Evaluation of RPL-compliant routing solutions in real-life WSNs

Directory of Open Access Journals (Sweden)

Zahariadis Theodore

2016-01-01

Full Text Available Wireless Sensor Networks (WSN applications continue to expand and already cover almost all our daily activities improving from security and environmental efficiency to gaming experience. The diverse applications running on top of WSNs have led to the design of an immense number of routing protocols. Few years ago, the IETF standardized the IPv6 routing protocol for low-power and lossy networks (RPL which is based on routing metrics to build communication paths between a source and the destination node. While significant efforts have focused on the design of routing metrics that satisfy the various applications, limited work has been reported on validating their performance using real-life motes. In this paper, we focus on validating the simulation results (obtained through the JSim simulator using TelosB motes for a set of routing metrics that have been proposed in our previous articles.

A novel solvothermal route for obtaining strontium titanate nanoparticles

Energy Technology Data Exchange (ETDEWEB)

Marquez-Herrera, A., E-mail: alfredo.marquez@uaslp.mx [Universidad Autonoma de San Luis Potosi, Departamento de Ingenieria Mecanica Administrativa, Coordinacion Academica Region Altiplano (COARA) (Mexico); Ovando-Medina, Victor M.; Corona-Rivera, Miguel A. [Universidad Autonoma de San Luis Potosi, Departamento de Ingenieria Quimica, Coordinacion Academica Region Altiplano (COARA) (Mexico); Hernandez-Rodriguez, E.; Zapata-Torres, M. [Centro de Investigacion en Ciencia Aplicada y Tecnologia Avanzada, Unidad Legaria IPN (Mexico); Campos-Gonzalez, E.; Guillen-Cervantes, A.; Zelaya-Angel, O.; Melendez-Lira, M. [CINVESTAV-IPN, Departamento de Fisica (Mexico)

2013-04-15

Strontium titanate (SrTiO{sub 3}) has attracted a lot of attention because of its possible applications in new microelectronic devices. It is a material with a high dielectric constant, low leakage current, and some of its properties can be changed by adding or modifying the concentration of a dopant, which can be used for a wide range of functional purposes, from simple capacitors to complicated microwave devices. Therefore, in this work, we report the development of a new route to synthesize SrTiO{sub 3} nanoparticles based on the solvothermal method by employing two precursor solutions: strontium chloride and titanium(IV) butoxide. Our route allows the production of cubic SrTiO{sub 3} nanoparticles with a narrow size distribution. The particle sizes range between 8 and 24 nm, forming agglomerates of SrTiO{sub 3} in the range of 128-229 nm. It was demonstrated that the Ti/Sr molar ratio employed into the precursor solution has an important effect onto the chemical composition of the resulting SrTiO{sub 3} nanoparticles: when using Ti/Sr < 1, the formation and incorporation of the SrCO{sub 3} compound into the nanoparticles was observed while with Ti/Sr {>=} 1 nanoparticles are free of contaminants. The as-prepared nanoparticles were characterized by energy-dispersive X-ray spectroscopy, X-ray diffraction, transmission electron microscopy, high-resolution TEM, selected area electron diffraction, scanning electron microscopy, and dynamic light scattering.

Integrating routing decisions in public transportation problems

CERN Document Server

Schmidt, Marie E

2014-01-01

This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Su Xia

2014-05-01

Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

OpenAIRE

Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

2017-01-01

In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

ENTIRELY AQUEOUS SOLUTION-GEL ROUTE FOR THE PREPARATION OF ZIRCONIUM CARBIDE, HAFNIUM CARBIDE AND THEIR TERNARY CARBIDE POWDERS

Directory of Open Access Journals (Sweden)

Zhang Changrui

2016-07-01

Full Text Available An entirely aqueous solution-gel route has been developed for the synthesis of zirconium carbide, hafnium carbide and their ternary carbide powders. Zirconium oxychloride (ZrOCl₂.8H₂O, malic acid (MA and ethylene glycol (EG were dissolved in water to form the aqueous zirconium carbide precursor. Afterwards, this aqueous precursor was gelled and transformed into zirconium carbide at a relatively low temperature (1200 °C for achieving an intimate mixing of the intermediate products. Hafnium and the ternary carbide powders were also synthesized via the same aqueous route. All the zirconium, hafnium and ternary carbide powders exhibited a particle size of ∼100 nm.

Acquisition of business intelligence from human experience in route planning

Science.gov (United States)

Bello Orgaz, Gema; Barrero, David F.; R-Moreno, María D.; Camacho, David

2015-04-01

The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.

Route analysis for MHD equilibria

International Nuclear Information System (INIS)

Kikuchi, Fumio; Aizawa, Tatsuhiko

1982-01-01

In Tokamak facilities which are promising in nuclear fusion reactor development, the plasma in the core is often described by MHD approximation. Specifically, since an axisymmetric torus is approximately assumed as the first wall (shell) shape in actual Tokamak facilities, the Grad-Shafranov equation to be satisfied by an axisymmetric equilibrium solution for ideal MHD fluid must be solved, and the characteristics of its solution must be clarified. This paper shows the outline of the numerical calculation which employs both the incremental method taking the particular incremental nodal point values as the control parameters and the interaction method in accordance with Newton method at the same time, the analysis objective being a non-linear eigenvalue problem dealing the boundary of plasma region with surrounding vacuum region as the free boundary. Next, the detailed route analysis of the equilibrium solution is performed, utilizing the above numerical calculation technique, to clarify the effect of shell shape on the behaviour of the equilibrium solution. As the shape of the shell, a rectangular section torus, which have a notch depression at a part of the shell inner boundary, is considered. In the paper, the fundamental MHD equation and its approximate solution by the finite element method, the behaviour of plasma equilibrium solution in a shell having a notch, and the effect of notch shapes on plasma behaviour are described. This analysis verifies the effectiveness of the calculation method. (Wakatsuki, Y.)

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.

Optimal solutions for routing problems with profits

NARCIS (Netherlands)

Archetti, C.; Bianchessi, N.; Speranza, M. G.

2013-01-01

In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to

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.

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.

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.

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.

A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

Directory of Open Access Journals (Sweden)

Qi Hu

2013-04-01

Full Text Available State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data’s real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.

Leaving the labour market: the impact of exit routes from employment to retirement on health and wellbeing in old age.

Science.gov (United States)

Halleröd, Björn; Örestig, Johan; Stattin, Mikael

2013-03-01

The study analyses whether and to what degree specific routes into retirement affect older people, i.e. the relationship between heterogeneous exit patterns and post-retirement health and wellbeing. We used longitudinal data from two points in time; data related to t 0 were collected in 1993, 1994, 1995 and 1996 and data related to t 1 were collected in 2002 and 2003 ( N  = 589). We focused on older people (55+ at t 1 ) who were employed at t 0 and retired at t 1 . We used confirmative factor analysis to identify identical measures of health and wellbeing at both t 0 and t 1 . Hence, we were able to control for pre-retirement health and wellbeing when evaluating the effects of different exit routes. These routes were defined as dependence on incomes from sickness benefit, disability pension, part-time pension, unemployment insurance and active labour market programmes. Our initial structural equation model showed a clear relation between exit routes and post-retirement wellbeing. People who prior to retirement were pushed into social benefit programmes related to health and unemployment were significantly worse off as retirees, especially those with health-related benefits. However, these relationships disappeared once pre-retirement wellbeing was added to the model. Our main conclusion is that post-retirement wellbeing first and foremost is a consequence of accumulation of advantages and disadvantages during the life course. Both labour market exit routes and post-retirement wellbeing can be seen as outcomes of this process. There are no independent effects of the retirement process. Judging from our findings, there is no reason to believe that involvement in social security programmes allowing early retirement on health grounds has any additional negative consequences for health and wellbeing.

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.

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

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

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.

Iterated Local Search Algorithm with Strategic Oscillation for School Bus Routing Problem with Bus Stop Selection

Directory of Open Access Journals (Sweden)

Mohammad Saied Fallah Niasar

2017-02-01

Full Text Available he school bus routing problem (SBRP represents a variant of the well-known vehicle routing problem. The main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. In this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. Exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. Two metaheuristics, called N-ILS (a variant of the Nearest Neighbourhood with Iterated Local Search algorithm and I-ILS (a variant of Insertion with Iterated Local Search algorithm are proposed to solve SBRP. Our experimental procedure is based on the two data sets. The results show that N-ILS is able to obtain better solutions in shorter computing times. Additionally, N-ILS appears to be very competitive in comparison with the best existing metaheuristics suggested for SBRP

Routing protocol extension for resilient GMPLS multi-domain networks

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Ruepp, Sarah Renée; Romeral, Ricardo

2010-01-01

This paper evaluates the performance of multi-domain networks under the Generalized Multi-Protocol Label Switching control framework in case of a single inter-domain link failure. We propose and evaluate a routing protocol extension for the Border Gateway Protocol, which allows domains to obtain...... two Autonomous System disjoint paths and use them efficiently under failure conditions. Three main applications for the protocol extension are illustrated: reducing traffic loss on existing connections by xploiting pre-selected backup paths derived with our proposal, applying multi-domain restoration...... as survivability mechanism in case of single link failure, and employing proper failure notification mechanisms for routing of future connection requests under routing protocol re-convergence. Via simulations we illustrate the benefits of utilizing the proposed routing protocol extension for networks employing...

A novel low-temperature chemical solution route for straight and dendrite-like ZnO nanostructures

International Nuclear Information System (INIS)

Zhang Hui; Du Ning; Wu Jianbo; Ma, Xiangyang; Yang Deren; Zhang Xiaobin; Yang Zhiqing

2007-01-01

The straight and dendrite-like growths of ZnO have been completely and simply controlled by the status of ZnO seed instead of surfactant, template, oriented attachment, and ZnO buffer layer on the substrate in the chemical reaction synthesis of ZnO nanostructures. The monodisperse ZnO seeds, which are prepared by in situ quickly injecting the cool mixed zinc acetate and potassium hydrate ethanol solution into the hot matrix aqueous solution of zinc nitrate hydrate and diethylenetriamine at 95 deg. C, improve the straight growth and lots of uniform, straight, and single-crystalline ZnO nanorods with about 20-30 nm in diameter and 300 nm in length are achieved. While, the aggregated ZnO seeds, which are prepared by dropwise adding potassium hydrate ethanol solution into zinc acetate ethanol solution at 60 deg. C for 3 h, result in the dendrite-like growth and the bur-like ZnO nanostructures consisting of hundreds of nanorods with about 30-50 nm in diameter and several micrometers in length are formed. Furthermore, the approach presented here provides a simple, low-cost, environmental-friendly and high efficiency route to synthesize the high quality ZnO nanorods and bur-like ZnO nanostructures

Access Routes of Internet Finance Dictionaries: Present Solutions ...

African Journals Online (AJOL)

Lexicographers working on finance dictionaries have not properly exploited the fast development of the Internet. This is revealed by the poor utilization of the access routes found in current Internet finance dictionaries. Consequently, users cannot effectively and efficiently find answers to their lexicographical problems. Firstly ...

Modeling of critical experiments employing Raschig rings in uranyl nitrate solution

International Nuclear Information System (INIS)

Tanner, J.E.

1989-01-01

Four critical experiments employing borated glass rings in concentrated uranyl nitrate solution yielded k eff higher by 0. 04 when modeled with a flux-weighted, homogenized cross section set than when modeled with discrete rings. k eff varied by 0.014 for a 10% boron uncertainty and by up to 0.04 for a 10% packing fraction uncertainty

Context Analysis of Customer Requests using a Hybrid Adaptive Neuro Fuzzy Inference System and Hidden Markov Models in the Natural Language Call Routing Problem

Science.gov (United States)

Rustamov, Samir; Mustafayev, Elshan; Clements, Mark A.

2018-04-01

The context analysis of customer requests in a natural language call routing problem is investigated in the paper. One of the most significant problems in natural language call routing is a comprehension of client request. With the aim of finding a solution to this issue, the Hybrid HMM and ANFIS models become a subject to an examination. Combining different types of models (ANFIS and HMM) can prevent misunderstanding by the system for identification of user intention in dialogue system. Based on these models, the hybrid system may be employed in various language and call routing domains due to nonusage of lexical or syntactic analysis in classification process.

Context Analysis of Customer Requests using a Hybrid Adaptive Neuro Fuzzy Inference System and Hidden Markov Models in the Natural Language Call Routing Problem

Directory of Open Access Journals (Sweden)

Rustamov Samir

2018-04-01

Full Text Available The context analysis of customer requests in a natural language call routing problem is investigated in the paper. One of the most significant problems in natural language call routing is a comprehension of client request. With the aim of finding a solution to this issue, the Hybrid HMM and ANFIS models become a subject to an examination. Combining different types of models (ANFIS and HMM can prevent misunderstanding by the system for identification of user intention in dialogue system. Based on these models, the hybrid system may be employed in various language and call routing domains due to nonusage of lexical or syntactic analysis in classification process.

Dynamic Weather Routes: A Weather Avoidance Concept for Trajectory-Based Operations

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

The integration of convective weather modeling with trajectory automation for conflict detection, trial planning, direct routing, and auto resolution has uncovered a concept that could help controllers, dispatchers, and pilots identify improved weather routes that result in significant savings in flying time and fuel burn. Trajectory automation continuously and automatically monitors aircraft in flight to find those that could potentially benefit from improved weather reroutes. Controllers, dispatchers, and pilots then evaluate reroute options to assess their suitability given current weather and traffic. In today's operations aircraft fly convective weather avoidance routes that were implemented often hours before aircraft approach the weather and automation does not exist to automatically monitor traffic to find improved weather routes that open up due to changing weather conditions. The automation concept runs in real-time and employs two keysteps. First, a direct routing algorithm automatically identifies flights with large dog legs in their routes and therefore potentially large savings in flying time. These are common - and usually necessary - during convective weather operations and analysis of Fort Worth Center traffic shows many aircraft with short cuts that indicate savings on the order of 10 flying minutes. The second and most critical step is to apply trajectory automation with weather modeling to determine what savings could be achieved by modifying the direct route such that it avoids weather and traffic and is acceptable to controllers and flight crews. Initial analysis of Fort Worth Center traffic suggests a savings of roughly 50% of the direct route savings could be achievable.The core concept is to apply trajectory automation with convective weather modeling in real time to identify a reroute that is free of weather and traffic conflicts and indicates enough time and fuel savings to be considered. The concept is interoperable with today

Solution precursor plasma deposition of nanostructured ZnO coatings

International Nuclear Information System (INIS)

Tummala, Raghavender; Guduru, Ramesh K.; Mohanty, Pravansu S.

2011-01-01

Highlights: → The solution precursor route employed is an inexpensive process with capability to produce large scale coatings at fast rates on mass scale production. → It is highly capable of developing tailorable nanostructures. → This technique can be employed to spray the coatings on any kind of substrates including polymers. → The ZnO coatings developed via solution precursor plasma spray process have good electrical conductivity and reflectivity properties in spite of possessing large amount of particulate boundaries, porosity and nanostructured grains. -- Abstract: Zinc oxide (ZnO) is a wide band gap semiconducting material that has various applications including optical, electronic, biomedical and corrosion protection. It is usually synthesized via processing routes, such as vapor deposition techniques, sol-gel, spray pyrolysis and thermal spray of pre-synthesized ZnO powders. Cheaper and faster synthesis techniques are of technological importance due to increased demand in alternative energy applications. Here, we report synthesis of nanostructured ZnO coatings directly from a solution precursor in a single step using plasma spray technique. Nanostructured ZnO coatings were deposited from the solution precursor prepared using zinc acetate and water/isopropanol. An axial liquid atomizer was employed in a DC plasma spray torch to create fine droplets of precursor for faster thermal treatment in the plasma plume to form ZnO. Microstructures of coatings revealed ultrafine particulate agglomerates. X-ray diffraction confirmed polycrystalline nature and hexagonal Wurtzite crystal structure of the coatings. Transmission electron microscopy studies showed fine grains in the range of 10-40 nm. Observed optical transmittance (∼65-80%) and reflectivity (∼65-70%) in the visible spectrum, and electrical resistivity (48.5-50.1 mΩ cm) of ZnO coatings are attributed to ultrafine particulate morphology of the coatings.

Solution precursor plasma deposition of nanostructured ZnO coatings

Energy Technology Data Exchange (ETDEWEB)

Tummala, Raghavender [Department of Mechanical Engineering, University of Michigan - Dearborn, MI 48128 (United States); Guduru, Ramesh K., E-mail: rkguduru@umich.edu [Department of Mechanical Engineering, University of Michigan - Dearborn, MI 48128 (United States); Mohanty, Pravansu S. [Department of Mechanical Engineering, University of Michigan - Dearborn, MI 48128 (United States)

2011-08-15

Highlights: {yields} The solution precursor route employed is an inexpensive process with capability to produce large scale coatings at fast rates on mass scale production. {yields} It is highly capable of developing tailorable nanostructures. {yields} This technique can be employed to spray the coatings on any kind of substrates including polymers. {yields} The ZnO coatings developed via solution precursor plasma spray process have good electrical conductivity and reflectivity properties in spite of possessing large amount of particulate boundaries, porosity and nanostructured grains. -- Abstract: Zinc oxide (ZnO) is a wide band gap semiconducting material that has various applications including optical, electronic, biomedical and corrosion protection. It is usually synthesized via processing routes, such as vapor deposition techniques, sol-gel, spray pyrolysis and thermal spray of pre-synthesized ZnO powders. Cheaper and faster synthesis techniques are of technological importance due to increased demand in alternative energy applications. Here, we report synthesis of nanostructured ZnO coatings directly from a solution precursor in a single step using plasma spray technique. Nanostructured ZnO coatings were deposited from the solution precursor prepared using zinc acetate and water/isopropanol. An axial liquid atomizer was employed in a DC plasma spray torch to create fine droplets of precursor for faster thermal treatment in the plasma plume to form ZnO. Microstructures of coatings revealed ultrafine particulate agglomerates. X-ray diffraction confirmed polycrystalline nature and hexagonal Wurtzite crystal structure of the coatings. Transmission electron microscopy studies showed fine grains in the range of 10-40 nm. Observed optical transmittance ({approx}65-80%) and reflectivity ({approx}65-70%) in the visible spectrum, and electrical resistivity (48.5-50.1 m{Omega} cm) of ZnO coatings are attributed to ultrafine particulate morphology of the coatings.

Introducing radiality constraints in capacitated location-routing problems

Directory of Open Access Journals (Sweden)

Eliana Mirledy Toro Ocampo

2017-03-01

Full Text Available In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP and for the Capacitated Location Routing Problem (CLRP, adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations already employed in electric power distribution networks, which requires a radial topology in its operation. The results show that the proposed formulation greatly improves the convergence of the solver.

Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

Directory of Open Access Journals (Sweden)

Rafael Grosso

2018-01-01

Full Text Available The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

Nonreciprocal signal routing in an active quantum network

Science.gov (United States)

Metelmann, A.; Türeci, H. E.

2018-04-01

As superconductor quantum technologies are moving towards large-scale integrated circuits, a robust and flexible approach to routing photons at the quantum level becomes a critical problem. Active circuits, which contain parametrically driven elements selectively embedded in the circuit, offer a viable solution. Here, we present a general strategy for routing nonreciprocally quantum signals between two sites of a given lattice of oscillators, implementable with existing superconducting circuit components. Our approach makes use of a dual lattice of overdamped oscillators linking the nodes of the main lattice. Solutions for spatially selective driving of the lattice elements can be found, which optimally balance coherent and dissipative hopping of microwave photons to nonreciprocally route signals between two given nodes. In certain lattices these optimal solutions are obtained at the exceptional point of the dynamical matrix of the network. We also demonstrate that signal and noise transmission characteristics can be separately optimized.

Part-time employment in Jordan as a nursing policy solution.

Science.gov (United States)

Al-Motlaq, M; Azar, N; Squires, A

2017-03-01

Explore the potential of a part-time work option for nurses as a strategy for managing domestic markets in Jordan by examining perceptions of working nurses and nursing students in the context of current social and cultural variables. Unemployment among Jordanian nurses has become a reality in recent years. However, labor markets literature in nursing rarely studies what kind of policy responses should occur during a surplus of nurses. A cross-sectional design structured the study. The perceptions of nurses and students were measured through a questionnaire developed specifically for the purpose of this exploratory study. Both nurses (n = 51) and students (n = 56) supported the introduction of the new suggested part-time option. However, students were more willing to start working or transfer into part-time work, take payment on hourly basis, and support colleagues to transfer into part-time work. Different solutions were also suggested by participants. The results were useful for providing the foundational data to further study the viability of a part-time work option for Jordanian nurses. The results show how optimistic current and future Jordanian nurses are regarding this employment option. For countries that may need to diversify their employment models due to excess supply of nurses and to address gender imbalances, this work may help inform policy development. Both employed and unemployed nurses will benefit if health care managers consider its application. The flexibility of this option may help improve the quality of life of many nurses. The results of this study provide nursing leaders and managers with foundational evidence that may be applicable in the Jordanian health sector. Although further studies are recommended, nursing leaders and policy makers should consider such a solution. © 2016 International Council of Nurses.

A generic methodology for processing route synthesis and design based on superstructure optimization

DEFF Research Database (Denmark)

Bertran, Maria-Ona; Frauzem, Rebecca; Sanchez-Arcilla, Ana Sofia

2017-01-01

a specially developed knowledge representation system, and (2) Super-O, a software interface that guides users through the formulation and solution of synthesis problems. Super-O transfers data between the different tools, including a library of generic models, representing a wide range of processing options...... are resolved and targets for improvement are identified through the use of integrated tools. In Stage 3, new alternatives are generated using the selected route and the previously identified targets. In addition to the various computer-aided tools, two special tools are presented: (1) a database employing...

Characterization of Cu–Ni nanostructured alloys obtained by a chemical route. Influence of the complexing agent content in the starting solution

Energy Technology Data Exchange (ETDEWEB)

Carreras, Alejo C., E-mail: acarreras@famaf.unc.edu.ar [Instituto de Física Enrique Gaviola (IFEG), Facultad de Matemática, Astronomía y Física, Universidad Nacional de Córdoba—CONICET, Medina Allende s/n, Ciudad Universitaria, 5016 Córdoba (Argentina); Cangiano, María de los A.; Ojeda, Manuel W.; Ruiz, María del C. [Instituto de Investigaciones en Tecnología Qumica (INTEQUI), Facultad de Química, Bioquímica y Farmacia, Universidad Nacional de San Luis—CONICET, Chacabuco y Pedernera, 5700 San Luis (Argentina)

2015-03-15

The influence of the amount of complexing agent added to the starting solution on the physicochemical properties of Cu–Ni nanostructured alloys obtained through a chemical route, was studied. For this purpose, three Cu–Ni nanoalloy samples were synthesized by a previously developed procedure, starting from solutions with citric acid to metal molar ratios (C/Me) of 0.73, 1.00 and 1.50. The synthesis technique consisted in preparing a precursor via the citrate-gel method, and carrying out subsequent thermal treatments in controlled atmospheres. Sample characterization was performed by scanning electron microscopy, X-ray microanalysis, X-ray diffraction, transmission electron microscopy, X-ray nanoanalysis and electron diffraction. In the three cases, copper and nickel formed a solid solution with a Cu/Ni atomic ratio close to 50/50, and free of impurities inside the crystal structure. The citric acid content of the starting solution proved to have an important influence on the morphology, size distribution, porosity, and crystallinity of the Cu–Ni alloy microparticles obtained, but a lesser influence on their chemical composition. The molar ratio C/Me = 1.00 resulted in the alloy with the Cu/Ni atomic ratio closest to 50/50. - Highlights: • We synthesize Cu–Ni nanoalloys by a chemical route based on the citrate-gel method. • We study the influence of the complexing agent content of the starting solution. • We characterize the samples by electron microscopy and X-ray techniques. • Citric acid influences the shape, size, porosity and crystallinity of the alloys.

CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

Science.gov (United States)

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.

k-Shortest routing of trains on shunting yards

NARCIS (Netherlands)

Riezebos, Jan; van Wezel, Wout

2009-01-01

We consider the problem of designing algorithmic support for k-best routing decisions in train shunting scheduling. A study at the Netherlands Railways revealed that planners like to interact with the solution process of finding suitable routes. Two types of interaction were required: the

Structural and optical properties of Co-doped ZnO nanocrystallites prepared by a one-step solution route

International Nuclear Information System (INIS)

Li Ping; Wang Sha; Li Jibiao; Wei Yu

2012-01-01

Zinc oxide (ZnO) nanocrystallites with different Co-doping levels were successfully synthesized by a simple one-step solution route at low temperature (95 deg. C) in this study. The structure and morphology of the samples thus obtained were characterized by XRD, EDS, XPS and FESEM. Results show that cobalt ions, in the oxidation state of Co 2+ , replace Zn 2+ ions in the ZnO lattice without changing its wurtzite structure. The dopant content varies from 0.59% to 5.39%, based on Co-doping levels. The pure ZnO particles exhibit well-defined 3D flower-like morphology with an average size of 550 nm, while the particles obtained after Co-doping are mostly cauliflower-like nanoclusters with an average size of 120 nm. Both the flower-like pure ZnO and the cauliflower-like Co:ZnO nanoclusters are composed of densely arrayed nanorods. The optical properties of the ZnO nanocrystallites following Co-doping were also investigated by UV-Visible absorption and Photoluminescence spectra. Our results indicate that Co-doping can change the energy-band structure and effectively adjust the luminescence properties of ZnO nanocrystallites. - Highlights: → Co-doped ZnO nanocrystallites were synthesized via a simple one-step solution route. → Co 2+ ions incorporated into the ZnO lattice without changing its wurtzite structure. → Co-doping changed the energy band structure of ZnO. → Co-doping effectively adjusted the luminescence properties of ZnO nanocrystallites.

Structural and optical properties of Co-doped ZnO nanocrystallites prepared by a one-step solution route

Energy Technology Data Exchange (ETDEWEB)

Li Ping, E-mail: lipingchina@yahoo.com.cn [Provincial Key Laboratory of Inorganic Nanomaterials, School of Chemistry and Materials Science, Hebei Normal University, 113 Yuhua Road, Shijiazhuang 050016, Hebei (China); Wang Sha; Li Jibiao; Wei Yu [Provincial Key Laboratory of Inorganic Nanomaterials, School of Chemistry and Materials Science, Hebei Normal University, 113 Yuhua Road, Shijiazhuang 050016, Hebei (China)

2012-01-15

Zinc oxide (ZnO) nanocrystallites with different Co-doping levels were successfully synthesized by a simple one-step solution route at low temperature (95 deg. C) in this study. The structure and morphology of the samples thus obtained were characterized by XRD, EDS, XPS and FESEM. Results show that cobalt ions, in the oxidation state of Co{sup 2+}, replace Zn{sup 2+} ions in the ZnO lattice without changing its wurtzite structure. The dopant content varies from 0.59% to 5.39%, based on Co-doping levels. The pure ZnO particles exhibit well-defined 3D flower-like morphology with an average size of 550 nm, while the particles obtained after Co-doping are mostly cauliflower-like nanoclusters with an average size of 120 nm. Both the flower-like pure ZnO and the cauliflower-like Co:ZnO nanoclusters are composed of densely arrayed nanorods. The optical properties of the ZnO nanocrystallites following Co-doping were also investigated by UV-Visible absorption and Photoluminescence spectra. Our results indicate that Co-doping can change the energy-band structure and effectively adjust the luminescence properties of ZnO nanocrystallites. - Highlights: > Co-doped ZnO nanocrystallites were synthesized via a simple one-step solution route. > Co{sup 2+} ions incorporated into the ZnO lattice without changing its wurtzite structure. > Co-doping changed the energy band structure of ZnO. > Co-doping effectively adjusted the luminescence properties of ZnO nanocrystallites.

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.

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.

Working in the UK: Polish migrant worker routes into employment in the north east and north west construction and food processing sectors

OpenAIRE

Fitzgerald, Ian

2007-01-01

This report presents the findings of a TUC-funded project that sought to identify the main routes into employment for Polish migrant workers in the North East and North West construction and food processing sectors. Its findings show that the two sectors offer real opportunities and challenges for trade unions to organise those who most need help. Indeed many unions in the sectors have already taken up the challenge and have started to see real successes in organising groups traditionally see...

Controlled synthesis of high-quality nickel sulfide chain-like tubes and echinus-like nanostructures by a solution chemical route

International Nuclear Information System (INIS)

Zhang Yahui; Guo Lin; He Lin; Liu, Kang; Chen Chinping; Zhang Qi; Wu Ziyu

2007-01-01

Chain-like NiS tubes and echinus-like nickel sulfide (Ni 3 S 2 ) nanostructures were synthesized successfully by a solution chemical route. The growth models of these two materials and the most possible mutation process between these two different morphologies are discussed. The temperature and field dependent magnetizations, M(T) and M(H), show that both the samples have a very weak ferromagnetism and exhibit a strong paramagnetic response in a high applied field

Growth of Highly Epitaxial YBa2Cu3O7-δ Films from a Simple Propionate-Based Solution

DEFF Research Database (Denmark)

Yue, Zhao; Torres, Pol; Tang, Xiao

2015-01-01

Intensive investigations have been conducted to develop epitaxial oxide thin films with superior electromagnetic performance by low-cost chemical solution deposition routes. In this paper, a novel propionate-based precursor solution without involving any other additive was proposed and employed...... to grow superconducting YBa2Cu3O7-δ (YBCO) films on LaAlO3 (LAO) single crystals. The precursor solutions are stable with a long shelf life of up to several months. Since the primary compositions are propionates after evaporating the solvent, the toxic reagents and evolved gases during solution synthesis...... and heat treatment can be eliminated completely. In this process, rapid pyrolysis and high conversation rate can also be achieved during growth of YBCO films in comparison with the conventional trifluoroacetate metal organic deposition routes. Remarkably, a 210 nm YBCO film exhibits high superconducting...

Synthetic wastewaters treatment by electrocoagulation to remove silver nanoparticles produced by different routes.

Science.gov (United States)

Matias, M S; Melegari, S P; Vicentini, D S; Matias, W G; Ricordel, C; Hauchard, D

2015-08-15

Nanoscience is a field that has stood out in recent years. The accurate long-term health and environmental risks associated with these emerging materials are unknown. Therefore, this work investigated how to eliminate silver nanoparticles (AgNPs) from synthetic effluents by electrocoagulation (EC) due to the widespread use of this type of nanoparticle (NP) in industry and its potential inhibition power over microorganisms responsible for biological treatment in effluent treatment plants. Synthesized AgNPs were studied via four different routes by chemical reduction in aqueous solutions to simulate the chemical variations of a hypothetical industrial effluent, and efficiency conditions of the EC treatment were determined. All routes used silver nitrate as the source of silver ions, and two synthesis routes were studied with sodium citrate as a stabilizer. In route I, sodium citrate functioned simultaneously as the reducing agent and stabilizing agent, whereas route II used sodium borohydride as a reducing agent. Route III used D-glucose as the reducing agent and sodium pyrophosphate as the stabilizer; route IV used sodium pyrophosphate as the stabilizing agent and sodium borohydride as the reducing agent. The efficiency of the EC process of the different synthesized solutions was studied. For route I, after 85 min of treatment, a significant decrease in the plasmon resonance peak of the sample was observed, which reflects the efficiency in the mass reduction of AgNPs in the solution by 98.6%. In route II, after 12 min of EC, the absorbance results reached the detection limit of the measurement instrument, which indicates a minimum reduction of 99.9% of AgNPs in the solution. During the 4 min of treatment in route III, the absorbance intensities again reached the detection limit, which indicates a minimum reduction of 99.8%. In route IV, after 10 min of treatment, a minimum AgNP reduction of 99.9% was observed. Based on these results, it was possible to verify that

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

A chance-constrained stochastic approach to intermodal container routing problems.

Science.gov (United States)

Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

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.

Minimum critical values of uranyl and plutonium nitrate solutions calculated by various routes of the french criticality codes system CRISTAL using the new isopiestic nitrate density law

International Nuclear Information System (INIS)

Anno, Jacques; Rouyer, Veronique; Leclaire, Nicolas

2003-01-01

This paper provides for various cases of 235 U enrichment or Pu isotopic vectors, and different reflectors, new minimum critical values of uranyl nitrate and plutonium nitrate solutions (H + =0) obtained by the standard IRSN calculation route and the new isopiestic density laws. Comparisons are also made with other more accurate routes showing that the standard one's results are most often conservative and usable for criticality safety assessments. (author)

DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

OpenAIRE

B.Rajeshkanna *1, Dr.M.Anitha 2

2018-01-01

The cluster message criticality level based zigbee routing(CMCLZOR) has been proposed for routing the cluster messages in wireless smart energy home area networks. It employs zigbee opportunistic shortcut tree routing(ZOSTR) and AODV individually for routing normal messages and highly critical messages respectively. ZOSTR allows the receiving nodes to compete for forwarding a packet with the priority of left-over hops rather than stating single next hop node like unicast protocols. Since it h...

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)

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.

Dynamic Escape Routes for Naval Ships

National Research Council Canada - National Science Library

Villalonga, Francisco J

2005-01-01

This thesis addresses the problem of optimal evacuation of a naval ship. We propose the use of a dynamic escape-route system which employs a signaling system to adapt the emergency egress process to the instigating contingency...

Controlled synthesis of high-quality nickel sulfide chain-like tubes and echinus-like nanostructures by a solution chemical route

Energy Technology Data Exchange (ETDEWEB)

Zhang Yahui [School of Materials Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 (China); Guo Lin [School of Materials Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 (China); He Lin [Department of Physics, Peking University, Beijing 100871 (China); Liu, Kang [Department of Physics, Peking University, Beijing 100871 (China); Chen Chinping [Department of Physics, Peking University, Beijing 100871 (China); Zhang Qi [School of Materials Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 (China); Wu Ziyu [Institute of High Energy Physics, Chinese of Academy of Science, Beijing 100039 (China)

2007-12-05

Chain-like NiS tubes and echinus-like nickel sulfide (Ni{sub 3}S{sub 2}) nanostructures were synthesized successfully by a solution chemical route. The growth models of these two materials and the most possible mutation process between these two different morphologies are discussed. The temperature and field dependent magnetizations, M(T) and M(H), show that both the samples have a very weak ferromagnetism and exhibit a strong paramagnetic response in a high applied field.

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

Route Monopolie and Optimal Nonlinear Pricing

Science.gov (United States)

Tournut, Jacques

2003-01-01

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform

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.

Full Employment in a Green Society

OpenAIRE

Steve Dawe

2012-01-01

This article is an attempt to re-conceptualise Full Employment. The UK context is the main geographical focus. A normative route to the rehabilitation of Full Employment is offered - recast here as 'Green Full Employment' - utilising a variety of Green perspectives from sociology, politics and economics. This contribution to the debate about Full Employment is 'normative', because without ethical values we may lack a moral compass to motivate policies. Green Full Employment is presented here ...

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao Li

2014-09-01

Full Text Available In this paper, we propose a novel approach to improve coordination routing while minimizing the maintenance overhead during nodes churn. It bases on “CAN Tree Routing for Content- Addressable Network” 1 which is a solution for peer-to-peer routing. We concentrated on coordinate routing in this paper. The key idea of our approach is a recursion process to calculate target zone code and search in CAN tree 1. Because the hops are via long links in CAN, it enhances routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is , which is much better than a uniform greedy routing, while each node maintains two long links in average.

Multifactor-Driven Hierarchical Routing on Enterprise Service Bus

Science.gov (United States)

Mi, Xueqiang; Tang, Xinhuai; Yuan, Xiaozhou; Chen, Delai; Luo, Xiangfeng

Message Routing is the foremost functionality on Enterprise Service Bus (ESB), but current ESB products don't provide an expected solution for it, especially in the aspects of runtime route change mechanism and service orchestration model. In order to solve the above drawbacks, this paper proposes a multifactor-driven hierarchical routing (MDHR) model. MDHR defines three layers for message routing on ESB. Message layer gives the original support for message delivery. Application layer can integration or encapsulate some legacy applications or un-standard services. Business layer introduces business model to supplies developers with a business rule configuration, which supports enterprise integration patterns and simplifies the service orchestration on ESB.

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.

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.

Routing architecture and security for airborne networks

Science.gov (United States)

Deng, Hongmei; Xie, Peng; Li, Jason; Xu, Roger; Levy, Renato

2009-05-01

Airborne networks are envisioned to provide interconnectivity for terrestial and space networks by interconnecting highly mobile airborne platforms. A number of military applications are expected to be used by the operator, and all these applications require proper routing security support to establish correct route between communicating platforms in a timely manner. As airborne networks somewhat different from traditional wired and wireless networks (e.g., Internet, LAN, WLAN, MANET, etc), security aspects valid in these networks are not fully applicable to airborne networks. Designing an efficient security scheme to protect airborne networks is confronted with new requirements. In this paper, we first identify a candidate routing architecture, which works as an underlying structure for our proposed security scheme. And then we investigate the vulnerabilities and attack models against routing protocols in airborne networks. Based on these studies, we propose an integrated security solution to address routing security issues in airborne networks.

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohail Jabbar

2015-01-01

Full Text Available Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

Real time monitoring system used in route planning for the electric vehicle

Science.gov (United States)

Ionescu, LM; Mazare, A.; Serban, G.; Ionita, S.

2017-10-01

The electric vehicle is a new consumer of electricity that is becoming more and more widespread. Under these circumstances, new strategies for optimizing power consumption and increasing vehicle autonomy must be designed. These must include route planning along with consumption, fuelling points and points of interest. The hardware and software solution proposed by us allows: non-invasive monitoring of power consumption, energy autonomy - it does not add any extra consumption, data transmission to a server and data fusion with the route, the points of interest of the route and the power supply points. As a result: an optimal route planning service will be provided to the driver, considering the route, the requirements of the electric vehicle and the consumer profile. The solution can be easily installed on any type of electric car - it does not involve any intervention on the equipment.

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

Access Routes of Internet Finance Dictionaries: Present Solutions and Future Opportunities

Directory of Open Access Journals (Sweden)

Deny Arnos Kwary

2011-10-01

Full Text Available

ABSTRACT: Lexicographers working on finance dictionaries have not properly exploited the fast development of the Internet. This is revealed by the poor utilization of the access routes found in current Internet finance dictionaries. Consequently, users cannot effectively and efficiently find answers to their lexicographical problems. Firstly, there are Internet finance dictionaries which lack technological features and can simply be called meagre Internet dictionaries. Secondly, there are Internet finance dictionaries which utilize so many technological features that users incur high lexicographical information costs. In order to create better access routes, a sound theoretical foundation has to be established. This article shows that the implementation of the modern theory of lexicographical functions, which focuses on the users, results in a better design for future Internet finance dictionaries. With the proper theoretical basis, lexicographers will be able to create state-ofthe- art dictionaries that can provide effective and efficient solutions to lexicographical problems.

OPSOMMING: Toegangsroetes van Internet- finansiële woordeboeke: Huidige oplossings en toekomstige geleenthede. Leksikograwe wat aan finansiële woordeboeke werk, het nie die vinnige ontwikkeling van die Internet behoorlik benut nie. Dit blyk uit die gebrekkige aanwending van die toegangsroetes wat in huidige Internet- finansiële woordeboeke aangetref word. Gevolglik kan gebruikers nie doeltreffend en doelmatig antwoorde kry op hul leksikografiese probleme nie. Eerstens is daar Internet- finansiële woordeboeke waarin tegnologiese kenmerke ontbreek en wat gewoon karige Internetwoordeboeke genoem kan word. Tweedens is daar Internet- finansiële woordeboeke wat so baie tegnologiese kenmerke aanwend dat gebruikers hoë leksikografiese inligtingskoste oploop. Om beter toegangsroetes te skep, moet 'n deeglike teoretiese grondslag gevestig word. Hierdie artikel toon

Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Annisa Kesy Garside

2014-01-01

Full Text Available Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.

Learning Points and Routes to Recommend Trajectories

OpenAIRE

Chen, Dawei; Ong, Cheng Soon; Xie, Lexing

2016-01-01

The problem of recommending tours to travellers is an important and broadly studied area. Suggested solutions include various approaches of points-of-interest (POI) recommendation and route planning. We consider the task of recommending a sequence of POIs, that simultaneously uses information about POIs and routes. Our approach unifies the treatment of various sources of information by representing them as features in machine learning algorithms, enabling us to learn from past behaviour. Info...

Synthesis of SnO2 nanoparticles through the controlled precipitation route

International Nuclear Information System (INIS)

Ibarguen, C. Ararat; Mosquera, A.; Parra, R.; Castro, M.S.; Rodriguez-Paez, J.E.

2007-01-01

The controlled precipitation method allowed to the synthesis of SnO 2 with advantageous specific properties, such as size and shape employing an aqueous SnCl 2 .2H 2 O solution as precursor. Through XRD analyses, the optimum pH value of the solution that yielded the desired product was found to be 6.25. After a thermal treatment at 600 deg. C, the final powder presented an average particle size below 50 nm with a surface area of 19 m 2 g -1 and a large reactivity. The evolution of the most important functional groups during the steps involved in this synthesis route is explained in view of the results obtained with FTIR and XRD. A thorough discussion on the different intermediates involved in the whole process is presented on the basis of hydrolysis and condensation reactions. The conclusions are supported with a complete characterization through differential and gravimetric thermal analysis (DTA/TGA), electron microscopies (SEM/TEM) and surface area determinations (BET)

Preparation of SmBiO{sub 3} buffer layer on YSZ substrate by an improved chemical solution deposition route

Energy Technology Data Exchange (ETDEWEB)

Zhu, Xiaolei [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Pu, Minghua, E-mail: mhpu@home.swjtu.edu.cn [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Zhao, Yong [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); School of Materials Science and Engineering, University of New South Wale, Sydney, NSW 2052 (Australia)

2016-12-15

Highlights: • The proper conditions for SBO growth are 794 °C for 60 min in flowing Ar gas, the temperature of epitaxial growth is relatively low. • The total time by SSD technique for organic solvent removing, salts decomposition and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. • SBO layer on YSZ prepared by SSD technique are suitable for the growth of YBCO, The results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes. - Abstract: A quick route for chemical solution deposition (CSD) has been developed to prepare SmBiO{sub 3} (SBO) layers on yttria stabilized zirconia (YSZ) substrates rapidly by using of solid state decomposition (SSD) technique. The proper conditions for volatilization of lactic acid, which as solvent in precursor coated layer, and SBO growth are 115°C for 30 min and 794°C for 60 min in flowing Ar gas. The coated layers are amorphous structure of mixture oxides and quasi-crystal structure of SBO before and after growth, respectively. The total time by this quick CSD route for organic solvent volatilization, salts decomposed and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. SBO layer is directly epitaxial growth on YSZ substrate without any lattice rotation. SBO layer prepared by this quick route as well as that by traditional route are suitable for the growth of YBCO. The superconducting transition temperature and critical current density of the coated YBCO layer on SBO/YSZ obtained by this quick route are up to 90 K and 1.66 MA/cm{sup 2}. These results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes.

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

OpenAIRE

Gelareh , Shahin; Neamatian Monemi , Rahimeh; Semet , Frédéric

2015-01-01

International audience; In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo-hub allocations. We propose a mathematical model and a b...

Effective Privacy-Preserving Online Route Planning

DEFF Research Database (Denmark)

Vicente, Carmen Ruiz; Assent, Ira; Jensen, Christian S.

2011-01-01

An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce...... the number of times that the RPS needs to be queried, and we also describe how the accuracy and privacy requirements can be relaxed to achieve better performance. An empirical study offers insight into key properties of the approach....

NICKEL HYDROXIDE FILMS IN CONTACT WITH AN ELECTROACTIVE SOLUTION. A STUDY EMPLOYING ELECTROCHEMICAL IMPEDANCE MEASUREMENTS

OpenAIRE

RICARDO TUCCERI

2018-01-01

The deactivation of nickel hydroxide films after prolonged storage times without use was studied. This study was carried out in the context of the Rotating Disc Electrode Voltammetry (RDEV) and Electrochemical Impedance Spectroscopy (EIS) when the nickel hydroxide film contacts an electroactive solution and a redox reaction occurs at the Au-Ni(OH)2|electrolyte interface. Deferasirox (4-(3,5-bis(2- hydroxyphenyl)-1,2,4-triazol-1-yl) benzoic acid) was employed as redox species in solution. Limi...

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.

A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

Directory of Open Access Journals (Sweden)

2009-03-01

Full Text Available We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the “Traveling Salesman Problem” (TSP and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS algorithm in order to reach an effective solution.

Generalized routing protocols for multihop relay networks

KAUST Repository

Khan, Fahd Ahmed

2011-07-01

Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

Science.gov (United States)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

DEFF Research Database (Denmark)

Gamst, M.

2014-01-01

problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...

Autism and Overcoming Job Barriers: Comparing Job-Related Barriers and Possible Solutions in and outside of Autism-Specific Employment.

Directory of Open Access Journals (Sweden)

Timo Lorenz

Full Text Available The aim of this study was to discover how individuals with autism succeed in entering the job market. We therefore sought to identify expected and occurred barriers, keeping them from taking up and staying in employment as well as to identify the solutions used to overcome these barriers. Sixty-six employed individuals with autism--17 of them with autism-specific employment--participated in an online survey. Results showed a variety of possible barriers. Individuals in autism-specific employment named formality problems--problems with organizational and practical process-related aspects of the job entry--most frequently while individuals in non-autism-specific employment mentioned social problems--obstacles concerning communication and human interaction--most. In terms of solutions, both groups used their own resources as much as external help, but differed in their specific strategies. In addition, correlations of an autism-specific employment with general and occupational self-efficacy as well as life and job satisfaction were examined. Possible implications of the results are discussed with regard to problem solving behavior and the use of strengths.

A Cross-Layer Route Discovery Framework for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Wu Jieyi

2005-01-01

Full Text Available Most reactive routing protocols in MANETs employ a random delay between rebroadcasting route requests (RREQ in order to avoid "broadcast storms." However this can lead to problems such as "next hop racing" and "rebroadcast redundancy." In addition to this, existing routing protocols for MANETs usually take a single routing strategy for all flows. This may lead to inefficient use of resources. In this paper we propose a cross-layer route discovery framework (CRDF to address these problems by exploiting the cross-layer information. CRDF solves the above problems efficiently and enables a new technique: routing strategy automation (RoSAuto. RoSAuto refers to the technique that each source node automatically decides the routing strategy based on the application requirements and each intermediate node further adapts the routing strategy so that the network resource usage can be optimized. To demonstrate the effectiveness and the efficiency of CRDF, we design and evaluate a macrobian route discovery strategy under CRDF.

On the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2006-01-01

. The fourth and final paper ‘Vehicle routing problem with time windows’ (Kallehauge, Larsen, Madsen, and Solomon. In Desaulniers, Desrosiers, and Solomon, editors, Column generation, pages 67-98, Springer, New York, 2005) is a contribution to a book on column generation edited by G. Desaulniers, J. Desrosiers......The vehicle routing problem with time windows is concerned with the optimal routing of a fleet of vehicles between a depot and a number of customers that must be visited within a specified time interval, called a time window. The purpose of this thesis is to develop new and efficient solution...... techniques for solving the vehicle routing problem with time windows (VRPTW). The thesis consists of a section of introductory remarks and four independent papers. The first paper ‘Formulations and exact approaches for the vehicle routing problem with time windows’ (Kallehauge, 2005, unpublished) is a review...

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.

Energy-Aware Routing in Multiple Domains Software-Defined Networks

Directory of Open Access Journals (Sweden)

Adriana FERNÁNDEZ-FERNÁNDEZ

2016-12-01

Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

Solution-processable precursor route for fabricating ultrathin silica film for high performance and low voltage organic transistors

Institute of Scientific and Technical Information of China (English)

Shujing Guo; Liqiang Li; Zhongwu Wang; Zeyang Xu; Shuguang Wang; Kunjie Wu; Shufeng Chen; Zongbo Zhang; Caihong Xu; Wenfeng Qiu

2017-01-01

Silica is one of the most commonly used materials for dielectric layer in organic thin-film transistors due to its excellent stability,excellent electrical properties,mature preparation process,and good compatibility with organic semiconductors.However,most of conventional preparation methods for silica film are generally performed at high temperature and/or high vacuum.In this paper,we introduce a simple solution spin-coating method to fabricate silica thin film from precursor route,which possesses a low leakage current,high capacitance,and low surface roughness.The silica thin film can be produced in the condition of low temperature and atmospheric environment.To meet various demands,the thickness of film can be adjusted by means of preparation conditions such as the speed of spin-coating and the concentration of solution.The p-type and n-type organic field effect transistors fabricated by using this film as gate electrodes exhibit excellent electrical performance including low voltage and high performance.This method shows great potential for industrialization owing to its characteristic of low consumption and energy saving,time-saving and easy to operate.

A novel route for placing free flap pedicle from a palatal defect

Directory of Open Access Journals (Sweden)

Rajeev B Ahuja

2014-01-01

Full Text Available One of the better options available to repair a large palatal defect is by employing a free flap. Almost all the times such free flaps are plumbed to facial vessels. The greatest challenge in such cases is the placement of the pedicle from palatal shelf to recipient vessels because there is no direct route available. As majority of large palatal fistulae are encountered in operated cleft palates there is a possibility of routing the pedicle through a cleft in the maxillary arch or via pyriform aperture. When such a possibility doesn′t exist the pedicle is routed behind the maxillary arch. We describe a novel technique of pedicle placement through a maxillary antrostomy, in this case report, where a large palatal fistula in a 16 year old boy was repaired employing a free radial artery forearm flap. The direct route provided by maxillary antrostomy is considered the most expeditious of all possibilities mentioned above.

Optimization Using Simulation of the Vehicle Routing Problem

OpenAIRE

Nayera E. El-Gharably; Khaled S. El-Kilany; Aziz E. El-Sayed

2013-01-01

A key element of many distribution systems is the routing and scheduling of vehicles servicing a set of customers. A wide variety of exact and approximate algorithms have been proposed for solving the vehicle routing problems (VRP). Exact algorithms can only solve relatively small problems of VRP, which is classified as NP-Hard. Several approximate algorithms have proven successful in finding a feasible solution not necessarily optimum. Although different parts of the pro...

Autism and Overcoming Job Barriers: Comparing Job-Related Barriers and Possible Solutions in and outside of Autism-Specific Employment

Science.gov (United States)

Lorenz, Timo; Frischling, Cora; Cuadros, Raphael; Heinitz, Kathrin

2016-01-01

The aim of this study was to discover how individuals with autism succeed in entering the job market. We therefore sought to identify expected and occurred barriers, keeping them from taking up and staying in employment as well as to identify the solutions used to overcome these barriers. Sixty-six employed individuals with autism–17 of them with autism-specific employment–participated in an online survey. Results showed a variety of possible barriers. Individuals in autism-specific employment named formality problems–problems with organizational and practical process-related aspects of the job entry–most frequently while individuals in non-autism-specific employment mentioned social problems–obstacles concerning communication and human interaction–most. In terms of solutions, both groups used their own resources as much as external help, but differed in their specific strategies. In addition, correlations of an autism-specific employment with general and occupational self-efficacy as well as life and job satisfaction were examined. Possible implications of the results are discussed with regard to problem solving behavior and the use of strengths. PMID:26766183

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

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.

Vessels Route Planning Problem with Uncertain Data

Directory of Open Access Journals (Sweden)

Tomasz Neumann

2016-09-01

Full Text Available The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

Identifying vital edges in Chinese air route network via memetic algorithm

Directory of Open Access Journals (Sweden)

Wenbo Du

2017-02-01

Full Text Available Due to rapid development in the past decade, air transportation system has attracted considerable research attention from diverse communities. While most of the previous studies focused on airline networks, here we systematically explore the robustness of the Chinese air route network, and identify the vital edges which form the backbone of Chinese air transportation system. Specifically, we employ a memetic algorithm to minimize the network robustness after removing certain edges, and hence the solution of this model is the set of vital edges. Counterintuitively, our results show that the most vital edges are not necessarily the edges of the highest topological importance, for which we provide an extensive explanation from the microscope view. Our findings also offer new insights to understanding and optimizing other real-world network systems.

Latency reduction in online multiplayer games using detour routing

OpenAIRE

Ly, Cong

2010-01-01

Long network latency negatively impacts the performance of online multiplayer games. In this thesis, we propose a novel approach to reduce the network latency in online gaming. Our approach employs application level detour routing in which game-state update messages between two players can be forwarded through other intermediate relay nodes in order to reduce network latency. We present results from an extensive measurement study to show the potential benefits of detour routing in online game...

A Practical Route Search System for Amusement Parks Navigation

Directory of Open Access Journals (Sweden)

Takahiro Shibuya

2013-12-01

Full Text Available It is very difficult to find the minimum route to travel in amusement park navigation. A searching system for visitors would be useful. Therefore, we constructed a system to find the route with the minimum total traveling time. Facility visitors can employ this system on a smart phone. The system is composed of Java and a Java Servlet. We conclude that our system is useful and can greatly shorten travel time within a typical amusement park.

Route Optimization for the Distribution Network of a Confectionary Chain

Directory of Open Access Journals (Sweden)

Anıl İnanlı

2015-12-01

Full Text Available This study considers the distribution network of a well-known perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central distribution of products from a single factory. The objective is to decrease the cost of transportation while maintaining a high level of customer satisfaction. Hence, the focus is on the vehicle routing problem (VRP of this large franchise chain within each city. The problem is defined as a rich VRP with heterogeneous fleet, site-dependent and compartmentalized vehicles, and soft/hard time windows. This NP-hard problem is modelled and tried with real data on a commercial solver. A basic heuristic procedure which can be used easily by the decision makers is also employed for obtaining quick and high-quality solutions for large instances.

Design alternatives for wavelength routing networks

Science.gov (United States)

Miliotis, K.; Papadimitriou, G. I.; Pomportsis, A. S.

2003-03-01

This paper attempts to provide a high level overview of many of the technologies employed in optical networks with a focus on wavelength-routing networks. Optical networks involve a number of technologies from the physics of light through protocols and networks architectures. In fact there is so much technology and know-how that most people involved with optical networks only have a full understanding of the narrow area they deal with. We start first examining the principles that govern light and its use as a wave guide, and then turn our focus to the various components that constitute an optical network and conclude with the description of all optical networks and wavelength-routed networks in greater detail.

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Shifeng Chen

2017-09-01

Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

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

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.

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Science.gov (United States)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Performance of clustering techniques for solving multi depot vehicle routing problem

Directory of Open Access Journals (Sweden)

Eliana M. Toro-Ocampo

2016-01-01

Full Text Available The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines simultaneously the routes of a set of vehicles and aims to meet a set of clients with a known demand. The objective function of the problem is to minimize the total distance traveled by the routes given that all customers must be served considering capacity constraints in depots and vehicles. This paper presents a hybrid methodology that combines agglomerative clustering techniques to generate initial solutions with an iterated local search algorithm (ILS to solve the problem. Although previous studies clustering methods have been proposed like strategies to generate initial solutions, in this work the search is intensified on the information generated after applying the clustering technique. Besides an extensive analysis on the performance of techniques, and their effect in the final solution is performed. The operation of the proposed methodology is feasible and effective to solve the problem regarding the quality of the answers and computational times obtained on request evaluated literature

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.

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.

A new route to copper nitrate hydroxide microcrystals

International Nuclear Information System (INIS)

Niu Haixia; Yang Qing; Tang Kaibin

2006-01-01

A solution evaporation route has been successfully developed for the growth of copper nitrate hydroxide microcrystals using copper nitrate solution as the starting material in the absence of any surfactants or templates. The products were characterized by X-ray diffraction (XRD), infrared (IR) spectrum, scanning electron microscopy (SEM) and thermogravimetric (TG) analysis measurements. Controlled experiments suggested that the reaction temperature and solution concentration played an important role on the formation of the products. A possible formation mechanism of the products was also proposed

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.

Reconfigurable Robust Routing for Mobile Outreach Network

Science.gov (United States)

Lin, Ching-Fang

2010-01-01

The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

A Sociability-Based Routing Scheme for Delay-Tolerant Networks

Directory of Open Access Journals (Sweden)

Fabbri Flavio

2011-01-01

Full Text Available The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel routing strategy that selects a subset of optimal forwarders among all the nodes and relies on them for an efficient delivery. The key idea is that of assigning to each network node a time-varying scalar parameter which captures its social behavior in terms of frequency and types of encounters. This sociability concept is widely discussed and mathematically formalized. Simulation results of a DTN of vehicles in urban environment, driven by real mobility traces, and employing sociable routing, is presented. Encouraging results show that sociable routing, compared to other known protocols, achieves a good compromise in terms of delay performance and amount of generated traffic.

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

Junos Enterprise Routing A Practical Guide to Junos Routing and Certification

CERN Document Server

Southwick, Peter; Reynolds, Harry

2011-01-01

Considered the go-to study guide for Juniper Networks enterprise routing certification exams, this book offers you unparalleled coverage of all the services available to Junos administrators-including the most recent set of flow-based security services and design guidelines that incorporate services and features of the MX, SRX, and EX network devices. Its emphasis on practical solutions also makes this book an ideal on-the-job reference for design, maintenance, and troubleshooting issues in the enterprise. Simply put, this updated edition is the most comprehensive and authoritative resource

A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.

Science.gov (United States)

Li-Ning Xing; Rohlfshagen, P; Ying-Wu Chen; Xin Yao

2011-08-01

The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization (ACO) algorithm (HACOA) to solve instances of the extended CARP. This approach is characterized by the exploitation of heuristic information, adaptive parameters, and local optimization techniques: Two kinds of heuristic information, arc cluster information and arc priority information, are obtained continuously from the solutions sampled to guide the subsequent optimization process. The adaptive parameters ease the burden of choosing initial values and facilitate improved and more robust results. Finally, local optimization, based on the two-opt heuristic, is employed to improve the overall performance of the proposed algorithm. The resulting HACOA is tested on four sets of benchmark problems containing a total of 87 instances with up to 140 nodes and 380 arcs. In order to evaluate the effectiveness of the proposed method, some existing capacitated arc routing heuristics are extended to cope with the extended version of this problem; the experimental results indicate that the proposed ACO method outperforms these heuristics.

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.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment

Directory of Open Access Journals (Sweden)

Muhammad Sohail

2018-03-01

Full Text Available Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing, which extends the widely used AODV (Ad hoc On-demand Distance Vector routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network. The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.

Science.gov (United States)

Sohail, Muhammad; Wang, Liangmin

2018-03-14

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

Automated Flight Routing Using Stochastic Dynamic Programming

Science.gov (United States)

Ng, Hok K.; Morando, Alex; Grabbe, Shon

2010-01-01

Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

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

About some types of constraints in problems of routing

Science.gov (United States)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

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.

A facile route to shape controlled CdTe nanoparticles

Energy Technology Data Exchange (ETDEWEB)

Mntungwa, Nhlakanipho; Rajasekhar, Pullabhotla V.S.R. [Department of Chemistry, University of Zululand, Private Bag X1001, KwaDlangezwa 3886, Empangeni, KZN (South Africa); Revaprasadu, Neerish, E-mail: nrevapra@pan.uzulu.ac.za [Department of Chemistry, University of Zululand, Private Bag X1001, KwaDlangezwa 3886, Empangeni, KZN (South Africa)

2011-04-15

Research highlights: {yields} A facile hybrid solution based/thermolysis route has been used for the synthesis of hexadecylamine capped CdTe nanoparticles. {yields} This method involves the reaction by the addition of an aqueous suspension of a cadmium salt to a freshly prepared NaHTe solution. {yields} The cadmium salt plays an important role in the growth mechanism of the particles and hence its final morphology. - Abstract: Hexadecylamine (HDA) capped CdTe nanoparticles have been synthesized using a facile hybrid solution based/thermolysis route. This method involves the reaction by the addition of an aqueous suspension or solution of a cadmium salt (chloride, acetate, nitrate or carbonate) to a freshly prepared NaHTe solution. The isolated CdTe was then dispersed in tri-octylphosphine (TOP) and injected into pre-heated HDA at temperatures of 190, 230 and 270 deg. C for 2 h. The particle growth and size distribution of the CdTe particles synthesized using cadmium chloride as the cadmium source were monitored using absorption and photoluminescence spectroscopy. The final morphology of the CdTe nanoparticles synthesized from the various cadmium sources was studied by transmission electron microscopy (TEM) and high resolution TEM. The cadmium source has an influence on the final morphology of the particles.

A facile route to shape controlled CdTe nanoparticles

International Nuclear Information System (INIS)

Mntungwa, Nhlakanipho; Rajasekhar, Pullabhotla V.S.R.; Revaprasadu, Neerish

2011-01-01

Research highlights: → A facile hybrid solution based/thermolysis route has been used for the synthesis of hexadecylamine capped CdTe nanoparticles. → This method involves the reaction by the addition of an aqueous suspension of a cadmium salt to a freshly prepared NaHTe solution. → The cadmium salt plays an important role in the growth mechanism of the particles and hence its final morphology. - Abstract: Hexadecylamine (HDA) capped CdTe nanoparticles have been synthesized using a facile hybrid solution based/thermolysis route. This method involves the reaction by the addition of an aqueous suspension or solution of a cadmium salt (chloride, acetate, nitrate or carbonate) to a freshly prepared NaHTe solution. The isolated CdTe was then dispersed in tri-octylphosphine (TOP) and injected into pre-heated HDA at temperatures of 190, 230 and 270 deg. C for 2 h. The particle growth and size distribution of the CdTe particles synthesized using cadmium chloride as the cadmium source were monitored using absorption and photoluminescence spectroscopy. The final morphology of the CdTe nanoparticles synthesized from the various cadmium sources was studied by transmission electron microscopy (TEM) and high resolution TEM. The cadmium source has an influence on the final morphology of the particles.

Branch-and-cut algorithms for the split delivery vehicle routing problem

NARCIS (Netherlands)

Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

2014-01-01

In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations

A Conceptual Understanding of Employability: The Employers' View in Rwanda

Science.gov (United States)

Bamwesiga, Penelope Mbabazi

2013-01-01

Many governments believe that investing in human capital should increase citizens' employability, which is why it is often presented as a solution to the problems of knowledge-based economies and societies, rising unemployment rates and economic competiveness. The aim of this study is to understand employers' views regarding the employability of…

An analysis of generalised heuristics for vehicle routing and personnel rostering problems

OpenAIRE

Mustafa Misir; Pieter Smet; Greet Vanden Berghe

2015-01-01

The present study investigates the performance of heuristics while solving problems with routing and rostering characteristics. The target problems include scheduling and routing home care, security and maintenance personnel. In analysing the behaviour of the heuristics and determining the requirements for solving the aforementioned problems, the winning hyper-heuristic from the first International Cross-domain Heuristic Search Challenge (CHeSC 2011) is employed. The completely new applicatio...

Optimal routing of hazardous substances in time-varying, stochastic transportation networks

International Nuclear Information System (INIS)

Woods, A.L.; Miller-Hooks, E.; Mahmassani, H.S.

1998-07-01

This report is concerned with the selection of routes in a network along which to transport hazardous substances, taking into consideration several key factors pertaining to the cost of transport and the risk of population exposure in the event of an accident. Furthermore, the fact that travel time and the risk measures are not constant over time is explicitly recognized in the routing decisions. Existing approaches typically assume static conditions, possibly resulting in inefficient route selection and unnecessary risk exposure. The report described the application of recent advances in network analysis methodologies to the problem of routing hazardous substances. Several specific problem formulations are presented, reflecting different degrees of risk aversion on the part of the decision-maker, as well as different possible operational scenarios. All procedures explicitly consider travel times and travel costs (including risk measures) to be stochastic time-varying quantities. The procedures include both exact algorithms, which may require extensive computational effort in some situations, as well as more efficient heuristics that may not guarantee a Pareto-optimal solution. All procedures are systematically illustrated for an example application using the Texas highway network, for both normal and incident condition scenarios. The application illustrates the trade-offs between the information obtained in the solution and computational efficiency, and highlights the benefits of incorporating these procedures in a decision-support system for hazardous substance shipment routing decisions

Deflection routing scheme for GMPLS-based OBS networks

DEFF Research Database (Denmark)

Eid, Arafat; Mahmood, Waqar; Alomar, Anwar

2010-01-01

Integrating the Generalized Multi-Protocol Label Switching (GMPLS) framework into an Optical Burst Switching (OBS) Control Plane is a promising solution to alleviating most of OBS performance and design issues. However, implementing the already proposed OBS deflection routing schemes is not appli...

Multi-objective evacuation routing optimization for toxic cloud releases

International Nuclear Information System (INIS)

Gai, Wen-mei; Deng, Yun-feng; Jiang, Zhong-an; Li, Jing; Du, Yan

2017-01-01

This paper develops a model for assessing the risks associated with the evacuation process in response to potential chemical accidents, based on which a multi-objective evacuation routing model for toxic cloud releases is proposed taking into account that the travel speed on each arc will be affected by disaster extension. The objectives of the evacuation routing model are to minimize travel time and individual evacuation risk along a path respectively. Two heuristic algorithms are proposed to solve the multi-objective evacuation routing model. Simulation results show the effectiveness and feasibility of the model and algorithms presented in this paper. And, the methodology with appropriate modification is suitable for supporting decisions in assessing emergency route selection in other cases (fires, nuclear accidents). - Highlights: • A model for assessing and visualizing the risks is developed. • A multi-objective evacuation routing model is proposed for toxic cloud releases. • A modified Dijkstra algorithm is designed to obtain an solution of the model. • Two heuristic algorithms have been developed as the optimization tool.

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.

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

Economic and quality of life impacts of route 21 freeway construction : final report, October 2009.

Science.gov (United States)

2009-10-01

Opened to traffic in December 2000, the missing section of the Route 21 Freeway in Clifton : and Passaic (Hope Ave. to the Route 46 Interchange) was designed utilizing the equivalent to : the Context Sensitive Solutions (CSS) approach at ...

Split delivery vehicle routing problem with time windows: a case study

Science.gov (United States)

Latiffianti, E.; Siswanto, N.; Firmandani, R. A.

2018-04-01

This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

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.

Do Online Bicycle Routing Portals Adequately Address Prevalent Safety Concerns?

Directory of Open Access Journals (Sweden)

Martin Loidl

2018-03-01

Full Text Available Safety concerns are among the most prevalent deterrents for bicycling. The provision of adequate bicycling infrastructure is considered as one of the most efficient means to increase cycling safety. However, limited public funding does not always allow agencies to implement cycling infrastructure improvements at the desirable level. Thus, bicycle trip planners can at least partly alleviate the lack of adequate infrastructure by recommending optimal routes in terms of safety. The presented study provides a systematic review of 35 bicycle routing applications and analyses to which degree they promote safe bicycling. The results show that most trip planners lack corresponding routing options and therefore do not sufficiently address safety concerns of bicyclists. Based on these findings, we developed recommendations on how to better address bicycling safety in routing portals. We suggest employing current communication technology and analysis to consider safety concerns more explicitly.

Secure Multicast Routing Algorithm for Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Rakesh Matam

2016-01-01

Full Text Available Multicast is an indispensable communication technique in wireless mesh network (WMN. Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.

FFT Bifurcation Analysis of Routes to Chaos via Quasiperiodic Solutions

Directory of Open Access Journals (Sweden)

L. Borkowski

2015-01-01

Full Text Available The dynamics of a ring of seven unidirectionally coupled nonlinear Duffing oscillators is studied. We show that the FFT analysis presented in form of a bifurcation graph, that is, frequency distribution versus a control parameter, can provide a valuable and helpful complement to the corresponding typical bifurcation diagram and the course of Lyapunov exponents, especially in context of detailed identification of the observed attractors. As an example, bifurcation analysis of routes to chaos via 2-frequency and 3-frequency quasiperiodicity is demonstrated.

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.

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Directory of Open Access Journals (Sweden)

ChunYing Liu

2013-09-01

Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm

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

Science.gov (United States)

Baldwin, Jarret Taylor

previous 24 hour period, fatigue state at report time, circadian rhythm disruptions, assigned rest periods in an onboard crew rest facility, experiencing spontaneous sleep episodes, and napping metrics. The study also reports on some common en-route fatigue mitigation strategy themes, as reported by the study participants and how these relate to the survey question responses of survey participants. Study results suggest that there are significant relationships between fatigue states prior to napping and augmentation, fatigue states when reporting for duty, assignment to en-route rest in an onboard crew rest facility, and having experienced spontaneous sleep episodes. The study results also suggest that there is not a significant relationship between being assigned scheduled rest periods in an onboard crew rest facility and the usage of en-route napping as part of an individual pilot's fatigue mitigation stategy. Finally, the study results suggest that short duration naps, averaging less than 30 minutes, are most commonly being employed by the subject population to beneficial effect.

Processing by both classical and mechanosynthesis routes and characterization of a new solid solution of tungsten-bronze structure ceramics

International Nuclear Information System (INIS)

Khachane, M.; Moure, A.; Elaatmani, M.; Zegzouti, A.; Daoud, M.; Castro, A.

2006-01-01

A new family of ferroelectric compounds with Ba 2-x Na 1+x Li x Nb 5 O 15 composition (0 ≤ x ≤ 1) and tetragonal tungsten-bronze structure is processed for the first time. This new family of materials derived from Ba 2 NaNb 5 O 15 compound was processed by classical solid-state reaction and by mechanosynthesis. The powders prepared by these two routes were characterized by X-ray diffraction (at room and high temperature), differential thermal analysis, thermogravimetry and scanning electron microscopy. The results confirm the formation of the solid solution in the whole range of composition. The influence of Li addition on the dielectric permittivity and losses and on the ferro-paraelectric transition temperature is also studied

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.

Optimal routing of IP packets to multi-homed servers

International Nuclear Information System (INIS)

Swartz, K.L.

1992-08-01

Multi-homing, or direct attachment to multiple networks, offers both performance and availability benefits for important servers on busy networks. Exploiting these benefits to their fullest requires a modicum of routing knowledge in the clients. Careful policy control must also be reflected in the routing used within the network to make best use of specialized and often scarce resources. While relatively straightforward in theory, this problem becomes much more difficult to solve in a real network containing often intractable implementations from a variety of vendors. This paper presents an analysis of the problem and proposes a useful solution for a typical campus network. Application of this solution at the Stanford Linear Accelerator Center is studied and the problems and pitfalls encountered are discussed, as are the workarounds used to make the system work in the real world

The vehicle routing problem latest advances and new challenges

CERN Document Server

Golden, Bruce L; Wasil, Edward A

2008-01-01

The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems. The book will systematically examine these recent developments in the VRP and provide the following in a unified and carefully developed presentation: Present novel problems that have arisen in the vehicle routing domain and highlight new challenges for the field; Pre...

Partial Path Column Generation for the Vehicle Routing Problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn

This paper presents a column generation algorithm for the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the CVRP and VRPTW have consisted of a Set Partitioning master problem with each column...... of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution space for the pricing problem can be obtained....

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

Employment, Social Networks and Undocumented Migrants: The Employer Perspective

Science.gov (United States)

Bloch, Alice; McKay, Sonia

2015-01-01

This article draws on data from qualitative interviews with ethnic enclave and ethnic economy business entrepreneurs from Chinese, Bangladeshi and Turkish-speaking communities in London. Routes into business and worker recruitment practices are explored, demonstrating the centrality of social capital in the form of family and other social networks within these processes. The article investigates what employers consider the desirable characteristics of workers: trust, kinship, gender, social networks, language compatibility and the needs of the business intersect with racialised notions of workers’ strengths and characteristics. Finally, we consider changing practices in relation to the employment of undocumented migrants, in the context of an increasingly punitive legislative regime. The complex and variable impact of policy alongside the ways in which other obligations and positions outweigh the fear and risks of sanctions associated with non-compliance is revealed. PMID:25866421

An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

National Research Council Canada - National Science Library

Burks, Jr, Robert E

2006-01-01

.... The location routing problem (LRP) is an extension of the vehicle routing problem where the solution identifies the optimal location of the depots and provides the vehicle schedules and distribution routes...

Cluster chain based energy efficient routing protocol for moblie WSN

Directory of Open Access Journals (Sweden)

WU Ziyu

2016-04-01

Full Text Available With the ubiquitous smart devices acting as mobile sensor nodes in the wireless sensor networks(WSNs to sense and transmit physical information,routing protocols should be designed to accommodate the mobility issues,in addition to conventional considerations on energy efficiency.However,due to frequent topology change,traditional routing schemes cannot perform well.Moreover,existence of mobile nodes poses new challenges on energy dissipation and packet loss.In this paper,a novel routing scheme called cluster chain based routing protocol(CCBRP is proposed,which employs a combination of cluster and chain structure to accomplish data collection and transmission and thereafter selects qualified cluster heads as chain leaders to transmit data to the sink.Furthermore,node mobility is handled based on periodical membership update of mobile nodes.Simulation results demonstrate that CCBRP has a good performance in terms of network lifetime and packet delivery,also strikes a better balance between successful packet reception and energy consumption.

A flow-first route-next heuristic for liner shipping network design

DEFF Research Database (Denmark)

Krogsgaard, Alexander; Pisinger, David; Thorsen, Jesper

2018-01-01

Having a well-designed liner shipping network is paramount to ensure competitive freight rates, adequate capacity on trade-lanes, and reasonable transportation times.The most successful algorithms for liner shipping network design make use of a two-phase approach, where they first design the routes...... different operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity flow problem to route the containers through the network, the flow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange...... heuristic for flowing containers is 2–5% from the optimal solution, the solution quality is sufficiently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to find improved solutions for large...

Routing helicopters for crew exchanges on off-shore locations

NARCIS (Netherlands)

Sierksma, G.; Tijssen, G.A.

This paper deals with a vehicle routing problem with split demands, namely the problem of determining a flight schedule for helicopters to off-shore platform locations for exchanging crew people employed on these platforms. The problem is formulated as an LP model and solved by means of a

Solution-chemical route to generalized synthesis of metal germanate nanowires with room-temperature, light-driven hydrogenation activity of CO2 into renewable hydrocarbon fuels.

Science.gov (United States)

Liu, Qi; Zhou, Yong; Tu, Wenguang; Yan, Shicheng; Zou, Zhigang

2014-01-06

A facile solution-chemical route was developed for the generalized preparation of a family of highly uniform metal germanate nanowires on a large scale. This route is based on the use of hydrazine monohydrate/H2O as a mixed solvent under solvothermal conditions. Hydrazine has multiple effects on the generation of the nanowires: as an alkali solvent, a coordination agent, and crystal anisotropic growth director. Different-percentage cobalt-doped Cd2Ge2O6 nanowires were also successfully obtained through the addition of Co(OAc)2·4H2O to the initial reaction mixture for future investigation of the magnetic properties of these nanowires. The considerably negative conduction band level of the Cd2Ge2O6 nanowire offers a high driving force for photogenerated electron transfer to CO2 under UV-vis illumination, which facilitates CO2 photocatalytic reduction to a renewable hydrocarbon fuel in the presence of water vapor at room temperature.

Modified artificial bee colony for the vehicle routing problems with time windows.

Science.gov (United States)

Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

2016-01-01

The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.

Routing Planning As An Application Of Graph Theory with Fuzzy Logic

Directory of Open Access Journals (Sweden)

Tomasz Neumann

2016-12-01

Full Text Available The routing planning one of the classic problems in graph theory. Its application have various practical uses ranging from the transportation, civil engineering and other applications. The resolution of this paper is to find a solution for route planning in a transport networks, where the description of tracks, factor of safety and travel time are ambiguous. In the study the ranking system based on the theory of possibility is proposed.

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

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.

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.

Application of MIKE21 Software in Flood Routing of Tidal Rivers: A Case Study of the Zohre River

Directory of Open Access Journals (Sweden)

Ali Karami Khaniki

2007-01-01

Full Text Available Flood routing is of special importance from different aspects of river engineering such as flood zoning, flood forecasting, etc. There are two methods employed in river flood routing, hydraulic and hydrological. Hydrological methods are used when the river is at low tide and, hence, cannot be employed to analyze floods caused by the tide. Hydraulic methods must be employed in tidal rivers when the direction of the current reverses at high tide. In this research,MIKE21 modeling software was used for the flood routing of the Zohreh tidal river. The model was calibrated by surveying the river, taking samples form the river bed, measuring sea water level and the velocity of the river flow. Analyzing the sensitivity of the model showed that the coefficient of determination, root mean square error and relative error were 0.95, 0.032, and 0.27, respectively, all indicating the efficacy of the model in simulating different parameters such as velocity, flow rate, and water surface profile. The flood routing results of the tidal currents showed that the hydrograph of the influent and effluent to the reach at high tide (when the current direction is from sea to the river was similar to the normal flood routing of the river, but at low tide (when the current direction is from the sea to the river influent and effluent hydrograph would not follow the laws of normal flood routing.

LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring.

Science.gov (United States)

Tseng, Chinyang Henry

2016-05-31

In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee's AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee's routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node's distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee's AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV.

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

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.

Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms

Directory of Open Access Journals (Sweden)

Mattas Konstantinos

2016-12-01

Full Text Available The determination of the optimal circular path has become widely known for its difficulty in producing a solution and for the numerous applications in the scope of organization and management of passenger and freight transport. It is a mathematical combinatorial optimization problem for which several deterministic and heuristic models have been developed in recent years, applicable to route organization issues, passenger and freight transport, storage and distribution of goods, waste collection, supply and control of terminals, as well as human resource management. Scope of the present paper is the development, with the use of fuzzy sets, of a practical, comprehensible and speedy heuristic algorithm for the improvement of the ability of the classical deterministic algorithms to identify optimum, symmetrical or non-symmetrical, circular route. The proposed fuzzy heuristic algorithm is compared to the corresponding deterministic ones, with regard to the deviation of the proposed solution from the best known solution and the complexity of the calculations needed to obtain this solution. It is shown that the use of fuzzy sets reduced up to 35% the deviation of the solution identified by the classical deterministic algorithms from the best known solution.

Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

OpenAIRE

Wang, Qian; Ji, Qingkai; Chiu, Chun-Hung

2014-01-01

We present a metaheuristic called the reactive guided tabu search (RGTS) to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP), where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this proble...

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

Full Text Available A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR for vehicular ad hoc networks (VANETs is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments, and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

AIB-OR: improving onion routing circuit construction using anonymous identity-based cryptosystems.

Science.gov (United States)

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Institute of Scientific and Technical Information of China (English)

Li Yanping; Wang Xin; Xue Xiangyang; C.K. Toh

2006-01-01

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks (MANETs), it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop suggests smart route recovery strategy. Our approach is composed of setup procedure, regular procedure and recovery procedure to achieve clustering, routing and emergent route recovering.

The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

Directory of Open Access Journals (Sweden)

Huey-Kuo Chen

2011-01-01

Full Text Available This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW. Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

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

The Swedish Model in Employment. Post-Crisis Solutions

Directory of Open Access Journals (Sweden)

Mirela Ionela ACELEANU

2012-04-01

Full Text Available The Swedish model in the field of employment is part of the Nordic countries model focused on labour market flexibility in terms of a generous welfare system. This paper presents the characteristics of this model and its application effects in Sweden before and after the current crisis. According to specialized studies and registered indicators, Sweden has very good results in terms of general well-being, quality of life, employment of labour resources, being among the top countries. Thus, since the experience of the developed countries should be a benchmark for the developing countries, the purpose of the paper is to identify some measures that can be applied in Romania to improve employment, economic and social policies.

Mineralogical characteristics of Ettringites synthesized from solutions and suspensions

International Nuclear Information System (INIS)

Goetz-Neunhoeffer, F.; Neubauer, J.; Schwesig, P.

2006-01-01

Due to the wide technical importance of Ettringite (3CaO.Al 2 O 3 .3CaSO 4 .32H 2 O) in hydrated cement based systems, four different synthesis methods were applied to get a better overview on how and under what favoring conditions Ettringite can be formed. In the first step different precipitation methods resulting in Ettringite were established. For all methods Al 3+ was supplied by aqueous CO 2 -free solution of Al 2 (SO 4 ) 3 .18H 2 O. As a source of CaO-supply a clear solution and otherwise a Ca(OH) 2 -suspension was utilized. Four synthesis routes with and without sucrose were employed. Variation of reaction parameter like temperature, time of reaction, pH-value of synthesis solution and influence of additional Gypsum were investigated. The qualitative phase analysis was performed by X-ray diffraction method (XRD). Morphological aspects of some synthesis products were studied by scanning electron microscopy (SEM). Finally lattice and structural parameter of the Ettringites were determined by refinement of XRD-pattern using the Rietveld-Method

Composition and microstructure of zirconium and hafnium germanates obtained by different chemical routes

International Nuclear Information System (INIS)

Utkin, A.V.; Prokip, V.E.; Baklanova, N.I.

2014-01-01

The phase composition and morphology of zirconium and hafnium germanates synthesized by ceramic and co-precipitation routes were studied. The products were characterized using high-temperature X-ray diffraction analysis (XRD), Raman spectroscopy, scanning electron microscopy (SEM) and thermal (TG/DTA) analysis. To investigate the phase composition and stoichiometry of compounds the unit cell parameters were refined by full-profile Rietveld XRD analysis. The morphology of products and its evolution during high-temperature treatment was examined by SEM analysis. It was stated that there is the strong dependence of the phase composition and morphology of products on the preparation route. The ceramic route requires a multi-stage high-temperature treatment to obtain zirconium and hafnium germanates of 95% purity or more. Also, there are strong diffusion limitations to obtain hafnium germanate Hf 3 GeO 8 by ceramic route. On the contrary, the co-precipitation route leads to the formation of nanocrystalline single phase germanates of stoichiometric composition at a relatively low temperatures (less than 1000 °C). The results of quantitative XRD analysis showed the hafnium germanates are stoichiometric compounds in contrast to zirconium germanates that form a set of solid solutions. This distinction may be related to the difference in the ion radii of Zr and Hf. - Graphical abstract: The phase composition and morphology of zirconium and hafnium germanates synthesized by ceramic and co-precipitation routes were studied. It was stated that there is the strong dependence of the phase composition and morphology of products on the preparation route. Display Omitted - Highlights: • Zr and Hf germanates were synthesized by ceramic and co-precipitation routes. • The morphology of products depends on the synthesis parameters. • Zirconium germanates forms a set of solid solutions. • Hafnium germanates are stoichiometric compounds

Green open location-routing problem considering economic and environmental costs

Directory of Open Access Journals (Sweden)

Eliana M. Toro

2016-12-01

Full Text Available This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP, recently presented in the literature, coupled with the growing need for fuel consumption minimization, named Green OLRP (G-OLRP. Open routing problems (ORP are known to be NP-hard problems, in which vehicles start from the set of existing depots and are not required to return to the starting depot after completing their service. The OLRP is a strategic-level problem involving the selection of one or many depots from a set of candidate locations and the planning of delivery radial routes from the selected depots to a set of customers. The concept of radial paths allows us to use a set of constraints focused on maintaining the radiality condition of the paths, which significantly simplifies the set of constraints associated with the connectivity and capacity requirements and provides a suitable alternative when compared with the elimination problem of sub-tours traditionally addressed in the literature. The emphasis in the paper will be placed on modeling rather than solution methods. The model proposed is formulated as a bi-objective problem, considering the minimization of operational costs and the minimization of environmental effects, and it is solved by using the epsilon constraint technique. The results illustrate that the proposed model is able to generate a set of trade-off solutions leading to interesting conclusions about the relationship between operational costs and environmental impact.

MULTI-VEHICLE COVERING TOUR PROBLEM: BUILDING ROUTES FOR URBAN PATROLLING

Directory of Open Access Journals (Sweden)

Washington Alves de Oliveira

2015-12-01

Full Text Available ABSTRACT In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community perceived safety, allowing quick emergency responses and providing surveillance of selected sites (e.g., hospitals, schools. The planning is restricted to the availability of vehicles and strives to achieve balanced routes. We study an adaptation of the model for the multi-vehicle covering tour problem, in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. It constitutes an NP-complete integer programming problem. Suboptimal solutions are obtained with several heuristics, some adapted from the literature and others developed by us. We solve some adapted instances from TSPLIB and an instance with real data, the former being compared with results from literature, and latter being compared with empirical data.

Surface-Wave Pulse Routing around Sharp Right Angles

Science.gov (United States)

Gao, Z.; Xu, H.; Gao, F.; Zhang, Y.; Luo, Y.; Zhang, B.

2018-04-01

Surface-plasmon polaritons (SPPs), or localized electromagnetic surface waves propagating on a metal-dielectric interface, are deemed promising information carriers for future subwavelength terahertz and optical photonic circuitry. However, surface waves fundamentally suffer from scattering loss when encountering sharp corners in routing and interconnection of photonic signals. Previous approaches enabling scattering-free surface-wave guidance around sharp corners are limited to either volumetric waveguide environments or extremely narrow bandwidth, being unable to guide a surface-wave pulse (SPP wave packet) on an on-chip platform. Here, in a surface-wave band-gap crystal implemented on a single metal surface, we demonstrate in time-domain routing a surface-wave pulse around multiple sharp right angles without perceptible scattering. Our work not only offers a solution to on-chip surface-wave pulse routing along an arbitrary path, but it also provides spatiotemporal information on the interplay between surface-wave pulses and sharp corners, both of which are desirable in developing high-performance large-scale integrated photonic circuits.

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

Ship speed optimization: Concepts, models and combined speed-routing scenarios

DEFF Research Database (Denmark)

Psaraftis, Harilaos N.; Kontovas, Christos A.

2014-01-01

The purpose of this paper is to clarify some important issues as regards ship speed optimization at the operational level and develop models that optimize ship speed for a spectrum of routing scenarios in a single ship setting. The paper's main contribution is the incorporation of those fundament...... parameters and other considerations that weigh heavily in a ship owner's or charterer's speed decision and in his routing decision, wherever relevant. Various examples are given so as to illustrate the properties of the optimal solution and the various trade-offs that are involved....

Addressing the Issue of Routing Unfairness in Opportunistic Backhaul Networks for Collecting Sensed Data

Directory of Open Access Journals (Sweden)

Tekenate E. Amah

2017-12-01

Full Text Available Widely deploying sensors in the environment and embedding them in physical objects is a crucial step towards realizing smart and sustainable cities. To cope with rising resource demands and limited budgets, opportunistic networks (OppNets offer a scalable backhaul option for collecting delay-tolerant data from sensors to gateways in order to enable efficient urban operations and services. While pervasive devices such as smartphones and tablets contribute significantly to the scalability of OppNets, closely following human movement patterns and social structure introduces network characteristics that pose routing challenges. Our study on the impact of these characteristics reveals that existing routing protocols subject a key set of devices to higher resource consumption, to which their users may respond by withdrawing participation. Unfortunately, existing solutions addressing this unfairness do not guarantee achievable throughput since they are not specifically designed for sensed data collection scenarios. Based on concepts derived from the study, we suggest design guidelines for adapting applicable routing protocols to sensed data collection scenarios. We also follow our design guidelines to propose the Fair Locality Aware Routing (FLARoute technique. Evaluating FLARoute within an existing routing protocol confirms improved fairness and throughput under conditions that compromise the performance of existing solutions.

Vehicle Routing Problems for Drone Delivery

OpenAIRE

Dorling, Kevin; Heinrichs, Jordan; Messier, Geoffrey G.; Magierowski, Sebastian

2016-01-01

Unmanned aerial vehicles, or drones, have the potential to significantly reduce the cost and time of making last-mile deliveries and responding to emergencies. Despite this potential, little work has gone into developing vehicle routing problems (VRPs) specifically for drone delivery scenarios. Existing VRPs are insufficient for planning drone deliveries: either multiple trips to the depot are not permitted, leading to solutions with excess drones, or the effect of battery and payload weight ...

Crowdsourced WebGIS for routing applications in disaster management situations

NARCIS (Netherlands)

Nedkov, S.

2012-01-01

Successfully navigating a damaged infrastructure is challenging due to a lack of automatic routing solutions and a shortage of real-time infrastructure status information. Remote sensing techniques, which are traditionally used, have drawbacks; clouds obscure the view, observation frequency is low,

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.

Flight planning and flexible use of airspace in Free route airspace area

Directory of Open Access Journals (Sweden)

Martin Kodera

2014-01-01

Full Text Available The paper summarizes changes in the flight planning caused by the introduction of Free Route Airspace Project and suggests possible measures needed to be adopted across the whole system in order to ensure military and civilian aircraft remain segregated in a way that is today ensured by the system of conditional routes. The paper suggests a possible solution in flight planning using existing flight planning tools provided by the CFMU.

The Fragility of Employability: A Dynamic Perspective and Examples from the Netherlands

NARCIS (Netherlands)

Sanders, J.; Dorenbosch, L.; Blonk, R.

2015-01-01

This contribution aims to provide a framework for viewing the fragility of employability and potentially fruitful routes for making employability more sustainable. A second goal, is to inspire readers with examples from the Netherlands, to create and test promising interventions, so that a broad set

A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation

Directory of Open Access Journals (Sweden)

Triana Mugia Rahayu

2015-06-01

Full Text Available The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both.

Partial path column generation for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Petersen, Bjørn; Jepsen, Mads Kehlet

2009-01-01

This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...

Effect of strain and deformation route on grain boundary characteristics and recrystallization behavior of aluminum

International Nuclear Information System (INIS)

Sakai, Tetsuo; Takahashi, Yasuo; Utsunomiya, Hiroshi

2014-01-01

The effect of strain and deformation route on the recrystallization behavior of aluminum sheets has been investigated using well lubricated cold rolling and continuous equal channel angular extrusion. Three different deformation routes in plane strain corresponding to (1) simple shear, (2) compression, and (3) the combination of simple shear and compression were performed on 1100 aluminum sheet. Fixed amounts of the equivalent strain of 1.28 and 1.06 were accumulated in each route. In case of the combined deformation route, the ratio of shear strain to the total equivalent strain was varied. The recrystallized grain size was finer if the combined deformation route was employed instead of the monotonic route under the same amount of equivalent strain at either strain level. The density of high angle grain boundaries that act as nucleation sites for recrystallization was higher in materials deformed by the combined route. The orientation imaging micrographs revealed that the change in deformation route is effective for introducing a larger number of new high angle grain boundaries with relatively low misorientation angle

Effect of strain and deformation route on grain boundary characteristics and recrystallization behavior of aluminum

Science.gov (United States)

Sakai, Tetsuo; Utsunomiya, Hiroshi; Takahashi, Yasuo

2014-08-01

The effect of strain and deformation route on the recrystallization behavior of aluminum sheets has been investigated using well lubricated cold rolling and continuous equal channel angular extrusion. Three different deformation routes in plane strain corresponding to (1) simple shear, (2) compression, and (3) the combination of simple shear and compression were performed on 1100 aluminum sheet. Fixed amounts of the equivalent strain of 1.28 and 1.06 were accumulated in each route. In case of the combined deformation route, the ratio of shear strain to the total equivalent strain was varied. The recrystallized grain size was finer if the combined deformation route was employed instead of the monotonic route under the same amount of equivalent strain at either strain level. The density of high angle grain boundaries that act as nucleation sites for recrystallization was higher in materials deformed by the combined route. The orientation imaging micrographs revealed that the change in deformation route is effective for introducing a larger number of new high angle grain boundaries with relatively low misorientation angle.

Microstructural features of the La1−xCaxFeO3−δ solid solutions prepared via Pechini route

International Nuclear Information System (INIS)

Gerasimov, E.Yu.; Isupova, L.A.; Tsybulya, S.V.

2015-01-01

Highlights: • La 1−x Ca x FeO (3−δ) (0 ≤ x ≤ 0.7) perovskite were prepared by Pechini method. • Planar defects in direction (1 0 1) were observed in the perovskite surface. • α-Fe 2 O 3 particles (1–10 nm) on the surface of perovskite were revealed. • Amount of α-Fe 2 O 3 particles on the perovskite surface grew with rising x values. - Abstract: Solid solutions with La 1−x Ca x FeO 3−δ (0 ≤ x ≤ 0.7) perovskite-like structure prepared via Pechini route have been investigated by using high resolution transmission electron microscopy and X-ray diffraction. Extended planar defects lying in (1 0 1) crystallographic planes and α-Fe 2 O 3 nanoparticles on the surface of perovskite microcrystals are characteristic of the samples under investigation. It was found that testing of the samples in catalytic deep CH 4 oxidation process results in partial destruction of solid solutions with formation of planar defects in the bulk and α-Fe 2 O 3 particles on the surface

On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity

Science.gov (United States)

Hanum, F.; Hartono, A. P.; Bakhtiar, T.

2018-03-01

This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.

A unified approach to mapping and routing on a network-on-chip for both best-effort and guaranteed service traffic

NARCIS (Netherlands)

Hansson, M.A.; Goossens, K.G.W.; Radulescu, A.

2007-01-01

One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate and possibly conflicting objective

A Unified Approach to Mapping and Routing on a Network-on-Chip for Both Best-Effort and Guaranteed Service Traffic

NARCIS (Netherlands)

Hansson, A.; Goossens, K.; R?dulescu, A.

2007-01-01

One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate and possibly conflicting objective

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

Induced synthesis of toroid-like lead sulfide nanocomposites in ethanol solution through a protein templating route

International Nuclear Information System (INIS)

Zhang, Li; Qin, Dezhi; Yang, Guangrui; Du, Xian; Zhang, Qiuxia; Li, Feng

2015-01-01

The toroid-like PbS nanocrystals have been prepared in zein ethanol solution based on self-assembly template of protein molecules. From transmission electron microscopy observation, the obtained samples were monodispersed with an average size of about 47 nm. The chemical composition and crystal structure of nanocomposites were determined by X-ray diffraction and energy-dispersive X-ray spectrum measurements. The interaction between PbS and zein was investigated through Fourier transform infrared, photoluminescence, circular dichroism (CD) spectra, and thermogravimetric analysis. The PbS nanocrystals could react with nitrogen and oxygen atoms of zein molecules through coordination and electrostatic force. The CD spectra results suggested that PbS nanocrystals induced the conformational transition of protein from α-helix to β-sheet and then self-assembled into ring or toroid nanostructure. The quenching of zein fluorescence induced by PbS nanocrystals also showed the change in the chemical microenvironments of the fluorescent amino acid residues in the protein structure. The key step of this facile, biomimetic route was the formation of self-assembly nanostructure of zein, which could regulate the nucleation and growth of toroid-like PbS nanocrystals

A decision support system for mission-based ship routing considering multiple performance criteria

International Nuclear Information System (INIS)

Dong, You; Frangopol, Dan M.; Sabatino, Samantha

2016-01-01

It is crucial to evaluate the risk associated with marine vessels subjected to inclement weather and sea conditions when developing a decision support system for ship routing. The generalized decision making framework developed in this paper performs a variety of tasks, including, but not limited to quantifying the flexural and fatigue performance of ship structures and employing multi-attribute utility theory to evaluate ship mission performance. A structural reliability approach is utilized to compute the probability of failure considering the uncertainties in structural capacity and load effects; specifically, effects of flexural and fatigue damage are investigated. The expected repair cost, cumulative fatigue damage, total travel time, and carbon dioxide emissions associated with ship routing are considered as consequences within the risk assessment procedure adopted in this paper. Additionally, the decision maker’s risk attitude is integrated into the presented approach by employing utility theory. The presented methodology can assist decision makers in making informed decisions concerning ship routing. In order to illustrate its capabilities the approach is applied to the Joint High-speed Sealift Ship. - Highlights: • Multi-attribute utility theory is proposed for the ship routing decision making. • Spectral-based fatigue damage and repair loss are computed. • Travel time and CO_2 emissions are incorporated within the decision making process. • The attitude of the decision maker has significant effects on the utility value.

R&D Personnel Career Routes: An Exploratory Study

Directory of Open Access Journals (Sweden)

Barbara Bigliardi

2009-05-01

Full Text Available This study, aiming at investigate the alternative modes of career development for personnel belonging to R&D staff, addresses the extent to which career anchors are applicable to R&D staff and to examine the relationship among career anchors, gender and age, with the final purpose to add elements of discussion to the long-lasting debate about this matter. With this purpose in mind, we developed a questionnaire survey among 309 R&D personnel employed at firms belonging to the food machinery industry in a Northern Italy district. The results obtained from the statistical analysis indicate that the R&D personnel’s career orientations is a predictor of their career routes preferences, confirming three possible career routes in R&D labs that were highlighted in previous studies.

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

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 Survey of Wireless Indoor Positioning Technology for Fire Emergency Routing

International Nuclear Information System (INIS)

Niu, Lei

2014-01-01

Fire emergency response needs positioning solutions to assist evacuation and rescue operations. Therefore, we have to carefully review the candidates for this purpose. These indoor positioning technologies show different levels of applicability in fire emergency response. According to the varying demands of emergency response, flexible localization solutions should be provided. Thus, we guide a first step to implement this concept in three pre-defined emergency scenes. At last, we conclude several key features for indoor positioning solutions for emergency routing and three future research topics

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.

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

International Nuclear Information System (INIS)

Onut, S; Kamber, M R; Altay, G

2014-01-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

Science.gov (United States)

Onut, S.; Kamber, M. R.; Altay, G.

2014-03-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

The integrated model for solving the single-period deterministic inventory routing problem

Science.gov (United States)

Rahim, Mohd Kamarul Irwan Abdul; Abidin, Rahimi; Iteng, Rosman; Lamsali, Hendrik

2016-08-01

This paper discusses the problem of efficiently managing inventory and routing problems in a two-level supply chain system. Vendor Managed Inventory (VMI) policy is an integrating decisions between a supplier and his customers. We assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The objective of this paper is to minimize the inventory and the transportation costs of the customers for a two-level supply chain. The problem is to determine the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixed-integer program is developed for the solutions of the SP-DIRP problem.

Harmonic analysis of the stability of reverse routing in channels

Directory of Open Access Journals (Sweden)

2007-01-01

Full Text Available Normal downstream routing of a flood flow is a highly stable process for Froude numbers less than 1 and hence the results are reliable. In contrast, reverse routing in an upstream direction, which may be required for flow control, is potentially unstable. This paper reports the results of a study of the practical limits on channel lengths for reverse routing. Harmonic analysis is applied to the full non-linear solution of the St. Venant equations for three different wave patterns and two different wave periods, for a particular channel with a Froude number of 0.5. Reverse routing can be done for prismatic channels longer than 100 km. For long periods (>10 hours the shape of the upstream hydrograph is recovered well. However, when the wave period is short (<1 hour, the high frequency components of the upstream hydrograph and, thus, its shape, are not recovered. These limits are influenced by the channel morphology and shape of the wave. Further work is needed to determine how these factors interact.

Parallel algorithms for placement and routing in VLSI design. Ph.D. Thesis

Science.gov (United States)

Brouwer, Randall Jay

1991-01-01

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Topology control of tactical wireless sensor networks using energy efficient zone routing

Directory of Open Access Journals (Sweden)

Preetha Thulasiraman

2016-02-01

Full Text Available The US Department of Defense (DoD routinely uses wireless sensor networks (WSNs for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE, Low Energy Adaptive Cluster Head routing (LEACH, and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.

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.

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

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

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

Solution Methods for the Periodic Petrol Station Replenishment Problem

Directory of Open Access Journals (Sweden)

C Triki

2013-12-01

Full Text Available In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved exactly until achieving optimalization. Moreover, an improvement procedure is also developed with the aim of ensuring a better quality solution. Our heuristics are tested and compared in two real-life cases, and our computational results show encouraging improvements with respect to a human planning solution

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2010-08-01

Full Text Available Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

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

Energy Aware GPSR Routing Protocol in a Wireless Sensor Network ...

African Journals Online (AJOL)

Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their ...

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.

Nanofabrication and characterization of ZnO nanorod arrays and branched microrods by aqueous solution route and rapid thermal processing

International Nuclear Information System (INIS)

Lupan, Oleg; Chow, Lee; Chai, Guangyu; Roldan, Beatriz; Naitabdi, Ahmed; Schulte, Alfons; Heinrich, Helge

2007-01-01

This paper presents an inexpensive and fast fabrication method for one-dimensional (1D) ZnO nanorod arrays and branched two-dimensional (2D), three-dimensional (3D) - nanoarchitectures. Our synthesis technique includes the use of an aqueous solution route and post-growth rapid thermal annealing. It permits rapid and controlled growth of ZnO nanorod arrays of 1D - rods, 2D - crosses, and 3D - tetrapods without the use of templates or seeds. The obtained ZnO nanorods are uniformly distributed on the surface of Si substrates and individual or branched nano/microrods can be easily transferred to other substrates. Process parameters such as concentration, temperature and time, type of substrate and the reactor design are critical for the formation of nanorod arrays with thin diameter and transferable nanoarchitectures. X-ray diffraction, scanning electron microscopy, X-ray photoelectron spectroscopy, transmission electron microscopy and Micro-Raman spectroscopy have been used to characterize the samples

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.

Approximation Algorithm for a Heterogeneous Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Jungyun Bae

2015-08-01

Full Text Available This article addresses a fundamental path planning problem which aims to route a collection of heterogeneous vehicles such that each target location is visited by some vehicle and the sum of the travel costs of the vehicles is minimal. Vehicles are heterogeneous as the cost of traveling between any two locations depends on the type of the vehicle. Algorithms are developed for this path planning problem with bounds on the quality of the solutions produced by the algorithms. Computational results show that high quality solutions can be obtained for the path planning problem involving four vehicles and 40 targets using the proposed approach.

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.

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

A variable neighborhood descent based heuristic to solve the capacitated location-routing problem

Directory of Open Access Journals (Sweden)

M. S. Jabal-Ameli

2011-01-01

Full Text Available Location-routing problem (LRP is established as a new research area in the context of location analysis. The primary concern of LRP is on locating facilities and routing of vehicles among established facilities and existing demand points. In this work, we address the capacitated LRP which arises in many practical applications within logistics and supply chain management. The objective is to minimize the overall system costs which include the fixed costs of opening depots and using vehicles at each depot site, and the variable costs associated with delivery activities. A novel heuristic is proposed which is based on variable neighborhood descent (VND algorithm to solve the resulted problem. The computational study indicates that the proposed VND based heuristic is highly competitive with the existing solution algorithms in terms of solution quality.

Inventory slack routing application in emergency logistics and relief distributions.

Science.gov (United States)

Yang, Xianfeng; Hao, Wei; Lu, Yang

2018-01-01

Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

Route Instruction Mechanism for Mobile Users Leveraging Distributed Wireless Resources

Science.gov (United States)

Kakehi, Takeshi; Shinkuma, Ryoichi; Murase, Tutomu; Motoyoshi, Gen; Yamori, Kyoko; Takahashi, Tatsuro

The market growths of smart-phones and thin clients have been significantly increasing communication traffic in mobile networks. To handle the increased traffic, network operators should consider how to leverage distributed wireless resources such as distributed spots of wireless local access networks. In this paper, we consider the system where multiple moving users share distributed wireless access points on their traveling routes between their start and goal points and formulate as an optimization problem. Then, we come up with three algorithms as a solution for the problem. The key idea here is ‘longcut route instruction’, in which users are instructed to choose a traveling route where less congested access points are available; even if the moving distance increases, the throughput for users in the system would improve. In this paper, we define the gain function. Moreover, we analyze the basic characteristics of the system using as a simple model as possible.

Stigma against People Living with HIV/AIDS in China: Does the Route of Infection Matter?

Directory of Open Access Journals (Sweden)

Chen Zhang

Full Text Available In the current study, we tested the hypothesis that people who contracted HIV from "blameless" routes (e.g., blood transfusion, sex with stable partners are less stigmatized compared to people who contracted HIV from "blamable" routes (e.g., injection drug use, sex with sex workers. A cross-sectional study was conducted among 2,987 participants in Guangxi province, China, between 2012 and 2013. We employed both explanatory and predictive modeling strategy by using multivariate linear regression models. In the explanatory models, we assessed the association between routes of infection and three types of stigma (perceived, internalized, and enacted. From identified routes of infection that significantly contributed to higher stigma, we employed predictive modeling to explore predictors for the specific type of stigma. Multiple-imputation was employed for sensitivity analyses. Of the total sample, 63% were male and the average age was 42.9 years (ranged between 18 and 88. Multivariate regression models revealed that contraction from commercial sex increased the perceived (β = 0.46, 95%CI = 0.02, 0.90 and internalized stigma (β = 0.60, 95%CI = 0.09, 1.10, while injecting drug use increased the perceived (β = 0.65, 95%CI = 0.07, 1.22 and enacted stigma (β = 0.09, 95%CI = 0.02, 0.16 after controlling for confounders. Among PLWHA who were infected via commercial sex partners, social support was negatively associated with perceived (β = -0.47, 95%CI = -0.79, -0.14 and internalized stigma (β = -0.80, 95%CI = -1.24, -0.35. Among PLWHA who were infected via injecting drugs, no adherence to antiretroviral treatment (β = 0.41, 95%CI = 0.01, 0.82 was positively associated with perceived stigma, and disclosure of serostatus to others was negatively associated with enacted stigma (β = -0.20, 95%CI = -0.34, -0.05. Knowledge of the association between routes of infection and stigma can guide health professionals and policy makers to develop tailored

Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time.

Science.gov (United States)

Avellar, Gustavo S C; Pereira, Guilherme A S; Pimenta, Luciano C A; Iscold, Paulo

2015-11-02

This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem's (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles' maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs.

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

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

DEFF Research Database (Denmark)

Wøhlk, Sanne; Lysgaard, Jens

2014-01-01

The paper considers the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing...... the sum of arrival times at the customers. A branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem is proposed. Computational results based on a set of standard CVRP benchmarks are presented....

A new combustion route to γ-Fe2O3 synthesis

Indian Academy of Sciences (India)

A new combustion route for the synthesis of -Fe2O3 is reported by employing purified -Fe2O3 as aprecursor in the present investigation. This synthesis which is similar to a self propagation combustion reaction, involves fewer steps, a shorter overall processing time, is a low energy reaction without the need of any ...

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

Urea route to coat inorganic nanowires, carbon fibers and nanotubes by boron nitride

International Nuclear Information System (INIS)

Gomathi, A.; Ramya Harika, M.; Rao, C.N.R.

2008-01-01

A simple route involving urea as the nitrogen source has been employed to carry out boron nitride coating on carbon fibers, multi-walled carbon nanotubes and inorganic nanowires. The process involves heating the carbon fibers and nanotubes or inorganic nanowires in a mixture of H 3 BO 3 and urea, followed by a heat treatment at 1000 deg. C in a N 2 atmosphere. We have been able to characterize the BN coating by transmission electron microscopy as well as X-ray photoelectron spectroscopy. The urea decomposition route affords a simple method to coat boron nitride on one-dimensional nanostructures

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

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

Sequential deposition as a route to high-performance perovskite-sensitized solar cells

KAUST Repository

Burschka, Julian

2013-07-10

Following pioneering work, solution-processable organic-inorganic hybrid perovskites - such as CH 3 NH 3 PbX 3 (X = Cl, Br, I) - have attracted attention as light-harvesting materials for mesoscopic solar cells. So far, the perovskite pigment has been deposited in a single step onto mesoporous metal oxide films using a mixture of PbX 2 and CH 3 NH 3 X in a common solvent. However, the uncontrolled precipitation of the perovskite produces large morphological variations, resulting in a wide spread of photovoltaic performance in the resulting devices, which hampers the prospects for practical applications. Here we describe a sequential deposition method for the formation of the perovskite pigment within the porous metal oxide film. PbI 2 is first introduced from solution into a nanoporous titanium dioxide film and subsequently transformed into the perovskite by exposing it to a solution of CH 3 NH 3 I. We find that the conversion occurs within the nanoporous host as soon as the two components come into contact, permitting much better control over the perovskite morphology than is possible with the previously employed route. Using this technique for the fabrication of solid-state mesoscopic solar cells greatly increases the reproducibility of their performance and allows us to achieve a power conversion efficiency of approximately 15 per cent (measured under standard AM1.5G test conditions on solar zenith angle, solar light intensity and cell temperature). This two-step method should provide new opportunities for the fabrication of solution-processed photovoltaic cells with unprecedented power conversion efficiencies and high stability equal to or even greater than those of today\\'s best thin-film photovoltaic devices. © 2013 Macmillan Publishers Limited. All rights reserved.

Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.

Science.gov (United States)

Bula, Gustavo Alfredo; Prodhon, Caroline; Gonzalez, Fabio Augusto; Afsar, H Murat; Velasco, Nubia

2017-02-15

This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed. Copyright © 2016 Elsevier B.V. All rights reserved.

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

DEFF Research Database (Denmark)

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

2009-01-01

We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method...

Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

Directory of Open Access Journals (Sweden)

Qian Wang

2014-01-01

Full Text Available We present a metaheuristic called the reactive guided tabu search (RGTS to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP, where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this problem, we design three guiding mechanisms in which the search history is used to guide the search. The three mechanisms are experimentally demonstrated to be more efficient than the ones which only apply the known distance information. Armed with the guiding mechanisms and the well-known reactive mechanism, the RGTS can produce remarkable solutions in a reasonable computation time.

MANETS and Internet of Things: The Development of a Data Routing Algorithm

Directory of Open Access Journals (Sweden)

I. A. Alameri

2018-02-01

Full Text Available Internet of things (IoT, is an innovative technology which allows the connection of physical things with the digital world through the use of heterogeneous networks and communication technologies. IoT in smart environments interacts with wireless sensor network (WSN and mobile ad‐hoc network (MANET, becoming even more attractive and economically successful. Interaction between wireless sensor and mobile ad‐hoc networks with the internet of things allows the creation of a new MANET‐IoT systems and IT‐based networks. Such systems give the user greater mobility and reduce costs. At the same time new challenging issues are opened in networking aspects. In this work, author proposed a routing solution for the IoT system using a combination of MANET protocols and WSN routing principles. The presented results of solution's investigation provide an effective approach to efficient energy consumption in the global MANET‐IoT system. That is a step forward to a reliable provision of services over global future internet infrastructure.

Facile Solution Route to Synthesize Nanostructure Li4Ti5O12 for High Rate Li-Ion Battery

Directory of Open Access Journals (Sweden)

M. V. Tran

2016-01-01

Full Text Available High rate Li-ion batteries have been given great attention during the last decade as a power source for hybrid electric vehicles (HEVs, EVs, etc. due to the highest energy and power density. These lithium batteries required a new design of material structure as well as innovative electrode materials. Among the promising candidates, spinel Li4Ti5O12 has been proposed as a high rate anode to replace graphite anode because of high capacity and a negligible structure change during intercalation of lithium. In this work, we synthesized a spinel Li4Ti5O12 in nanosize by a solution route using LiOH and Ti(OBu4 as precursor. An evaluation of structure and morphology by XRD and SEM exhibited pure spinel phase Li4Ti5O12 and homogenous nanoparticles around 100 nm. In the charge-discharge test, nanospinel Li4Ti5O12 presents excellent discharge capacity 160 mAh/g at rate C/10, as well as good specific capacities of 120, 110, and 100 mAh/g at high rates C, 5C and 10C, respectively.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

Science.gov (United States)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength

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.

On the task of building the routes of passenger buses of two automobile companies

Directory of Open Access Journals (Sweden)

Morozov А.V.

2016-12-01

Full Text Available The article formulates a mathematical model search of n bus routes between the two points, which carry out cruises corresponding to the specified schedule, and with specified duration. The duration of each route consists of two cruises and idle hours, which are determined by the moment of the completion of the first cruise and the moment of the beginning of the second. Totally, 2n cruises are performed and provide the passenger transportation by n cruises. In this specific version of the problem is the additional condition, that the execution time of each route shall not exceed the established limit of a standard d. Offered framework for the solution of the problem of procedure to the task assignment and modification of Kuhn-Munkres algorithm, which is looking for a solution of the problem of assignment to the maximum. The proposed numerical scheme is an iterative process, each step of which provides the topmost layout. To adapt the task to form, which allows to apply the modification of Kuhn-Munkres algorithm, to consider the bichromatic graph, which builds perfect matching with a maximum weight of the ribs

Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

Directory of Open Access Journals (Sweden)

Omar M. Zakaria

2016-01-01

Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

Civil engineering work to raise the level of Route Goward

CERN Multimedia

2013-01-01

Civil engineering work to raise the level of Route Goward will take place during Long Shutdown 1. The work will begin on 18 March 2013 and is expected to last around 5 months.   Route Goward runs over the top of the PS tunnel and is the only access route to the inside of the ring. The layer of shielding backfill beneath this road is the thinnest anywhere on the PS ring. As the purpose of this shielding is to protect against the ionising radiation emitted by the accelerator when in operation, this road has been classified as a “supervised radiation area” according to radiation protection regulations. This classification was merely a temporary solution and, on the recommendation of the PS Radiation Working Group (PSRWG), the decision has been taken to raise the surface level permanently by around 2 m in order to increase the thickness of the shielding and thus lower the dose rate to that of a non-designated area. As the PS tunnel itself is unable to withstand the weight of t...

H2 production by reforming route in reducing CO2 emissions

International Nuclear Information System (INIS)

Raphaelle Imbault

2006-01-01

Nowadays the most common way to produce hydrogen is the Steam Methane Reforming route from natural gas. With the pressure of new environmental rules, reducing CO 2 emissions becomes a key issue. The European project Ulcos (Ultra Low CO 2 Steelmaking) has targeted to reduce of at least 50% the CO 2 emissions in steelmaking. The H 2 route (and in particular the reforming process) is one of the solutions which have been explored. The results of this study have shown that the two main ways (which can be combined) of limiting CO 2 emissions in H 2 production are to improve the energetic efficiency of the plant or to capture CO 2 . With the first way, a reduction of 20% of emissions compared to conventional plant can be reached. The second one enables to achieve a decrease of 90%. However the CO 2 capture is much more expensive and this kind of solution can be economically competitive only if high CO 2 taxes are implemented (≥40 Euros/ton). (author)

Bases for DOT exemption uranyl nitrate solution shipments

International Nuclear Information System (INIS)

Moyer, R.A.

1982-07-01

Uranyl nitrate solutions from a Savannah River Plant reprocessing facility have been transported in cargo tank trailers for more than 20 years without incident during transit. The solution is shipped to Oak Ridge for further processing and returned to SRP in a solid metal form for recycle. This solution, called uranyl nitrate hexahydrate (UNH) solution in Department of Transportation (DOT) regulations, is currently diluted about 2-fold to comply with DOT concentration limits (10% of low specific activity levels) specified for bulk low specific activity (LSA) liquid shipments. Dilution of the process solution increases the number of shipments, the cost of transportation, the cost of shipper preparations, the cost of further reprocessing in the receiving facility to first evaporate the added water, and the total risk to the population along the route of travel. However, the radiological risk remains about the same. Therefore, obtaining an exemption from DOT regulations to permit shipment of undiluted UNH solution, which is normally about two times the present limit, is prudent and more economical. The radiological and nonradiological risks from shipping a unit load of undiluted solution are summarized for the probable route. Data and calculations are presented on a per load or per shipment basis throughout this memorandum to keep it unclassified

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Directory of Open Access Journals (Sweden)

Ailian Jiang

2018-03-01

Full Text Available Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs. This paper investigates the existing ant colony optimization (ACO-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

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

Magnetic properties of pure and Fe doped HoCrO{sub 3} thin films fabricated via a solution route

Energy Technology Data Exchange (ETDEWEB)

Yin, Shiqi; Sauyet, Theodore [Department of Physics, University of Connecticut, Storrs, CT 06269 (United States); Guild, Curt [Department of Chemistry, University of Connecticut, Storrs, CT 06269 (United States); Suib, S.L. [Department of Chemistry, University of Connecticut, Storrs, CT 06269 (United States); Institute of Materials Science, University of Connecticut, Storrs, CT 06269 (United States); Jain, Menka, E-mail: menka.jain@uconn.edu [Department of Physics, University of Connecticut, Storrs, CT 06269 (United States); Institute of Materials Science, University of Connecticut, Storrs, CT 06269 (United States)

2017-04-15

Multiferroic properties of orthorhombically distorted perovskite rare-earth chromites, such as HoCrO{sub 3}, are being investigated extensively in recent years. In the present work, we report on the effect of Fe substitution on the magnetic properties of HoCrO{sub 3} thin films. Thin films of HoCrO{sub 3} and HoCr{sub 0.7}Fe{sub 0.3}O{sub 3} were fabricated via a solution route on platinized silicon substrates. Structural properties of the films were evaluated by X-ray diffraction and Raman spectroscopy techniques. The surface morphology and cross-sections of the films were examined using scanning electron microscopy. Optical band gaps of pure and Fe doped HoCrO{sub 3} films are found to be 3.45 eV and 3.39 eV, respectively. The magnetization measurements show that the Néel temperatures (where Cr{sup 3+} orders) for the HoCrO{sub 3} and HoCr{sub 0.7}Fe{sub 0.3}O{sub 3} films are 134 and 148 K, respectively. In a magnetic field of 2 T, the maximum entropy change and relative cooling power, two parameters to evaluate the magnetocaloric properties of a material, were 0.813 J/kg K at 11 K and 21.1 J/kg for HoCrO{sub 3} film, in comparison with 0.748 J/kg K at 15 K and 26.8 J/kg for HoCr{sub 0.7}Fe{sub 0.3}O{sub 3} film. To our knowledge, this is the first work exploring the band gap and magnetocaloric properties of rare-earth chromite thin films. These findings should inspire the development of rare-earth chromite thin films for temperature control of nanoscale electronic devices and sensors in the low temperature region (< 30 K). - Highlights: • Phase-pure HoCrO{sub 3} and HoCr{sub 0.7}Fe{sub 0.3}O{sub 3}films were fabricated on platinized Sivia a solution route. • This is the first work on the exploration of band gap and magnetocaloric properties of rare-earth chromitefilms. • From 0-2 T, maximum entropy change for the HoCrO{sub 3} film was 0.813 J/kg K at 11 K.From 0-2 T, maximum entropy change for HoCr{sub 0.7}Fe{sub 0.3}O{sub 3} film was 0.748 J/kg K at 15

A novel heuristic algorithm for capacitated vehicle routing problem

Science.gov (United States)

Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre

2017-09-01

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas

Directory of Open Access Journals (Sweden)

Towsley Don

2009-01-01

Full Text Available In a hostile environment, it is important for a transmitter to make its wireless transmission invisible to adversaries because an adversary can detect the transmitter if the received power at its antennas is strong enough. This paper defines a detection probability model to compute the level of a transmitter being detected by a detection system at arbitrary location around the transmitter. Our study proves that the probability of detecting a directional antenna is much lower than that of detecting an omnidirectional antenna if both the directional and omnidirectional antennas provide the same Effective Isotropic Radiated Power (EIRP in the direction of the receiver. We propose a Minimizing Detection Probability (MinDP routing algorithm to find a secure routing path in ad hoc networks where nodes employ directional antennas to transmit data to decrease the probability of being detected by adversaries. Our study shows that the MinDP routing algorithm can reduce the total detection probability of deliveries from the source to the destination by over 74%.

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

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resou...... indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc.......We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...

Formulations and exact algorithms for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2008-01-01

In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...

Refinements of the column generation process for the Vehicle Routing Problem with Time Windows

DEFF Research Database (Denmark)

Larsen, Jesper

2004-01-01

interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch......-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for using run-time refinements when speeding up an exact approach without compromising...

ON THE USE OF LYTLE’S ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM AT DEVELOPING SUBURBAN ROUTE

Directory of Open Access Journals (Sweden)

S. Kantsedal

2012-01-01

Full Text Available Lytle’s algorithm is described as proposed for an accurate solution of the salesman Problem. Statistical characteristics of solution duration with lytle’s algorithm of some problems and of their modifications are specified. On the basis of the results obtained the limits for the algorithm practical specification in the preparation of the route network are given.

The Dynamic Multi-Period Vehicle Routing Problem

DEFF Research Database (Denmark)

Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert

This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minim......This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives...... are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling...... planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that our solutions improve upon those of the Swedish distributor....

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.

Modeling a four-layer location-routing problem

Directory of Open Access Journals (Sweden)

Mohsen Hamidi

2012-01-01

Full Text Available Distribution is an indispensable component of logistics and supply chain management. Location-Routing Problem (LRP is an NP-hard problem that simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the decisions at multiple layers of a distribution network where multiple products are transported within and between layers of the network. This paper focuses on modeling a complicated four-layer and multi-product LRP which has not been tackled yet. The distribution network consists of plants, central depots, regional depots, and customers. In this study, the structure, assumptions, and limitations of the distribution network are defined and the mathematical optimization programming model that can be used to obtain the optimal solution is developed. Presented by a mixed-integer programming model, the LRP considers the location problem at two layers, the allocation problem at three layers, the vehicle routing problem at three layers, and a transshipment problem. The mathematical model locates central and regional depots, allocates customers to plants, central depots, and regional depots, constructs tours from each plant or open depot to customers, and constructs transshipment paths from plants to depots and from depots to other depots. Considering realistic assumptions and limitations such as producing multiple products, limited production capacity, limited depot and vehicle capacity, and limited traveling distances enables the user to capture the real world situations.

Acetic acid extraction from aqueous solutions using fatty acids

NARCIS (Netherlands)

IJmker, H.M.; Gramblicka, M.; Kersten, Sascha R.A.; van der Ham, Aloysius G.J.; Schuur, Boelo

2014-01-01

A major challenge for production of acetic acid via bio-based routes is cost-effective concentration and purification of the acetic acid from the aqueous solutions, for which liquid–liquid extraction is a possible method. A main challenge in extraction of acetic acid from dilute aqueous solutions is

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

Science.gov (United States)

Arneson, Heather M.; Dousse, Nicholas; Langbort, Cedric

2014-01-01

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

MPATHav: A software prototype for multiobjective routing in transportation risk assessment

International Nuclear Information System (INIS)

Ganter, J.H.; Smith, J.D.

1995-01-01

Most routing problems depend on several important variables: transport distance, population exposure, accident rate, mandated roads (e.g., HM-164 regulations), and proximity to emergency response resources are typical. These variables may need to be minimized or maximized, and often are weighted. 'Objectives' to be satisfied by the analysis are thus created. The resulting problems can be approached by combining spatial analysis techniques from geographic information systems (GIS) with multiobjective analysis techniques from the field of operations research (OR); we call this hybrid multiobjective spatial analysis' (MOSA). MOSA can be used to discover, display, and compare a range of solutions that satisfy a set of objectives to varying degrees. For instance, a suite of solutions may include: one solution that provides short transport distances, but at a cost of high exposure; another solution that provides low exposure, but long distances; and a range of solutions between these two extremes

MPATHav: A software prototype for multiobjective routing in transportation risk assessment

Energy Technology Data Exchange (ETDEWEB)

Ganter, J.H.; Smith, J.D.

1995-12-31

Most routing problems depend on several important variables: transport distance, population exposure, accident rate, mandated roads (e.g., HM-164 regulations), and proximity to emergency response resources are typical. These variables may need to be minimized or maximized, and often are weighted. `Objectives` to be satisfied by the analysis are thus created. The resulting problems can be approached by combining spatial analysis techniques from geographic information systems (GIS) with multiobjective analysis techniques from the field of operations research (OR); we call this hybrid multiobjective spatial analysis` (MOSA). MOSA can be used to discover, display, and compare a range of solutions that satisfy a set of objectives to varying degrees. For instance, a suite of solutions may include: one solution that provides short transport distances, but at a cost of high exposure; another solution that provides low exposure, but long distances; and a range of solutions between these two extremes.

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

Anionic PPV polymerization from the sulfinyl precursor route : Block copolymer formation from sequential addition of monomers

NARCIS (Netherlands)

Cosemans, Inge; Vandenbergh, Joke; Voet, Vincent S. D.; Loos, Katja; Lutsen, Laurence; Vanderzande, Dirk; Junkers, Thomas

2013-01-01

The sulfinyl precursor route for the synthesis of poly(p-phenylene vinylene) (PPV) materials via an anionic polymerization procedure employing dedicated initiators is evaluated in depth. Reaction kinetics are investigated to gain more control over the polymerization, since polymerization proceeds to

Size-controlled synthesis of transition metal nanoparticles through chemical and photo-chemical routes

Science.gov (United States)

Tangeysh, Behzad

The central objective of this work is developing convenient general procedures for controlling the formation and stabilization of nanoscale transition metal particles. Contemporary interest in developing alternative synthetic approaches for producing nanoparticles arises in large part from expanding applications of the nanomaterials in areas such as catalysis, electronics and medicine. This research focuses on advancing the existing nanoparticle synthetic routes by using a new class of polymer colloid materials as a chemical approach, and the laser irradiation of metal salt solution as a photo-chemical method to attain size and shape selectivity. Controlled synthesis of small metal nanoparticles with sizes ranging from 1 to 5nm is still a continuing challenge in nanomaterial synthesis. This research utilizes a new class of polymer colloid materials as nano-reactors and protective agents for controlling the formation of small transition metal nanoparticles. The polymer colloid particles were formed from cross-linking of dinegatively charged metal precursors with partially protonated poly dimethylaminoethylmethacrylate (PDMAEMA). Incorporation of [PtCl6]2- species into the colloidal particles prior to the chemical reduction was effectively employed as a new strategy for synthesis of unusually small platinum nanoparticles with narrow size distributions (1.12 +/-0.25nm). To explore the generality of this approach, in a series of proof-of-concept studies, this method was successfully employed for the synthesis of small palladium (1.4 +/-0.2nm) and copper nanoparticles (1.5 +/-0.6nm). The polymer colloid materials developed in this research are pH responsive, and are designed to self-assemble and/or disassemble by varying the levels of protonation of the polymer chains. This unique feature was used to tune the size of palladium nanoparticles in a small range from 1nm to 5nm. The procedure presented in this work is a new convenient room temperature route for synthesis of

Ensuring Data Storage Security in Tree cast Routing Architecture for Sensor Networks

Science.gov (United States)

Kumar, K. E. Naresh; Sagar, U. Vidya; Waheed, Mohd. Abdul

2010-10-01

In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, this routing architecture moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this paper, we focus on data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in this architecture, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server

Public Transport Route Finding using a Hybrid Genetic Algorithm

OpenAIRE

Liviu Adrian COTFAS; Andreea DIOSTEANU

2011-01-01

In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.

Coordinated Optimization of Aircraft Routes and Locations of Ground Sensors

Science.gov (United States)

2014-09-17

2007), although solution methods are sub- stantially distinct in these two areas. Khardi and Abdallah (2012) applied the variational calculus ...aircraft may face a problem encircling both the outer and inner corner space. To make the problem geometrically feasible, the requirement of having an...problem can be easily determined analytically : it should be a single route with the widest possible coverage. The latter can be inferred from Figure 11(d

Infiltration route analysis using thermal observation devices (TOD) and optimization techniques in a GIS environment.

Science.gov (United States)

Bang, Soonam; Heo, Joon; Han, Soohee; Sohn, Hong-Gyoo

2010-01-01

Infiltration-route analysis is a military application of geospatial information system (GIS) technology. In order to find susceptible routes, optimal-path-searching algorithms are applied to minimize the cost function, which is the summed result of detection probability. The cost function was determined according to the thermal observation device (TOD) detection probability, the viewshed analysis results, and two feature layers extracted from the vector product interim terrain data. The detection probability is computed and recorded for an individual cell (50 m × 50 m), and the optimal infiltration routes are determined with A* algorithm by minimizing the summed costs on the routes from a start point to an end point. In the present study, in order to simulate the dynamic nature of a real-world problem, one thousand cost surfaces in the GIS environment were generated with randomly located TODs and randomly selected infiltration start points. Accordingly, one thousand sets of vulnerable routes for infiltration purposes could be found, which could be accumulated and presented as an infiltration vulnerability map. This application can be further utilized for both optimal infiltration routing and surveillance network design. Indeed, dynamic simulation in the GIS environment is considered to be a powerful and practical solution for optimization problems. A similar approach can be applied to the dynamic optimal routing for civil infrastructure, which requires consideration of terrain-related constraints and cost functions.

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.

Solution approach for a large scale personnel transport system for a large company in Latin America

Energy Technology Data Exchange (ETDEWEB)

Garzón-Garnica, Eduardo-Arturo; Caballero-Morales, Santiago-Omar; Martínez-Flores, José-Luis

2017-07-01

The present paper focuses on the modelling and solution of a large-scale personnel transportation system in Mexico where many routes and vehicles are currently used to service 525 points. The routing system proposed can be applied to many cities in the Latin-American region. Design/methodology/approach: This system was modelled as a VRP model considering the use of real-world transit times, and the fact that routes start at the farthest point from the destination center. Experiments were performed on different sized sets of service points. As the size of the instances was increased, the performance of the heuristic method was assessed in comparison with the results of an exact algorithm, the results remaining very close between both. When the size of the instance was full-scale and the exact algorithm took too much time to solve the problem, then the heuristic algorithm provided a feasible solution. Supported by the validation with smaller scale instances, where the difference between both solutions was close to a 6%, the full –scale solution obtained with the heuristic algorithm was considered to be within that same range. Findings: The proposed modelling and solving method provided a solution that would produce significant savings in the daily operation of the routes. Originality/value: The urban distribution of the cities in Latin America is unique to other regions in the world. The general layout of the large cities in this region includes a small town center, usually antique, and a somewhat disordered outer region. The lack of a vehicle-centered urban planning poses distinct challenges for vehicle routing problems in the region. The use of a heuristic VRP combined with the results of an exact VRP, allowed the obtention of an improved routing plan specific to the requirements of the region.

Solution approach for a large scale personnel transport system for a large company in Latin America

International Nuclear Information System (INIS)

Garzón-Garnica, Eduardo-Arturo; Caballero-Morales, Santiago-Omar; Martínez-Flores, José-Luis

2017-01-01

The present paper focuses on the modelling and solution of a large-scale personnel transportation system in Mexico where many routes and vehicles are currently used to service 525 points. The routing system proposed can be applied to many cities in the Latin-American region. Design/methodology/approach: This system was modelled as a VRP model considering the use of real-world transit times, and the fact that routes start at the farthest point from the destination center. Experiments were performed on different sized sets of service points. As the size of the instances was increased, the performance of the heuristic method was assessed in comparison with the results of an exact algorithm, the results remaining very close between both. When the size of the instance was full-scale and the exact algorithm took too much time to solve the problem, then the heuristic algorithm provided a feasible solution. Supported by the validation with smaller scale instances, where the difference between both solutions was close to a 6%, the full –scale solution obtained with the heuristic algorithm was considered to be within that same range. Findings: The proposed modelling and solving method provided a solution that would produce significant savings in the daily operation of the routes. Originality/value: The urban distribution of the cities in Latin America is unique to other regions in the world. The general layout of the large cities in this region includes a small town center, usually antique, and a somewhat disordered outer region. The lack of a vehicle-centered urban planning poses distinct challenges for vehicle routing problems in the region. The use of a heuristic VRP combined with the results of an exact VRP, allowed the obtention of an improved routing plan specific to the requirements of the region.

Solution approach for a large scale personnel transport system for a large company in Latin America

Directory of Open Access Journals (Sweden)

Eduardo-Arturo Garzón-Garnica

2017-10-01

Full Text Available Purpose: The present paper focuses on the modelling and solution of a large-scale personnel transportation system in Mexico where many routes and vehicles are currently used to service 525 points. The routing system proposed can be applied to many cities in the Latin-American region. Design/methodology/approach: This system was modelled as a VRP model considering the use of real-world transit times, and the fact that routes start at the farthest point from the destination center. Experiments were performed on different sized sets of service points. As the size of the instances was increased, the performance of the heuristic method was assessed in comparison with the results of an exact algorithm, the results remaining very close between both.  When the size of the instance was full-scale and the exact algorithm took too much time to solve the problem, then the heuristic algorithm provided a feasible solution. Supported by the validation with smaller scale instances, where the difference between both solutions was close to a 6%, the full –scale solution obtained with the heuristic algorithm was considered to be within that same range. Findings: The proposed modelling and solving method provided a solution that would produce significant savings in the daily operation of the routes. Originality/value: The urban distribution of the cities in Latin America is unique to other regions in the world. The general layout of the large cities in this region includes a small town center, usually antique, and a somewhat disordered outer region. The lack of a vehicle-centered urban planning poses distinct challenges for vehicle routing problems in the region. The use of a heuristic VRP combined with the results of an exact VRP, allowed the obtention of an improved routing plan specific to the requirements of the region.

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

Modelling Stochastic Route Choice Behaviours with a Closed-Form Mixed Logit Model

Directory of Open Access Journals (Sweden)

Xinjun Lai

2015-01-01

Full Text Available A closed-form mixed Logit approach is proposed to model the stochastic route choice behaviours. It combines both the advantages of Probit and Logit to provide a flexible form in alternatives correlation and a tractable form in expression; besides, the heterogeneity in alternative variance can also be addressed. Paths are compared by pairs where the superiority of the binary Probit can be fully used. The Probit-based aggregation is also used for a nested Logit structure. Case studies on both numerical and empirical examples demonstrate that the new method is valid and practical. This paper thus provides an operational solution to incorporate the normal distribution in route choice with an analytical expression.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

Science.gov (United States)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

Science.gov (United States)

Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

2015-08-27

A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.

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.

Self-employment as a solution for attitudinal barriers: a case study.

Science.gov (United States)

Quinton, Melanie C

2014-01-01

This paper uses a case study to examine attitudinal barriers to employment and underemployment. We follow the career path of PR, a woman with multiple physical impairments, as she seeks financial independence through several employment strategies. In these, she faced attitudinal barriers and employment situations without opportunity for advancement. Eventually, PR opens her own business, turning to an alternative loan program to acquire the funds necessary to purchase a ready-made vehicle that matches her needs for accessible transportation. Use of this vehicle to provide delivery services for her business has more than doubled her income.

Spray-combustion synthesis: efficient solution route to high-performance oxide transistors.

Science.gov (United States)

Yu, Xinge; Smith, Jeremy; Zhou, Nanjia; Zeng, Li; Guo, Peijun; Xia, Yu; Alvarez, Ana; Aghion, Stefano; Lin, Hui; Yu, Junsheng; Chang, Robert P H; Bedzyk, Michael J; Ferragut, Rafael; Marks, Tobin J; Facchetti, Antonio

2015-03-17

Metal-oxide (MO) semiconductors have emerged as enabling materials for next generation thin-film electronics owing to their high carrier mobilities, even in the amorphous state, large-area uniformity, low cost, and optical transparency, which are applicable to flat-panel displays, flexible circuitry, and photovoltaic cells. Impressive progress in solution-processed MO electronics has been achieved using methodologies such as sol gel, deep-UV irradiation, preformed nanostructures, and combustion synthesis. Nevertheless, because of incomplete lattice condensation and film densification, high-quality solution-processed MO films having technologically relevant thicknesses achievable in a single step have yet to be shown. Here, we report a low-temperature, thickness-controlled coating process to create high-performance, solution-processed MO electronics: spray-combustion synthesis (SCS). We also report for the first time, to our knowledge, indium-gallium-zinc-oxide (IGZO) transistors having densification, nanoporosity, electron mobility, trap densities, bias stability, and film transport approaching those of sputtered films and compatible with conventional fabrication (FAB) operations.

Low-Temperature Synthesis Routes to Intermetallic Superconductors

Energy Technology Data Exchange (ETDEWEB)

Schaak, Raymond E

2008-01-08

Over the past few years, our group has gained expertise at developing low-temperature solution-based synthetic pathways to complex nanoscale solids, with particular emphasis on nanocrystalline intermetallic compounds. Our synthetic capabilities are providing tools to reproducibly generate intermetallic nanostructures with simultaneous control over crystal structure, composition, and morphology. This DOE-funded project aims to expand these capabilities to intermetallic superconductors. This could represent an important addition to the tools that are available for the synthesis and processing of intermetallic superconductors, which traditionally utilize high-temperature, high-pressure, thin film, or gas-phase vacuum deposition methods. Our current knowledge of intermetallic superconductors suggests that significant enhancements could result from the inherent benefits of low-temperature solution synthesis, e.g. metastable phase formation, control over nanoscale morphology to facilitate size-dependent property studies, robust and inexpensive processability, low-temperature annealing and consolidation, and impurity incorporation (for doping, stoichiometry control, flux pinning, and improving the critical fields). Our focus is on understanding the superconducting properties as a function of synthetic route, crystal structure, crystallite size, and morphology, and developing the synthetic tools necessary to accomplish this. This research program can currently be divided into two classes of superconducting materials: intermetallics (transition metal/post transition metal) and metal carbides/borides. Both involve the development and exploitation of low-temperature synthesis routes followed by detailed characterization of structures and properties, with the goal of understanding how the synthetic pathways influence key superconducting properties of selected target materials. Because of the low-temperature methods used to synthesize them and the nanocrystalline morphologies

One-step green route to narrowly dispersed copper nanocrystals

Energy Technology Data Exchange (ETDEWEB)

Wu Chunwei; Mosher, Brian P.; Zeng Taofang [North Carolina State University, Mechanical and Aerospace Engineering (United States)], E-mail: tzeng2@unity.ncsu.edu

2006-12-15

We report a total 'green' chemical method in aqueous solution for synthesizing stable narrowly distributed copper nanoparticles with average diameter less than 5 nm in the presence of Polyvinylpyrrolidone (PVP) as a stabilizer and without any inert gas protection. In our synthesis route, ascorbic acid, natural vitamin C (VC), an excellent oxygen scavenger, acts as both reducing agent and antioxidant, to reduce the metallic ion precursor, and to effectively prevent the common oxidation process of the newborn pure copper nanoclusters.

Public Transport Route Finding using a Hybrid Genetic Algorithm

Directory of Open Access Journals (Sweden)

Liviu Adrian COTFAS

2011-01-01

Full Text Available In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.

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.

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.

Vacuum-thermal-evaporation: the route for roll-to-roll production of large-area organic electronic circuits

International Nuclear Information System (INIS)

Taylor, D M

2015-01-01

Surprisingly little consideration is apparently being given to vacuum-evaporation as the route for the roll-to-roll (R2R) production of large-area organic electronic circuits. While considerable progress has been made by combining silicon lithographic approaches with solution processing, it is not obvious that these will be compatible with a low-cost, high-speed R2R process. Most efforts at achieving this ambition are directed at conventional solution printing approaches such as inkjet and gravure. This is surprising considering that vacuum-evaporation of organic semiconductors (OSCs) is already used commercially in the production of organic light emitting diode displays. Beginning from a discussion of the materials and geometrical parameters determining transistor performance and drawing on results from numerous publications, this review makes a case for vacuum-evaporation as an enabler of R2R organic circuit production. The potential of the vacuum route is benchmarked against solution approaches and found to be highly competitive. For example, evaporated small molecules tend to have higher mobility than printed OSCs. High resolution metal patterning on plastic films is already a low-cost commercial process for high-volume packaging applications. Similarly, solvent-free flash-evaporation and polymerization of thin films on plastic substrates is also a high-volume commercial process and has been shown capable of producing robust gate dielectrics. Reports of basic logic circuit elements produced in a vacuum R2R environment are reviewed and shown to be superior to all-solution printing approaches. Finally, the main issues that need to be resolved in order to fully develop the vacuum route to R2R circuit production are highlighted. (paper)

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

Solution precursor plasma deposition of nanostructured CdS thin films

International Nuclear Information System (INIS)

Tummala, Raghavender; Guduru, Ramesh K.; Mohanty, Pravansu S.

2012-01-01

Highlights: ► Inexpensive process with capability to produce large scale nanostructured coatings. ► Technique can be employed to spray the coatings on any kind of substrates including polymers. ► The CdS coatings developed have good electrical conductivity and optical properties. ► Coatings possess large amount of particulate boundaries and nanostructured grains. -- Abstract: Cadmium sulfide (CdS) films are used in solar cells, sensors and microelectronics. A variety of techniques, such as vapor based techniques, wet chemical methods and spray pyrolysis are frequently employed to develop adherent CdS films. In the present study, rapid deposition of CdS thin films via plasma spray route using a solution precursor was investigated, for the first time. Solution precursor comprising cadmium chloride, thiourea and distilled water was fed into a DC plasma jet via an axial atomizer to create ultrafine droplets for instantaneous and accelerated thermal decomposition in the plasma plume. The resulting molten/semi-molten ultrafine/nanoparticles of CdS eventually propel toward the substrate to form continuous CdS films. The chemistry of the solution precursor was found to be critical in plasma pyrolysis to control the stoichiometry and composition of the films. X-ray diffraction studies confirmed hexagonal α-CdS structure. Surface morphology and microstructures were investigated to compare with other synthesis techniques in terms of process mechanism and structural features. Transmission electron microscopy studies revealed nanostructures in the atomized particulates. Optical measurements indicated a decreasing transmittance in the visible light with increasing the film thickness and band gap was calculated to be ∼2.5 eV. The electrical resistivity of the films (0.243 ± 0.188 × 10 5 Ω cm) was comparable with the literature values. These nanostructured polycrystalline CdS films could be useful in sensing and solar applications.

Solution precursor plasma deposition of nanostructured CdS thin films

Energy Technology Data Exchange (ETDEWEB)

Tummala, Raghavender [Department of Mechanical Engineering, University of Michigan, Dearborn, MI 48128 (United States); Guduru, Ramesh K., E-mail: rkguduru@umich.edu [Department of Mechanical Engineering, University of Michigan, Dearborn, MI 48128 (United States); Mohanty, Pravansu S. [Department of Mechanical Engineering, University of Michigan, Dearborn, MI 48128 (United States)

2012-03-15

Highlights: Black-Right-Pointing-Pointer Inexpensive process with capability to produce large scale nanostructured coatings. Black-Right-Pointing-Pointer Technique can be employed to spray the coatings on any kind of substrates including polymers. Black-Right-Pointing-Pointer The CdS coatings developed have good electrical conductivity and optical properties. Black-Right-Pointing-Pointer Coatings possess large amount of particulate boundaries and nanostructured grains. -- Abstract: Cadmium sulfide (CdS) films are used in solar cells, sensors and microelectronics. A variety of techniques, such as vapor based techniques, wet chemical methods and spray pyrolysis are frequently employed to develop adherent CdS films. In the present study, rapid deposition of CdS thin films via plasma spray route using a solution precursor was investigated, for the first time. Solution precursor comprising cadmium chloride, thiourea and distilled water was fed into a DC plasma jet via an axial atomizer to create ultrafine droplets for instantaneous and accelerated thermal decomposition in the plasma plume. The resulting molten/semi-molten ultrafine/nanoparticles of CdS eventually propel toward the substrate to form continuous CdS films. The chemistry of the solution precursor was found to be critical in plasma pyrolysis to control the stoichiometry and composition of the films. X-ray diffraction studies confirmed hexagonal {alpha}-CdS structure. Surface morphology and microstructures were investigated to compare with other synthesis techniques in terms of process mechanism and structural features. Transmission electron microscopy studies revealed nanostructures in the atomized particulates. Optical measurements indicated a decreasing transmittance in the visible light with increasing the film thickness and band gap was calculated to be {approx}2.5 eV. The electrical resistivity of the films (0.243 {+-} 0.188 Multiplication-Sign 10{sup 5} {Omega} cm) was comparable with the literature

A general solution-chemistry route to the synthesis LiMPO4 (M=Mn, Fe, and Co) nanocrystals with [010] orientation for lithium ion batteries

International Nuclear Information System (INIS)

Su Jing; Wei Bingqing; Rong Jiepeng; Yin Wenyan; Ye Zhixia; Tian Xianqing; Ren Ling; Cao Minhua; Hu Changwen

2011-01-01

A general and efficient solvothermal strategy has been developed for the preparation of lithium transition metal phosphate microstructures (LiMnPO 4 , LiFePO 4 , and LiCoPO 4 ), employing ethanol as the solvent, LiI as the Li source, metal salts as the M sources, H 3 PO 4 as the phosphorus source, and poly(vinyl pyrrolidone) (PVP) as the carbon source and template. This route features low cost, environmental benign, and one-step process for the cathode material production of Li-ion batteries without any complicated experimental setups and sophisticated operations. The as-synthesized LiMPO 4 microstructures exhibit unique, well-shaped and favorable structures, which are self-assembled from microplates or microrods. The b axis is the preferred crystal growth orientation of the products, resulting in a shorter lithium ion diffusion path. The LiFePO 4 microstructures show an excellent cycling stability without capacity fading up to 50 cycles when they are used as a cathode material in lithium-ion batteries. - Graphical abstract: A general and efficient solvothermal strategy has been developed for the preparation of lithium transition metal phosphate microstructures under solvothermal conditions in the presence of PVP. Highlights: → A general and efficient solvothermal strategy has been developed for the preparation of LiMPO 4 microstructures. → This route features low cost, environmental benign, and one-step process. → The LiMPO 4 microstructures exhibit unique, well-shaped, and favorable structures. → The LiFePO 4 microstructures show an excellent cycling stability up to 50 cycles as a cathode material of lithium-ion batteries.

Analysis of energy efficient routing protocols for implementation of a ubiquitous health system

Science.gov (United States)

Kwon, Jongwon; Park, Yongman; Koo, Sangjun; Ayurzana, Odgeral; Kim, Hiesik

2007-12-01

The innovative Ubiquitous-Health was born through convergence of medical service, with development of up to date information technologies and ubiquitous IT. The U-Health can be applied to a variety of special situations for managing functions of each medical center efficiently. This paper focuses on estimation of various routing protocols for implementation of U-health monitoring system. In order to facilitate wireless communication over the network, a routing protocol on the network layer is used to establish precise and efficient route between sensor nodes so that information acquired from sensors may be delivered in a timely manner. A route establishment should be considered to minimize overhead, data loss and power consumption because wireless networks for U-health are organized by a large number of sensor nodes which are small in size and have limited processing power, memory and battery life. In this paper a overview of wireless sensor network technologies commonly known is described as well as evaluation of three multi hop routing protocols which are flooding, gossiping and modified low energy adaptive clustering hierarchy(LEACH) for use with these networks using TOSSIM simulator. As a result of evaluation the integrated wireless sensor board was developed in particular. The board is embedded device based on AVR128 porting TinyOS. Also it employs bio sensor measures blood pressure, pulse frequency and ZigBee module for wireless communication. This paper accelerates the digital convergence age through continual research and development of technologies related the U-Health.

Route Selection Problem Based on Hopfield Neural Network

Directory of Open Access Journals (Sweden)

N. Kojic

2013-12-01

Full Text Available Transport network is a key factor of economic, social and every other form of development in the region and the state itself. One of the main conditions for transport network development is the construction of new routes. Often, the construction of regional roads is dominant, since the design and construction in urban areas is quite limited. The process of analysis and planning the new roads is a complex process that depends on many factors (the physical characteristics of the terrain, the economic situation, political decisions, environmental impact, etc. and can take several months. These factors directly or indirectly affect the final solution, and in combination with project limitations and requirements, sometimes can be mutually opposed. In this paper, we present one software solution that aims to find Pareto optimal path for preliminary design of the new roadway. The proposed algorithm is based on many different factors (physical and social with the ability of their increase. This solution is implemented using Hopfield's neural network, as a kind of artificial intelligence, which has shown very good results for solving complex optimization problems.

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

Cost Optimisation in Freight Distribution with Cross-Docking: N-Echelon Location Routing Problem

Directory of Open Access Journals (Sweden)

Jesus Gonzalez-Feliu

2012-03-01

Full Text Available Freight transportation constitutes one of the main activities that influence the economy and society, as it assures a vital link between suppliers and customers and represents a major source of employment. Multi-echelon distribution is one of the most common strategies adopted by the transportation companies in an aim of cost reduction. Although vehicle routing problems are very common in operational research, they are essentially related to single-echelon cases. This paper presents the main concepts of multi-echelon distribution with cross-docks and a unified notation for the N-echelon location routing problem. A literature review is also presented, in order to list the main problems and methods that can be helpful for scientists and transportation practitioners.

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)

Towards transparent all-optical label-swapped networks: 40 Gbit/s ultra-fast dynamic wavelength routing using integrated devices

DEFF Research Database (Denmark)

Seoane, Jorge; Holm-Nielsen, Pablo Villanueva; Jeppesen, Palle

2006-01-01

All-optical routing of 40 Gbit/s 1.6 ns packets is demonstrated employing integrated devices based on SOA-MZIs. The scheme allows wavelength transparent operation and sub-nanosecond dynamic wavelength selection for future packet/label switched networks....

Solution Methods for the Periodic Petrol Station Replenishment Problem

OpenAIRE

C Triki

2013-01-01

In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP) over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved exactly until achieving optimalization. Moreover, an improvement procedure is also developed with the aim of ens...

Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.

Science.gov (United States)

Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

2015-01-01

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

On-chip photonic memory elements employing phase-change materials.

Science.gov (United States)

Rios, Carlos; Hosseini, Peiman; Wright, C David; Bhaskaran, Harish; Pernice, Wolfram H P

2014-03-05

Phase-change materials integrated into nanophotonic circuits provide a flexible way to realize tunable optical components. Relying on the enormous refractive-index contrast between the amorphous and crystalline states, such materials are promising candidates for on-chip photonic memories. Nonvolatile memory operation employing arrays of microring resonators is demonstrated as a route toward all-photonic chipscale information processing. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Magnetic and photocatalytic response of Ag-doped ZnFeO nano-composites for photocatalytic degradation of reactive dyes in aqueous solution

International Nuclear Information System (INIS)

Mahmood, Asif; Ramay, Shahid Mahmood; Al-Zaghayer, Yousef S.; Imran, Muhammad; Atiq, Shahid; Al-Johani, Meshal S.

2014-01-01

Highlights: • Self-consistent sol–gel based auto-combustion route was used. • Photocatalytic degradation of reactive dyes in aqueous solution was investigated. • Due to Ag doping, band gap reduced. • Activity of Ag-doped samples was higher than that of un-doped ones. - Abstract: To investigate the photocatalytic degradation of reactive dyes in aqueous solution, pure ZnO and Fe/Ag-doped magnetic photocatalysts having nominal compositions of Zn 0.95−x Fe 0.05 Ag x O (x = 0.0, 0.05 and 0.1) have been synthesized via self-consistent sol–gel based auto-combustion route. Thermally stable samples were subsequently confirmed to exhibit wurtzite type hexagonal structure, characteristic of ZnO. The nature of chemical bonding was elaborated by Fourier transform analysis. Electron microscopic techniques were employed to investigate the structural morphology and to evaluate the particle size. Ferromagnetic nature of the Fe/Ag doped samples was revealed by vibrating sample magnetometry, enabling the photocatalytic samples to be re-collected magnetically for repeated usage. The enhanced photocatalytic activity in the degradation of methylene blue under UV light irradiation with 5 and 10 wt.% Ag/ZnFeO has been observed validating the potential applications of these materials in the field of photo-degradation of organic pollutants

An integrated approach to route selection in slurry pipeline design

Energy Technology Data Exchange (ETDEWEB)

Betinol, Roy G.; Altmann, Nara [Brass Chile S.A., Santiago (Chile)

2009-12-19

The pressure to get engineering projects done and constructed as fast as possible in order to take advantage of the high prices in metals and petrochemicals has been driving companies to skip the conceptual phase and go straight into basic engineering with cost estimates in the level of 15% accuracy. By-passing early engineering and demanding higher cost estimating accuracy is a contradiction. In most cases, savings made on capital investment is much higher had money been spent in conceptual studies which allow for the optimal solution to be found. This paper reviews one of the key aspects in conceptual engineering of slurry pipeline designs: route selection. This activity is often overlooked, causing capital cost and operating difficulties to rise unnecessarily. This paper describes and gives example on how an integrated client/engineering company's approach to route selection can produce significant savings in pipeline construction and operating costs. (author)

Fully solution-processing route toward highly transparent polymer solar cells.

Science.gov (United States)

Guo, Fei; Kubis, Peter; Stubhan, Tobias; Li, Ning; Baran, Derya; Przybilla, Thomas; Spiecker, Erdmann; Forberich, Karen; Brabec, Christoph J

2014-10-22

We report highly transparent polymer solar cells using metallic silver nanowires (AgNWs) as both the electron- and hole-collecting electrodes. The entire stack of the devices is processed from solution using a doctor blading technique. A thin layer of zinc oxide nanoparticles is introduced between photoactive layer and top AgNW electrode which plays decisive roles in device functionality: it serves as a mechanical foundation which allows the solution-deposition of top AgNWs, and more importantly it facilitates charge carriers extraction due to the better energy level alignment and the formation of ohmic contacts between the active layer/ZnO and ZnO/AgNWs. The resulting semitransparent polymer:fullerene solar cells showed a power conversion efficiency of 2.9%, which is 72% of the efficiency of an opaque reference device. Moreover, an average transmittance of 41% in the wavelength range of 400-800 nm is achieved, which is of particular interest for applications in transparent architectures.

A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

Directory of Open Access Journals (Sweden)

Qunli Yuchi

2016-01-01

Full Text Available We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL network design, which simultaneously integrates the location decisions of distribution centers (DCs, the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.

A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

Directory of Open Access Journals (Sweden)

Jose Bernal

2017-10-01

Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

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.

The effect of dynamic scheduling and routing in a solid waste management system

International Nuclear Information System (INIS)

Johansson, Ola M.

2006-01-01

Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From the study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators

Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

Directory of Open Access Journals (Sweden)

Preiss Bruno

2011-01-01

Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

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

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

Solution-Phase Synthesis of SnSe Nanocrystals for Use in Solar Cells

KAUST Repository

Franzman, Matthew A.

2010-03-31

Nanocrystals of phase-pure tin(II) selenide (SnSe) were synthesized via a solution-phase route employing stoichiometric amounts of di-tert-butyl dlselenlde as a novel and facile selenium source. The direct band gap of the resulting nanocrystals (E8 = 1.71 eV) is significantly blue-shifted relative to the bulk value (E8 = 1.30 eV), a likely consequence of quantum confinement resulting from the relatively small average diameter of the nanocrystals (μD < 20 nm). Preliminary solar cell devices incorporating SnSe nanocrystals into a poly[2-methoxy5-(3\\',7\\'-d1methyloctyloxy)-1,4- phenylenev1nylene] matrix demonstrate a significant enhancement In quantum efficiency and short-circuit current density, suggesting that this earth-abundant material could be a valuable component In future photovoltaic devices. Copyright © 2010 American Chemical Society.

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

Solution-phase synthesis of nanomaterials at low temperature

Science.gov (United States)

Zhu, Yongchun; Qian, Yitai

2009-01-01

This paper reviews the solution-phase synthesis of nanoparticles via some routes at low temperatures, such as room temperature route, wave-assisted synthesis (γ-irradiation route and sonochemical route), directly heating at low temperatures, and hydrothermal/solvothermal methods. A number of strategies were developed to control the shape, the size, as well as the dispersion of nanostructures. Using diethylamine or n-butylamine as solvent, semiconductor nanorods were yielded. By the hydrothermal treatment of amorphous colloids, Bi2S3 nanorods and Se nanowires were obtained. CdS nanowires were prepared in the presence of polyacrylamide. ZnS nanowires were obtained using liquid crystal. The polymer poly (vinyl acetate) tubule acted as both nanoreactor and template for the CdSe nanowire growth. Assisted by the surfactant of sodium dodecyl benzenesulfonate (SDBS), nickel nanobelts were synthesized. In addition, Ag nanowires, Te nanotubes and ZnO nanorod arrays could be prepared without adding any additives or templates.

Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

Directory of Open Access Journals (Sweden)

Wan-Yu Liu

2014-07-01

Full Text Available Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP. This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.

The time-dependent prize-collecting arc routing problem

DEFF Research Database (Denmark)

Black, Dan; Eglese, Richard; Wøhlk, Sanne

2013-01-01

with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though......A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change...

The vehicle routing problem with edge set costs

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications and other costly investments....... The certifications and contributions impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. Different versions for defining the edge sets are discussed and formulated. A MIP-formulation of the problem is presented, and a solution method based...

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

Science.gov (United States)

Tavakkoli-Moghaddam, Reza; Alinaghian, Mehdi; Salamat-Bakhsh, Alireza; Norouzi, Narges

2012-05-01

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.

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

A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters

Science.gov (United States)

Wang, Xiaoming; Lin, Yaguang; Zhang, Shanshan; Cai, Zhipeng

2017-05-01

Sudden disasters such as earthquake, flood and hurricane necessitate the employment of communication networks to carry out emergency response activities. Routing has a significant impact on the functionality, performance and flexibility of communication networks. In this article, the routing problem is studied considering the delivery ratio of messages, the overhead ratio of messages and the average delay of messages in mobile opportunistic networks (MONs) for enterprise-level emergency response communications in sudden disaster scenarios. Unlike the traditional routing methods for MONS, this article presents a new two-stage spreading and forwarding dynamic routing algorithm based on the proposed social activity degree and physical contact factor for mobile customers. A new modelling method for describing a dynamic evolving process of the topology structure of a MON is first proposed. Then a multi-copy spreading strategy based on the social activity degree of nodes and a single-copy forwarding strategy based on the physical contact factor between nodes are designed. Compared with the most relevant routing algorithms such as Epidemic, Prophet, Labelled-sim, Dlife-comm and Distribute-sim, the proposed routing algorithm can significantly increase the delivery ratio of messages, and decrease the overhead ratio and average delay of messages.

ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

Directory of Open Access Journals (Sweden)

K. Sankar

2012-06-01

Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

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.

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

Science.gov (United States)

2015-01-01

solution approach that combines heuristic search and integer programming. Boudia et al. (2007) solved an SDVRP instance using a memetic algorithm with...Boudia, M., Prins, C., Reghioui, M., 2007. An effective memetic algorithm with population management for the split delivery vehicle routing problem

Performance Analysis of Routing Protocols in Ad-hoc and Sensor Networking Environments

Directory of Open Access Journals (Sweden)

L. Gavrilovska

2009-06-01

Full Text Available Ad-hoc and sensor networks are becoming an increasingly popular wireless networking concepts lately. This paper analyzes and compares prominent routing schemes in these networking environments. The knowledge obtained can serve users to better understand short range wireless network solutions thus leading to options for implementation in various scenarios. In addition, it should aid researchers develop protocol improvements reliable for the technologies of interest.

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

Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

DEFF Research Database (Denmark)

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

A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize proFIt by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel....... We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase profits and that the decision...

Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

DEFF Research Database (Denmark)

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

A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... and bunker consumption. We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase pro...

An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems

DEFF Research Database (Denmark)

Helsgaun, Keld

This report describes the implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver for solving constrained traveling salesman and vehicle routing problems. The extension, which is called LKH-3, is able to solve a variety of well-known problems, including the sequential ordering...... problem (SOP), the traveling repairman problem (TRP), variants of the multiple travel-ing salesman problem (mTSP), as well as vehicle routing problems (VRPs) with capacity, time windows, pickup-and-delivery and distance constraints. The implementation of LKH-3 builds on the idea of transforming...... the problems into standard symmetric traveling salesman problems and handling constraints by means of penalty functions. Extensive testing on benchmark instances from the literature has shown that LKH-3 is effective. Best known solutions are often obtained, and in some cases, new best solutions are found...

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.

En route position and time control of aircraft using Kalman filtering of radio aid data

Science.gov (United States)

Mcgee, L. A.; Christensen, J. V.

1973-01-01

Fixed-time-of-arrival (FTA) guidance and navigation is investigated as a possible technique capable of operation within much more stringent en route separation standards and offering significant advantages in safety, higher traffic densities, and improved scheduling reliability, both en route and in the terminal areas. This study investigated the application of FTA guidance previously used in spacecraft guidance. These FTA guidance techniques have been modified and are employed to compute the velocity corrections necessary to return an aircraft to a specified great-circle reference path in order to exercise en route time and position control throughout the entire flight. The necessary position and velocity estimates to accomplish this task are provided by Kalman filtering of data from Loran-C, VORTAC/TACAN, Doppler radar, radio or barometric altitude,and altitude rate. The guidance and navigation system was evaluated using a digital simulation of the cruise phase of supersonic and subsonic flights between San Francisco and New York City, and between New York City and London.

A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

Energy Technology Data Exchange (ETDEWEB)

Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

2017-07-01

We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

International Nuclear Information System (INIS)

Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

2017-01-01

We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

Employment status in persons with and without HIV infection in Denmark

DEFF Research Database (Denmark)

Legarth, Rebecca; Omland, Lars Haukali; Kronborg, Gitte

2014-01-01

.v.) drug abuse as a route of HIV infection or diagnosed with hepatitis C infection (n = 2799) and 22,369 individually matched persons from the background population. Study inclusion was 1 January 1996 or HIV diagnosis, which ever came last. METHODS: Data on employment status and disability pension were......OBJECTIVE: To estimate annual employment rates and disability retirement rates (DRRs) among HIV-infected individuals and population controls during the period 1996-2011. DESIGN: A population-based cohort study including all HIV-infected individuals born in Denmark and not reporting intravenous (i...... extracted from Danish national registries. Employment rate and DRR were estimated in each calendar year after study inclusion for the cohorts included before 1996 (pre-1996), 1996-1999 and 2000-2011. RESULTS: Employment rate in the year of study inclusion increased from 54.8% [95% confidence interval (CI...

Boron nitride nanoparticle enhanced prepregs: A novel route for manufacturing aerospace structural composite laminate

Energy Technology Data Exchange (ETDEWEB)

Kelkar, Ajit D., E-mail: kelkar@ncat.edu [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States); Tian, Qiong [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States); School of Science, Xi' an Jiaotong University, Xi' an, 710049 (China); Yu, Demei [School of Science, Xi' an Jiaotong University, Xi' an, 710049 (China); Zhang, Lifeng, E-mail: lzhang@ncat.edu [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States)

2016-06-15

Boron nitride nanoparticles (BNNPs) were surface functionalized and subsequently applied to surface of fiberglass prepregs to fabricate hybrid BNNPs/fiberglass/epoxy composite laminate. A systematic and comparative study on BNNPs functionalization routes and their effects on morphology, mechanical property and thermal conductivity of final BNNPs enhanced composite laminates was performed. The functionalized BNNPs were characterized by Fourier-transform infrared spectroscopy (FT-IR), thermogravimetric analysis (TGA), and scanning electron microscopy (SEM). The composite laminates with surface functionalized BNNPs demonstrated improvement in tensile and flexural strength and modulus as well as in thermal conductivity compared to the composite laminate with pristine BNNPs while physically functionalized BNNPs outperformed chemically functionalized BNNPs in all cases. SEM images indicated better compatibility and dispersion of BNNPs in epoxy matrix following either of functionalization route. BNNPs bear great radiation-shielding capability. This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials. - Highlights: • BNNPs were surface functionalized and applied onto fiberglass prepreg. • The BNNPs enhanced prepreg was employed to make hybrid BNNPs/fiberglass/epoxy composite laminate. • The hybrid laminate presented significant improvement in mechanical strength and thermal conductivity. • This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials.

Boron nitride nanoparticle enhanced prepregs: A novel route for manufacturing aerospace structural composite laminate

International Nuclear Information System (INIS)

Kelkar, Ajit D.; Tian, Qiong; Yu, Demei; Zhang, Lifeng

2016-01-01

Boron nitride nanoparticles (BNNPs) were surface functionalized and subsequently applied to surface of fiberglass prepregs to fabricate hybrid BNNPs/fiberglass/epoxy composite laminate. A systematic and comparative study on BNNPs functionalization routes and their effects on morphology, mechanical property and thermal conductivity of final BNNPs enhanced composite laminates was performed. The functionalized BNNPs were characterized by Fourier-transform infrared spectroscopy (FT-IR), thermogravimetric analysis (TGA), and scanning electron microscopy (SEM). The composite laminates with surface functionalized BNNPs demonstrated improvement in tensile and flexural strength and modulus as well as in thermal conductivity compared to the composite laminate with pristine BNNPs while physically functionalized BNNPs outperformed chemically functionalized BNNPs in all cases. SEM images indicated better compatibility and dispersion of BNNPs in epoxy matrix following either of functionalization route. BNNPs bear great radiation-shielding capability. This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials. - Highlights: • BNNPs were surface functionalized and applied onto fiberglass prepreg. • The BNNPs enhanced prepreg was employed to make hybrid BNNPs/fiberglass/epoxy composite laminate. • The hybrid laminate presented significant improvement in mechanical strength and thermal conductivity. • This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

Science.gov (United States)

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

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

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.

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.

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Directory of Open Access Journals (Sweden)

Goran Martinovic

2008-01-01

Full Text Available We present a novel variation of the vehicle routing problem (VRP. Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD. 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is hard in the strong sense. Iterative modified simulated annealing (IMSA is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

Smart Waste Collection System with Low Consumption LoRaWAN Nodes and Route Optimization

Directory of Open Access Journals (Sweden)

Álvaro Lozano

2018-05-01

Full Text Available New solutions for managing waste have emerged due to the rise of Smart Cities and the Internet of Things. These solutions can also be applied in rural environments, but they require the deployment of a low cost and low consumption sensor network which can be used by different applications. Wireless technologies such as LoRa and low consumption microcontrollers, such as the SAM L21 family make the implementation and deployment of this kind of sensor network possible. This paper introduces a waste monitoring and management platform used in rural environments. A prototype of a low consumption wireless node is developed to obtain measurements of the weight, filling volume and temperature of a waste container. This monitoring allows the progressive filling data of every town container to be gathered and analysed as well as creating alerts in case of incidence. The platform features a module for optimising waste collection routes. This module dynamically generates routes from data obtained through the deployed nodes to save energy, time and consequently, costs. It also features a mobile application for the collection fleet which guides every driver through the best route—previously calculated for each journey. This paper presents a case study performed in the region of Salamanca to evaluate the efficiency and the viability of the system’s implementation. Data used for this case study come from open data sources, the report of the Castilla y León waste management plan and data from public tender procedures in the region of Salamanca. The results of the case study show a developed node with a great lifetime of operation, a large coverage with small deployment of antennas in the region, and a route optimization system which uses weight and volume measured by the node, and provides savings in cost, time and workforce compared to a static collection route approach.

Smart Waste Collection System with Low Consumption LoRaWAN Nodes and Route Optimization.

Science.gov (United States)

Lozano, Álvaro; Caridad, Javier; De Paz, Juan Francisco; Villarrubia González, Gabriel; Bajo, Javier

2018-05-08

New solutions for managing waste have emerged due to the rise of Smart Cities and the Internet of Things. These solutions can also be applied in rural environments, but they require the deployment of a low cost and low consumption sensor network which can be used by different applications. Wireless technologies such as LoRa and low consumption microcontrollers, such as the SAM L21 family make the implementation and deployment of this kind of sensor network possible. This paper introduces a waste monitoring and management platform used in rural environments. A prototype of a low consumption wireless node is developed to obtain measurements of the weight, filling volume and temperature of a waste container. This monitoring allows the progressive filling data of every town container to be gathered and analysed as well as creating alerts in case of incidence. The platform features a module for optimising waste collection routes. This module dynamically generates routes from data obtained through the deployed nodes to save energy, time and consequently, costs. It also features a mobile application for the collection fleet which guides every driver through the best route—previously calculated for each journey. This paper presents a case study performed in the region of Salamanca to evaluate the efficiency and the viability of the system’s implementation. Data used for this case study come from open data sources, the report of the Castilla y León waste management plan and data from public tender procedures in the region of Salamanca. The results of the case study show a developed node with a great lifetime of operation, a large coverage with small deployment of antennas in the region, and a route optimization system which uses weight and volume measured by the node, and provides savings in cost, time and workforce compared to a static collection route approach.

Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks

Directory of Open Access Journals (Sweden)

Yong Wang

2018-04-01

Full Text Available The formation of a cooperative alliance is an effective means of approaching the vehicle routing optimization in two-echelon reverse logistics networks. Cooperative mechanisms can contribute to avoiding the inefficient assignment of resources for the recycling logistics operations and reducing long distance transportation. With regard to the relatively low performance of waste collection, this paper proposes a three-phase methodology to properly address the corresponding vehicle routing problem on two echelons. First, a bi-objective programming model is established to minimize the total cost and the number of vehicles considering semitrailers and vehicles sharing. Furthermore, the Clarke–Wright (CW savings method and the Non-dominated Sorting Genetic Algorithm-II (NSGA-II are combined to design a hybrid routing optimization heuristic, which is denoted CW_NSGA-II. Routes on the first and second echelons are obtained on the basis of sub-optimal solutions provided by CW algorithm. Compared to other intelligent algorithms, CW_NSGA-II reduces the complexity of the multi-objective solutions search and mostly converges to optimality. The profit generated by cooperation among retail stores and the recycling hub in the reverse logistics network is fairly and reasonably distributed to the participants by applying the Minimum Costs-Remaining Savings (MCRS method. Finally, an empirical study in Chengdu City, China, reveals the superiority of CW_NSGA over the multi-objective particle swarm optimization and the multi objective genetic algorithms in terms of solutions quality and convergence. Meanwhile, the comparison of MCRS method with the Shapley value model, equal profit method and cost gap allocation proves that MCRS method is more conducive to the stability of the cooperative alliance. In general, the implementation of cooperation in the optimization of the reverse logistics network effectively leads to the sustainable development of urban and sub

Strategy modulates spatial perspective-taking: evidence for dissociable disembodied and embodied routes

Science.gov (United States)

Gardner, Mark R.; Brazier, Mark; Edmonds, Caroline J.; Gronholm, Petra C.

2013-01-01

Previous research provides evidence for a dissociable embodied route to spatial perspective-taking that is under strategic control. The present experiment investigated further the influence of strategy on spatial perspective-taking by assessing whether participants may also elect to employ a separable “disembodied” route loading on inhibitory control mechanisms. Participants (N = 92) undertook both the “own body transformation” (OBT) perspective-taking task, requiring speeded spatial judgments made from the perspective of an observed figure, and a control task measuring ability to inhibit spatially compatible responses in the absence of a figure. Perspective-taking performance was found to be related to performance on the response inhibition control task, in that participants who tended to take longer to adopt a new perspective also tended to show a greater elevation in response times when inhibiting spatially compatible responses. This relationship was restricted to those participants reporting that they adopted the perspective of another by reversing left and right whenever confronted with a front-view figure; it was absent in those participants who reported perspective-taking by mentally transforming their spatial orientation to align with that of the figure. Combined with previously published results, these findings complete a double dissociation between embodied and disembodied routes to spatial perspective-taking, implying that spatial perspective-taking is subject to modulation by strategy, and suggesting that embodied routes to perspective-taking may place minimal demands on domain general executive functions. PMID:23964229

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

A rhodanine flanked nonfullerene acceptor for solution-processed organic photovoltaics

KAUST Repository

Holliday, Sarah

2015-01-21

A novel small molecule, FBR, bearing 3-ethylrhodanine flanking groups was synthesized as a nonfullerene electron acceptor for solution-processed bulk heterojunction organic photovoltaics (OPV). A straightforward synthesis route was employed, offering the potential for large scale preparation of this material. Inverted OPV devices employing poly(3-hexylthiophene) (P3HT) as the donor polymer and FBR as the acceptor gave power conversion efficiencies (PCE) up to 4.1%. Transient and steady state optical spectroscopies indicated efficient, ultrafast charge generation and efficient photocurrent generation from both donor and acceptor. Ultrafast transient absorption spectroscopy was used to investigate polaron generation efficiency as well as recombination dynamics. It was determined that the P3HT:FBR blend is highly intermixed, leading to increased charge generation relative to comparative devices with P3HT:PC60BM, but also faster recombination due to a nonideal morphology in which, in contrast to P3HT:PC60BM devices, the acceptor does not aggregate enough to create appropriate percolation pathways that prevent fast nongeminate recombination. Despite this nonoptimal morphology the P3HT:FBR devices exhibit better performance than P3HT:PC60BM devices, used as control, demonstrating that this acceptor shows great promise for further optimization.

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.

Stochastic Petri nets for the reliability analysis of communication network applications with alternate-routing

International Nuclear Information System (INIS)

Balakrishnan, Meera; Trivedi, Kishor S.

1996-01-01

In this paper, we present a comparative reliability analysis of an application on a corporate B-ISDN network under various alternate-routing protocols. For simple cases, the reliability problem can be cast into fault-tree models and solved rapidly by means of known methods. For more complex scenarios, state space (Markov) models are required. However, generation of large state space models can get very labor intensive and error prone. We advocate the use of stochastic reward nets (a variant of stochastic Petri nets) for the concise specification, automated generation and solution of alternate-routing protocols in networks. This paper is written in a tutorial style so as to make it accessible to a large audience

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.

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

Solving Inventory Routing Problems Using Location Based Heuristics

Directory of Open Access Journals (Sweden)

Paweł Hanczar

2014-01-01

Full Text Available Inventory routing problems (IRPs occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle consistency, and heterogeneous fleet of vehicles as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP. (original abstract

State Employment Protection Statutes for Victims of Domestic Violence: Public Policy's Response to Domestic Violence as an Employment Matter

Science.gov (United States)

Swanberg, Jennifer E.; Ojha, Mamta U.; Macke, Caroline

2012-01-01

Evidence indicates that domestic violence has negative consequences on victims' employment; yet employers lag in recognizing this as a workplace issue. To address the problem, some states have established several policy solutions. To understand the scope of the public sector's response to domestic violence as a workplace issue, a content analysis…

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.

A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows

NARCIS (Netherlands)

Bräysy, Olli; Porkka, Pasi P.; Dullaert, Wout; Repoussis, Panagiotis P.; Tarantilis, Christos D.

This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The

Optimal Re-Routes and Ground Delays Using a Route-Based Aggregate Air Traffic Flow Model

Science.gov (United States)

Soler, Lluis

The National Airspace System (NAS) is very complex and with a high level of uncertainty. For this reason, developing an automated conflict resolution tool at NAS level is presented as a big challenge. One way to address the problem is by using aggregate models, which can significantly reduce its dimension and complexity. Significant effort has been made to develop an air traffic aggregate model capable to effectively state and solve the problem. In this study, a Route-Based Aggregate Model is developed and tested. It consists in a modification of several existing models and overcomes some issues identified in previous aggregate models. It allows the implementation of Traffic Flow Management conventional controls, such as ground delay and rerouting. These control strategies can be used to avoid congestion conflicts based on sectors and airports capacity as well as regions affected by convective weather. The optimization problem is posed as a Linear Programming routine, which guarantees an optimal solution that minimizes the total accumulated delay required to avoid such capacity conflicts. The solutions can be directly translated into specific instructions at aircraft level, via modification of the times of departure and flight plans. The model is integrated with Future Air Traffic Management Concepts Evaluation Tool (FACET), a state of the art air traffic simulation tool, and uses its files as both input and output. This allows simulating in FACET the solution obtained from the aggregate domain. The approach is validated by applying it in three realistic scenarios at different scales. Results show that, for time horizons larger than 2 hours, the accuracy of the aggregate model is similar to other simulation tools. Also, the modified flight plans, the product of the disaggregated solution, reduce the number of capacity conflicts in the FACET simulation. Future research will study the robustness of these solutions and determine the most appropriate scenarios where to

A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Wanfeng Liu

2015-01-01

Full Text Available Assessment of the components of a solution helps provide useful information for an optimization problem. This paper presents a new population-based problem-reduction evolutionary algorithm (PREA based on the solution components assessment. An individual solution is regarded as being constructed by basic elements, and the concept of acceptability is introduced to evaluate them. The PREA consists of a searching phase and an evaluation phase. The acceptability of basic elements is calculated in the evaluation phase and passed to the searching phase. In the searching phase, for each individual solution, the original optimization problem is reduced to a new smaller-size problem. With the evolution of the algorithm, the number of common basic elements in the population increases until all individual solutions are exactly the same which is supposed to be the near-optimal solution of the optimization problem. The new algorithm is applied to a large variety of capacitated vehicle routing problems (CVRP with customers up to nearly 500. Experimental results show that the proposed algorithm has the advantages of fast convergence and robustness in solution quality over the comparative algorithms.

Health care spending accounts: a flexible solution for Canadian employers.

Science.gov (United States)

Smithies, R; Steeves, L

1996-01-01

Flexible benefits plans have grown more slowly in Canada than in the United States, largely because of certain legal and regulatory considerations. Health care spending accounts (HCSAs) provide a cost-effective way for Canadian employers to address the health care benefit needs of a diverse workforce. A flexible health care spending account is a versatile and cost-effective instrument that can be used by Canadian employers that wish to provide a full range of health care benefits to employees. The health care alternatives available through an HCSA can provide employees with an opportunity to customize and optimize their benefits program. Regulatory requirements that an HCSA must meet in order to qualify for available tax advantages are discussed, as are the range of health care services that may be covered.

A rapid room temperature chemical route for the synthesis of graphene: metal-mediated reduction of graphene oxide.

Science.gov (United States)

Dey, Ramendra Sundar; Hajra, Saumen; Sahu, Ranjan K; Raj, C Retna; Panigrahi, M K

2012-02-07

A rapid and facile route for the synthesis of reduced graphene oxide sheets (rGOs) at room temperature by the chemical reduction of graphene oxide using Zn/acid in aqueous solution is demonstrated. This journal is © The Royal Society of Chemistry 2012

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.

An Improved PRoPHET Routing Protocol in Delay Tolerant Network

Directory of Open Access Journals (Sweden)

Seung Deok Han

2015-01-01

Full Text Available In delay tolerant network (DTN, an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection

Directory of Open Access Journals (Sweden)

Jamal Abdul Nasir

2018-01-01

Full Text Available Development of an efficient and effective home health care (HHC service system is a quite recent and challenging task for the HHC firms. This paper aims to develop an HHC service system in the perspective of long-term economic sustainability as well as operational efficiency. A more flexible mixed-integer linear programming (MILP model is formulated by incorporating the dynamic arrival and departure of patients along with the selection of new patients and nursing staff. An integrated model is proposed that jointly addresses: (i patient selection; (ii nurse hiring; (iii nurse to patient assignment; and (iv scheduling and routing decisions in a daily HHC planning problem. The proposed model extends the HHC problem from conventional scheduling and routing issues to demand and capacity management aspects. It enables an HHC firm to solve the daily scheduling and routing problem considering existing patients and nursing staff in combination with the simultaneous selection of new patients and nurses, and optimizing the existing routes by including new patients and nurses. The model considers planning issues related to compatibility, time restrictions, contract durations, idle time and workload balance. Two heuristic methods are proposed to solve the model by exploiting the variable neighborhood search (VNS approach. Results obtained from the heuristic methods are compared with a CPLEX based solution. Numerical experiments performed on different data sets, show the efficiency and effectiveness of the solution methods to handle the considered problem.

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

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.

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

Science.gov (United States)

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-02-26

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.

A Comprehensive Real-Time Traffic Map for Geographic Routing in VANETs

Directory of Open Access Journals (Sweden)

Chi-Fu Huang

2017-01-01

Full Text Available Vehicular Ad Hoc Networks (VANETs have attracted a lot of attention during the last decade. VANETs can not only improve driving safety, but also convenience, and support most future Intelligent Transportation System (ITS. Due to the highly dynamic network topology of VANETs, many geographic routing protocols have been proposed and use real-time traffic information as an important metric to select a reliable forwarding path. However, most of the existing works do not describe how to gather real-time traffic. They either assume this information is already available, or can query an existing traffic center. Few studies have noticed this issue but the proposed solutions only consider a small region. In this paper, we propose a Comprehensive Real-Time Traffic Map (CRT Map to collect wide-ranging real-time traffic information with low overhead. In the design of a CRT Map, the concept of Crowdsensing is adopted. Vehicles cooperatively gather traffic information and share it with each other to construct an overview of the whole road network traffic. In addition, we design a CRT Map Based Routing (CBR, which takes into account the connectivity of consecutive roads in routing decisions. Simulation results show that the CBR can achieve a lower end-to-end delay and a higher packet delivery ratio.

Fault-Aware Resource Allocation for Heterogeneous Data Sources with Multipath Routing

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

Full Text Available With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

Simulated annealing (SA to vehicle routing problems with soft time windows

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2014-12-01

Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.

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.

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.

Graphitic nanofibres from electrospun solutions of PAN in dimethylsulphoxide

OpenAIRE

Kurban, Zeynep; Lovell, Arthur; Jenkins, Derek; Bennington, Steve; Loader, Ian; Schober, Alex; Skipper, Neal

2009-01-01

Homogenous graphitic nanofibres (GNFs) have been synthesised by heat treatment of electrospun polyacrylonitrile in dimethylsulphoxide, offering a new solution route of low toxicity to manufacture sub-60 nm diameter GNFs. Fibre beading resulting from the spinning of low-concentration polymer solutions can be reduced with the addition of surfactant or sodium chloride. Characterisation techniques including X-ray diffraction, scanning- and transmission electron microscopy have been used to quanti...

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.

Children's route choice during active transportation to school: Difference between shortest and actual route

NARCIS (Netherlands)

Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

2016-01-01

Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

Numerical Modeling of Fiber-Reinforced Metal Matrix Composite Processing by the Liquid Route: Literature Contribution

Science.gov (United States)

Lacoste, Eric; Arvieu, Corinne; Mantaux, Olivier

2018-04-01

One of the technologies used to produce metal matrix composites (MMCs) is liquid route processing. One solution is to inject a liquid metal under pressure or at constant rate through a fibrous preform. This foundry technique overcomes the problem of the wettability of ceramic fibers by liquid metal. The liquid route can also be used to produce semiproducts by coating a filament with a molten metal. These processes involve physical phenomena combined with mass and heat transfer and phase change. The phase change phenomena related to solidification and also to the melting of the metal during the process notably result in modifications to the permeability of porous media, in gaps in impregnation, in the appearance of defects (porosities), and in segregation in the final product. In this article, we provide a state-of-the-art review of numerical models and simulation developed to study these physical phenomena involved in MMC processing by the liquid route.

Structural and morphological properties of HfxZr 1-xO2 thin films prepared by Pechini route

KAUST Repository

Garcí a-Cerda, L. A.; Puente-Urbina, B. A.; Quevedo-Ló pez, Manuel Angel Quevedo; Gnade, Bruce E.; Baldenegro-Pé rez, Leonardo Aurelio; Alshareef, Husam N.; Herná ndez-Landaverde, Martí n Adelaido

2010-01-01

In this study, HfxZr1-xO2 (0 < x < 1) thin films were deposited on silicon wafers using a dip-coating technique and by using a precursor solution prepared by the Pechini route. The effects of annealing temperature on the structure and morphological

Epitaxial solution deposition of YBa2Cu3O7-6 coated conductors.

Energy Technology Data Exchange (ETDEWEB)

Overmyer, Donald L.; Clem, Paul Gilbert; Siegal, Michael P.; Holesinger, Terry A. (Los Alamos National Laboratory, Los Alamos, NM); Voigt, James A.; Richardson, Jacob J.; Dawley, Jeffrey Todd

2004-11-01

A variety of solution deposition routes have been reported for processing complex perovskite-based materials such as ferroelectric oxides and conductive electrode oxides, due to ease of incorporating multiple elements, control of chemical stoichiometry, and feasibility for large area deposition. Here, we report an extension of these methods toward long length, epitaxial film solution deposition routes to enable biaxially oriented YBa{sub 2}Cu{sub 3}O{sub 7-{delta}} (YBCO)-coated conductors for superconducting transmission wires. Recent results are presented detailing an all-solution deposition approach to YBCO-coated conductors with critical current densities J{sub c} (77 K) > 1 MA/cm{sup 2} on rolling-assisted, biaxially textured, (200)-oriented Ni-W alloy tapes. Solution-deposition methods such as this approach and those of other research groups appear to have promise to compete with vapor phase methods for superconductor electrical properties, with potential advantages for large area deposition and low cost/kA {center_dot} m of wire.

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

A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Ligang Cui

2013-01-01

Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

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,

Two sides of gender: ERP evidence for the presence of two routes during gender agreement processing.

Science.gov (United States)

Caffarra, Sendy; Janssen, Niels; Barber, Horacio A

2014-10-01

The present ERP study aimed at providing evidence for the existence of two routes in the brain for the processing of morphosyntactic features during language comprehension; a lexical route which retrieves grammatical properties stored in the lexicon without reliance on formal cues, and a form-based route that takes advantage of sub-lexical units strongly related to a specific grammatical class. In the experiment, we investigated grammatical gender agreement processing in Spanish article-noun word pairs using a grammaticality judgment task. Article-noun pairs either agreed or did not agree in gender. Noun transparency was manipulated such that the ending could be strongly associated with a specific gender class (i.e., transparent nouns) or not (i.e., opaque nouns). A visual half-field method was employed and ERPs were recorded in response to the target nouns in order to disentangle the initial hemisphere-specific computations of gender processing. ERP results showed that, while both hemispheres compute agreement dependencies, the left hemisphere is sensitive to the presence of formal gender cues at an early stage (i.e., 350-500 ms) indicating the presence of a form-based route. The right hemisphere showed an ERP effect of transparency, but later than the left hemisphere (i.e., 500-750 ms). These findings confirm the presence of two routes to gender, which can be differently used depending on the availability of transparent endings. In addition, the results showed hemispheric differences in the time course of the form-based route. Copyright © 2014 Elsevier Ltd. All rights reserved.

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.

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

The Effects of the Tractor and Semitrailer Routing Problem on Mitigation of Carbon Dioxide Emissions

Directory of Open Access Journals (Sweden)

Hongqi Li

2013-01-01

Full Text Available The incorporation of CO2 emissions minimization in the vehicle routing problem (VRP is of critical importance to enterprise practice. Focusing on the tractor and semitrailer routing problem with full truckloads between any two terminals of the network, this paper proposes a mathematical programming model with the objective of minimizing CO2 emissions per ton-kilometer. A simulated annealing (SA algorithm is given to solve practical-scale problems. To evaluate the performance of the proposed algorithm, a lower bound is developed. Computational experiments on various problems generated randomly and a realistic instance are conducted. The results show that the proposed methods are effective and the algorithm can provide reasonable solutions within an acceptable computational time.

Crossing Active Faults on the Sakhalin II Onshore Pipeline Route: Pipeline Design and Risk Analysis

International Nuclear Information System (INIS)

Mattiozzi, Pierpaolo; Strom, Alexander

2008-01-01

Twin oil (20 and 24 inch) and gas (20 and 48 inch) pipeline systems stretching 800 km are being constructed to connect offshore hydrocarbon deposits from the Sakhalin II concession in the North to an LNG plant and oil export terminal in the South of Sakhalin island. The onshore pipeline route follows a regional fault zone and crosses individual active faults at 19 locations. Sakhalin Energy, Design and Construction companies took significant care to ensure the integrity of the pipelines, should large seismic induced ground movements occur during the Operational life of the facilities. Complex investigations including the identification of the active faults, their precise location, their particular displacement values and assessment of the fault kinematics were carried out to provide input data for unique design solutions. Lateral and reverse offset displacements of 5.5 and 4.5 m respectively were determined as the single-event values for the design level earthquake (DLE) - the 1000-year return period event. Within the constraints of a pipeline route largely fixed, the underground pipeline fault crossing design was developed to define the optimum routing which would minimize stresses and strain using linepipe materials which had been ordered prior to the completion of detailed design, and to specify requirements for pipe trenching shape, materials, drainage system, etc. Detailed Design was performed with due regard to actual topography and to avoid the possibility of the trenches freezing in winter, the implementation of specific drainage solutions and thermal protection measures

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.

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.

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.

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.

Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution

Science.gov (United States)

Barekatain, Behrang; Raahemifar, Kaamran; Ariza Quintana, Alfonso; Triviño Cabrera, Alicia

2015-01-01

Wireless Mesh Networks (WMNs) cannot completely guarantee good performance of traffic sources such as video streaming. To improve the network performance, this study proposes an efficient engineering solution named Wireless-to-Ethernet-Mesh-Portal-Passageway (WEMPP) that allows effective use of wired communication in WMNs. WEMPP permits transmitting data through wired and stable paths even when the destination is in the same network as the source (Intra-traffic). Tested with four popular routing protocols (Optimized Link State Routing or OLSR as a proactive protocol, Dynamic MANET On-demand or DYMO as a reactive protocol, DYMO with spanning tree ability and HWMP), WEMPP considerably decreases the end-to-end delay, jitter, contentions and interferences on nodes, even when the network size or density varies. WEMPP is also cost-effective and increases the network throughput. Moreover, in contrast to solutions proposed by previous studies, WEMPP is easily implemented by modifying the firmware of the actual Ethernet hardware without altering the routing protocols and/or the functionality of the IP/MAC/Upper layers. In fact, there is no need for modifying the functionalities of other mesh components in order to work with WEMPPs. The results of this study show that WEMPP significantly increases the performance of all routing protocols, thus leading to better video quality on nodes. PMID:25793516

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

Research on vehicle routing optimization for the terminal distribution of B2C E-commerce firms

Science.gov (United States)

Zhang, Shiyun; Lu, Yapei; Li, Shasha

2018-05-01

In this paper, we established a half open multi-objective optimization model for the vehicle routing problem of B2C (business-to-customer) E-Commerce firms. To minimize the current transport distance as well as the disparity between the excepted shipments and the transport capacity in the next distribution, we applied the concept of dominated solution and Pareto solutions to the standard particle swarm optimization and proposed a MOPSO (multi-objective particle swarm optimization) algorithm to support the model. Besides, we also obtained the optimization solution of MOPSO algorithm based on data randomly generated through the system, which verified the validity of the model.

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.

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.

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

Science.gov (United States)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

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

Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization.

Science.gov (United States)

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

2017-03-01

Waste collection is an important part of waste management that involves different issues, including environmental, economic, and social, among others. Waste collection optimization can reduce the waste collection budget and environmental emissions by reducing the collection route distance. This paper presents a modified Backtracking Search Algorithm (BSA) in capacitated vehicle routing problem (CVRP) models with the smart bin concept to find the best optimized waste collection route solutions. The objective function minimizes the sum of the waste collection route distances. The study introduces the concept of the threshold waste level (TWL) of waste bins to reduce the number of bins to be emptied by finding an optimal range, thus minimizing the distance. A scheduling model is also introduced to compare the feasibility of the proposed model with that of the conventional collection system in terms of travel distance, collected waste, fuel consumption, fuel cost, efficiency and CO 2 emission. The optimal TWL was found to be between 70% and 75% of the fill level of waste collection nodes and had the maximum tightness value for different problem cases. The obtained results for four days show a 36.80% distance reduction for 91.40% of the total waste collection, which eventually increases the average waste collection efficiency by 36.78% and reduces the fuel consumption, fuel cost and CO 2 emission by 50%, 47.77% and 44.68%, respectively. Thus, the proposed optimization model can be considered a viable tool for optimizing waste collection routes to reduce economic costs and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Remote technology in the spent fuel route in the UK

International Nuclear Information System (INIS)

Webster, A.W.

1999-01-01

Remote technologies employed in front end (commercial) reprocessing operations of metallic and oxide fuel at Sellafield in the UK are described. An overview of the transportation, fuel receiving and preparation facilities are given together with the remote technology developments employed to improve operations. It is concluded that the facilities and remote technology used within them are mature and based upon simple and robust principles. Remote operations and maintenance in these facilities is often easier than in many facilities downstream of the dissolution stage. Fuel design considerations for shearing and handling are described and it is concluded that advanced and higher burnup fuel can be accommodated by existing reprocessing and interim storage routes with current remote technologies. Two different storage systems are available from UK companies which use existing spent fuel handling technology/equipment. The pace of remote technology development is currently being set by the demands of other nuclear process areas such as decommissioning and plant clean out; these will spin-off into front end processes. (author)

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

Science.gov (United States)

Hemmelmayr, Vera C.; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-01-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP. PMID:23483764

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.

Science.gov (United States)

Hemmelmayr, Vera C; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-12-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

How Uncertain Information on Service Capacity Influences the Intermodal Routing Decision: A Fuzzy Programming Perspective

Directory of Open Access Journals (Sweden)

Yan Sun

2018-01-01

Full Text Available Capacity uncertainty is a common issue in the transportation planning field. However, few studies discuss the intermodal routing problem with service capacity uncertainty. Based on our previous study on the intermodal routing under deterministic capacity consideration, we systematically explore how service capacity uncertainty influences the intermodal routing decision. First of all, we adopt trapezoidal fuzzy numbers to describe the uncertain information of the service capacity, and further transform the deterministic capacity constraint into a fuzzy chance constraint based on fuzzy credibility measure. We then integrate such fuzzy chance constraint into the mixed-integer linear programming (MILP model proposed in our previous study to develop a fuzzy chance-constrained programming model. To enable the improved model to be effectively programmed in the standard mathematical programming software and solved by exact solution algorithms, a crisp equivalent linear reformulation of the fuzzy chance constraint is generated. Finally, we modify the empirical case presented in our previous study by replacing the deterministic service capacities with trapezoidal fuzzy ones. Using the modified empirical case, we utilize sensitivity analysis and fuzzy simulation to analyze the influence of service capacity uncertainty on the intermodal routing decision, and summarize some interesting insights that are helpful for decision makers.

Analysis of Energy Efficiency in Dynamic Optical Networks Employing Solar Energy Sources

DEFF Research Database (Denmark)

Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

2013-01-01

The paper presents energy efficient routing in dynamic optical networks, where solar energy sources are employed for the network nodes. Different parameters are evaluated, including the number of nodes that have access to solar energy sources, the different maximum solar output power, traffic type...... and the locations of solar powered nodes. Results show a maximum 39% savings in energy consumption with different increases in connection blocking probability....

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

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

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

Science.gov (United States)

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

Energy-efficient routing, modulation and spectrum allocation in elastic optical networks

Science.gov (United States)

Tan, Yanxia; Gu, Rentao; Ji, Yuefeng

2017-07-01

With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.

Graduate employability as a function of career decision in the ...

African Journals Online (AJOL)

In contrast to the high attention paid by the government for self-employment, in addition, most students preferred paid employment to self-employment. At the same time, the TVET system is plagued by unemployment. Consequently, considering TVET as one of the solutions to the development challenges in the study area is ...

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

Meta-analysis of choice set generation effects on route choice model estimates and predictions

DEFF Research Database (Denmark)

Prato, Carlo Giacomo

2012-01-01

are applied for model estimation and results are compared to the ‘true model estimates’. Last, predictions from the simulation of models estimated with objective choice sets are compared to the ‘postulated predicted routes’. A meta-analytical approach allows synthesizing the effect of judgments......Large scale applications of behaviorally realistic transport models pose several challenges to transport modelers on both the demand and the supply sides. On the supply side, path-based solutions to the user assignment equilibrium problem help modelers in enhancing the route choice behavior...... modeling, but require them to generate choice sets by selecting a path generation technique and its parameters according to personal judgments. This paper proposes a methodology and an experimental setting to provide general indications about objective judgments for an effective route choice set generation...

Potential and challenges in home care service process optimization : a route optimization approach

OpenAIRE

Nakari, Pentti J. E.

2016-01-01

Aging of the population is an increasing problem in many countries, including Finland, and it poses a challenge to public services such as home care. Vehicle routing optimization (VRP) type optimization solutions are one possible way to decrease the time required for planning home visits and driving to customer addresses, as well as decreasing transportation costs. Although VRP optimization is widely and succesfully applied to commercial and industrial logistics, the home care ...

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

Higher derivative discontinuous solutions to linear ordinary differential equations: a new route to complexity?

International Nuclear Information System (INIS)

Datta, Dhurjati Prasad; Bose, Manoj Kumar

2004-01-01

We present a new one parameter family of second derivative discontinuous solutions to the simplest scale invariant linear ordinary differential equation. We also point out how the construction could be extended to generate families of higher derivative discontinuous solutions as well. The discontinuity can occur only for a subset of even order derivatives, viz., 2nd, 4th, 8th, 16th,.... The solutions are shown to break the discrete parity (reflection) symmetry of the underlying equation. These results are expected to gain significance in the contemporary search of a new dynamical principle for understanding complex phenomena in nature

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Directory of Open Access Journals (Sweden)

Wei Tu

2015-10-01

Full Text Available Vehicle routing optimization (VRO designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW. Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

An artificial bee colony algorithm for the capacitated vehicle routing problem

DEFF Research Database (Denmark)

Szeto, W.Y.; Wu, Yongzhong; Ho, Sin C.

2011-01-01

This paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also...... proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms...

Improvement in interfacial characteristics of low-voltage carbon nanotube thin-film transistors with solution-processed boron nitride thin films

Energy Technology Data Exchange (ETDEWEB)

Jeon, Jun-Young; Ha, Tae-Jun, E-mail: taejunha0604@gmail.com

2017-08-15

Highlights: • We demonstrate the potential of solution-processed boron nitride (BN) thin films for nanoelectronics. • Improved interfacial characteristics reduced the leakage current by three orders of magnitude. • The BN encapsulation improves all the device key metrics of low-voltage SWCNT-TFTs. • Such improvements were achieved by reduced interaction of interfacial localized states. - Abstract: In this article, we demonstrate the potential of solution-processed boron nitride (BN) thin films for high performance single-walled carbon nanotube thin-film transistors (SWCNT-TFTs) with low-voltage operation. The use of BN thin films between solution-processed high-k dielectric layers improved the interfacial characteristics of metal-insulator-metal devices, thereby reducing the current density by three orders of magnitude. We also investigated the origin of improved device performance in SWCNT-TFTs by employing solution-processed BN thin films as an encapsulation layer. The BN encapsulation layer improves the electrical characteristics of SWCNT-TFTs, which includes the device key metrics of linear field-effect mobility, sub-threshold swing, and threshold voltage as well as the long-term stability against the aging effect in air. Such improvements can be achieved by reduced interaction of interfacial localized states with charge carriers. We believe that this work can open up a promising route to demonstrate the potential of solution-processed BN thin films on nanoelectronics.

Enhanced exact solution methods for the Team Orienteering Problem

NARCIS (Netherlands)

Keshtkaran, M.; Ziarati, K.; Bettinelli, A.; Vigo, D.

2016-01-01

The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic

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.

A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Majid Yousefikhoshbakht

2017-07-01

Full Text Available This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP, in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach based on column generation (CG is applied to solve the HFFOVRP. A tight integer programming model is presented and the linear programming relaxation of which is solved by the CG technique. Since there have been no existing benchmarks, this study generated 19 test problems and the results of the proposed CG algorithm is compared to the results of exact algorithm. Computational experience confirms that the proposed algorithm can provide better solutions within a comparatively shorter period of time.

Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

Directory of Open Access Journals (Sweden)

Wang Li-ying

2015-11-01

Full Text Available This paper presents the electric vehicle (EV multiple charging station location-routing problem with time window to optimize the routing plan of capacitated EVs and the strategy of charging stations. In particular, the strategy of charging stations includes both infrastructure-type selection and station location decisions. The problem accounts for two critical constraints in logistic practice: the vehicle loading capacity and the customer time windows. A hybrid heuristic that incorporates an adaptive variable neighborhood search (AVNS with the tabu search algorithm for intensification was developed to address the problem. The specialized neighborhood structures and the selection methods of charging station used in the shaking step of AVNS were proposed. In contrast to the commercial solver CPLEX, experimental results on small-scale test instances demonstrate that the algorithm can find nearly optimal solutions on small-scale instances. The results on large-scale instances also show the effectiveness of the algorithm.

Solving a bi-objective mathematical programming model for bloodmobiles location routing problem

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2017-01-01

Full Text Available Perishability of platelets, uncertainty of donors’ arrival and conflicting views in platelet supply chain have made platelet supply chain planning a problematic issue. In this paper, mobile blood collection system for platelet production is investigated. Two mathematical models are presented to cover the bloodmobile collection planning problem. The first model is a multi-objective fuzzy mathematical programming in which the bloodmobiles locations are considered with the aim of maximizing potential amount of blood collection and minimizing the operational cost. The second model is a vehicle routing problem with time windows which studies the shuttles routing problem. To tackle the first model, it is reformulated as a crisp multi objective linear programming model and then solved through a fuzzy multi objective programming approach. Several sensitivity analysis are conducted on important parameters to demonstrate the applicability of the proposed model. The proposed model is then solved by using a tailored Simulated Annealing (SA algorithm. The numerical results demonstrate promising efficiency of the proposed solution method.

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.

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

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.

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.

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.

Route Optimization for Offloading Congested Meter Fixes

Science.gov (United States)

Xue, Min; Zelinski, Shannon

2016-01-01

The Optimized Route Capability (ORC) concept proposed by the FAA facilitates traffic managers to identify and resolve arrival flight delays caused by bottlenecks formed at arrival meter fixes when there exists imbalance between arrival fixes and runways. ORC makes use of the prediction capability of existing automation tools, monitors the traffic delays based on these predictions, and searches the best reroutes upstream of the meter fixes based on the predictions and estimated arrival schedules when delays are over a predefined threshold. Initial implementation and evaluation of the ORC concept considered only reroutes available at the time arrival congestion was first predicted. This work extends previous work by introducing an additional dimension in reroute options such that ORC can find the best time to reroute and overcome the 'firstcome- first-reroute' phenomenon. To deal with the enlarged reroute solution space, a genetic algorithm was developed to solve this problem. Experiments were conducted using the same traffic scenario used in previous work, when an arrival rush was created for one of the four arrival meter fixes at George Bush Intercontinental Houston Airport. Results showed the new approach further improved delay savings. The suggested route changes from the new approach were on average 30 minutes later than those using other approaches, and fewer numbers of reroutes were required. Fewer numbers of reroutes reduce operational complexity and later reroutes help decision makers deal with uncertain situations.

Ethylic or methylic route to soybean biodiesel? Tracking environmental answers through life cycle assessment

International Nuclear Information System (INIS)

Alejos Altamirano, Carlos Alberto; Yokoyama, Lídia; Medeiros, José Luiz de; Queiroz Fernandes Araújo, Ofélia de

2016-01-01

Highlights: • Life cycle of biodiesel using alternative transesterification routes is analyzed. • Bioethanol can potentially decrease CO_2 emissions of methanol biodiesel. • Contrarily, equivalent CO_2 emissions are retained and renewability is reduced. • Water footprint increases from 37.12 (methanol) to 44.88 m"3/GJ biodiesel (ethanol). • Energy efficiency is reduced from 79.37% (methanol) to 75.19 (ethanol %). - Abstract: Biodiesel is a renewable fuel produced by transesterification of triacylglicerides (TAG) contained in vegetable oils and animal fats, to yield alkyl esters (biodiesel) and glycerin. Methanol is the main transesterification agent employed resulting in FAME (fatty acid methyl esters), which is primarily obtained from natural gas reforming (fossil source). Substitution of methanol by ethanol produces FAEE (fatty acid ethyl esters) and has the potential to render biodiesel a fully renewable fuel. Although renewability is a significant driving force for the proposed alcohol replacement, environmental performance of the alternative transesterification is questioned. The answer is herein sought through a comparative Life Cycle Assessment (LCA) of the two production chains. The study tracks CO_2 emissions, energy efficiency, water and resources consumption, and environmental impacts (Acidification Potential – AP, Global Warming Potential – GWP, Eutrophication Potential – EP, and Human Toxicity Potential – TP). The boundaries of the biodiesel production chains extend from the extraction of raw-materials to its final use as transportation fuel in buses, applied to the Brazilian scenario. Results show that substitution of the methylic route with the ethylic route does not attribute significant environmental benefits. Furthermore, the ethylic route presents competitive advantages only in the category of GWP, and exhibits inferior performance in the remaining evaluated impact categories. Finally, a greater consumption of water and energy

Transcranial route of brain targeted delivery of methadone in oil.

Science.gov (United States)

Pathirana, W; Abhayawardhana, P; Kariyawasam, H; Ratnasooriya, W D

2009-05-01

The unique anatomical arrangement of blood vessels and sinuses in the human skull and the brain, the prevalence of a high density of skin appendages in the scalp, extracranial vessels of the scalp communicating with the brain via emissary veins and most importantly, the way that the scalp is used in Ayurvedic medical system in treating diseases associated with the brain show that a drug could be transcranially delivered and targeted to the brain through the scalp. The present study was to investigate by measuring the antinociceptive effect on rats whether the opioid analgesic methadone could be delivered and targeted to the brain by transcranial delivery route. A non aqueous solution of methadone base in sesame oil was used for the application on the scalp. Animal studies were carried out using six groups of male rats consisting of group 1, the oral control treated with distilled water 1 ml; group 2, the oral positive control treated with methadone hydrochloride solution 316.5 mug/ml; group 3, the negative control treated transcranially with the blank sesame oil 0.2 ml and three test groups 4, 5 and 6 treated with three different dose levels of the transcranial oil formulation of methadone base, 41.6 mug/0.2 ml, 104 mug/0.2 ml and 208 mug/0.2 ml, respectively. The antinociceptive effects were examined by subjecting the rats to the hot plate and tail flick tests. The two higher concentrations of the three transcranial methadone formulations yielded response vs time curves showing nearly equal maximum antinociceptive effects similar to that of the oral positive control. Maximum analgesic effect after transcranial administration was observed between 1st and 2nd h and declined up to 6th hour. The results indicate that the transcranial brain targeted delivery of methadone base in the form of an oil based non aqueous solution results in statistically significant antinociceptive effects under experimental conditions. Therefore, it is possible to deliver central nervous

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

Dual reorientation relaxation routes of water molecules in oxyanion’s hydration shell: A molecular geometry perspective

Energy Technology Data Exchange (ETDEWEB)

Xie, Wen Jun; Yang, Yi Isaac; Gao, Yi Qin, E-mail: gaoyq@pku.edu.cn [Institute of Theoretical and Computational Chemistry, College of Chemistry and Molecular Engineering and Biodynamic Optical Imaging Center, Peking University, Beijing 100871 (China)

2015-12-14

In this study, we examine how complex ions such as oxyanions influence the dynamic properties of water and whether differences exist between simple halide anions and oxyanions. Nitrate anion is taken as an example to investigate the hydration properties of oxyanions. Reorientation relaxation of its hydration water can occur through two different routes: water can either break its hydrogen bond with the nitrate to form one with another water or switch between two oxygen atoms of the same nitrate. The latter molecular mechanism increases the residence time of oxyanion’s hydration water and thus nitrate anion slows down the translational motion of neighbouring water. But it is also a “structure breaker” in that it accelerates the reorientation relaxation of hydration water. Such a result illustrates that differences do exist between the hydration of oxyanions and simple halide anions as a result of different molecular geometries. Furthermore, the rotation of the nitrate solute is coupled with the hydrogen bond rearrangement of its hydration water. The nitrate anion can either tilt along the axis perpendicularly to the plane or rotate in the plane. We find that the two reorientation relaxation routes of the hydration water lead to different relaxation dynamics in each of the two above movements of the nitrate solute. The current study suggests that molecular geometry could play an important role in solute hydration and dynamics.

Dual reorientation relaxation routes of water molecules in oxyanion’s hydration shell: A molecular geometry perspective

International Nuclear Information System (INIS)

Xie, Wen Jun; Yang, Yi Isaac; Gao, Yi Qin

2015-01-01

In this study, we examine how complex ions such as oxyanions influence the dynamic properties of water and whether differences exist between simple halide anions and oxyanions. Nitrate anion is taken as an example to investigate the hydration properties of oxyanions. Reorientation relaxation of its hydration water can occur through two different routes: water can either break its hydrogen bond with the nitrate to form one with another water or switch between two oxygen atoms of the same nitrate. The latter molecular mechanism increases the residence time of oxyanion’s hydration water and thus nitrate anion slows down the translational motion of neighbouring water. But it is also a “structure breaker” in that it accelerates the reorientation relaxation of hydration water. Such a result illustrates that differences do exist between the hydration of oxyanions and simple halide anions as a result of different molecular geometries. Furthermore, the rotation of the nitrate solute is coupled with the hydrogen bond rearrangement of its hydration water. The nitrate anion can either tilt along the axis perpendicularly to the plane or rotate in the plane. We find that the two reorientation relaxation routes of the hydration water lead to different relaxation dynamics in each of the two above movements of the nitrate solute. The current study suggests that molecular geometry could play an important role in solute hydration and dynamics