Science.gov

Sample records for heterogeneous vehicle routing

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

    NASA Astrophysics Data System (ADS)

    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.

  2. Routing Vehicles with Ants

    NASA Astrophysics Data System (ADS)

    Tan, Wen Fang; Lee, Lai Soon; Majid, Zanariah Abdul; Seow, Hsin Vonn

    Routing vehicles involve the design of an optimal set of routes for a fleet of vehicles to serve a number of customers with known demands. This research develops an Ant Colony Optimization for the vehicle routing with one central depot and identical vehicles. The procedure simulates the behavior of real ants that always find the shortest path between their nest and a food source through a form of communication, pheromone trail. Finally, preliminary results on the learning of the algorithm testing on benchmark data set will be presented in this paper.

  3. Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts

    PubMed Central

    Yilmaz Eroglu, Duygu; Caglar Gencosman, Burcu; Cavdur, Fatih; Ozmutlu, H. Cenk

    2014-01-01

    In this paper, we analyze a real-world OVRP problem for a production company. Considering real-world constrains, we classify our problem as multicapacitated/heterogeneous fleet/open vehicle routing problem with split deliveries and multiproduct (MCHF/OVRP/SDMP) which is a novel classification of an OVRP. We have developed a mixed integer programming (MIP) model for the problem and generated test problems in different size (10–90 customers) considering real-world parameters. Although MIP is able to find optimal solutions of small size (10 customers) problems, when the number of customers increases, the problem gets harder to solve, and thus MIP could not find optimal solutions for problems that contain more than 10 customers. Moreover, MIP fails to find any feasible solution of large-scale problems (50–90 customers) within time limits (7200 seconds). Therefore, we have developed a genetic algorithm (GA) based solution approach for large-scale problems. The experimental results show that the GA based approach reaches successful solutions with 9.66% gap in 392.8 s on average instead of 7200 s for the problems that contain 10–50 customers. For large-scale problems (50–90 customers), GA reaches feasible solutions of problems within time limits. In conclusion, for the real-world applications, GA is preferable rather than MIP to reach feasible solutions in short time periods. PMID:25045735

  4. The Consistent Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2009-01-01

    In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.

  5. Vehicle routing problem in investment fund allocation

    NASA Astrophysics Data System (ADS)

    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.

  6. Genetic algorithms for the vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Volna, Eva

    2016-06-01

    The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

  7. Fund allocation using capacitated vehicle routing problem

    NASA Astrophysics Data System (ADS)

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

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  8. The Balanced Billing Cycle Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2009-01-01

    Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

  9. A green vehicle routing problem with customer satisfaction criteria

    NASA Astrophysics Data System (ADS)

    Afshar-Bakeshloo, M.; Mehrabi, A.; Safari, H.; Maleki, M.; Jolai, F.

    2016-08-01

    This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers' satisfaction have been taken into account. Meanwhile, the introduced model prepares an effective dashboard for decision-makers that determines appropriate routes, the best mixed fleet, speed and idle time of vehicles. Additionally, some new factors evaluate the greening of each decision based on three criteria. This model applies piecewise linear functions (PLFs) to linearize a nonlinear fuzzy interval for incorporating customers' satisfaction into other linear objectives. We have presented a mixed integer linear programming formulation for the S-GVRP. This model enriches managerial insights by providing trade-offs between customers' satisfaction, total costs and emission levels. Finally, we have provided a numerical study for showing the applicability of the model.

  10. Heterogeneous Participant Recruitment for Comprehensive Vehicle Sensing.

    PubMed

    Liu, Yazhi; Li, Xiong

    2015-01-01

    Widely distributed mobile vehicles wherein various sensing devices and wireless communication interfaces are installed bring vehicular participatory sensing into practice. However, the heterogeneity of vehicles in terms of sensing capability and mobility, and the participants' expectations on the incentives blackmake the collection of comprehensive sensing data a challenging task. A sensing data quality-oriented optimal heterogeneous participant recruitment strategy is proposed in this paper for vehicular participatory sensing. In the proposed strategy, the differences between the sensing data requirements and the collected sensing data are modeled. An optimization formula is established to model the optimal participant recruitment problem, and a participant utility analysis scheme is built based on the sensing and mobility features of vehicles. Besides, a greedy algorithm is then designed according to the utility of vehicles to recruit the most efficient vehicles with a limited total incentive budget. Real trace-driven simulations show that the proposed strategy can collect 85.4% of available sensing data with 34% incentive budget. PMID:26407102

  11. Heterogeneous Participant Recruitment for Comprehensive Vehicle Sensing

    PubMed Central

    Liu, Yazhi; Li, Xiong

    2015-01-01

    Widely distributed mobile vehicles wherein various sensing devices and wireless communication interfaces are installed bring vehicular participatory sensing into practice. However, the heterogeneity of vehicles in terms of sensing capability and mobility, and the participants’ expectations on the incentives blackmake the collection of comprehensive sensing data a challenging task. A sensing data quality-oriented optimal heterogeneous participant recruitment strategy is proposed in this paper for vehicular participatory sensing. In the proposed strategy, the differences between the sensing data requirements and the collected sensing data are modeled. An optimization formula is established to model the optimal participant recruitment problem, and a participant utility analysis scheme is built based on the sensing and mobility features of vehicles. Besides, a greedy algorithm is then designed according to the utility of vehicles to recruit the most efficient vehicles with a limited total incentive budget. Real trace-driven simulations show that the proposed strategy can collect 85.4% of available sensing data with 34% incentive budget. PMID:26407102

  12. The price of commitment in online stochastic vehicle routing

    SciTech Connect

    Bent, Russell W; Van Hentenryck, Pascal

    2009-01-01

    This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Early work has focused on very flexible routing settings where the decision to assign a vehicle to a customer is delayed until a vehicle is actually deployed to the customer. Motivated by real applications that require stability in the decision making, this paper considers a setting where the decision to assign a customer request to a vehicle must be taken when that request is accepted. Experimental results suggest that this constraint severely degrades the performance of existing algorithms. However, the paper shows how the use of stochastic information for vehicle assignment and request acceptance improves decision quality considerably. Moreover, the use of resource augmentation quantifies precisely the cost of commitment in online vehicle routing.

  13. Route-Based Control of Hybrid Electric Vehicles: Preprint

    SciTech Connect

    Gonder, J. D.

    2008-01-01

    Today's hybrid electric vehicle controls cannot always provide maximum fuel savings over all drive cycles. Route-based controls could improve HEV fuel efficiency by 2%-4% and help save nearly 6.5 million gallons of fuel annually.

  14. Optimizing investment fund allocation using vehicle routing problem framework

    NASA Astrophysics Data System (ADS)

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

    2014-07-01

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

  15. Impairment aware routing with service differentiation in heterogeneous WDM networks

    NASA Astrophysics Data System (ADS)

    Jirattigalachote, Amornrat; Wosinska, Lena; Monti, Paolo; Katrinis, Kostas; Tzanakaki, Anna

    2009-11-01

    In transparent Wavelength Division Multiplexing (WDM) networks, the signal is transported from source to destination in the optical domain through all-optical channels, or lightpaths. A lightpath may traverse several fiber segments and optical components that in general degrade the optical signal. This effect introduces the need for considering physical layer impairments during the connection-provisioning phase. Physical layer impairments can be divided into linear and non-linear. Both types of impairments are highly dependent on the fiber characteristics, which in turn are sensitive to length, temperature and age. A close look at the fiber infrastructure of today's network operators reveals a situation where old and newly deployed fibers coexist in the network. This heterogeneous fiber plant presents a challenge. A tradeoff should be found between the QoS requirements of connection requests and the use of the available (old and new) network resources. This calls for a provisioning mechanism able to adapt to the various fiber composition scenarios. In parallel, given the need for service differentiation, the authors recently proposed an Impairment Constraint Based Routing (ICBR) algorithm, referred to as ICBR-Diff, supporting differentiation of services at the BER (Bit Error Rate) level in a network with a homogeneous fiber infrastructure. In this paper the ICBR-Diff algorithm is extended to heterogeneous network; particularly, it is evaluated in WDM networks with fiber links having varying Polarization Mode Dispersion characteristics, i.e., with old and new fiber coexisting. Simulation results show that the ICBR-Diff algorithm exhibits high adaptability in a heterogeneous fiber composition scenario. This translates into improved performance in terms of blocking probability, when compared to traditional impairment aware routing algorithms.

  16. Solving the time dependent vehicle routing problem by metaheuristic algorithms

    NASA Astrophysics Data System (ADS)

    Johar, Farhana; Potts, Chris; Bennell, Julia

    2015-02-01

    The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has been categorized as non-classical VRP. It is motivated by the fact that multinational companies are currently not only manufacturing the demanded products but also distributing them to the customer location. This implies an efficient synchronization of production and distribution activities. Hence, this study will look into the routing of vehicles which departs from the depot at varies time due to the variation in manufacturing process. We consider a single production line where demanded products are being process one at a time once orders have been received from the customers. It is assumed that order released from the production line will be loaded into scheduled vehicle which ready to be delivered. However, the delivery could only be done once all orders scheduled in the vehicle have been released from the production line. Therefore, there could be lateness on the delivery process from awaiting all customers' order of the route to be released. Our objective is to determine a schedule for vehicle routing that minimizes the solution cost including the travelling and tardiness cost. A mathematical formulation is developed to represent the problem and will be solved by two metaheuristics; Variable Neighborhood Search (VNS) and Tabu Search (TS). These algorithms will be coded in C ++ programming and run using 56's Solomon instances with some modification. The outcome of this experiment can be interpreted as the quality criteria of the different approximation methods. The comparison done shown that VNS gave the better results while consuming reasonable computational efforts.

  17. Routing and Allocation of Unmanned Aerial Vehicles with Communication Considerations

    NASA Astrophysics Data System (ADS)

    Sabo, Chelsea

    Cooperative Unmanned Aerial Vehicles (UAV) teams are anticipated to provide much needed support for human intelligence, measurement and signature intelligence, signals intelligence, imagery intelligence, and open source intelligence through algorithms, software, and automation. Therefore, it is necessary to have autonomous algorithms that route multiple UAVs effectively and efficiently throughout missions and that these are realizable in the real-world given the associated uncertainties. Current routing strategies ignore communication constraints altogether. In reality, communication can be restricted by bandwidth, line-of-sight, maximum communication ranges, or a need for uninterrupted transmission. Generating autonomous algorithms that work effectively around these communication constraints is key for the future of UAV surveillance applications. In this work, both current and new routing strategies for UAVS are analyzed to determine how communications impact efficiency of information return. It is shown that under certain communication conditions, a new approach on routing can be more efficient than typically adopted strategies. This new approach defines and presents a new formulation based on a minimum delivery latency objective function. The problem is formulated such that information is not considered delivered until it is returned back to a high-bandwidth connection (depot) which is common when communication is restricted. The size of the region is shown to be dependent upon distance between requests, UAV bandwidth, UAV velocity, and data size, but it was shown that for large-sized data, long distances, and low bandwidth, it is generally better to route UAVs with this new minimum latency objective. With the added decision of when to deliver information to a high-bandwidth connection, an already computationally complex problem grows even faster. Because of scaling issues, a heuristic algorithm was developed that was constructed by analyzing the optimal

  18. A Parallel Algorithm for the Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2011-01-01

    The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.

  19. Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

    PubMed

    Sun, Zhonghao; Zhou, Xingshe

    2016-01-01

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

  20. Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

    NASA Astrophysics Data System (ADS)

    Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

    2016-05-01

    With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

  1. Routing the asteroid surface vehicle with detailed mechanics

    NASA Astrophysics Data System (ADS)

    Yu, Yang; Baoyin, He-Xi

    2014-06-01

    The motion of a surface vehicle on/above an irregular object is investigated for a potential interest in the insitu explorations to asteroids of the solar system. A global valid numeric method, including detailed gravity and geomorphology, is developed to mimic the behaviors of the test particles governed by the orbital equations and surface coupling effects. A general discussion on the surface mechanical environment of a specified asteroid, 1620 Geographos, is presented to make a global evaluation of the surface vehicle's working conditions. We show the connections between the natural trajectories near the ground and differential features of the asteroid surface, which describes both the good and bad of typical terrains from the viewpoint of vehicles' dynamic performances. Monte Carlo simulations are performed to take a further look at the trajectories of particles initializing near the surface. The simulations reveal consistent conclusions with the analysis, i.e., the open-field flat ground and slightly concave basins/valleys are the best choices for the vehicles' dynamical security. The dependence of decending trajectories on the releasing height is studied as an application; the results show that the pole direction (where the centrifugal force is zero) is the most stable direction in which the shift of a natural trajectory will be well limited after landing. We present this work as an example for pre-analysis that provides guidance to engineering design of the exploration site and routing the surface vehicles.

  2. Cooperative vehicle routing problem: an opportunity for cost saving

    NASA Astrophysics Data System (ADS)

    Zibaei, Sedighe; Hafezalkotob, Ashkan; Ghashami, Seyed Sajad

    2016-02-01

    In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost saving allocations which are obtained from various coalitions of owners. The methodology is illustrated with a numerical example in which different coalitions of the players are evaluated along with the results of cooperation and cost saving allocation methods.

  3. Analysis of the single-vehicle cyclic inventory routing problem

    NASA Astrophysics Data System (ADS)

    Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

    2012-11-01

    The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

  4. Vehicle routing for the last mile of power system restoration

    SciTech Connect

    Bent, Russell W; Coffrin, Carleton; Van Hentenryck, Pascal

    2010-11-23

    This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

  5. Hybrid Ant Algorithm and Applications for Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    Xiao, Zhang; Jiang-qing, Wang

    Ant colony optimization (ACO) is a metaheuristic method that inspired by the behavior of real ant colonies. ACO has been successfully applied to several combinatorial optimization problems, but it has some short-comings like its slow computing speed and local-convergence. For solving Vehicle Routing Problem, we proposed Hybrid Ant Algorithm (HAA) in order to improve both the performance of the algorithm and the quality of solutions. The proposed algorithm took the advantages of Nearest Neighbor (NN) heuristic and ACO for solving VRP, it also expanded the scope of solution space and improves the global ability of the algorithm through importing mutation operation, combining 2-opt heuristics and adjusting the configuration of parameters dynamically. Computational results indicate that the hybrid ant algorithm can get optimal resolution of VRP effectively.

  6. Vehicle Routing with Three-dimensional Container Loading Constraints—Comparison of Nested and Joint Algorithms

    NASA Astrophysics Data System (ADS)

    Koloch, Grzegorz; Kaminski, Bogumil

    2010-10-01

    In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which shapes of transported cargo are accounted for. This problem, known as a three-dimensional VRP with loading constraints (3D-VRP), is appropriate when transported commodities are not perfectly divisible, but they have fixed and heterogeneous dimensions. In the paper restrictions on allowable cargo positionings are also considered. These restrictions are derived from business practice and they extended the baseline 3D-VRP formulation as considered by Koloch and Kaminski (2010). In particular, we investigate how additional restrictions influence relative performance of two proposed optimization algorithms: the nested and the joint one. Performance of both methods is compared on artificial problems and on a big-scale real life case study.

  7. Combining Nearest Neighbor Search with Tabu Search for Large-Scale Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    Du, Lingling; He, Ruhan

    The vehicle routing problem is a classical problem in operations research, where the objective is to design least cost routes for a fleet of identical capacitated vehicles to service geographically scattered customers. In this paper, we present a new and effective hybrid metaheuristic algorithm for large-scale vehicle routing problem. The algorithm combines the strengths of the well-known Nearest Neighbor Search and Tabu Search into a two-stage procedure. More precisely, Nearest Neighbor Search is used to construct initial routes in the first stage and the Tabu Search is utilized to optimize the intra-route and the inter-route in the second stage. The presented algorithm is specifically designed for large-scale problems. The computational experiments were carried out on a standard benchmark and a real dataset with 6772 tobacco customers. The results demonstrate that the suggested method is highly competitive.

  8. A comparative study of routing protocols of heterogeneous wireless sensor networks.

    PubMed

    Han, Guangjie; Jiang, Xu; Qian, Aihua; Rodrigues, Joel J P C; Cheng, Long

    2014-01-01

    Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently--EDFCM, MCR, and EEPCA--together with two previous classical routing protocols--LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols. PMID:25050393

  9. A new approach on auxiliary vehicle assignment in capacitated location routing problem

    NASA Astrophysics Data System (ADS)

    Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

    2016-03-01

    The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

  10. A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem

    PubMed Central

    2013-01-01

    We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62). PMID:24382948

  11. Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

    NASA Astrophysics Data System (ADS)

    Ismail, Zuhaimy; Irhamah

    2010-11-01

    This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.

  12. Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    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.

  13. Northwest passage: Trade route for large air cushion vehicles

    NASA Technical Reports Server (NTRS)

    Anderson, J. L.

    1973-01-01

    A conceptual vehicle and powerplant (10,000-ton) nuclear-powered air-cushion vehicle (ACV) that could open the Northwest Passage and other Arctic passages to commercial traffic is identified. The report contains a description of the conceptual vehicle, including the powerplant and operations, an assessment of technical feasibility, estimates of capital and operating costs, and identification of eligible cargo and markets. A comparison of the nuclear ACV freighter with nuclear container ships shows that for containerized or roll-on/roll-off cargo the ACV would provide greatly reduced transit time between North Atlantic and North Pacific ports at a competitive cost.

  14. Hybrid tabu search for the multi-depot vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Hu, Shan-Liang

    2010-07-01

    A hybrid tabu search for the multi-depot vehicle routing problem is considered in this paper. The purpose of the proposed approach is to decrease the number of used vehicles and the total travel cost. An extensive numerical experiment was performed on benchmark problem instances available in literature, the computational results are presented to show the high effectiveness and performance of the proposed approaches.

  15. Modelling of the optimal vehicle route in terrain in emergency situations using GIS data

    NASA Astrophysics Data System (ADS)

    Rybansky, M.

    2014-02-01

    Most navigation systems in transport are oriented towards the search for optimal paths (shortest or fastest), using vector GIS data. At the time of natural disasters and emergency situations is necessary to consider roads and terrain for transport. This article is focused on finding optimal routes in terrain, which contains a number of point, line and area obstacles. The most frequent point obstacles are trees in the forest. The paper analyzes the typical structure of tree stands in the forest, their characteristics in GIS databases, as well as dimensional parameters of vehicles moving in the forest. The quality of these data is a prerequisite for finding routes between point obstacles. Searching for the fastest or shortest route of the vehicle described in this article is based on the use of the relationship between the Delaunay triangulation and Voronoi graph, the application of Dijkstra's algorithm and the optimization of fractional line. The above-mentioned methods are also exploitable for searching for the shortest route of movement among line obstructions and area obstructions, such route can be apprehended as the joining of points defining impassable terrain. In such a case, the condition must be met that the distance of terminal points of joins has to be adjusted to the extent that it will be shorter than a vehicle width increased by safe margin.

  16. A Food Chain Algorithm for Capacitated Vehicle Routing Problem with Recycling in Reverse Logistics

    NASA Astrophysics Data System (ADS)

    Song, Qiang; Gao, Xuexia; Santos, Emmanuel T.

    2015-12-01

    This paper introduces the capacitated vehicle routing problem with recycling in reverse logistics, and designs a food chain algorithm for it. Some illustrative examples are selected to conduct simulation and comparison. Numerical results show that the performance of the food chain algorithm is better than the genetic algorithm, particle swarm optimization as well as quantum evolutionary algorithm.

  17. Hybrid self organizing migrating algorithm - Scatter search for the task of capacitated vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman; Jasek, Roman; Bialic-Davendra, Magdalena

    2012-11-01

    One of the new emerging application strategies for optimization is the hybridization of existing metaheuristics. The research combines the unique paradigms of solution space sampling of SOMA and memory retention capabilities of Scatter Search for the task of capacitated vehicle routing problem. The new hybrid heuristic is tested on the Taillard sets and obtains good results.

  18. Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

    SciTech Connect

    Bent, Russell W

    2010-01-01

    This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositions which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.

  19. Decomposing the dynamics of heterogeneous delayed networks with applications to connected vehicle systems

    NASA Astrophysics Data System (ADS)

    Szalai, Róbert; Orosz, Gábor

    2013-10-01

    Delay-coupled networks are investigated with nonidentical delay times and the effects of such heterogeneity on the emergent dynamics of complex systems are characterized. A simple decomposition method is presented that decouples the dynamics of the network into node-size modal equations in the vicinity of equilibria. The resulting independent components contain distributed delays that map the spatiotemporal complexity of the system to the time domain. We demonstrate that this approach can be used to reveal physical phenomena in heterogenous vehicular traffic when vehicles are linked via vehicle-to-vehicle communication.

  20. Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment

    NASA Astrophysics Data System (ADS)

    Barnawi, Waleed T.

    Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned

  1. An Angle-Based Crossover Tabu Search for Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    Yang, Ning; Li, Ping; Li, Mingsen

    An improved tabu search - crossover tabu search (CTS) is presented which adopt the crossover operator of the genetic algorithm as the diversification strategy, and selecting elite solutions as the intensification strategies. To improve the performances, the angle-based idea of the sweep heuristic is used to confirm the neighborhood, and an object function with punishment. The angle-based CTS is applied for the vehicle routing problem. The simulating results which compared the tradition sweep heuristic and the standard tabu search shows the results got by angle-based CTS are better than those got by other two heuristics. The experiment shows the angle-based CTS has good performance on the vehicle routing problem.

  2. Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests

    NASA Astrophysics Data System (ADS)

    Sombuntham, Pandhapon; Kachitvichyanukul, Voratas

    2010-10-01

    This paper considers a multi-depot vehicle routing problem with pickup and delivery requests. In the problem of interest, each location may have goods for both pickup and delivery with multiple delivery locations that may not be the depots. These characteristics are quite common in industrial practice. A particle swarm optimization algorithm with multiple social learning structures is proposed for solving the practical case of multi-depot vehicle routing problem with simultaneous pickup and delivery and time window. A new decoding procedure is implemented using the PSO class provided in the ETLib object library. Computational experiments are carried out using the test instances for the pickup and delivery problem with time windows (PDPTW) as well as a newly generated instance. The preliminary results show that the proposed algorithm is able to provide good solutions to most of the test problems.

  3. Field Operations Program - U.S. Postal Service - Fountain Valley Electric Carrier Route Vehicle Testing

    SciTech Connect

    Francfort, J.E.

    2002-01-21

    The United States Postal Service (USPS) has ordered 500 light-duty electric carrier route vehicles (ECRV) mostly for their delivery carriers to use in several California locations. The 500 ECRVs have been defined as a demonstration fleet to support a decision of potentially ordering 5,500 additional ECRVs. Several different test methods are being used by the USPS to evaluate the 500-vehicle deployment. One of these test methods is the ECRV Customer Acceptance Test Program at Fountain Valley, California. Two newly manufactured ECRVs were delivered to the Fountain Valley Post Office and eighteen mail carriers primarily drove the ECRVs on ''park and loop'' mail delivery routes for a period of 2 days each. This ECRV testing consisted of 36 route tests, 18 tests per vehicle. The 18 mail carriers testing the ECRVs were surveyed for the opinions on the performance of the ECRVs. The U.S. Department of Energy, through its Field Operations Program, is supporting the USPS's ECRV testing activities both financially and with technical expertise. As part of this support, Field Operations Program personnel at the Idaho National Engineering and Environmental Laboratory have compiled this report based on the data generated by the USPS and its testing contractor (Ryerson, Master and Associates, Inc.) During the 36 route tests, the two test vehicles were driven a total of 474 miles, averaging 13 mile per test. The distance of the 36 route tests ranged from 4 to 34 miles. Both miles driven and State-of-Charge (SOC) data was collected for only 28 of the route tests. During these 28 tests, the ECRVs were driven a total of 447 miles. The SOC used during the 28 tests averaged a 41% decrease and the average distance driven was 16 miles. This suggests that a 16-mile route uses almost half of the ECRV's battery energy. The 18 carriers also rated 12 ECRV traits that included the physical design of the ECRVs as well as their performance. Based on a scale of 1 being the lowest and 5 being

  4. Field Operations Program - US Postal Service Fountain Valley Electric Carrier Route Vehicle Testing

    SciTech Connect

    Francfort, James Edward

    2002-01-01

    The United States Postal Service (USPS) has ordered 500 light-duty electric carrier route vehicles (ECRV) mostly for their delivery carriers to use in several California locations. The 500 ECRVs have been defined as a demonstration fleet to support a decision of potentially ordering 5,500 additional ECRVs. Several different test methods are being used by the USPS to evaluate the 500-vehicle deployment. One of these test methods is the ECRV Customer Acceptance Test Program at Fountain Valley, California. Two newly manufactured ECRVs were delivered to the Fountain Valey Post Office and eighteen mail carriers primarily drove the ECRVs on "park and loop" mail delivery routes for a period of 2 days each. This ECRV testing consisted of 36 route tests, 18 tests per vehicle. The 18 mail carriers testing the ECRVs were surveyed for the opinions on the performance of the ECRVs. The U.S. Department of Energy, through its Field Operations Program, is supporting the USPS's ECRV testing activities both financially and with technical expertise. As part of this support, Field Operations Program personnel at the Idaho National Engineering and Environmental Laboratory have compiled this report based on the data generated by the USPS and its testing contractor (Ryerson, Master and Associates, Inc.) During the 36 route tests, the two test vehicles were driven a total of 474 miles, averaging 13 mile per test. The distance of the 36 route tests ranged from 4 to 34 miles. Both miles driven and State-of-Charge (SOC) data was collected for only 28 of the route tests. During these 28 tests, the ECRVs were driven a total of 447 miles. The SOC used during the 28 tests averaged a 41% decrease and the average distance driven was 16 miles. This suggests that a 16-mile route uses almost half of the ECRV's battery energy. The 18 carriers also rated 12 ECRV traits that included the physical design of the ECRVs as well as their performance. Based on a scale of 1 being the lowest and 5 being highest

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

    PubMed

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

    2014-04-01

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

  6. A set-covering based heuristic algorithm for the periodic vehicle routing problem.

    PubMed

    Cacchiani, V; Hemmelmayr, V C; Tricoire, F

    2014-01-30

    We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

  7. A memory structure adapted simulated annealing algorithm for a green vehicle routing problem.

    PubMed

    Küçükoğlu, İlker; Ene, Seval; Aksoy, Aslı; Öztürk, Nursel

    2015-03-01

    Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions. PMID:25056743

  8. Modeling municipal solid waste collection: A generalized vehicle routing model with multiple transfer stations, gather sites and inhomogeneous vehicles in time windows.

    PubMed

    Son, Le Hoang; Louati, Amal

    2016-06-01

    Municipal Solid Waste (MSW) collection is a necessary process in any municipality resulting in the quality-of-life, economic aspects and urban structuralization. The intrinsic nature of MSW collection relates to the development of effective vehicle routing models that optimize the total traveling distances of vehicles, the environmental emission and the investment costs. In this article, we propose a generalized vehicle routing model including multiple transfer stations, gather sites and inhomogeneous vehicles in time windows for MSW collection. It takes into account traveling in one-way routes, the number of vehicles per m(2) and waiting time at traffic stops for reduction of operational time. The proposed model could be used for scenarios having similar node structures and vehicles' characteristics. A case study at Danang city, Vietnam is given to illustrate the applicability of this model. The experimental results have clearly shown that the new model reduces both total traveling distances and operational hours of vehicles in comparison with those of practical scenarios. Optimal routes of vehicles on streets and markets at Danang are given. Those results are significant to practitioners and local policy makers. PMID:27036996

  9. Analysis of Vehicle-Following Heterogeneity Using Self-Organizing Feature Maps

    PubMed Central

    Cheu, Ruey Long; Guo, Xiucheng; Romo, Alicia

    2014-01-01

    A self-organizing feature map (SOM) was used to represent vehicle-following and to analyze the heterogeneities in vehicle-following behavior. The SOM was constructed in such a way that the prototype vectors represented vehicle-following stimuli (the follower's velocity, relative velocity, and gap) while the output signals represented the response (the follower's acceleration). Vehicle trajectories collected at a northbound segment of Interstate 80 Freeway at Emeryville, CA, were used to train the SOM. The trajectory information of two selected pairs of passenger cars was then fed into the trained SOM to identify similar stimuli experienced by the followers. The observed responses, when the stimuli were classified by the SOM into the same category, were compared to discover the interdriver heterogeneity. The acceleration profile of another passenger car was analyzed in the same fashion to observe the interdriver heterogeneity. The distribution of responses derived from data sets of car-following-car and car-following-truck, respectively, was compared to ascertain inter-vehicle-type heterogeneity. PMID:25538767

  10. Analysis of vehicle-following heterogeneity using self-organizing feature maps.

    PubMed

    Yang, Jie; Cheu, Ruey Long; Guo, Xiucheng; Romo, Alicia

    2014-01-01

    A self-organizing feature map (SOM) was used to represent vehicle-following and to analyze the heterogeneities in vehicle-following behavior. The SOM was constructed in such a way that the prototype vectors represented vehicle-following stimuli (the follower's velocity, relative velocity, and gap) while the output signals represented the response (the follower's acceleration). Vehicle trajectories collected at a northbound segment of Interstate 80 Freeway at Emeryville, CA, were used to train the SOM. The trajectory information of two selected pairs of passenger cars was then fed into the trained SOM to identify similar stimuli experienced by the followers. The observed responses, when the stimuli were classified by the SOM into the same category, were compared to discover the interdriver heterogeneity. The acceleration profile of another passenger car was analyzed in the same fashion to observe the interdriver heterogeneity. The distribution of responses derived from data sets of car-following-car and car-following-truck, respectively, was compared to ascertain inter-vehicle-type heterogeneity. PMID:25538767

  11. enRoute: dynamic path extraction from biological pathway maps for exploring heterogeneous experimental datasets

    PubMed Central

    2013-01-01

    Jointly analyzing biological pathway maps and experimental data is critical for understanding how biological processes work in different conditions and why different samples exhibit certain characteristics. This joint analysis, however, poses a significant challenge for visualization. Current techniques are either well suited to visualize large amounts of pathway node attributes, or to represent the topology of the pathway well, but do not accomplish both at the same time. To address this we introduce enRoute, a technique that enables analysts to specify a path of interest in a pathway, extract this path into a separate, linked view, and show detailed experimental data associated with the nodes of this extracted path right next to it. This juxtaposition of the extracted path and the experimental data allows analysts to simultaneously investigate large amounts of potentially heterogeneous data, thereby solving the problem of joint analysis of topology and node attributes. As this approach does not modify the layout of pathway maps, it is compatible with arbitrary graph layouts, including those of hand-crafted, image-based pathway maps. We demonstrate the technique in context of pathways from the KEGG and the Wikipathways databases. We apply experimental data from two public databases, the Cancer Cell Line Encyclopedia (CCLE) and The Cancer Genome Atlas (TCGA) that both contain a wide variety of genomic datasets for a large number of samples. In addition, we make use of a smaller dataset of hepatocellular carcinoma and common xenograft models. To verify the utility of enRoute, domain experts conducted two case studies where they explore data from the CCLE and the hepatocellular carcinoma datasets in the context of relevant pathways. PMID:24564375

  12. On the Miller-Tucker-Zemlin Based Formulations for the Distance Constrained Vehicle Routing Problems

    NASA Astrophysics Data System (ADS)

    Kara, Imdat

    2010-11-01

    Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In this paper, existing two-indexed integer programming formulations, having Miller-Tucker-Zemlin based subtour elimination constraints, are reviewed. Existing formulations are simplified and obtained formulation is presented as formulation F1. It is shown that, the distance bounding constraints of the formulation F1, may not generate the distance traveled up to the related node. To do this, we redefine the auxiliary variables of the formulation and propose second formulation F2 with new and easy to use distance bounding constraints. Adaptation of the second formulation to the cases where new restrictions such as minimal distance traveled by each vehicle or other objectives such as minimizing the longest distance traveled is discussed.

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

    PubMed Central

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

    2015-01-01

    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. PMID:26343655

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

    PubMed

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

    2015-01-01

    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. PMID:26343655

  15. Application of an off-road mobility model to autonomous cross-country routing of unmanned ground vehicles

    NASA Astrophysics Data System (ADS)

    Cummins, Christopher L.; Jones, Randolph A.; Gates, Burhman Q., Jr.

    2006-05-01

    This paper describes the application of an Army-standard legacy off-road mobility model to cross-country route planning and negotiation by unmanned ground vehicles. A planned route is created from a movement map generated from existing terrain data. An unmanned ground vehicle negotiates the planned route and makes local routing adjustments based on a trafficability assessment of terrain features which are observed from the platform. This research leverages results from other work investigating the scalability of the existing legacy off-road mobility model to small vehicles (<500 kg). The legacy mobility model is the NATO Reference Mobility Model II (NRMM II), a standard for combat mobility modeling and procurement since the mid-90's.

  16. On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    Strodl, Johannes; Doerner, Karl F.; Tricoire, Fabien; Hartl, Richard F.

    In this paper we study the impact of different index structures used within hybrid solution approaches for vehicle routing problems with hard feasibility checks. We examine the case of the vehicle routing problem with two-dimensional loading constraints, which combines the loading of freight into the vehicles and the routing of the vehicles to satisfy the demands of the customers. The problem is solved by a variable neighborhood search for the routing part, in which we embed an exact procedure for the loading subproblem. The contribution of the paper is threefold: i) Four different index mechanisms for managing the subproblems are implemented and tested. It is shown that simple index structures tend to lead to better solutions than more powerful albeit complex ones, when using the same runtime limits. ii) The problem of balancing the CPU budget between exploration of different solutions and exact solution of the loading subproblem is investigated; experiments show that solving exactly hard subproblems can lead to better solution quality over the whole solution process. iii) New best results are presented on existing benchmark instances.

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

    PubMed Central

    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. PMID:26167171

  18. Urban signalised intersections: Impact of vehicle heterogeneity and driver type on cross-traffic manoeuvres

    NASA Astrophysics Data System (ADS)

    Deo, Puspita; Ruskin, Heather J.

    2014-07-01

    This paper presents a model for heterogeneous traffic at simple X and T-intersections of a single lane and two lane urban roads. Traffic at the intersections is controlled by a set of lights, operated to one of several fixed-time schemes. The heterogeneous traffic consists of both short (e.g. cars) and long (buses/trucks or equivalent) vehicles and is modelled, using a one-dimensional two-component cellular automaton. For intersections, we consider the implications for both homogeneous and heterogeneous traffic flows, based on a minimum space rule. For longer vehicles, this implies occupation of multiple road cells. The distributions of traffic mix and driver type are shown to have significant effect on intersection performance and patterns of flow. Example findings are presented and simple validation of the model basis is given, using available, but limited, local Dublin field data.

  19. Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

    PubMed Central

    Jawarneh, Sana; Abdullah, Salwani

    2015-01-01

    This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon’s 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results. PMID:26132158

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

    NASA Astrophysics Data System (ADS)

    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.

  1. A Library of Local Search Heuristics for the Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2010-01-01

    The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

  2. Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches

    NASA Astrophysics Data System (ADS)

    Gunes, Canan; van Hoeve, Willem-Jan; Tayur, Sridhar

    The 1-Commodity Pickup and Delivery Vehicle Routing Problem (1-PDVRP) asks to deliver a single commodity from a set of supply nodes to a set of demand nodes, which are unpaired. That is, a demand node can be served by any supply node. In this paper, we further assume that the supply and demand is unsplittable, which implies that we can visit each node only once. The 1-PDVRP arises in several practical contexts, ranging from bike-sharing programs in which bikes at each station need to be redistributed at various points in time, to food rescue programs in which excess food is collected from, e.g., restaurants and schools, and redistributed through agencies to people in need. The latter application is the main motivation of our study.

  3. A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Chen, Xianshun; Feng, Liang; Ong, Yew Soon

    2012-07-01

    In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

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

    PubMed

    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. PMID:27547672

  5. Properties analyses for the heterogeneous nonmotorized vehicle traffic based on cellular automaton model

    NASA Astrophysics Data System (ADS)

    Jiang, Hang; Ren, Gang; Zheng, Liang; Chen, Jingxu; Huang, Zhengfeng

    2014-04-01

    As traffic phenomena can be explained by physical method, this interdisciplinary domain has attracted many physicists to explore. The primary object of this research is to reveal the physical characteristics of heterogeneous nonmotorized vehicle traffic composing of conventional bicycles and electric bicycles. Cellular automaton (CA) model is an effective method to reveal the characteristics of the traffic, so a new CA model is proposed to simulate the flow characteristics, overtaking maneuvers patterns and segregation effect in the heterogeneous traffic. In order to realistically describe the traffic characteristics, the new model incorporates the honk effect, performance variance and erratic riding behavior of the nonmotorized vehicles. The simulations achieve three conclusions. First, increasing the ratio of electric bicycles can obtain higher flow and increase the number of overtaking maneuvers. Second, the honk can influence the density-flow diagram and stir up more overtaking maneuvers in the intermediate density region. Third, the existence of segregation effect which means conventional bicycles and electric bicycles could respectively gather together to form clusters is verified and elucidated in the heterogeneous traffic.

  6. Adaptive Traffic Route Control in QoS Provisioning for Cognitive Radio Technology with Heterogeneous Wireless Systems

    NASA Astrophysics Data System (ADS)

    Yamamoto, Toshiaki; Ueda, Tetsuro; Obana, Sadao

    As one of the dynamic spectrum access technologies, “cognitive radio technology,” which aims to improve the spectrum efficiency, has been studied. In cognitive radio networks, each node recognizes radio conditions, and according to them, optimizes its wireless communication routes. Cognitive radio systems integrate the heterogeneous wireless systems not only by switching over them but also aggregating and utilizing them simultaneously. The adaptive control of switchover use and concurrent use of various wireless systems will offer a stable and flexible wireless communication. In this paper, we propose the adaptive traffic route control scheme that provides high quality of service (QoS) for cognitive radio technology, and examine the performance of the proposed scheme through the field trials and computer simulations. The results of field trials show that the adaptive route control according to the radio conditions improves the user IP throughput by more than 20% and reduce the one-way delay to less than 1/6 with the concurrent use of IEEE802.16 and IEEE802.11 wireless media. Moreover, the simulation results assuming hundreds of mobile terminals reveal that the number of users receiving the required QoS of voice over IP (VoIP) service and the total network throughput of FTP users increase by more than twice at the same time with the proposed algorithm. The proposed adaptive traffic route control scheme can enhance the performances of the cognitive radio technologies by providing the appropriate communication routes for various applications to satisfy their required QoS.

  7. Efficient routing of multi-vehicle systems: Limited sensing and nonholonomic motion constraints

    NASA Astrophysics Data System (ADS)

    Enright, John Joseph

    Consider a routing problem for a team of agents in the plane: target points appear over time in a bounded environment and must be visited by one of the agents. It is desired to minimize the expected waiting time between the appearance of a target point, and the instant it is visited. In an effort to address issues relevant in applications such as autonomous mobile robotics, this dissertation focuses on variations of such a problem. First, we consider a team of agents that can only detect targets by way of limited-range onboard sensors. When the sensing radius is small, the system time is dominated by the searching component, and performance decreases dramatically due to the lack of information gathering capability demonstrated by the agents. However, when targets appear frequently, the presented algorithms recover the optimal performance achieved by agents with full information of the environment. The main contribution of the dissertation lies in the second part, in which we return to a full-information setting, but consider a team of Uninhabited Aerial Vehicles (UAVs), modeled as vehicles moving with constant forward speed along paths of bounded curvature. We focus on the case in which targets appear sporadically. For holonomic agents (single integrators), this reduces to a facility location problem. If the density of UAVs in the environment is low, the optimal algorithm resembles that of holonomic agents: the environment is partitioned into static regions of dominance within which each agent is responsible for targets (territorial behavior). But if the density of UAVs is high, the optimal algorithm exhibits a gregarious behavior: the agents move in a coordinated pattern, each visiting targets that appear immediately in front of it. The above results demonstrate a phase transition in the optimal algorithm. We present a non-dimensional parameter that characterizes the phase and analyze the critical value at which the transition occurs. This analysis offers

  8. Polynomial Size Formulations for the Distance and Capacity Constrained Vehicle Routing Problem

    NASA Astrophysics Data System (ADS)

    Kara, Imdat; Derya, Tusan

    2011-09-01

    The Distance and Capacity Constrained Vehicle Routing Problem (DCVRP) is an extension of the well known Traveling Salesman Problem (TSP). DCVRP arises in distribution and logistics problems. It would be beneficial to construct new formulations, which is the main motivation and contribution of this paper. We focused on two indexed integer programming formulations for DCVRP. One node based and one arc (flow) based formulation for DCVRP are presented. Both formulations have O(n2) binary variables and O(n2) constraints, i.e., the number of the decision variables and constraints grows with a polynomial function of the nodes of the underlying graph. It is shown that proposed arc based formulation produces better lower bound than the existing one (this refers to the Water's formulation in the paper). Finally, various problems from literature are solved with the node based and arc based formulations by using CPLEX 8.0. Preliminary computational analysis shows that, arc based formulation outperforms the node based formulation in terms of linear programming relaxation.

  9. A cloud theory-based particle swarm optimization for multiple decision maker vehicle routing problems with fuzzy random time windows

    NASA Astrophysics Data System (ADS)

    Ma, Yanfang; Xu, Jiuping

    2015-06-01

    This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.

  10. A new bio-inspired route to metal-nanoparticle-based heterogeneous catalysts.

    PubMed

    Debecker, Damien P; Faure, Chrystel; Meyre, Marie-Edith; Derré, Alain; Gaigneaux, Eric M

    2008-10-01

    Onion-type multilamellar vesicles are made of concentric bilayers of organic surfactant and are mainly known for their potential applications in biotechnology. They can be used as microreactors for the spontaneous and controlled production of metal nanoparticles. This process does not require any thermal treatment and, hence, it is also attractive for material sciences such as heterogeneous catalysis. In this paper, silver-nanoparticle-based catalysts are prepared by transferring onion-grown silver nanoparticles onto inorganic supports. The resulting materials are active in the total oxidation of benzene, attesting that this novel bio-inspired concept is promising in inorganic catalysis. PMID:18844300

  11. Dynamic routing control in heterogeneous tactical networks with multiple traffic priorities

    NASA Astrophysics Data System (ADS)

    Fecko, Mariusz A.; Wong, Larry; Kang, Jaewong; Cichocki, Andrzej; Kaul, Vikram; Samtani, Sunil

    2012-05-01

    To efficiently use alternate paths during periods of congestion, we have devised prioritized Dynamic Routing Control Agent (pDRCA) that (1) selects best links to meet the bandwidth and delay requirements of traffic, (2) provides load-balancing and traffic prioritization when multiple topologies are available, and (3) handles changes in link quality and traffic demand, and link outages. pDRCA provides multiplatform load balancing to maximize SATCOM (both P2P and multi-point) and airborne links utilization. It influences link selection by configuring the cost metrics on a router's interface, which does not require any changes to the routing protocol itself. It supports service differentiation of multiple traffic priorities by providing more network resources to the highest priority flows. pDRCA does so by solving an optimization problem to find optimal links weights that increase throughput and decrease E2E delay; avoid congested, low quality, and long delay links; and exploit path diversity in the network. These optimal link weights are sent to the local agents to be configured on individual routers per traffic priority. The pDRCA optimization algorithm has been proven effective in improving application performance. We created a variety of different test scenarios by varying traffic profile and link behavior (stable links, varying capacity, and link outages). In the scenarios where high priority traffic experienced significant loss without pDRCA, the average loss was reduced from 49.5% to 13% and in some cases dropped to 0%. Currently, pDRCA is integrated with an open-source software router and priority queues on Linux as a component of Open Tactical Router (OTR), which is being developed by ONR DTCN program.

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

    PubMed Central

    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

  13. Wheeled mobility device transportation safety in fixed route and demand-responsive public transit vehicles within the United States.

    PubMed

    Frost, Karen L; van Roosmalen, Linda; Bertocci, Gina; Cross, Douglas J

    2012-01-01

    An overview of the current status of wheelchair transportation safety in fixed route and demand-responsive, non-rail, public transportation vehicles within the US is presented. A description of each mode of transportation is provided, followed by a discussion of the primary issues affecting safety, accessibility, and usability. Technologies such as lifts, ramps, securement systems, and occupant restraint systems, along with regulations and voluntary industry standards have been implemented with the intent of improving safety and accessibility for individuals who travel while seated in their wheeled mobility device (e.g., wheelchair or scooter). However, across both fixed route and demand-responsive transit systems a myriad of factors such as nonuse and misuse of safety systems, oversized wheeled mobility devices, vehicle space constraints, and inadequate vehicle operator training may place wheeled mobility device (WhMD) users at risk of injury even under non-impact driving conditions. Since WhMD-related incidents also often occur during the boarding and alighting process, the frequency of these events, along with factors associated with these events are described for each transit mode. Recommendations for improving WhMD transportation are discussed given the current state of PMID:22876731

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

    NASA Astrophysics Data System (ADS)

    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.

  15. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

    PubMed Central

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-01-01

    It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks. PMID:26076404

  16. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications.

    PubMed

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-01-01

    It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs' route planning for small and medium-scale networks. PMID:26076404

  17. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    SciTech Connect

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  18. Heterogeneous impacts of gender-interpreted contributing factors on driver injury severities in single-vehicle rollover crashes.

    PubMed

    Wu, Qiong; Zhang, Guohui; Chen, Cong; Tarefder, Rafiqul; Wang, Haizhong; Wei, Heng

    2016-09-01

    In this study, a mixed logit model is developed to identify the heterogeneous impacts of gender-interpreted contributing factors on driver injury severities in single-vehicle rollover crashes. The random parameter of the variables in the mixed logit model, the heterogeneous mean, is elaborated by driver gender-based linear regression models. The model is estimated using crash data in New Mexico from 2010 to 2012. The percentage changes of factors' predicted probabilities are calculated in order to better understand the model specifications. Female drivers are found more likely to experience severe or fatal injuries in rollover crashes than male drivers. However, the probability of male drivers being severely injured is higher than female drivers when the road surface is unpaved. Two other factors with fixed parameters are also found to significantly increase driver injury severities, including Wet and Alcohol Influenced. This study provides a better understanding of contributing factors influencing driver injury severities in rollover crashes as well as their heterogeneous impacts in terms of driver gender. Those results are also helpful to develop appropriate countermeasures and policies to reduce driver injury severities in single-vehicle rollover crashes. PMID:27240126

  19. Characterization of gaseous pollutants and PM2.5 at fixed roadsides and along vehicle traveling routes in Bangkok Metropolitan Region

    NASA Astrophysics Data System (ADS)

    Kim Oanh, N. T.; Kongpran, J.; Hang, N. T.; Parkpian, P.; Hung, N. T. Q.; Lee, S.-B.; Bae, G.-N.

    2013-10-01

    Traffic is a major source of air pollution in urban areas of developing countries that leads to high exposure risk of urban dwellers. This study comparatively investigated levels of fine particles (PM2.5), SO2, NO2, and BTEX (benzene, toluene, ethylbenzene and xylenes) at fixed roadsides and on traveling routes in congested urban and less congested suburban areas of Bangkok in 2010. The roadside air quality monitoring was done at two opposite sites across the selected roads. The traffic counting was made simultaneously in these roads and hourly flows of 8 different vehicle types were determined. Roadside PM2.5 levels during dry season were high in both the city center and suburban area, significantly above the wet season, with 65-75% measurements exceeded 24 h Thailand ambient air quality standard of 50 μg m-3. Oppositely, roadside BTEX levels measured in the city center during wet season were higher than dry season and well above those in suburban area. Diurnal variations and the results of SPSS (Statistical Package for the Social Sciences) analysis showed associations between roadside pollutants levels and hourly traffic flows. The differences in pollution levels between 2 monitoring sites across a road were explained by road configurations and prevalent wind directions. On-route pollution levels were measured simultaneously both inside and outside selected vehicles (van, pickup), and on motorcycle. The on-route PM2.5 levels along the urban route were higher during the dry season than wet season. PM2.5 levels inside the vehicles were lower than outside whereas the opposite was observed for BTEX. BTEX were higher on more congested urban sub-routes with lower vehicle speeds. Higher pollution levels suggest a high risk of exposure.

  20. Tolerable Levels of Nonclinical Vehicles and Formulations Used in Studies by Multiple Routes in Multiple Species With Notes on Methods to Improve Utility.

    PubMed

    Gad, Shayne Cox; Spainhour, Charles B; Shoemake, Catherine; Pallman, Danielle R Stackhouse; Stricker-Krongrad, Alain; Downing, Philip A; Seals, Richard E; Eagle, Leslie Anne; Polhamus, Kara; Daly, Jennifer

    2016-03-01

    Formulation of nonclinical evaluations is a challenge, with the fundamental need to achieve multiples of the clinical exposure complicated by differences in species and routes of administration-specific tolerances, depending on concentrations, volumes, dosing regimen, duration of each administration, and study duration. Current practice to approach these differences is based on individual experience and scattered literature with no comprehensive data source (the most notable exception being our 2006 publication on this same subject). Lack of formulation tolerance data results in excessive animal use, unplanned delays in the evaluation and development of drugs, and vehicle-dependent results. A consulting firm, a chemical company, and 4 contract research organizations conducted a rigorous data mining operation of vehicle data from studies dating from 1991 to 2015, enhancing the data from this author's 2006 publication (3 of the six 2015 contributors were also 2006 contributors). Additional data were found in the published literature. The results identified 108 single-component vehicles (and 305 combination formulations) used in more than 1,040 studies across multiple species (dog, primate, rat, mouse, rabbit, guinea pig, minipig, pig, chick embryo, and cat) by multiple routes for a wide range of study durations. The tabulated data include maximum tolerated use levels by species, route, duration of study, dose-limiting toxicity where reported, review of the available literature on each vehicle, guidance on syringe selection, volume and pH limits by route with basic guidance on nonclinical formulation development, and guidance on factors to be considered in nonclinical route selection. PMID:26755718

  1. Nitrous acid (HONO) in a polluted subtropical atmosphere: Seasonal variability, direct vehicle emissions and heterogeneous production at ground surface

    NASA Astrophysics Data System (ADS)

    Xu, Zheng; Wang, Tao; Wu, Jueqi; Xue, Likun; Chan, James; Zha, Qiaozhi; Zhou, Shengzhen; Louie, Peter K. K.; Luk, Connie W. Y.

    2015-04-01

    Although nitrous acid (HONO) plays an important role in the chemistry of polluted atmospheres, its atmospheric abundances and sources are still not well understood. This paper reports ambient measurements of HONO taken over four select months in different seasons at a suburban site in Hong Kong. The data were analyzed to elucidate the seasonal characteristics, emission ratios and rates of heterogeneous production. The monthly averaged HONO concentrations ranged from 0.35 ± 0.30 ppbv in late spring (May) to 0.93 ± 0.67 ppbv in late autumn (November). The similar variation patterns of HONO, NOx, and traffic flow from midnight to rush hours suggest that the HONO concentration was strongly influenced by vehicle emissions. The emission ratios (HONO/NOx) were derived from an analysis of 21 fresh plumes (NO/NOx > 0.80), with the range of 0.5-1.6%. The large variability in the emission ratios is attributed to the reaction of NO2 on black carbon (BC) emitted from vehicles, based on a strong correlation between the HONO/NOx and concurrently measured BC. The mean conversion rate of NO2 to HONO on ground surface during nighttime estimated on nine select days was 0.52 × 10-2 h-1, which is relatively low compared with other reported values. This paper highlights a large variability in vehicle emission ratios and heterogeneous conversions of NO2 at ground surface. Photochemical models must consider this variability to better simulate the primary sources of HONO and subsequent photochemistry in the lower part of the troposphere.

  2. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem.

    PubMed

    Parragh, Sophie N

    2011-08-01

    Dial-a-ride problems deal with the transportation of people between pickup and delivery locations. Given the fact that people are subject to transportation, constraints related to quality of service are usually present, such as time windows and maximum user ride time limits. In many real world applications, different types of users exist. In the field of patient and disabled people transportation, up to four different transportation modes can be distinguished. In this article we consider staff seats, patient seats, stretchers and wheelchair places. Furthermore, most companies involved in the transportation of the disabled or ill dispose of different types of vehicles. We introduce both aspects into state-of-the-art formulations and branch-and-cut algorithms for the standard dial-a-ride problem. Also a recent metaheuristic method is adapted to this new problem. In addition, a further service quality related issue is analyzed: vehicle waiting time with passengers aboard. Instances with up to 40 requests are solved to optimality. High quality solutions are obtained with the heuristic method. PMID:24511211

  3. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem

    PubMed Central

    Parragh, Sophie N.

    2011-01-01

    Dial-a-ride problems deal with the transportation of people between pickup and delivery locations. Given the fact that people are subject to transportation, constraints related to quality of service are usually present, such as time windows and maximum user ride time limits. In many real world applications, different types of users exist. In the field of patient and disabled people transportation, up to four different transportation modes can be distinguished. In this article we consider staff seats, patient seats, stretchers and wheelchair places. Furthermore, most companies involved in the transportation of the disabled or ill dispose of different types of vehicles. We introduce both aspects into state-of-the-art formulations and branch-and-cut algorithms for the standard dial-a-ride problem. Also a recent metaheuristic method is adapted to this new problem. In addition, a further service quality related issue is analyzed: vehicle waiting time with passengers aboard. Instances with up to 40 requests are solved to optimality. High quality solutions are obtained with the heuristic method. PMID:24511211

  4. Heterogeneous and Homogeneous Routes in Water Oxidation Catalysis Starting from Cu(II) Complexes with Tetraaza Macrocyclic Ligands.

    PubMed

    Prevedello, Andrea; Bazzan, Irene; Dalle Carbonare, Nicola; Giuliani, Angela; Bhardwaj, Sunil; Africh, Cristina; Cepek, Cinzia; Argazzi, Roberto; Bonchio, Marcella; Caramori, Stefano; Robert, Marc; Sartorel, Andrea

    2016-04-20

    Since the first report in 2012, molecular copper complexes have been proposed as efficient electrocatalysts for water oxidation reactions, carried out in alkaline/neutral aqueous media. However, in some cases the copper species have been recognized as precursors of an active copper oxide layer, electrodeposited onto the working electrode. Therefore, the question whether copper catalysis is molecular or not is particularly relevant in the field of water oxidation. In this study, we investigate the electrochemical activity of copper(II) complexes with two tetraaza macrocyclic ligands, distinguishing heterogeneous or homogeneous processes depending on the reaction media. In an alkaline aqueous solution, and upon application of an anodic bias to working electrodes, an active copper oxide layer is observed to electrodeposit at the electrode surface. Conversely, water oxidation in neutral aqueous buffers is not associated to formation of the copper oxide layer, and could be exploited to evaluate and optimize a molecular, homogeneous catalysis. PMID:26888601

  5. Fine root mercury heterogeneity: metabolism of lower-order roots as an effective route for mercury removal.

    PubMed

    Wang, Jun-Jian; Guo, Ying-Ying; Guo, Da-Li; Yin, Sen-Lu; Kong, De-Liang; Liu, Yang-Sheng; Zeng, Hui

    2012-01-17

    Fine roots are critical components for plant mercury (Hg) uptake and removal, but the patterns of Hg distribution and turnover within the heterogeneous fine root components and their potential limiting factors are poorly understood. Based on root branching structure, we studied the total Hg (THg) and its cellular partitioning in fine roots in 6 Chinese subtropical trees species and the impacts of root morphological and stoichiometric traits on Hg partitioning. The THg concentration generally decreased with increasing root order, and was higher in cortex than in stele. This concentration significantly correlated with root length, diameter, specific root length, specific root area, and nitrogen concentration, whereas its cytosolic fraction (accounting for <10% of THg) correlated with root carbon and sulfur concentrations. The estimated Hg return flux from dead fine roots outweighed that from leaf litter, and ephemeral first-order roots that constituted 7.2-22.3% of total fine root biomass may have contributed most to this flux (39-71%, depending on tree species and environmental substrate). Our results highlight the high capacity of Hg stabilization and Hg return by lower-order roots and demonstrate that turnover of lower-order roots may be an effective strategy of detoxification in perennial tree species. PMID:22126585

  6. The Effect of Route, Vehicle, and Divided Doses on the Pharmacokinetics of Chlorpyrifos and its Metabolite Trichloropyridinol in Neonatal Sprague-Dawley Rats

    SciTech Connect

    Marty, M. S.; Domoradzki, J. Y.; Hansen, S. C.; Timchalk, Chuck; Bartels, M. J.; Mattsson, Joel L.

    2007-12-01

    There is a paucity of data on neonatal systemic exposure using different dosing paradigms. Male CD (Sprague-Dawley derived) rats at postnatal day (PND) 5 were dosed with chlorpyrifos (CPF, 1 mg/kg) using different routes of exposure, vehicles, and single vs. divided doses. Blood concentrations of CPF and its primary metabolite, trichloropyridinol (TCP), were measured at multiple times through 24 h. Groups included: single gavage bolus vs. divided gavage doses in corn oil (1 vs 3 times in 24 h), single gavage bolus vs. divided gavage doses in rat milk, and subcutaneous administration in DMSO. These data were compared with lactational exposure of PND 5 pups from dams exposed to CPF in the diet at 5 mg/kg/day for four weeks or published data from dams exposed to daily gavage with CPF at 5 mg/kg/day. Maternal blood CPF levels were an order of magnitude lower from dietary exposure than gavage (1.1 vs 14.8 ng/g), and blood CPF levels in PND 5 pups that nursed dietary-exposed or gavage-exposed dams were below the limit of detection. Single gavage doses of 1 mg/kg CPF in corn oil vehicle in pups resulted in CPF blood levels of 49 ng/g, and in milk vehicle about 9 ng/g. Divided doses led to lower peak CPF levels. A bolus dose of 1 mg/kg CPF in DMSO administered sc appeared to have substantially altered pharmacokinetics from orally administered chlorpyrifos. To be meaningful for risk assessment, neonatal studies require attention to the exposure scenario, since route, vehicle, dose and frequency of administration result in different systemic exposure to the test chemical and its metabolites.

  7. Conformational Heterogeneity Determined by Folding and Oligomer Assembly Routes of the Interferon Response Inhibitor NS1 Protein, Unique to Human Respiratory Syncytial Virus.

    PubMed

    Pretel, Esteban; Sánchez, Ignacio E; Fassolari, Marisol; Chemes, Lucía B; de Prat-Gay, Gonzalo

    2015-08-25

    The nonstructural NS1 protein is an essential virulence factor of the human respiratory syncytial virus, with a predominant role in the inhibition of the host antiviral innate immune response. This inhibition is mediated by multiple protein-protein interactions and involves the formation of large oligomeric complexes. There is neither a structure nor sequence or functional homologues of this protein, which points to a distinctive mechanism for blocking the interferon response among viruses. The NS1 native monomer follows a simple unfolding kinetics via a nativelike transition state ensemble, with a half-life of 45 min, in agreement with a highly stable core structure at equilibrium. Refolding is a complex process that involves several slowly interconverting species compatible with proline isomerization. However, an ultrafast folding event with a half-life of 0.2 ms is indicative of a highly folding compatible species within the unfolded state ensemble. On the other hand, the oligomeric assembly route from the native monomer, which does not involve unfolding, shows a monodisperse and irreversible end-point species triggered by a mild temperature change, with half-lives of 160 and 26 min at 37 and 47 °C, respectively, and at a low protein concentration (10 μM). A large secondary structure change into β-sheet structure and the formation of a dimeric nucleus precede polymerization by the sequential addition of monomers at the surprisingly low rate of one monomer every 34 s. The polymerization phase is followed by the binding to thioflavin-T indicative of amyloid-like, albeit soluble, repetitive β-sheet quaternary structure. The overall process is reversible only up until ~8 min, a time window in which most of the secondary structure change takes place. NS1's multiple binding activities must be accommodated in a few binding interfaces at most, something to be considered remarkable given its small size (15 kDa). Thus, conformational heterogeneity, and in particular

  8. Automatic routing module

    NASA Technical Reports Server (NTRS)

    Malin, Janice A.

    1987-01-01

    Automatic Routing Module (ARM) is a tool to partially automate Air Launched Cruise Missile (ALCM) routing. For any accessible launch point or target pair, ARM creates flyable routes that, within the fidelity of the models, are optimal in terms of threat avoidance, clobber avoidance, and adherence to vehicle and planning constraints. Although highly algorithmic, ARM is an expert system. Because of the heuristics applied, ARM generated routes closely resemble manually generated routes in routine cases. In more complex cases, ARM's ability to accumulate and assess threat danger in three dimensions and trade that danger off with the probability of ground clobber results in the safest path around or through difficult areas. The tools available prior to ARM did not provide the planner with enough information or present it in such a way that ensured he would select the safest path.

  9. Real-time immune-inspired optimum state-of-charge trajectory estimation using upcoming route information preview and neural networks for plug-in hybrid electric vehicles fuel economy

    NASA Astrophysics Data System (ADS)

    Mozaffari, Ahmad; Vajedi, Mahyar; Azad, Nasser L.

    2015-06-01

    The main proposition of the current investigation is to develop a computational intelligence-based framework which can be used for the real-time estimation of optimum battery state-of-charge (SOC) trajectory in plug-in hybrid electric vehicles (PHEVs). The estimated SOC trajectory can be then employed for an intelligent power management to significantly improve the fuel economy of the vehicle. The devised intelligent SOC trajectory builder takes advantage of the upcoming route information preview to achieve the lowest possible total cost of electricity and fossil fuel. To reduce the complexity of real-time optimization, the authors propose an immune system-based clustering approach which allows categorizing the route information into a predefined number of segments. The intelligent real-time optimizer is also inspired on the basis of interactions in biological immune systems, and is called artificial immune algorithm (AIA). The objective function of the optimizer is derived from a computationally efficient artificial neural network (ANN) which is trained by a database obtained from a high-fidelity model of the vehicle built in the Autonomie software. The simulation results demonstrate that the integration of immune inspired clustering tool, AIA and ANN, will result in a powerful framework which can generate a near global optimum SOC trajectory for the baseline vehicle, that is, the Toyota Prius PHEV. The outcomes of the current investigation prove that by taking advantage of intelligent approaches, it is possible to design a computationally efficient and powerful SOC trajectory builder for the intelligent power management of PHEVs.

  10. 36 CFR 1192.39 - Destination and route signs.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 36 Parks, Forests, and Public Property 3 2012-07-01 2012-07-01 false Destination and route signs... Buses, Vans and Systems § 1192.39 Destination and route signs. (a) Where destination or route information is displayed on the exterior of a vehicle, each vehicle shall have illuminated signs on the...

  11. 36 CFR 1192.39 - Destination and route signs.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Destination and route signs... Buses, Vans and Systems § 1192.39 Destination and route signs. (a) Where destination or route information is displayed on the exterior of a vehicle, each vehicle shall have illuminated signs on the...

  12. 36 CFR 1192.39 - Destination and route signs.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 36 Parks, Forests, and Public Property 3 2014-07-01 2014-07-01 false Destination and route signs... Buses, Vans and Systems § 1192.39 Destination and route signs. (a) Where destination or route information is displayed on the exterior of a vehicle, each vehicle shall have illuminated signs on the...

  13. 36 CFR 1192.39 - Destination and route signs.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 36 Parks, Forests, and Public Property 3 2011-07-01 2011-07-01 false Destination and route signs... Buses, Vans and Systems § 1192.39 Destination and route signs. (a) Where destination or route information is displayed on the exterior of a vehicle, each vehicle shall have illuminated signs on the...

  14. 36 CFR 1192.39 - Destination and route signs.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 36 Parks, Forests, and Public Property 3 2013-07-01 2012-07-01 true Destination and route signs... Buses, Vans and Systems § 1192.39 Destination and route signs. (a) Where destination or route information is displayed on the exterior of a vehicle, each vehicle shall have illuminated signs on the...

  15. Variability in operation-based NO(x) emission factors with different test routes, and its effects on the real-driving emissions of light diesel vehicles.

    PubMed

    Lee, Taewoo; Park, Junhong; Kwon, Sangil; Lee, Jongtae; Kim, Jeongsoo

    2013-09-01

    The objective of this study is to quantify the differences in NO(x) emissions between standard and non-standard driving and vehicle operating conditions, and to estimate by how much NO(x) emissions exceed the legislative emission limits under typical Korean road traffic conditions. Twelve Euro 3-5 light-duty diesel vehicles (LDDVs) manufactured in Korea were driven on a chassis dynamometer over the standard New European Driving Cycle (NEDC) and a representative Korean on-road driving cycle (KDC). NO(x) emissions, average speeds and accelerations were calculated for each 1-km trip segment, so called averaging windows. The results suggest that the NO(x) emissions of the tested vehicles are more susceptible to variations in the driving cycles than to those in the operating conditions. Even under comparable operating conditions, the NO(x) control capabilities of vehicles differ from each other, i.e., NO(x) control is weaker for the KDC than for the NEDC. The NO(x) emissions over the KDC for given vehicle operating conditions exceed those over the NEDC by more than a factor of 8. Consequently, on-road NO(x) emission factors are estimated here to exceed the Euro 5 emission limit by up to a factor of 8, 4 and 3 for typical Korean urban, rural, and motorway road traffic conditions, respectively. Our findings support the development of technical regulations for supplementary real-world emission tests for emission certification and the corresponding research actions taken by automotive industries. PMID:23747552

  16. "Recalculating Route".

    PubMed

    Baum, Neil

    2015-01-01

    Can you imagine going to a doctor who uses a paper chart, sends you a bill on a ledger card, and handwrites a prescription? You wouldn't have a great deal of confidence that the clinical skills of the doctor were up to date. This would be an example of a doctor who did not "recalculate his or her route." This article provides 10 examples of adjustments that have been made in medicine where the route has been recalculated. PMID:26399043

  17. 49 CFR 38.39 - Destination and route signs.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 1 2013-10-01 2013-10-01 false Destination and route signs. 38.39 Section 38.39... SPECIFICATIONS FOR TRANSPORTATION VEHICLES Buses, Vans and Systems § 38.39 Destination and route signs. (a) Where... illuminated signs on the front and boarding side of the vehicle. (b) Characters on signs required by...

  18. 49 CFR 38.39 - Destination and route signs.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 49 Transportation 1 2012-10-01 2012-10-01 false Destination and route signs. 38.39 Section 38.39... SPECIFICATIONS FOR TRANSPORTATION VEHICLES Buses, Vans and Systems § 38.39 Destination and route signs. (a) Where... illuminated signs on the front and boarding side of the vehicle. (b) Characters on signs required by...

  19. 49 CFR 38.39 - Destination and route signs.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 49 Transportation 1 2011-10-01 2011-10-01 false Destination and route signs. 38.39 Section 38.39... SPECIFICATIONS FOR TRANSPORTATION VEHICLES Buses, Vans and Systems § 38.39 Destination and route signs. (a) Where... illuminated signs on the front and boarding side of the vehicle. (b) Characters on signs required by...

  20. 49 CFR 38.39 - Destination and route signs.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 1 2014-10-01 2014-10-01 false Destination and route signs. 38.39 Section 38.39... SPECIFICATIONS FOR TRANSPORTATION VEHICLES Buses, Vans and Systems § 38.39 Destination and route signs. (a) Where... illuminated signs on the front and boarding side of the vehicle. (b) Characters on signs required by...

  1. 49 CFR 38.39 - Destination and route signs.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 49 Transportation 1 2010-10-01 2010-10-01 false Destination and route signs. 38.39 Section 38.39... SPECIFICATIONS FOR TRANSPORTATION VEHICLES Buses, Vans and Systems § 38.39 Destination and route signs. (a) Where... illuminated signs on the front and boarding side of the vehicle. (b) Characters on signs required by...

  2. Intelligent route surveillance

    NASA Astrophysics Data System (ADS)

    Schoemaker, Robin; Sandbrink, Rody; van Voorthuijsen, Graeme

    2009-05-01

    Intelligence on abnormal and suspicious behaviour along roads in operational domains is extremely valuable for countering the IED (Improvised Explosive Device) threat. Local sensor networks at strategic spots can gather data for continuous monitoring of daily vehicle activity. Unattended intelligent ground sensor networks use simple sensing nodes, e.g. seismic, magnetic, radar, or acoustic, or combinations of these in one housing. The nodes deliver rudimentary data at any time to be processed with software that filters out the required information. At TNO (Netherlands Organisation for Applied Scientific Research) research has started on how to equip a sensor network with data analysis software to determine whether behaviour is suspicious or not. Furthermore, the nodes should be expendable, if necessary, and be small in size such that they are hard to detect by adversaries. The network should be self-configuring and self-sustaining and should be reliable, efficient, and effective during operational tasks - especially route surveillance - as well as robust in time and space. If data from these networks are combined with data from other remote sensing devices (e.g. UAVs (Unmanned Aerial Vehicles)/aerostats), an even more accurate assessment of the tactical situation is possible. This paper shall focus on the concepts of operation towards a working intelligent route surveillance (IRS) research demonstrator network for monitoring suspicious behaviour in IED sensitive domains.

  3. Systems and methods for vehicle speed management

    DOEpatents

    Sujan, Vivek Anand; Vajapeyazula, Phani; Follen, Kenneth; Wu, An; Forst, Howard Robert

    2016-03-01

    Controlling a speed of a vehicle based on at least a portion of a route grade and a route distance divided into a plurality of route sections, each including at least one of a section grade and section length. Controlling the speed of the vehicle is further based on determining a cruise control speed mode for the vehicle for each of the plurality of route sections and determining a speed reference command of the vehicle based on at least one of the cruise control speed mode, the section length, the section grade, and a current speed.

  4. Advanced Vehicle Testing and Evaluation

    SciTech Connect

    Garetson, Thomas

    2013-03-31

    The objective of the United States (U.S.) Department of Energy's (DOEs) Advanced Vehicle Testing and Evaluation (AVTE) project was to provide test and evaluation services for advanced technology vehicles, to establish a performance baseline, to determine vehicle reliability, and to evaluate vehicle operating costs in fleet operations.Vehicles tested include light and medium-duty vehicles in conventional, hybrid, and all-electric configurations using conventional and alternative fuels, including hydrogen in internal combustion engines. Vehicles were tested on closed tracks and chassis dynamometers, as well as operated on public roads, in fleet operations, and over prescribed routes. All testing was controlled by procedures developed specifically to support such testing.

  5. Method and system for vehicle refueling

    DOEpatents

    Surnilla, Gopichandra; Leone, Thomas G; Prasad, Krishnaswamy Venkatesh; Argarwal, Apoorv; Hinds, Brett Stanley

    2012-11-20

    Methods and systems are provided for facilitating refueling operations in vehicles operating with multiple fuels. A vehicle operator may be assisted in refueling the multiple fuel tanks of the vehicle by being provided one or more refueling profiles that take into account the vehicle's future trip plans, the predicted environmental conditions along a planned route, and the operator's preferences.

  6. Method and system for vehicle refueling

    DOEpatents

    Surnilla, Gopichandra; Leone, Thomas G; Prasad, Krishnaswamy Venkatesh; Agarwal, Apoorv; Hinds, Brett Stanley

    2014-06-10

    Methods and systems are provided for facilitating refueling operations in vehicles operating with multiple fuels. A vehicle operator may be assisted in refueling the multiple fuel tanks of the vehicle by being provided one or more refueling profiles that take into account the vehicle's future trip plans, the predicted environmental conditions along a planned route, and the operator's preferences.

  7. Modeling blood flow heterogeneity.

    PubMed

    King, R B; Raymond, G M; Bassingthwaighte, J B

    1996-01-01

    analyzed. The separation between the distributions was further reduced when tissue content curves were analyzed. It is concluded that multipath models accounting for flow heterogeneity are a vehicle for assessing the effects of flow heterogeneity under the conditions applicable to specific laboratory protocols, that efforts should be made to assess the actual level of flow heterogeneity in the organ being studied, and that the errors in parameter estimates are generally smaller when the input function is known rather than estimated by deconvolution. PMID:8734057

  8. Heterogeneous sensor networks: a bio-inspired overlay architecture

    NASA Astrophysics Data System (ADS)

    Burman, Jerry; Hespanha, Joao; Madhow, Upamanyu; Klein, Daniel; Isaacs, Jason; Venkateswaran, Sriram; Pham, Tien

    2010-04-01

    Teledyne Scientific Company, the University of California at Santa Barbara (UCSB) and the Army Research Lab are developing technologies for automated data exfiltration from heterogeneous sensor networks through the Institute for Collaborative Biotechnologies (ICB). Unmanned air vehicles (UAV) provide an effective means to autonomously collect data from unattended ground sensors (UGSs) that cannot communicate with each other. UAVs are used to reduce the system reaction time by generating autonomous data-driven collection routes. Bio-inspired techniques for search provide a novel strategy to detect, capture and fuse data across heterogeneous sensors. A fast and accurate method has been developed for routing UAVs and localizing an event by fusing data from a sparse number of UGSs; it leverages a bio-inspired technique based on chemotaxis or the motion of bacteria seeking nutrients in their environment. The system was implemented and successfully tested using a high level simulation environment using a flight simulator to emulate a UAV. A field test was also conducted in November 2009 at Camp Roberts, CA using a UAV provided by AeroMech Engineering. The field test results showed that the system can detect and locate the source of an acoustic event with an accuracy of about 3 meters average circular error.

  9. Multicast Routing of Hierarchical Data

    NASA Technical Reports Server (NTRS)

    Shacham, Nachum

    1992-01-01

    The issue of multicast of broadband, real-time data in a heterogeneous environment, in which the data recipients differ in their reception abilities, is considered. Traditional multicast schemes, which are designed to deliver all the source data to all recipients, offer limited performance in such an environment, since they must either force the source to overcompress its signal or restrict the destination population to those who can receive the full signal. We present an approach for resolving this issue by combining hierarchical source coding techniques, which allow recipients to trade off reception bandwidth for signal quality, and sophisticated routing algorithms that deliver to each destination the maximum possible signal quality. The field of hierarchical coding is briefly surveyed and new multicast routing algorithms are presented. The algorithms are compared in terms of network utilization efficiency, lengths of paths, and the required mechanisms for forwarding packets on the resulting paths.

  10. Heterogeneous Catalysis.

    ERIC Educational Resources Information Center

    Miranda, R.

    1989-01-01

    Described is a heterogeneous catalysis course which has elements of materials processing embedded in the classical format of catalytic mechanisms and surface chemistry. A course outline and list of examples of recent review papers written by students are provided. (MVL)

  11. 36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... roads and designated routes. 1004.10 Section 1004.10 Parks, Forests, and Public Property PRESIDIO TRUST VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following...

  12. 36 CFR 4.10 - Travel on park roads and designated routes.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 36 Parks, Forests, and Public Property 1 2014-07-01 2014-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and...

  13. 36 CFR 4.10 - Travel on park roads and designated routes.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 36 Parks, Forests, and Public Property 1 2013-07-01 2013-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and...

  14. 36 CFR 4.10 - Travel on park roads and designated routes.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and...

  15. 36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... roads and designated routes. 1004.10 Section 1004.10 Parks, Forests, and Public Property PRESIDIO TRUST VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following...

  16. 36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... roads and designated routes. 1004.10 Section 1004.10 Parks, Forests, and Public Property PRESIDIO TRUST VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following...

  17. 36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... roads and designated routes. 1004.10 Section 1004.10 Parks, Forests, and Public Property PRESIDIO TRUST VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following...

  18. 36 CFR 4.10 - Travel on park roads and designated routes.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 36 Parks, Forests, and Public Property 1 2012-07-01 2012-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and...

  19. 36 CFR 4.10 - Travel on park roads and designated routes.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 36 Parks, Forests, and Public Property 1 2011-07-01 2011-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and...

  20. Method and apparatus for identification of hazards along an intended travel route

    NASA Technical Reports Server (NTRS)

    Kronfeld, Kevin M. (Inventor); Lapis, Mary Beth (Inventor); Walling, Karen L. (Inventor); Chackalackal, Mathew S. (Inventor)

    2003-01-01

    Targets proximate to a travel route plan were evaluated to determine hazardousness. Projected geometric representation of a vehicle determines intrusion of hazardous targets along travel route plan. Geometric representation of hazardous targets projected along motion vector to determine intrusion upon travel route plan. Intrusion assessment presented on user display.

  1. State alternative route designations

    SciTech Connect

    Not Available

    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.

  2. State alternative route designations

    SciTech Connect

    Not Available

    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.

  3. Defining Dynamic Route Structure

    NASA Technical Reports Server (NTRS)

    Zelinski, Shannon; Jastrzebski, Michael

    2011-01-01

    This poster describes a method for defining route structure from flight tracks. Dynamically generated route structures could be useful in guiding dynamic airspace configuration and helping controllers retain situational awareness under dynamically changing traffic conditions. Individual merge and diverge intersections between pairs of flights are identified, clustered, and grouped into nodes of a route structure network. Links are placed between nodes to represent major traffic flows. A parametric analysis determined the algorithm input parameters producing route structures of current day flight plans that are closest to todays airway structure. These parameters are then used to define and analyze the dynamic route structure over the course of a day for current day flight paths. Route structures are also compared between current day flight paths and more user preferred paths such as great circle and weather avoidance routing.

  4. View southwest along Route Canterbury Road (Route 169) showing commercial ...

    Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

    View southwest along Route Canterbury Road (Route 169) showing commercial and residential buildings on the east and west sides of the road - Brooklyn Green, North Green, South Green, & West Green, parts of Brown Road, Canterbury Road (Route 169), Hartford Road (Route 6), Hyde Road, Pomfret Road (Route 169), Prince Hill Road, Providence Road (Route 6), Wauregan Road (Routes 169 & 205), & Wolf Den Road, Brooklyn, Windham County, CT

  5. An Application of Traffic Measurements to Route Planning for Traffic Flow Simulation in MATSim

    NASA Astrophysics Data System (ADS)

    Maciejewski, Michał

    The paper presents MATSim Junction Turning Ratios Route Planner (JTRRouter) that enables to generate route plans for vehicles on the basis of traffic measurements conducted at intersections. The authors described a general design, functionality, and requirements of JTRRouter, and then presented a sketch of the route planning algorithm and discussed its computational complexity. In order to illustrate the most essential capabilities of the module, an example of route planning for a fragment of a real urban network was presented.

  6. Contact Graph Routing

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott C.

    2011-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

  7. Network Infrastructure for Electric Vehicle Charging

    NASA Astrophysics Data System (ADS)

    Lim, Yujin; Park, Jaesung; Ahn, Sanghyun

    Controlled charging of electric vehicles can take care of fluctuating electricity supply. In this paper, we design network infrastructure to collect and deliver data of charging data of electric vehicles to remote monitoring center. In our network infrastructure, we analyze and compare the existing routing mechanisms for multi-hop wireless networks from aspect of the control overhead for the path establishment.

  8. ROUTE-SPECIFIC DOSIMETRY

    EPA Science Inventory

    The capacity to perform route-to-route extrapolation of toxicity data is becoming increasingly crucial to the Agency, with a number of strategies suggested and demonstrated. One strategy involves using a combination of existing data and modeling approaches. This strategy propos...

  9. Intelligent Vehicle Health Management

    NASA Technical Reports Server (NTRS)

    Paris, Deidre E.; Trevino, Luis; Watson, Michael D.

    2005-01-01

    objectives: Guidance and Navigation; Communications and Tracking; Vehicle Monitoring; Information Transport and Integration; Vehicle Diagnostics; Vehicle Prognostics; Vehicle mission Planning; Automated Repair and Replacement; Vehicle Control; Human Computer Interface; and Onboard Verification and Validation. Furthermore, the presented framework provides complete vehicle management which not only allows for increased crew safety and mission success through new intelligence capabilities, but also yields a mechanism for more efficient vehicle operations. The representative IVHM technologies for computer platform using heterogeneous communication, 3) coupled electromagnetic oscillators for enhanced communications, 4) Linux-based real-time systems, 5) genetic algorithms, 6) Bayesian Networks, 7) evolutionary algorithms, 8) dynamic systems control modeling, and 9) advanced sensing capabilities. This paper presents IVHM technologies developed under NASA's NFFP pilot project and the integration of these technologies forms the framework for IIVM.

  10. Capacitated arc routing problem and its extensions in waste collection

    NASA Astrophysics Data System (ADS)

    Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

    2015-05-01

    Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

  11. Capacitated arc routing problem and its extensions in waste collection

    SciTech Connect

    Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

    2015-05-15

    Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

  12. Understanding individual routing behaviour.

    PubMed

    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. PMID:26962031

  13. 76 FR 37059 - Siuslaw National Forest; Oregon; Oregon Dunes NRA Management Area 10 (C) Route and Area Designation

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-06-24

    ... Forest Service Siuslaw National Forest; Oregon; Oregon Dunes NRA Management Area 10 (C) Route and Area... Dunes Plan) in order to: (1) Designate Off Highway Vehicle (OHV), also called Off Road Vehicle (ORV) routes within Management Area (MA) 10 (C) of the Oregon Dunes National Recreation Area (ODNRA) beyond...

  14. Biodiesel production using heterogeneous catalysts.

    PubMed

    Semwal, Surbhi; Arora, Ajay K; Badoni, Rajendra P; Tuli, Deepak K

    2011-02-01

    The production and use of biodiesel has seen a quantum jump in the recent past due to benefits associated with its ability to mitigate greenhouse gas (GHG). There are large number of commercial plants producing biodiesel by transesterification of vegetable oils and fats based on base catalyzed (caustic) homogeneous transesterification of oils. However, homogeneous process needs steps of glycerol separation, washings, very stringent and extremely low limits of Na, K, glycerides and moisture limits in biodiesel. Heterogeneous catalyzed production of biodiesel has emerged as a preferred route as it is environmentally benign needs no water washing and product separation is much easier. The present report is review of the progress made in development of heterogeneous catalysts suitable for biodiesel production. This review shall help in selection of suitable catalysts and the optimum conditions for biodiesel production. PMID:21106371

  15. Class network routing

    DOEpatents

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    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.

  16. Railroad Routing Model

    Energy Science and Technology Software Center (ESTSC)

    1995-01-05

    INTERLINE/PC is an interactive program designed to simulate the routing practices of the United States rail system. The rail industry is divided into a large number of independent competing companies. The INTERLINE data base represents these rail companies as 94 separate subnetworks. An additional two subnetworks represent navigable inland/intracoastal and deep draft marine routes. Interchange points between individual rail systems and waterway systems are also identified.

  17. AURP: an AUV-aided underwater routing protocol for underwater acoustic sensor networks.

    PubMed

    Yoon, Seokhoon; Azad, Abul K; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  18. AURP: An AUV-Aided Underwater Routing Protocol for Underwater Acoustic Sensor Networks

    PubMed Central

    Yoon, Seokhoon; Azad, Abul K.; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  19. Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

    PubMed Central

    Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D. K.; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

    2014-01-01

    Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

  20. Robotic Mounted Detection System: robotics for route clearance

    NASA Astrophysics Data System (ADS)

    Hutchison, John; Klager, Gene; McCoy, Edward; Fite, David; Frederick, Brian

    2010-04-01

    Robotic Mounted Detection System (RMDS) is a government program to enable robotic control of a Husky route clearance vehicle with a mine detection sensor payload. The goal is for the operator to control the Husky and mine detection sensor from another vehicle. This program will provide the user with standard tele-operation control of the vehicle as well as semi-autonomous modes including cruise control, precision waypoint navigation with operator error correction and a visual mode allowing the operator to enter waypoints in the current video feed. The use of autonomy will be tailored to give the operator maximum control of the robotic vehicle's path while minimizing the effort required to maintain the desired route. Autonomous alterations of the path would conflict with the goal of route clearance, so waypoint navigation will allow the operator to supply offsets to counteract location errors. While following a waypoint path, the Husky will be capable of controlling its speed to maintain an operator specified distance from the control vehicle. Obstacle avoidance will be limited to protecting the mine detection sensor, leaving any decision to leave the path up to the operator. Video will be the primary navigational sensor feed to the operator, who will use an augmented steering wheel controller and computer display to control the Husky. A LADAR system will be used to detect obstacles that could damage the mine sensor and to maintain the optimal sensor orientation while the vehicle is moving. Practical issues and lessons learned during integration will be presented.

  1. Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode

    PubMed Central

    He, Shiwei; Song, Rui

    2016-01-01

    Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case. PMID:27528865

  2. Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode.

    PubMed

    Zhou, Kang; He, Shiwei; Song, Rui

    2016-01-01

    Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case. PMID:27528865

  3. Collective network routing

    DOEpatents

    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.

  4. Route based forecasting

    NASA Astrophysics Data System (ADS)

    Zuurendonk, I. W.; Wokke, M. J. J.

    2009-09-01

    Road surface temperatures can differ several degrees on a very short distance due to local effects. In order to get more insight in the local temperature differences and to develop safer gritting routes, Meteogroup has developed a system for route based temperature forecasting. The standard version of the road model is addressed to forecast road surface temperature and condition for a specific location. This model consists of two parts. First a physical part, based on the energy balance equations. The second part of the model performs a statistical correction on the calculated physical road surface temperature. The road model is able to create a forecast for one specific location. From infrared measurements, we know that large local differences in road surface temperature exist on a route. Differences can be up to 5 degrees Celsius over a distance of several hundreds of meters. Based on those measurements, the idea came up to develop a system that forecasts road surface temperature and condition for an entire route: route based forecasting. The route is split up in sections with equal properties. For each section a temperature and condition will be calculated. The main factors that influence the road surface temperature are modelled in this forecasting system: •The local weather conditions: temperature, dew point temperature, wind, precipitation, weather type, cloudiness. •The sky view: A very sheltered place will receive less radiation during daytime and emit less radiation during nighttime. For a very open spot, the effects are reversed. •The solar view: A road section with trees on the southern side, will receive less solar radiation during daytime than a section with tress on the southern side. The route based forecast shows by means of a clear Google Maps presentation which sections will be slippery at what time of the coming night. The final goal of this type of forecast, is to make dynamical gritting possible: a variable salt amount and a different

  5. Electric vehicles

    SciTech Connect

    Not Available

    1990-03-01

    Quiet, clean, and efficient, electric vehicles (EVs) may someday become a practical mode of transportation for the general public. Electric vehicles can provide many advantages for the nation's environment and energy supply because they run on electricity, which can be produced from many sources of energy such as coal, natural gas, uranium, and hydropower. These vehicles offer fuel versatility to the transportation sector, which depends almost solely on oil for its energy needs. Electric vehicles are any mode of transportation operated by a motor that receives electricity from a battery or fuel cell. EVs come in all shapes and sizes and may be used for different tasks. Some EVs are small and simple, such as golf carts and electric wheel chairs. Others are larger and more complex, such as automobile and vans. Some EVs, such as fork lifts, are used in industries. In this fact sheet, we will discuss mostly automobiles and vans. There are also variations on electric vehicles, such as hybrid vehicles and solar-powered vehicles. Hybrid vehicles use electricity as their primary source of energy, however, they also use a backup source of energy, such as gasoline, methanol or ethanol. Solar-powered vehicles are electric vehicles that use photovoltaic cells (cells that convert solar energy to electricity) rather than utility-supplied electricity to recharge the batteries. This paper discusses these concepts.

  6. Submarine cable route survey

    SciTech Connect

    Herrouin, G.; Scuiller, T.

    1995-12-31

    The growth of telecommunication market is very significant. From the beginning of the nineties, more and more the use of optical fiber submarine cables is privileged to that of satellites. These submarine telecommunication highways require accurate surveys in order to select the optimum route and determine the cable characteristics. Advanced technology tools used for these surveys are presented along with their implementation.

  7. Hydrologic Flood Routing.

    ERIC Educational Resources Information Center

    Heggen, Richard J.

    1982-01-01

    Discusses a short classroom-based BASIC program which routes stream flow through a system of channels and reservoirs. The program is suitable for analyses of open channel conveyance systems, flood detention reservoirs, and combinations of the two. (Author/JN)

  8. Adaptive powertrain control for plugin hybrid electric vehicles

    DOEpatents

    Kedar-Dongarkar, Gurunath; Weslati, Feisel

    2013-10-15

    A powertrain control system for a plugin hybrid electric vehicle. The system comprises an adaptive charge sustaining controller; at least one internal data source connected to the adaptive charge sustaining controller; and a memory connected to the adaptive charge sustaining controller for storing data generated by the at least one internal data source. The adaptive charge sustaining controller is operable to select an operating mode of the vehicle's powertrain along a given route based on programming generated from data stored in the memory associated with that route. Further described is a method of adaptively controlling operation of a plugin hybrid electric vehicle powertrain comprising identifying a route being traveled, activating stored adaptive charge sustaining mode programming for the identified route and controlling operation of the powertrain along the identified route by selecting from a plurality of operational modes based on the stored adaptive charge sustaining mode programming.

  9. Weather routing in long-distance Mediterranean routes

    NASA Astrophysics Data System (ADS)

    Delitala, A. M. S.; Gallino, S.; Villa, L.; Lagouvardos, K.; Drago, A.

    2010-10-01

    The selection of ship routes based on modern weather forecasting is a mean of computing optimum shipping routes thereby increasing safety and comfort at sea, cutting down on transit time, and reducing fuel consumption. Further empirical research in the effectiveness of modern weather routing applications is required especially in applications concerning shorter routes in enclosed seas of limited geographical extent such as the Mediterranean Sea. The present study used two climatological simulations to test this state-of-the-art approach to ship routing. Simulations represented two theoretical routes: (1) a route between Italy and Greece and (2) a route between Cyprus and Italy. Both routes were analyzed across varying simulated climatic conditions and the results were compared with those of control routes. Furthermore, results were analyzed in terms of passenger and crew comfort, bunker consumption by ships, and time of crossing. The first simulation showed that weather routing would improve ship performance on 37% of days while the second simulation revealed that weather routing would support ship captains virtually all the time.

  10. Masked Proportional Routing

    NASA Technical Reports Server (NTRS)

    Wolpert, David

    2004-01-01

    Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an

  11. 36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 36 Parks, Forests, and Public Property 3 2013-07-01 2012-07-01 true Travel on Presidio Trust roads... VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following...

  12. Connectivity-enhanced route selection and adaptive control for the Chevrolet Volt

    DOE PAGESBeta

    Gonder, Jeffrey; Wood, Eric; Rajagopalan, Sai

    2016-01-01

    The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3%, respectively. Furthermore, these represent substantial opportunities considering that they only require software adjustments to implement.

  13. Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

    SciTech Connect

    Gonder, J.; Wood, E.; Rajagopalan, S.

    2014-09-01

    The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

  14. Descent vehicles

    NASA Technical Reports Server (NTRS)

    Popov, Y. I.

    1985-01-01

    The creation of descent vehicles marked a new stage in the development of cosmonautics, involving the beginning of manned space flight and substantial progress in space research on the distant bodies of the Solar System. This booklet describes these vehicles and their structures, systems, and purposes. It is intended for the general public interested in modern problems of space technology.

  15. Vehicle systems

    NASA Technical Reports Server (NTRS)

    Bales, Tom; Modlin, Tom; Suddreth, Jack; Wheeler, Tom; Tenney, Darrel R.; Bayless, Ernest O.; Lisagor, W. Barry; Bolstad, Donald A.; Croop, Harold; Dyer, J.

    1993-01-01

    Perspectives of the subpanel on expendable launch vehicle structures and cryotanks are: (1) new materials which provide the primary weight savings effect on vehicle mass/size; (2) today's investment; (3) typically 10-20 years to mature and fully characterize new materials.

  16. Risk-cost-benefit analysis for transportation corridors with interval uncertainties of heterogeneous data.

    PubMed

    Xu, Junrui; Lambert, James H

    2015-04-01

    Access management, which systematically limits opportunities for egress and ingress of vehicles to highway lanes, is critical to protect trillions of dollars of current investment in transportation. This article addresses allocating resources for access management with incomplete and partially relevant data on crash rates, travel speeds, and other factors. While access management can be effective to avoid crashes, reduce travel times, and increase route capacities, the literature suggests a need for performance metrics to guide investments in resource allocation across large corridor networks and several time horizons. In this article, we describe a quantitative decision model to support an access management program via risk-cost-benefit analysis under data uncertainties from diverse sources of data and expertise. The approach quantifies potential benefits, including safety improvement and travel time savings, and costs of access management through functional relationships of input parameters including crash rates, corridor access point densities, and traffic volumes. Parameter uncertainties, which vary across locales and experts, are addressed via numerical interval analyses. This approach is demonstrated at several geographic scales across 7,000 kilometers of highways in a geographic region and several subregions. The demonstration prioritizes route segments that would benefit from risk management, including (i) additional data or elicitation, (ii) right-of-way purchases, (iii) restriction or closing of access points, (iv) new alignments, (v) developer proffers, and (vi) etc. The approach ought to be of wide interest to analysts, planners, policymakers, and stakeholders who rely on heterogeneous data and expertise for risk management. PMID:24924626

  17. Neighboring and Connectivity-Aware Routing in VANETs

    PubMed Central

    Koo, Insoo

    2014-01-01

    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. PMID:24982996

  18. Neighboring and connectivity-aware routing in VANETs.

    PubMed

    Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

    2014-01-01

    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. PMID:24982996

  19. Robustness of airline route networks

    NASA Astrophysics Data System (ADS)

    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.

  20. Space vehicle

    NASA Technical Reports Server (NTRS)

    Vonpragenau, G. L. (Inventor)

    1975-01-01

    A space vehicle having an improved ascent configuration for use in traveling in space is presented. Components of the vehicle are: (1) a winged orbiter having an elongater fuselage and rearwardly directed main engines fixed to the fuselage; (2) an elongated tank assembly of an improved configuration disposed forwardly of the fuselage and connected with the main engines of the vehicle for supplying liquid propellants; and (3) a booster stage comprising a pair of integrated solid rocket boosters connected with the orbiter immediately beneath the fuselage and extended in substantial parallelism.

  1. 40 CFR 1037.610 - Vehicles with innovative technologies.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... CFR 86.1866. However, we will generally not seek public comment on credits or adjustments based on A... section for CO2 emission reductions resulting from vehicle technologies that were not in common use with... whether the grade is representative. (3) The vehicle speed over the route must be representative of...

  2. 40 CFR 1037.610 - Vehicles with innovative technologies.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... CFR 86.1866. However, we will generally not seek public comment on credits or adjustments based on A... section for CO2 emission reductions resulting from vehicle technologies that were not in common use with... whether the grade is representative. (3) The vehicle speed over the route must be representative of...

  3. 40 CFR 1037.610 - Vehicles with innovative technologies.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... CFR 86.1866. However, we will generally not seek public comment on credits or adjustments based on A... section for CO2 emission reductions resulting from vehicle technologies that were not in common use with... whether the grade is representative. (3) The vehicle speed over the route must be representative of...

  4. Robotic vehicle

    DOEpatents

    Box, W.D.

    1998-08-11

    A robotic vehicle is described for travel through a conduit. The robotic vehicle includes forward and rear housings each having a hub portion, and each being provided with surface engaging mechanisms for selectively engaging the walls of the conduit such that the housings can be selectively held in stationary positions within the conduit. The surface engaging mechanisms of each housing includes a plurality of extendible appendages, each of which is radially extendible relative to the operatively associated hub portion between a retracted position and a radially extended position. The robotic vehicle also includes at least three selectively extendible members extending between the forward and rear housings, for selectively changing the distance between the forward and rear housings to effect movement of the robotic vehicle. 20 figs.

  5. Robotic vehicle

    DOEpatents

    Box, W.D.

    1997-02-11

    A robotic vehicle is described for travel through a conduit. The robotic vehicle includes forward and rear housings each having a hub portion, and each being provided with surface engaging mechanisms for selectively engaging the walls of the conduit such that the housings can be selectively held in stationary positions within the conduit. The surface engaging mechanisms of each housing includes a plurality of extendable appendages, each of which is radially extendable relative to the operatively associated hub portion between a retracted position and a radially extended position. The robotic vehicle also includes at least three selectively extendable members extending between the forward and rear housings, for selectively changing the distance between the forward and rear housings to effect movement of the robotic vehicle. 20 figs.

  6. Robotic vehicle

    DOEpatents

    Box, W. Donald

    1998-01-01

    A robotic vehicle for travel through a conduit. The robotic vehicle includes forward and rear housings each having a hub portion, and each being provided with surface engaging mechanisms for selectively engaging the walls of the conduit such that the housings can be selectively held in stationary positions within the conduit. The surface engaging mechanisms of each housing includes a plurality of extendable appendages, each of which is radially extendable relative to the operatively associated hub portion between a retracted position and a radially extended position. The robotic vehicle also includes at least three selectively extendable members extending between the forward and rear housings, for selectively changing the distance between the forward and rear housings to effect movement of the robotic vehicle.

  7. Robotic vehicle

    DOEpatents

    Box, W. Donald

    1997-01-01

    A robotic vehicle for travel through a conduit. The robotic vehicle includes forward and rear housings each having a hub portion, and each being provided with surface engaging mechanisms for selectively engaging the walls of the conduit such that the housings can be selectively held in stationary positions within the conduit. The surface engaging mechanisms of each housing includes a plurality of extendable appendages, each of which is radially extendable relative to the operatively associated hub portion between a retracted position and a radially extended position. The robotic vehicle also includes at least three selectively extendable members extending between the forward and rear housings, for selectively changing the distance between the forward and rear housings to effect movement of the robotic vehicle.

  8. VHDL Control Routing Simulator

    SciTech Connect

    Venard, J.

    1995-07-10

    The control router simulates a backplane consisting of up to 16 slot. Slot 0, reserved for a control module (cr-ctrl), generates the system clocks and provides the serial interface to the Gating Logic. The remaining 15 slots (1-15) contain routing modules (cr mod), each having up to 64 serial inputs and outputs with FIFOs. Messages to be transmitted to the Control Router are taken from text files. There are currently 17 such source files. In the model, the serial output of each source is connected to multiple receivers, so that there are 8 identical messages transmitted to the router for each message file entry.

  9. Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles.

    PubMed

    Wan, Jiafu; Liu, Jianqi; Shao, Zehui; Vasilakos, Athanasios V; Imran, Muhammad; Zhou, Keliang

    2016-01-01

    The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction. PMID:26761013

  10. Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles

    PubMed Central

    Wan, Jiafu; Liu, Jianqi; Shao, Zehui; Vasilakos, Athanasios V.; Imran, Muhammad; Zhou, Keliang

    2016-01-01

    The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction. PMID:26761013

  11. Heterogenization of Homogeneous Catalysts: the Effect of the Support

    SciTech Connect

    Earl, W.L.; Ott, K.C.; Hall, K.A.; de Rege, F.M.; Morita, D.K.; Tumas, W.; Brown, G.H.; Broene, R.D.

    1999-06-29

    We have studied the influence of placing a soluble, homogeneous catalyst onto a solid support. We determined that such a 'heterogenized' homogeneous catalyst can have improved activity and selectivity for the asymmetric hydrogenation of enamides to amino acid derivatives. The route of heterogenization of RhDuPhos(COD){sup +} cations occurs via electrostatic interactions with anions that are capable of strong hydrogen bonding to silica surfaces. This is a novel approach to supported catalysis. Supported RhDuPhos(COD){sup +} is a recyclable, non-leaching catalyst in non-polar media. This is one of the few heterogenized catalysts that exhibits improved catalytic performance as compared to its homogeneous analog.

  12. New Routing Metrics for ADHOC Network Routing Protocols

    NASA Astrophysics Data System (ADS)

    Reddy, P. C.

    2014-12-01

    The performance and reliability of Internet is measured using different quantities. When the quantities measured are essential and have wide range of acceptance then they are called metrics. Performance metrics enable comparison and selection among the alternatives. In computer networks, metrics are used to evaluate an application, protocol etc. Routing in adhoc networks is nontrivial. Routing protocols for adhoc networks are still evolving and there is need for continuous evaluation of them. In the literature existing, several routing protocols are evaluated using standard metrics under different conditions. This paper proposes new metrics for evaluation of routing protocols and uses them to evaluate the adhoc network routing protocols AODV, DSR, DSDV and TORA. Simulation environment is created using NS-2 simulator. Typical range of speeds, pause times and data rates are used. The results provide new insights in to the working of the routing protocols.

  13. Routing Protocol of Sparse Urban Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Li, Huxiong

    Vehicular ad hoc network (VANET) is an application of mobile ad hoc technology in transportation systems, it has become an important part of ITS. Since multi-hop link is hard to set up in sparse VANET, a traffic-aware routing (TAR) protocol is proposed which estimates vehicle average neighbors (VAN) of roads by exchanging beacon messages between encounter vehicles. Road with high VAN is preferred to be selected as part of forwarding path at intersection. Packets are forwarded to the next intersection in road in a greedy manner. Simulations show that TAR outperforms the compared protocols in terms of both packet delivery ratio and average end-to-end delay.

  14. Stop_times based Routing Protocol for VANET

    NASA Astrophysics Data System (ADS)

    Moawad, Hafez; Shaaban, Eman; Taha Fayed, Zaki

    2013-11-01

    Vehicular Ad hoc Network (VANET) is a special class of Mobile Ad hoc Network (MANET) where vehicles are considered as MANET nodes with wireless links. The key difference of VANET and MANET is the special mobility pattern and rapidly changeable topology. There has been significant interest in improving safety and traffic efficiency using VANET. The design of routing protocols in VANET is important and necessary issue for support the smart ITS. Existing routing protocols of MANET are not suitable for VANET. AOMDV is the most important on demand multipath routing protocol. This paper proposes SSD-AOMDV as VANET routing protocol. SSD-AOMDV improves AOMDV to suit VANET characteristics. SSD-AOMDV adds the mobility parameters: Stop_times, Speed and Direction to hop count as new AOMDV routing metric to select next hop during the route discovery phase. Stop_times metric is added to simulate buses mobility pattern and traffic lights at intersections. Simulation results show that SSD-AOMDV achieves better performance compared to AOMDV.

  15. Autonomous vehicles

    SciTech Connect

    Meyrowitz, A.L.; Blidberg, D.R.; Michelson, R.C. |

    1996-08-01

    There are various kinds of autonomous vehicles (AV`s) which can operate with varying levels of autonomy. This paper is concerned with underwater, ground, and aerial vehicles operating in a fully autonomous (nonteleoperated) mode. Further, this paper deals with AV`s as a special kind of device, rather than full-scale manned vehicles operating unmanned. The distinction is one in which the AV is likely to be designed for autonomous operation rather than being adapted for it as would be the case for manned vehicles. The authors provide a survey of the technological progress that has been made in AV`s, the current research issues and approaches that are continuing that progress, and the applications which motivate this work. It should be noted that issues of control are pervasive regardless of the kind of AV being considered, but that there are special considerations in the design and operation of AV`s depending on whether the focus is on vehicles underwater, on the ground, or in the air. The authors have separated the discussion into sections treating each of these categories.

  16. Bio-inspired UAV routing, source localization, and acoustic signature classification for persistent surveillance

    NASA Astrophysics Data System (ADS)

    Burman, Jerry; Hespanha, Joao; Madhow, Upamanyu; Pham, Tien

    2011-06-01

    A team consisting of Teledyne Scientific Company, the University of California at Santa Barbara and the Army Research Laboratory* is developing technologies in support of automated data exfiltration from heterogeneous battlefield sensor networks to enhance situational awareness for dismounts and command echelons. Unmanned aerial vehicles (UAV) provide an effective means to autonomously collect data from a sparse network of unattended ground sensors (UGSs) that cannot communicate with each other. UAVs are used to reduce the system reaction time by generating autonomous collection routes that are data-driven. Bio-inspired techniques for search provide a novel strategy to detect, capture and fuse data. A fast and accurate method has been developed to localize an event by fusing data from a sparse number of UGSs. This technique uses a bio-inspired algorithm based on chemotaxis or the motion of bacteria seeking nutrients in their environment. A unique acoustic event classification algorithm was also developed based on using swarm optimization. Additional studies addressed the problem of routing multiple UAVs, optimally placing sensors in the field and locating the source of gunfire at helicopters. A field test was conducted in November of 2009 at Camp Roberts, CA. The field test results showed that a system controlled by bio-inspired software algorithms can autonomously detect and locate the source of an acoustic event with very high accuracy and visually verify the event. In nine independent test runs of a UAV, the system autonomously located the position of an explosion nine times with an average accuracy of 3 meters. The time required to perform source localization using the UAV was on the order of a few minutes based on UAV flight times. In June 2011, additional field tests of the system will be performed and will include multiple acoustic events, optimal sensor placement based on acoustic phenomenology and the use of the International Technology Alliance (ITA

  17. 36 CFR 13.1109 - Off-road vehicle use in Glacier Bay National Preserve.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 36 Parks, Forests, and Public Property 1 2014-07-01 2014-07-01 false Off-road vehicle use in... National Park and Preserve Administrative Provisions § 13.1109 Off-road vehicle use in Glacier Bay National Preserve. The use of off-road vehicles is authorized only on designated routes and areas in Glacier...

  18. 36 CFR 13.1109 - Off-road vehicle use in Glacier Bay National Preserve.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 36 Parks, Forests, and Public Property 1 2013-07-01 2013-07-01 false Off-road vehicle use in... National Park and Preserve Administrative Provisions § 13.1109 Off-road vehicle use in Glacier Bay National Preserve. The use of off-road vehicles is authorized only on designated routes and areas in Glacier...

  19. 36 CFR 13.1109 - Off-road vehicle use in Glacier Bay National Preserve.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Off-road vehicle use in... National Park and Preserve Administrative Provisions § 13.1109 Off-road vehicle use in Glacier Bay National Preserve. The use of off-road vehicles is authorized only on designated routes and areas in Glacier...

  20. 36 CFR 13.1109 - Off-road vehicle use in Glacier Bay National Preserve.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 36 Parks, Forests, and Public Property 1 2012-07-01 2012-07-01 false Off-road vehicle use in... National Park and Preserve Administrative Provisions § 13.1109 Off-road vehicle use in Glacier Bay National Preserve. The use of off-road vehicles is authorized only on designated routes and areas in Glacier...

  1. 36 CFR 13.1109 - Off-road vehicle use in Glacier Bay National Preserve.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 36 Parks, Forests, and Public Property 1 2011-07-01 2011-07-01 false Off-road vehicle use in... National Park and Preserve Administrative Provisions § 13.1109 Off-road vehicle use in Glacier Bay National Preserve. The use of off-road vehicles is authorized only on designated routes and areas in Glacier...

  2. Route Type Determination Analysis

    SciTech Connect

    Brett Stone

    2011-09-01

    According to the 2009 National Household Travel Survey 44.4 percent of all miles travelled by Americans in 2009 (including airplanes, trains, boats, golf carts, subways, bikes, etc.) were travelled in cars. If vans, SUV's and pickup trucks are included, that level increases to 86 percent. We do a lot of travelling on the road in personal vehicles - it's important to be able to understand how we get there and how to rate the fuel economy of our trips. An essential part of this is knowing how to decide if a trip is a city or highway trip.

  3. VHDL Control Routing Simulator

    Energy Science and Technology Software Center (ESTSC)

    1995-07-10

    The control router simulates a backplane consisting of up to 16 slot. Slot 0, reserved for a control module (cr-ctrl), generates the system clocks and provides the serial interface to the Gating Logic. The remaining 15 slots (1-15) contain routing modules (cr mod), each having up to 64 serial inputs and outputs with FIFOs. Messages to be transmitted to the Control Router are taken from text files. There are currently 17 such source files. Inmore » the model, the serial output of each source is connected to multiple receivers, so that there are 8 identical messages transmitted to the router for each message file entry.« less

  4. Airborne change detection system for the detection of route mines

    NASA Astrophysics Data System (ADS)

    Donzelli, Thomas P.; Jackson, Larry; Yeshnik, Mark; Petty, Thomas E.

    2003-09-01

    The US Army is interested in technologies that will enable it to maintain the free flow of traffic along routes such as Main Supply Routes (MSRs). Mines emplaced in the road by enemy forces under cover of darkness represent a major threat to maintaining a rapid Operational Tempo (OPTEMPO) along such routes. One technique that shows promise for detecting enemy mining activity is Airborne Change Detection, which allows an operator to detect suspicious day-to-day changes in and around the road that may be indicative of enemy mining. This paper presents an Airborne Change Detection that is currently under development at the US Army Night Vision and Electronic Sensors Directorate (NVESD). The system has been tested using a longwave infrared (LWIR) sensor on a vertical take-off and landing unmanned aerial vehicle (VTOL UAV) and a midwave infrared (MWIR) sensor on a fixed wing aircraft. The system is described and results of the various tests conducted to date are presented.

  5. 19 CFR 123.8 - Permit or special license to unlade or lade a vessel or vehicle.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS RELATIONS WITH CANADA AND MEXICO General Provisions... vessel of less than 5 net tons arriving from Canada or Mexico by any route, or from a vehicle, permission... vehicle arriving from or departing for Canada or Mexico by any route at night, on a Sunday or holiday,...

  6. 19 CFR 123.8 - Permit or special license to unlade or lade a vessel or vehicle.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CBP RELATIONS WITH CANADA AND MEXICO General Provisions § 123... less than 5 net tons arriving from Canada or Mexico by any route, or from a vehicle, permission to... vehicle arriving from or departing for Canada or Mexico by any route at night, on a Sunday or holiday,...

  7. Phenotypically heterogeneous populations in spatially heterogeneous environments

    NASA Astrophysics Data System (ADS)

    Patra, Pintu; Klumpp, Stefan

    2014-03-01

    The spatial expansion of a population in a nonuniform environment may benefit from phenotypic heterogeneity with interconverting subpopulations using different survival strategies. We analyze the crossing of an antibiotic-containing environment by a bacterial population consisting of rapidly growing normal cells and slow-growing, but antibiotic-tolerant persister cells. The dynamics of crossing is characterized by mean first arrival times and is found to be surprisingly complex. It displays three distinct regimes with different scaling behavior that can be understood based on an analytical approximation. Our results suggest that a phenotypically heterogeneous population has a fitness advantage in nonuniform environments and can spread more rapidly than a homogeneous population.

  8. Patterns of Emphysema Heterogeneity

    PubMed Central

    Valipour, Arschang; Shah, Pallav L.; Gesierich, Wolfgang; Eberhardt, Ralf; Snell, Greg; Strange, Charlie; Barry, Robert; Gupta, Avina; Henne, Erik; Bandyopadhyay, Sourish; Raffy, Philippe; Yin, Youbing; Tschirren, Juerg; Herth, Felix J.F.

    2016-01-01

    Background Although lobar patterns of emphysema heterogeneity are indicative of optimal target sites for lung volume reduction (LVR) strategies, the presence of segmental, or sublobar, heterogeneity is often underappreciated. Objective The aim of this study was to understand lobar and segmental patterns of emphysema heterogeneity, which may more precisely indicate optimal target sites for LVR procedures. Methods Patterns of emphysema heterogeneity were evaluated in a representative cohort of 150 severe (GOLD stage III/IV) chronic obstructive pulmonary disease (COPD) patients from the COPDGene study. High-resolution computerized tomography analysis software was used to measure tissue destruction throughout the lungs to compute heterogeneity (≥ 15% difference in tissue destruction) between (inter-) and within (intra-) lobes for each patient. Emphysema tissue destruction was characterized segmentally to define patterns of heterogeneity. Results Segmental tissue destruction revealed interlobar heterogeneity in the left lung (57%) and right lung (52%). Intralobar heterogeneity was observed in at least one lobe of all patients. No patient presented true homogeneity at a segmental level. There was true homogeneity across both lungs in 3% of the cohort when defining heterogeneity as ≥ 30% difference in tissue destruction. Conclusion Many LVR technologies for treatment of emphysema have focused on interlobar heterogeneity and target an entire lobe per procedure. Our observations suggest that a high proportion of patients with emphysema are affected by interlobar as well as intralobar heterogeneity. These findings prompt the need for a segmental approach to LVR in the majority of patients to treat only the most diseased segments and preserve healthier ones. PMID:26430783

  9. Robotic vehicle

    DOEpatents

    Box, W. Donald

    1996-01-01

    A robotic vehicle (10) for travel through an enclosed or partially enclosed conduit or pipe including vertical and/or horizontal conduit or pipe. The robotic vehicle (10) comprises forward and rear housings (32 and 12) each provided with a surface engaging mechanism for selectively engaging the walls of the conduit through which the vehicle is travelling, whereby the housings (32 and 12) are selectively held in a stationary position within the conduit. The vehicle (10) also includes at least three selectively extendable members (46), each of which defines a cavity (56) therein. The forward end portion (50) of each extendable member (46) is secured to the forward housing (32) and the rear end portion (48) of each housing is secured to the rear housing (12). Each of the extendable members (46) is independently extendable from a retracted position to an extended position upon the injection of a gas under pressure into the cavity (56) of the extendable member such that the distance between the forward housing (32 ) and the rear housing (12) can be selectively increased. Further, each of the extendable members (46) is independently retractable from the extended position to the retracted position upon the application of a vacuum to the cavity (56) of the extendable member (46) such that the distance between the forward housing (32) and the rear housing (12) can be selectively decreased.

  10. Robotic vehicle

    DOEpatents

    Box, W. Donald

    1994-01-01

    A robotic vehicle (10) for travel through an enclosed or partially enclosed conduit or pipe including vertical and/or horizontal conduit or pipe. The robotic vehicle (10) comprises forward and rear housings (32 and 12) each provided with a surface engaging mechanism for selectively engaging the walls of the conduit through which the vehicle is travelling, whereby the housings (32 and 12) are selectively held in a stationary position within the conduit. The vehicle (10) also includes at least three selectively extendable members (46), each of which defines a cavity (56) therein. The forward end portion (50) of each extendable member (46) is secured to the forward housing (32) and the rear end portion (48) of each housing is secured to the rear housing (12). Each of the extendable members (46) is independently extendable from a retracted position to an extended position upon the injection of a gas under pressure into the cavity (56) of the extendable member such that the distance between the forward housing (32 ) and the rear housing (12) can be selectively increased. Further, each of the extendable members (46) is independently retractable from the extended position to the retracted position upon the application of a vacuum to the cavity (56) of the extendable member (46) such that the distance between the forward housing (32) and the rear housing (12) can be selectively decreased.

  11. Robotic vehicle

    DOEpatents

    Box, W.D.

    1994-03-15

    A robotic vehicle is described for travel through an enclosed or partially enclosed conduit or pipe including vertical and/or horizontal conduit or pipe. The robotic vehicle comprises forward and rear housings each provided with a surface engaging mechanism for selectively engaging the walls of the conduit through which the vehicle is travelling, whereby the housings are selectively held in a stationary position within the conduit. The vehicle also includes at least three selectively extendable members, each of which defines a cavity therein. The forward end portion of each extendable member is secured to the forward housing and the rear end portion of each housing is secured to the rear housing. Each of the extendable members is independently extendable from a retracted position to an extended position upon the injection of a gas under pressure into the cavity of the extendable member such that the distance between the forward housing and the rear housing can be selectively increased. Further, each of the extendable members is independently retractable from the extended position to the retracted position upon the application of a vacuum to the cavity of the extendable member such that the distance between the forward housing and the rear housing can be selectively decreased. 11 figures.

  12. Robotic vehicle

    DOEpatents

    Box, W.D.

    1996-03-12

    A robotic vehicle is described for travel through an enclosed or partially enclosed conduit or pipe including vertical and/or horizontal conduit or pipe. The robotic vehicle comprises forward and rear housings each provided with a surface engaging mechanism for selectively engaging the walls of the conduit through which the vehicle is travelling, whereby the housings are selectively held in a stationary position within the conduit. The vehicle also includes at least three selectively extendable members, each of which defines a cavity therein. The forward end portion of each extendable member is secured to the forward housing and the rear end portion of each housing is secured to the rear housing. Each of the extendable members is independently extendable from a retracted position to an extended position upon the injection of a gas under pressure into the cavity of the extendable member such that the distance between the forward housing and the rear housing can be selectively increased. Further, each of the extendable members is independently retractable from the extended position to the retracted position upon the application of a vacuum to the cavity of the extendable member such that the distance between the forward housing and the rear housing can be selectively decreased. 14 figs.

  13. Modelling Routes towards Learning Goals

    ERIC Educational Resources Information Center

    Tattersall, Colin; Janssen, Jose; van den Berg, Bert; Koper, Rob

    2006-01-01

    Purpose: This paper aims to define the need for a route modelling language in e-learning, identifying requirements and candidate languages, before providing a recommended approach. Design/methodology/approach: Several sources of requirements are drawn from the literature then used to review available approaches to route modelling. The best…

  14. Producing gestures facilitates route learning.

    PubMed

    So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

    2014-01-01

    The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

  15. Dynamic Message Routing Using Processes

    NASA Astrophysics Data System (ADS)

    Scheibler, Thorsten; Karastoyanova, Dimka; Leymann, Frank

    The Enterprise Service Bus (ESB) is composable middleware that provides applications with services such as message routing and transformation, service composition, dynamic discovery, transactional support, coordination, security features, and others. In an ESB supporting SOAP message exchange, routing algorithms typically follow the sequential SOAP message processing model, where SOAP headers are the main artefacts used to specify the message route and the processing of the payload by intermediaries along that route. This model supports neither alternative nor parallel message routes. In the case of a failing intermediary node this leads to a failure in the message delivery. Moreover, the execution order of services on SOAP message payloads at the intermediaries cannot be prescribed. In this paper, we demonstrate how these deficiencies of the SOAP message processing model can be addressed. We introduce an approach that allows for specifying SOAP message routing logic in terms of BPEL processes. We show that parallel and alternative routes for SOAP messages can be modelled and executed, and the order of services that process a message at intermediaries can be predefined to accommodate the correct processing sequence as required by the concrete application domain. Features like dynamic discovery of services and flexible service composition are leveraged to enable flexible SOAP message routing.

  16. [Alternative routes for insulin administration].

    PubMed

    Lassmann-Vague, V

    1994-01-01

    Ideally, insulin administration should be done through portal route, with a precise kinetic. It should also lead to a reproducible biologic effect, with minimal side-effects and be acceptable for the majority of diabetic patients. Many alternative routes of insulin administration try to fulfill one or more of these criteria. Intraperitoneal route is already used with implantable pumps. It has proven safety and metabolic efficacy, particularly upon the reduction of severe hypoglycaemia. Nasal route could provide a rapid kinetic, but its long-term utilisation depends on improvement of bioavailability and studies of local toxicity. Results concerning intrabronchic insulin seem promising, but are still preliminary. In the future, the choice among these alternative routes of insulin administration will be guided by the development of a closed-loop system. PMID:8001707

  17. Tumour Cell Heterogeneity

    PubMed Central

    Gay, Laura; Baker, Ann-Marie; Graham, Trevor A.

    2016-01-01

    The population of cells that make up a cancer are manifestly heterogeneous at the genetic, epigenetic, and phenotypic levels. In this mini-review, we summarise the extent of intra-tumour heterogeneity (ITH) across human malignancies, review the mechanisms that are responsible for generating and maintaining ITH, and discuss the ramifications and opportunities that ITH presents for cancer prognostication and treatment. PMID:26973786

  18. Past tense route priming.

    PubMed

    Cohen-Shikora, Emily R; Balota, David A

    2013-03-01

    The present research examined whether lexical (whole word) or more rule-based (morphological constituent) processes can be locally biased by experimental list context in past tense verb inflection. In Experiment 1, younger and older adults completed a past tense inflection task in which list context was manipulated across blocks containing regular past tense verbs (e.g. REACH-REACHED) or irregular past tense verbs (TEACH-TAUGHT). Critical targets, consisting of half regular and half irregular verbs, were embedded within blocks and participants' inflection response latency and accuracy were assessed. The results yielded a cross-over interaction in response latencies for both young and older adults. In the regular context there was a robust regularity effect: regular target verbs were conjugated faster than irregular target verbs. In contrast, in the irregular context, irregular target verbs were conjugated faster than regular target verbs. Experiment 2 used the same targets but in the context of either standard nonwords or nonwords ending in "-ED" to test the possibility of a phonological basis for the effect. The effect of context was eliminated. The results support the notion that distinct processes in past tense verb production can be locally biased by list context and, as shown in Experiment 2, this route priming effect was not due to phonological priming. PMID:23291293

  19. Synthesis of RNA oligomers on heterogeneous templates

    NASA Technical Reports Server (NTRS)

    Ertem, G.; Ferris, J. P.

    1996-01-01

    The concept of an RNA world in the chemical origin of life is appealing, as nucleic acids are capable of both information storage and acting as templates that catalyse the synthesis of complementary molecules. Template-directed synthesis has been demonstrated for homogeneous oligonucleotides that, like natural nucleic acids, have 3',5' linkages between the nucleotide monomers. But it seems likely that prebiotic routes to RNA-like molecules would have produced heterogeneous molecules with various kinds of phosphodiester linkages and both linear and cyclic nucleotide chains. Here we show that such heterogeneity need be no obstacle to the templating of complementary molecules. Specifically, we show that heterogeneous oligocytidylates, formed by the montmorillonite clay-catalysed condensation of actuated monomers, can serve as templates for the synthesis of oligoguanylates. Furthermore, we show that oligocytidylates that are exclusively 2',5'-linked can also direct synthesis of oligoguanylates. Such heterogeneous templating reactions could have increased the diversity of the pool of protonucleic acids from which life ultimately emerged.

  20. Noninvasive Routes of Proteins and Peptides Drug Delivery

    PubMed Central

    Jitendra; Sharma, P. K.; Bansal, Sumedha; Banik, Arunabha

    2011-01-01

    Recent advances in the field of pharmaceutical biotechnology have led to the formulation of many protein and peptide-based drugs for therapeutic and clinical application. The route of administration has a significant impact on the therapeutic outcome of a drug. The needle and syringe is a well established choice of protein and peptide delivery which has some drawback related to patient and to formulation such as pain, cost, sterility etc. Thus, the noninvasive routes which were of minor importance as parts of drug delivery in the past have assumed added importance in protein and peptide drug delivery and these include nasal, ophthalmic, buccal, vaginal, transdermal and pulmonary routes. The pharmaceutical scientists have some approaches to develop the formulations for protein and peptide delivery by noninvasive routes. But, due to the physiochemical instability and enzymatic barrier of proteins and peptides there are several hurdle to develop suitable formulation. So there is need of penetration enhancers, enzyme inhibitors and suitable vehicles for noninvasive delivery to increase the bioavailability. In this review, the aim is to focus on the approaches to formulation of protein and peptide based drug administration by noninvasive route. PMID:22707818

  1. Impacts of SOC on car-following behavior and travel time in the heterogeneous traffic system

    NASA Astrophysics Data System (ADS)

    Tang, Tie-Qiao; Xu, Ke-Wei; Yang, Shi-Chun; Ding, Chuan

    2016-01-01

    Since the SOC (state of charge) of the battery of each electric vehicle directly determines whether the battery should be charged/swapped, the SOC may affect the electric vehicle's driving behavior. In this paper, we introduce the SOC of battery into the electric vehicle's driving behavior model and propose a car-following model for electric vehicles, and then use the proposed model to study the effects of the SOC of battery and battery swap on each vehicle's driving behavior in the heterogeneous traffic system consisting of traditional vehicles and electric vehicles. The numerical results show that the proposed model can reproduce some complex traffic phenomena resulted by the SOC of battery and battery swap and that the influences on each vehicle's driving behavior are directly related to the initial traffic state, the electric vehicle's proportion, and the SOC of battery.

  2. Dynamic performances analysis of a real vehicle driving

    NASA Astrophysics Data System (ADS)

    Abdullah, M. A.; Jamil, J. F.; Salim, M. A.

    2015-12-01

    Vehicle dynamic is the effects of movement of a vehicle generated from the acceleration, braking, ride and handling activities. The dynamic behaviours are determined by the forces from tire, gravity and aerodynamic which acting on the vehicle. This paper emphasizes the analysis of vehicle dynamic performance of a real vehicle. Real driving experiment on the vehicle is conducted to determine the effect of vehicle based on roll, pitch, and yaw, longitudinal, lateral and vertical acceleration. The experiment is done using the accelerometer to record the reading of the vehicle dynamic performance when the vehicle is driven on the road. The experiment starts with weighing a car model to get the center of gravity (COG) to place the accelerometer sensor for data acquisition (DAQ). The COG of the vehicle is determined by using the weight of the vehicle. A rural route is set to launch the experiment and the road conditions are determined for the test. The dynamic performance of the vehicle are depends on the road conditions and driving maneuver. The stability of a vehicle can be controlled by the dynamic performance analysis.

  3. 14 CFR 121.95 - Route width.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ..., FLAG, AND SUPPLEMENTAL OPERATIONS Approval of Routes: Domestic and Flag Operations § 121.95 Route width... routes in the case of certificate holders conducting flag operations) have a width equal to...

  4. Heterogeneous Atmospheric Chemistry

    NASA Astrophysics Data System (ADS)

    Schryer, David R.

    In the past few years it has become increasingly clear that heterogeneous, or multiphase, processes play an important role in the atmosphere. Unfortunately the literature on the subject, although now fairly extensive, is still rather dispersed. Furthermore, much of the expertise regarding heterogeneous processes lies in fields not directly related to atmospheric science. Therefore, it seemed desirable to bring together for an exchange of ideas, information, and methodologies the various atmospheric scientists who are actively studying heterogeneous processes as well as other researchers studying similar processes in the context of other fields.

  5. Reverse flood routing with the inverted Muskingum storage routing scheme

    NASA Astrophysics Data System (ADS)

    Koussis, A. D.; Mazi, K.; Lykoudis, S.; Argiriou, A. A.

    2012-01-01

    This work treats reverse flood routing aiming at signal identification: inflows are inferred from observed outflows by orienting the Muskingum scheme against the wave propagation direction. Routing against the wave propagation is an ill-posed, inverse problem (small errors amplify, leading to large spurious responses); therefore, the reverse solution must be smoothness-constrained towards stability and uniqueness (regularised). Theoretical constrains on the coefficients of the reverse routing scheme assist in error control, but optimal grids are derived by numerical experimentation. Exact solutions of the convection-diffusion equation, for a single and a composite wave, are reverse-routed and in both instances the wave is backtracked well for a range of grid parameters. In the arduous test of a square pulse, the result is comparable to those of more complex methods. Seeding outflow data with random errors enhances instability; to cope with the spurious oscillations, the reversed solution is conditioned by smoothing via low-pass filtering or optimisation. Good-quality inflow hydrographs are recovered with either smoothing treatment, yet the computationally demanding optimisation is superior. Finally, the reverse Muskingum routing method is compared to a reverse-solution method of the St. Venant equations of flood wave motion and is found to perform equally well, at a fraction of the computing effort. This study leads us to conclude that the efficiently attained good inflow identification rests on the simplicity of the Muskingum reverse routing scheme that endows it with numerical robustness.

  6. System and method of vehicle operating condition management

    DOEpatents

    Sujan, Vivek A.; Vajapeyazula, Phani; Follen, Kenneth; Wu, An; Moffett, Barty L.

    2015-10-20

    A vehicle operating condition profile can be determined over a given route while also considering imposed constraints such as deviation from time targets, deviation from maximum governed speed limits, etc. Given current vehicle speed, engine state and transmission state, the present disclosure optimally manages the engine map and transmission to provide a recommended vehicle operating condition that optimizes fuel consumption in transitioning from one vehicle state to a target state. Exemplary embodiments provide for offline and online optimizations relative to fuel consumption. The benefit is increased freight efficiency in transporting cargo from source to destination by minimizing fuel consumption and maintaining drivability.

  7. Distributed Task Offloading in Heterogeneous Vehicular Crowd Sensing.

    PubMed

    Liu, Yazhi; Wang, Wendong; Ma, Yuekun; Yang, Zhigang; Yu, Fuxing

    2016-01-01

    The ability of road vehicles to efficiently execute different sensing tasks varies because of the heterogeneity in their sensing ability and trajectories. Therefore, the data collection sensing task, which requires tempo-spatial sensing data, becomes a serious problem in vehicular sensing systems, particularly those with limited sensing capabilities. A utility-based sensing task decomposition and offloading algorithm is proposed in this paper. The utility function for a task executed by a certain vehicle is built according to the mobility traces and sensing interfaces of the vehicle, as well as the sensing data type and tempo-spatial coverage requirements of the sensing task. Then, the sensing tasks are decomposed and offloaded to neighboring vehicles according to the utilities of the neighboring vehicles to the decomposed sensing tasks. Real trace-driven simulation shows that the proposed task offloading is able to collect much more comprehensive and uniformly distributed sensing data than other algorithms. PMID:27428967

  8. Distributed Task Offloading in Heterogeneous Vehicular Crowd Sensing

    PubMed Central

    Liu, Yazhi; Wang, Wendong; Ma, Yuekun; Yang, Zhigang; Yu, Fuxing

    2016-01-01

    The ability of road vehicles to efficiently execute different sensing tasks varies because of the heterogeneity in their sensing ability and trajectories. Therefore, the data collection sensing task, which requires tempo-spatial sensing data, becomes a serious problem in vehicular sensing systems, particularly those with limited sensing capabilities. A utility-based sensing task decomposition and offloading algorithm is proposed in this paper. The utility function for a task executed by a certain vehicle is built according to the mobility traces and sensing interfaces of the vehicle, as well as the sensing data type and tempo-spatial coverage requirements of the sensing task. Then, the sensing tasks are decomposed and offloaded to neighboring vehicles according to the utilities of the neighboring vehicles to the decomposed sensing tasks. Real trace-driven simulation shows that the proposed task offloading is able to collect much more comprehensive and uniformly distributed sensing data than other algorithms. PMID:27428967

  9. Effect of signals on two-route traffic system with real-time information

    NASA Astrophysics Data System (ADS)

    Tobita, Kazuhiro; Nagatani, Takashi

    2012-12-01

    We study the effect of signals on the vehicular traffic in the two-route system at the tour-time feedback strategy where the vehicles move ahead through a series of signals. The Nagel-Schreckenberg model is applied to the vehicular motion. The traffic signals are controlled by both cycle time and split. The tour times on two routes fluctuate periodically and alternately. The period increases with decreasing the split. Also, the tour time on each route varies with time by synchronizing with the density. The dependences of tour times and densities on both split and cycle time are clarified.

  10. Teaching Heterogeneous Classes.

    ERIC Educational Resources Information Center

    Millrood, Radislav

    2002-01-01

    Discusses an approach to teaching heterogeneous English-as-a-Second/Foreign-Language classes. Draws on classroom research data to describe the features of a success-building lesson context. (Author/VWL)

  11. Heterogeneous atmospheric chemistry

    NASA Technical Reports Server (NTRS)

    Schryer, D. R.

    1982-01-01

    The present conference on heterogeneous atmospheric chemistry considers such topics concerning clusters, particles and microparticles as common problems in nucleation and growth, chemical kinetics, and catalysis, chemical reactions with aerosols, electron beam studies of natural and anthropogenic microparticles, and structural studies employing molecular beam techniques, as well as such gas-solid interaction topics as photoassisted reactions, catalyzed photolysis, and heterogeneous catalysis. Also discussed are sulfur dioxide absorption, oxidation, and oxidation inhibition in falling drops, sulfur dioxide/water equilibria, the evidence for heterogeneous catalysis in the atmosphere, the importance of heterogeneous processes to tropospheric chemistry, soot-catalyzed atmospheric reactions, and the concentrations and mechanisms of formation of sulfate in the atmospheric boundary layer.

  12. Towards heterogeneous distributed debugging

    SciTech Connect

    Damodaran-Kamal, S.K.

    1995-04-01

    Several years of research and development in parallel debugger design have given up several techniques, though implemented in a wide range of tools for an equally wide range of systems. This paper is an evaluation of these myriad techniques as applied to the design of a heterogeneous distributed debugger. The evaluation is based on what features users perceive as useful, as well as the ease of implementation of the features using the available technology. A preliminary architecture for such a heterogeneous tool is proposed. Our effort in this paper is significantly different from the other efforts at creating portable and heterogeneous distributed debuggers in that we concentrate on support for all the important issues in parallel debugging, instead of simply concentrating on portability and heterogeneity.

  13. Troll oil pipeline: Seabed surveying and pipeline routing in critical areas

    SciTech Connect

    Indreeide, A.; Nilsen, O.; Trodal, L.; Canu, M.; Baldascino, G.

    1996-12-01

    The 85 km long 16-in oil pipeline from the Troll Field to the Mongstad Refinery North of Bergen in Norway, including a nearshore/inshore section of some 30 km length which is characterized by a water depth down to 540 meters, complex and rocky seabed topography including extremely steep fjords walls. This inner section required a considerable amount of highly detailed and accurate surveying, in particular using remotely operated vehicles (ROV) to gather the required seabed documentation for pipeline routing engineering and construction. In particular a high precision in route definition was necessary, together with a common seabed reference system for engineering and construction in order to obtain a very accurate pipeline location within the actual narrow route corridor. This paper deals with the seabed surveying and documentation as well as the subsequent pipeline routing within the nearshore/inshore section of the pipeline route.

  14. Exploring Bikeability in a Suburban Metropolitan Area Using the Active Commuting Route Environment Scale (ACRES)

    PubMed Central

    Wahlgren, Lina; Schantz, Peter

    2014-01-01

    Background and Aim: Commuting by bicycle could contribute to public health, and route environments may influence this behaviour. Therefore, the aim of this study is to assess the potential associations between appraisals of the overall route environment as hindering or stimulating for bicycle commuting, with both perceptions of commuting route environmental factors in a suburban area and background factors. Methods: The Active Commuting Route Environment Scale (ACRES) was used for the assessment of bicycle commuters’ perceptions and appraisals of their route environments in the suburban parts of Greater Stockholm, Sweden. A simultaneous multiple regression analysis was used to assess the relationship between the outcome variable whether the overall route environment hinders or stimulates bicycle commuting and environmental factors (e.g., exhaust fumes, speeds of motor vehicles, greenery), as well as background factors (sex, age, education, income) as predictor variables. Results and Conclusions: The results indicate that in suburban areas, the factors aesthetics, greenery and bicycle paths seem to be, independently of each other, stimulating factors for bicycle commuting. On the other hand, flows of motor vehicles, noise, and low “directness” of the route seem to be hindering factors. A comparison of these results with those obtained from an inner urban area points to the importance of studying different types of built-up areas separately. PMID:25153462

  15. Reverse flood routing with the inverted Muskingum storage routing scheme

    NASA Astrophysics Data System (ADS)

    Koussis, A. D.; Mazi, K.; Lykoudis, S.; Argyriou, A.

    2010-09-01

    Motivation On occasion, flood related questions are posed in the reverse from the conventional sense, e.g.: Which inflow created the flow observed at cross-section X, or the flood profile observed along reach Y? This is a signal identification type problem (hydrologic forensics). A related question concerns the operation of a reservoir, via optimal outflow control, so as to minimise downstream flood damage. Solution of the aforementioned problems requires routing of floods in the upstream direction. This is an inverse problem, and as such it is not well posed. In routing against the wave propagation, small errors in the flow measurements, or rounding errors, are amplified leading to instability, i.e., to spurious, large changes in the response (inflow hydrograph). Therefore, for the reverse solution to be stable it must be constrained by a smoothness condition; this however does not ensure its uniqueness. Storage routing models as approximate diffusion wave models By appropriate choice of their parameter values, storage routing models approximate closely diffusion-wave (DW) behaviour, if dominant flood propagation mode is that of kinematic waves (KW), which is very often true. We solve the flood signal identification problem by reversing the Muskingum routing scheme. The Muskingum routing scheme derives from a first-order accurate FD discretisation of the KW equation yet yields second-order accurate DW solutions by matching the numerical diffusion coefficient of that KW equation solution scheme to the DW equation’s hydraulic diffusion coefficient. Formulation and testing of a reverse routing scheme based on Muskingum routing Theoretical analysis of the reversed Muskingum routing scheme yields nominal grid design rules; however, we study optimal grid design mainly by numerical experimentation. First, we reverse an exact outflow hydrograph (a single-wave solution of the convection-diffusion equation), and then demonstrate the scheme’s ability to reverse

  16. Cosmeceutical vehicles.

    PubMed

    Epstein, Howard

    2009-01-01

    Consumers will pay a premium for high-performance skin and hair care products. The demand exists, and in return for the high cost, consumers expect the product to perform as claimed and to meet aesthetic standards beyond many products found in the mass market. To be successful in this highly competitive market, products must function as claimed or consumers will not repurchase. Effective contemporary high-end products must be properly formulated in nonirritating vehicles that consumers will perceive as elegant. PMID:19695476

  17. Vehicle barrier

    DOEpatents

    Hirsh, Robert A.

    1991-01-01

    A vehicle security barrier which can be conveniently placed across a gate opening as well as readily removed from the gate opening to allow for easy passage. The security barrier includes a barrier gate in the form of a cable/gate member in combination with laterally attached pipe sections fixed by way of the cable to the gate member and lateral, security fixed vertical pipe posts. The security barrier of the present invention provides for the use of cable restraints across gate openings to provide necessary security while at the same time allowing for quick opening and closing of the gate areas without compromising security.

  18. Protocol independent adaptive route update for VANET.

    PubMed

    Rasheed, Asim; Ajmal, Sana; Qayyum, Amir

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

  19. Protocol Independent Adaptive Route Update for VANET

    PubMed Central

    Rasheed, Asim; Qayyum, Amir

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

  20. Characterization of Paper Heterogeneity

    NASA Astrophysics Data System (ADS)

    Considine, John M.

    Paper and paperboard are the most widely-used green materials in the world because they are renewable, recyclable, reusable, and compostable. Continued and expanded use of these materials and their potential use in new products requires a comprehensive understanding of the variability of their mechanical properties. This work develops new methods to characterize the mechanical properties of heterogeneous materials through a combination of techniques in experimental mechanics, materials science and numerical analysis. Current methods to analyze heterogeneous materials focus on crystalline materials or polymer-crystalline composites, where material boundaries are usually distinct. This work creates a methodology to analyze small, continuously-varying stiffness gradients in 100% polymer systems and is especially relevant to paper materials where factors influencing heterogeneity include local mass, fiber orientation, individual pulp fiber properties, local density, and drying restraint. A unique approach was used to understand the effect of heterogeneity on paper tensile strength. Additional variation was intentionally introduced, in the form of different size holes, and their effect on strength was measured. By modifying two strength criteria, an estimate of strength in the absence of heterogeneity was determined. In order to characterize stiffness heterogeneity, a novel load fixture was developed to excite full-field normal and shear strains for anisotropic stiffness determination. Surface strains were measured with digital image correlation and were analyzed with the VFM (Virtual Fields Method). This approach led to VFM-identified stiffnesses that were similar to values determined by conventional tests. The load fixture and VFM analyses were used to measure local stiffness and local stiffness variation on heterogeneous anisotropic materials. The approach was validated on simulated heterogeneous materials and was applied experimentally to three different paperboards

  1. General heuristics algorithms for solving capacitated arc routing problem

    NASA Astrophysics Data System (ADS)

    Fadzli, Mohammad; Najwa, Nurul; Masran, Hafiz

    2015-05-01

    In this paper, we try to determine the near-optimum solution for the capacitated arc routing problem (CARP). In general, NP-hard CARP is a special graph theory specifically arises from street services such as residential waste collection and road maintenance. By purpose, the design of the CARP model and its solution techniques is to find optimum (or near-optimum) routing cost for a fleet of vehicles involved in operation. In other words, finding minimum-cost routing is compulsory in order to reduce overall operation cost that related with vehicles. In this article, we provide a combination of various heuristics algorithm to solve a real case of CARP in waste collection and benchmark instances. These heuristics work as a central engine in finding initial solutions or near-optimum in search space without violating the pre-setting constraints. The results clearly show that these heuristics algorithms could provide good initial solutions in both real-life and benchmark instances.

  2. Vehicle testing of Cummins turbocompound diesel engine

    NASA Technical Reports Server (NTRS)

    Brands, M. C.; Werner, J. R.; Hoehne, J. L.

    1980-01-01

    Two turbocompound diesel engines were installed in Class VIII heavy-duty vehicles to determine the fuel consumption potential and performance characteristics. One turbocompound powered vehicle was evaluated at the Cummins Pilot Center where driveability, fuel consumption, torsional vibration, and noise were evaluated. Fuel consumption testing showed a 14.8% benefit for the turbocompound engine in comparison to a production NTC-400 used as a baseline. The turbocompound engine also achieved lower noise levels, improved driveability, improved gradeability, and marginally superior engine retardation. The second turbocompound engine was placed in commercial service and accumulated 50,000 miles on a cross-country route without malfunction. Tank mileage revealed a 15.92% improvement over a production NTCC-400 which was operating on the same route.

  3. Risk Considerations of Bird Strikes to Space Launch Vehicles

    NASA Technical Reports Server (NTRS)

    Hales, Christy; Ring, Robert

    2016-01-01

    Within seconds after liftoff of the Space Shuttle during mission STS-114, a turkey vulture impacted the vehicle's external tank. The contact caused no apparent damage to the Shuttle, but the incident led NASA to consider the potential consequences of bird strikes during a Shuttle launch. The environment at Kennedy Space Center provides unique bird strike challenges due to the Merritt Island National Wildlife Refuge and the Atlantic Flyway bird migration routes. NASA is currently refining risk assessment estimates for the probability of bird strike to space launch vehicles. This paper presents an approach for analyzing the risks of bird strikes to space launch vehicles and presents an example. The migration routes, types of birds present, altitudes of those birds, exposed area of the launch vehicle, and its capability to withstand impacts affect the risk due to bird strike. A summary of significant risk contributors is discussed.

  4. Central East Pacific Flight Routing

    NASA Technical Reports Server (NTRS)

    Grabbe, Shon; Sridhar, Banavar; Kopardekar, Parimal; Cheng, Nadia

    2006-01-01

    With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

  5. Forestry Vehicle

    NASA Technical Reports Server (NTRS)

    1982-01-01

    Power Pack II provides an economical means of moving a power source into remote roadless forest areas. It was developed by Prof. Miles and his associates, working in cooperation with the University of California's Department of Forestry. The team combined its own design of an all-terrain vehicle with a suspension system based on the NASA load equalization technology. Result is an intermediate-sized unit which carries a power source and the powered tools to perform a variety of forest management tasks which cannot be done economically with current equipment. Power Pack II can traverse very rough terrain and climb a 60 degree slope; any one of the wheels can move easily over an obstacle larger than itself. Work is being done on a more advanced Power Pack III.

  6. Tier-Based Scalable and Secure Routing for Wireless Sensor Networks with Mobile Sinks

    NASA Astrophysics Data System (ADS)

    Tang, Feilong; Guo, Minyi; Guo, Song

    Multiple hop based routing in homogeneous sensor networks with a single sink suffers performance degradation and severe security threats with the increase of the size of sensor networks. Large-scale sensor networks need to be deployed with multiple powerful nodes as sinks and they should be scheduled to move to different places during the lifetime of the networks. Existing routing mechanisms lack of such supports for large-scale sensor networks. In this paper, we propose a heterogeneous network model where multiple mesh nodes are deployed in a sensor network, and sensed data are collected through two tiers: firstly from a source sensor node to the closest mesh node in a multiple-hop fashion (called sensor routing), and then from the mesh node to the base station through long-distance mesh routing (called mesh routing). Based on this network model, we propose an energy-efficient and secure protocol for the sensor routing that can work well in large-scale sensor networks and resist most of attacks. Experiments demonstrate that our routing protocol significantly reduces average hops for data transmission. Our lightweight security mechanism enables the routing protocol to defend most attacks against sensor networks.

  7. A Multimetric, Map-Aware Routing Protocol for VANETs in Urban Areas

    PubMed Central

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Igartua, Mónica Aguilar; Rebollo-Monedero, David; de la Cruz Llopis, Luis J.; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  8. A multimetric, map-aware routing protocol for VANETs in urban areas.

    PubMed

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  9. Managing Power Heterogeneity

    NASA Astrophysics Data System (ADS)

    Pruhs, Kirk

    A particularly important emergent technology is heterogeneous processors (or cores), which many computer architects believe will be the dominant architectural design in the future. The main advantage of a heterogeneous architecture, relative to an architecture of identical processors, is that it allows for the inclusion of processors whose design is specialized for particular types of jobs, and for jobs to be assigned to a processor best suited for that job. Most notably, it is envisioned that these heterogeneous architectures will consist of a small number of high-power high-performance processors for critical jobs, and a larger number of lower-power lower-performance processors for less critical jobs. Naturally, the lower-power processors would be more energy efficient in terms of the computation performed per unit of energy expended, and would generate less heat per unit of computation. For a given area and power budget, heterogeneous designs can give significantly better performance for standard workloads. Moreover, even processors that were designed to be homogeneous, are increasingly likely to be heterogeneous at run time: the dominant underlying cause is the increasing variability in the fabrication process as the feature size is scaled down (although run time faults will also play a role). Since manufacturing yields would be unacceptably low if every processor/core was required to be perfect, and since there would be significant performance loss from derating the entire chip to the functioning of the least functional processor (which is what would be required in order to attain processor homogeneity), some processor heterogeneity seems inevitable in chips with many processors/cores.

  10. Vehicle tracking algorithm based on GPS and map-matching

    NASA Astrophysics Data System (ADS)

    Guan, Guixia; Yan, Lei; Chen, Jiabin; Wu, Taixia

    2008-10-01

    In the land vehicle positioning and tracking system, the vehicle moving route is sometimes positioned outside the vehicle running road because of the GPS positioning errors. It may cause the tracking system unavailable. In order to improve the positioning accuracy of vehicle tracking system, a current statistical model is employed as the vehicle moving model. At the same time, the map-matching algorithm with the nearest location and the suitable moving angle is proposed to amend GPS measured data. The algorithm can determine the best matching road by making full use of the road geographic information of electronic map. Simulation results show that the vehicle tracking system has high positioning accuracy besides the navigation function.

  11. VANET Clustering Based Routing Protocol Suitable for Deserts.

    PubMed

    Nasr, Mohammed Mohsen Mohammed; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-01-01

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

  12. Optimization of location routing inventory problem with transshipment

    NASA Astrophysics Data System (ADS)

    Ghani, Nor Edayu Abd; Shariff, S. Sarifah Radiah; Zahari, Siti Meriam

    2015-05-01

    Location Routing Inventory Problem (LRIP) is a collaboration of the three components in the supply chain. It is confined by location-allocation, vehicle routing and inventory management. The aim of the study is to minimize the total system cost in the supply chain. Transshipment is introduced in order to allow the products to be shipped to a customer who experiences a shortage, either directly from the supplier or from another customer. In the study, LRIP is introduced with the transshipment (LRIPT) and customers act as the transshipment points. We select the transshipment point by using the p-center and we present the results in two divisions of cases. Based on the analysis, the results indicated that LRIPT performed well compared to LRIP.

  13. VANET Clustering Based Routing Protocol Suitable for Deserts

    PubMed Central

    Mohammed Nasr, Mohammed Mohsen; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-01-01

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

  14. Heterogeneous delivering capability promotes traffic efficiency in complex networks

    NASA Astrophysics Data System (ADS)

    Zhu, Yan-Bo; Guan, Xiang-Min; Zhang, Xue-Jun

    2015-12-01

    Traffic is one of the most fundamental dynamical processes in networked systems. With the homogeneous delivery capability of nodes, the global dynamic routing strategy proposed by Ling et al. [Phys. Rev. E81, 016113 (2010)] adequately uses the dynamic information during the process and thus it can reach a quite high network capacity. In this paper, based on the global dynamic routing strategy, we proposed a heterogeneous delivery allocation strategy of nodes on scale-free networks with consideration of nodes degree. It is found that the network capacity as well as some other indexes reflecting transportation efficiency are further improved. Our work may be useful for the design of more efficient routing strategies in communication or transportation systems.

  15. Impact of wire topology on channel routing

    SciTech Connect

    Blair, J.R.S.

    1986-01-01

    Channel routing is a method that has been widely used to overcome the inherent difficulties in the routing stage of automated VLSI chip and printed circuit board design. Almost all previous work on channel routing has restricted the wires to paths that are strictly monotonic (i.e., paths that do not backtrack in either the horizontal or vertical direction). The impact on single layer channel routing of wire topologies that provide considerably more wire routing flexibility than has previously been allowed is addressed here. A hierarchy of routing classes stemming from these generalized wire topologies is defined. It is shown that each of the routing classes is applicable to both the two row routing scenario (river routing) and the single row routing scenario. The routing classes are examined to see if the flexibility provided by the new wire types is useful for single row routing. Global routing under the channel routing scenario is briefly examined. In particular, a simplistic two layer global channel routing problem is shown to be NP-complete using two separate optimization criteria.

  16. Routing Algorithm Exploits Spatial Relations

    NASA Technical Reports Server (NTRS)

    Okino, Clayton; Jennings, Esther

    2004-01-01

    A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

  17. Combination vehicle assembly

    SciTech Connect

    Silverman, M.J. Sr.

    1987-03-17

    A combination recreational vehicle assembly is described comprising: two vehicles of a different type, the vehicles comprising a first, leading vehicle having a steering mechanism for maneuvering the assembly and a drivable axle mechanism for propelling the assembly; an independently drivable second vehicle trailing the first vehicle comprising a standard road vehicle having a motor, and an axle mechanism for connecting the motor to the wheels of the second vehicle for providing power to the wheels of the vehicle. A gear means for selectively disconnecting the motor from the axle mechanism to place the vehicle in neutral, and a steering means for maneuvering the second vehicle when driven independently of the first vehicle are included; and a releasable mechanical drive connection between the second vehicle motor and the first vehicle axle mechanism to provide power for driving the assembly. The drive connection comprises a drive pinion projecting from the second vehicle motor to the front of the second vehicle, and a drive shaft projecting from the first vehicle axle mechanism to the rear of the first vehicle.

  18. Heterogeneous waste processing

    DOEpatents

    Vanderberg, Laura A.; Sauer, Nancy N.; Brainard, James R.; Foreman, Trudi M.; Hanners, John L.

    2000-01-01

    A combination of treatment methods are provided for treatment of heterogeneous waste including: (1) treatment for any organic compounds present; (2) removal of metals from the waste; and, (3) bulk volume reduction, with at least two of the three treatment methods employed and all three treatment methods emplyed where suitable.

  19. Evaluating foam heterogeneity

    NASA Technical Reports Server (NTRS)

    Liou, D. W.; Lee, W. M.

    1972-01-01

    New analytical tool is available to calculate the degree of foam heterogeneity based on the measurement of gas diffusivity values. Diffusion characteristics of plastic foam are described by a system of differential equations based on conventional diffusion theory. This approach saves research and computation time in studying mass or heat diffusion problems.

  20. Routes and mechanisms of extracellular vesicle uptake

    PubMed Central

    Mulcahy, Laura Ann; Pink, Ryan Charles; Carter, David Raul Francisco

    2014-01-01

    Extracellular vesicles (EVs) are small vesicles released by donor cells that can be taken up by recipient cells. Despite their discovery decades ago, it has only recently become apparent that EVs play an important role in cell-to-cell communication. EVs can carry a range of nucleic acids and proteins which can have a significant impact on the phenotype of the recipient. For this phenotypic effect to occur, EVs need to fuse with target cell membranes, either directly with the plasma membrane or with the endosomal membrane after endocytic uptake. EVs are of therapeutic interest because they are deregulated in diseases such as cancer and they could be harnessed to deliver drugs to target cells. It is therefore important to understand the molecular mechanisms by which EVs are taken up into cells. This comprehensive review summarizes current knowledge of EV uptake mechanisms. Cells appear to take up EVs by a variety of endocytic pathways, including clathrin-dependent endocytosis, and clathrin-independent pathways such as caveolin-mediated uptake, macropinocytosis, phagocytosis, and lipid raft–mediated internalization. Indeed, it seems likely that a heterogeneous population of EVs may gain entry into a cell via more than one route. The uptake mechanism used by a given EV may depend on proteins and glycoproteins found on the surface of both the vesicle and the target cell. Further research is needed to understand the precise rules that underpin EV entry into cells. PMID:25143819

  1. Roots/Routes: Part II

    ERIC Educational Resources Information Center

    Swanson, Dalene M.

    2009-01-01

    This narrative acts as an articulation of a journey of many routes. Following Part I of the same research journey of rootedness/routedness, it debates the nature of transformation and transcendence beyond personal and political paradoxes informed by neoliberalism and related repressive globalizing discourses. Through a more personal, descriptive,…

  2. Judaism and the Silk Route.

    ERIC Educational Resources Information Center

    Foltz, Richard

    1998-01-01

    Demonstrates that the Judeans traveled along the Ancient Silk Route. Discusses the Iranian influence on the formation of Jewish religious ideas. Considers the development of Jewish trade networks, focusing on the Radanites (Jewish traders), the Jewish presence in the Far East, and the survival of Judaism in central Asia. (CMK)

  3. Dynamic Weather Routes Architecture Overview

    NASA Technical Reports Server (NTRS)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

    Dynamic Weather Routes Architecture Overview, presents the high level software architecture of DWR, based on the CTAS software framework and the Direct-To automation tool. The document also covers external and internal data flows, required dataset, changes to the Direct-To software for DWR, collection of software statistics, and the code structure.

  4. Roots/Routes: Part I

    ERIC Educational Resources Information Center

    Swanson, Dalene M.

    2009-01-01

    This narrative and poetic rendering acts as an articulation of a journey of many routes. It is a storying of critical research issues and events as performances of lived experience. It is a metissage of hybrid, but interrelated, themes that find cohesion through fragmentation and coalescence, severance, and regrowth. These themes are invoked by…

  5. Vehicle/engine integration. [orbit transfer vehicles

    NASA Technical Reports Server (NTRS)

    Cooper, L. P.; Vinopal, T. J.; Florence, D. E.; Michel, R. W.; Brown, J. R.; Bergeron, R. P.; Weldon, V. A.

    1984-01-01

    VEHICLE/ENGINE Integration Issues are explored for orbit transfer vehicles (OTV's). The impact of space basing and aeroassist on VEHICLE/ENGINE integration is discussed. The AOTV structure and thermal protection subsystem weights were scaled as the vehicle length and surface was changed. It is concluded that for increased allowable payload lengths in a ground-based system, lower length-to-diameter (L/D) is as important as higher mixture ration (MR) in the range of mid L/D ATOV's. Scenario validity, geometry constraints, throttle levels, reliability, and servicing are discussed in the context of engine design and engine/vehicle integration.

  6. Access routes for nutritional therapy.

    PubMed

    Waitzberg, D L; Plopper, C; Terra, R M

    2000-12-01

    Enteral nutrition (EN) and total parenteral nutrition (TPN) may provide life-sustaining therapy for surgical patients. The duration of nutritional therapy (enteral or parenteral) implies distinct access routes. We review the main aspects related to access routes for nutrient delivery. The enteral route, whenever feasible, is preferred. For EN lasting less than 6 weeks, nasoenteric tubes are the route of choice. Conversely, enterostomy tubes should be used for longer-term enteral feeding and can be placed surgically or with fluoroscopic and endoscopic assistance. The first choice for patients who will not be submitted to laparotomy is percutaneous endoscopic gastrostomy. Postpyloric access, although not consensual, must be considered when there is a high risk of aspiration. For intravenous delivery of nutrients lasting less than 10 days, the peripheral route can be used. However, because of frequent infusion phlebitis, its role is still in discussion. Central venous catheters (CVCs) for TPN delivery may be (1) nonimplantable, percutaneous, nontunneled-used for a few days to 3 to 4 weeks; (2) partially implantable, percutaneous, tunneled-used for longer periods and permanent access; or (3) totally implantable subcutaneous ports-also used for long-term or permanent access. The subclavian vein is usually the insertion site of choice for central venous catheters. Implantable ports are associated with lower rates of septic complications than percutaneous CVCs. The catheter with the least number of necessary lumens should be applied. Central venous nutrient delivery can also be accomplished through peripherally inserted central catheters, which avoid insertion-related risks. PMID:11193710

  7. Evolutionary optimization of cooperative heterogeneous teams

    NASA Astrophysics Data System (ADS)

    Soule, Terence; Heckendorn, Robert B.

    2007-04-01

    There is considerable interest in developing teams of autonomous, unmanned vehicles that can function in hostile environments without endangering human lives. However, heterogeneous teams, teams of units with specialized roles and/or specialized capabilities, have received relatively little attention. Specialized roles and capabilities can significantly increase team effectiveness and efficiency. Unfortunately, developing effective cooperation mechanisms is much more difficult in heterogeneous teams. Units with specialized roles or capabilities require specialized software that take into account the role and capabilities of both itself and its neighbors. Evolutionary algorithms, algorithms modeled on the principles of natural selection, have a proven track record in generating successful teams for a wide variety of problem domains. Using classification problems as a prototype, we have shown that typical evolutionary algorithms either generate highly effective teams members that cooperate poorly or poorly performing individuals that cooperate well. To overcome these weaknesses we have developed a novel class of evolutionary algorithms. In this paper we apply these algorithms to the problem of controlling simulated, heterogeneous teams of "scouts" and "investigators". Our test problem requires producing a map of an area and to further investigate "areas of interest". We compare several evolutionary algorithms for their ability to generate individually effective members and high levels of cooperation.

  8. Analytical studies on the instabilities of heterogeneous intelligent traffic flow

    NASA Astrophysics Data System (ADS)

    Ngoduy, D.

    2013-10-01

    It has been widely reported in literature that a small perturbation in traffic flow such as a sudden deceleration of a vehicle could lead to the formation of traffic jams without a clear bottleneck. These traffic jams are usually related to instabilities in traffic flow. The applications of intelligent traffic systems are a potential solution to reduce the amplitude or to eliminate the formation of such traffic instabilities. A lot of research has been conducted to theoretically study the effect of intelligent vehicles, for example adaptive cruise control vehicles, using either computer simulation or analytical method. However, most current analytical research has only applied to single class traffic flow. To this end, the main topic of this paper is to perform a linear stability analysis to find the stability threshold of heterogeneous traffic flow using microscopic models, particularly the effect of intelligent vehicles on heterogeneous (or multi-class) traffic flow instabilities. The analytical results will show how intelligent vehicle percentages affect the stability of multi-class traffic flow.

  9. Adaptable formations utilizing heterogeneous unmanned systems

    NASA Astrophysics Data System (ADS)

    Barnes, Laura E.; Garcia, Richard; Fields, MaryAnne; Valavanis, Kimon

    2009-05-01

    This paper addresses the problem of controlling and coordinating heterogeneous unmanned systems required to move as a group while maintaining formation. We propose a strategy to coordinate groups of unmanned ground vehicles (UGVs) with one or more unmanned aerial vehicles (UAVs). UAVs can be utilized in one of two ways: (1) as alpha robots to guide the UGVs; and (2) as beta robots to surround the UGVs and adapt accordingly. In the first approach, the UAV guides a swarm of UGVs controlling their overall formation. In the second approach, the UGVs guide the UAVs controlling their formation. The unmanned systems are brought into a formation utilizing artificial potential fields generated from normal and sigmoid functions. These functions control the overall swarm geometry. Nonlinear limiting functions are defined to provide tighter swarm control by modifying and adjusting a set of control variables forcing the swarm to behave according to set constraints. Formations derived are subsets of elliptical curves but can be generalized to any curvilinear shape. Both approaches are demonstrated in simulation and experimentally. To demonstrate the second approach in simulation, a swarm of forty UAVs is utilized in a convoy protection mission. As a convoy of UGVs travels, UAVs dynamically and intelligently adapt their formation in order to protect the convoy of vehicles as it moves. Experimental results are presented to demonstrate the approach using a fully autonomous group of three UGVs and a single UAV helicopter for coordination.

  10. ADOPT: A Historically Validated Light Duty Vehicle Consumer Choice Model

    SciTech Connect

    Brooker, A.; Gonder, J.; Lopp, S.; Ward, J.

    2015-05-04

    The Automotive Deployment Option Projection Tool (ADOPT) is a light-duty vehicle consumer choice and stock model supported by the U.S. Department of Energy’s Vehicle Technologies Office. It estimates technology improvement impacts on U.S. light-duty vehicles sales, petroleum use, and greenhouse gas emissions. ADOPT uses techniques from the multinomial logit method and the mixed logit method estimate sales. Specifically, it estimates sales based on the weighted value of key attributes including vehicle price, fuel cost, acceleration, range and usable volume. The average importance of several attributes changes nonlinearly across its range and changes with income. For several attributes, a distribution of importance around the average value is used to represent consumer heterogeneity. The majority of existing vehicle makes, models, and trims are included to fully represent the market. The Corporate Average Fuel Economy regulations are enforced. The sales feed into the ADOPT stock model. It captures key aspects for summing petroleum use and greenhouse gas emissions This includes capturing the change in vehicle miles traveled by vehicle age, the creation of new model options based on the success of existing vehicles, new vehicle option introduction rate limits, and survival rates by vehicle age. ADOPT has been extensively validated with historical sales data. It matches in key dimensions including sales by fuel economy, acceleration, price, vehicle size class, and powertrain across multiple years. A graphical user interface provides easy and efficient use. It manages the inputs, simulation, and results.