WorldWideScience

Sample records for air routes

  1. 14 CFR 71.11 - Air Traffic Service (ATS) routes.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Air Traffic Service (ATS) routes. 71.11 Section 71.11 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED) AIRSPACE DESIGNATION OF CLASS A, B, C, D, AND E AIRSPACE AREAS; AIR TRAFFIC SERVICE ROUTES; AND REPORTING POINTS § 71.11 Air Traffic Service ...

  2. 14 CFR 71.13 - Classification of Air Traffic Service (ATS) routes.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Classification of Air Traffic Service (ATS) routes. 71.13 Section 71.13 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED) AIRSPACE DESIGNATION OF CLASS A, B, C, D, AND E AIRSPACE AREAS; AIR TRAFFIC SERVICE ROUTES; AND REPORTING POINTS § 71.13...

  3. Analysis of the Chinese air route network as a complex network

    Science.gov (United States)

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

    2012-02-01

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

  4. A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

    Science.gov (United States)

    Sadovsky, Alexander V.

    2016-01-01

    A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

  5. 77 FR 35836 - Amendment of Air Traffic Service Routes; Southwestern United States

    Science.gov (United States)

    2012-06-15

    ...This action modifies Jet Route J-2, and VOR Federal airways V- 16, V-66 and V-202 in southern Arizona and New Mexico due to the scheduled decommissioning of the Cochise, AZ, VHF Omnidirectional Range Tactical Air Navigation (VORTAC) which currently is used to define segments of the routes.

  6. Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

    Science.gov (United States)

    Bombelli, Alessandro

    Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is

  7. Commuters' exposure to particulate matter air pollution is affected by mode of transport, fuel type, and route.

    Science.gov (United States)

    Zuurbier, Moniek; Hoek, Gerard; Oldenwening, Marieke; Lenters, Virissa; Meliefste, Kees; van den Hazel, Peter; Brunekreef, Bert

    2010-06-01

    Commuters are exposed to high concentrations of air pollutants, but little quantitative information is currently available on differences in exposure between different modes of transport, routes, and fuel types. The aim of our study was to assess differences in commuters' exposure to traffic-related air pollution related to transport mode, route, and fuel type. We measured particle number counts (PNCs) and concentrations of PM2.5 (particulate matter bus passengers, we calculated that the inhaled air pollution doses were highest for cyclists. With the exception of PM10, we found that inhaled air pollution doses were lowest for electric bus passengers. Commuters' rush hour exposures were significantly influenced by mode of transport, route, and fuel type.

  8. Cyclist route choice, traffic-related air pollution, and lung function: a scripted exposure study.

    Science.gov (United States)

    Jarjour, Sarah; Jerrett, Michael; Westerdahl, Dane; de Nazelle, Audrey; Hanning, Cooper; Daly, Laura; Lipsitt, Jonah; Balmes, John

    2013-02-07

    A travel mode shift to active transportation such as bicycling would help reduce traffic volume and related air pollution emissions as well as promote increased physical activity level. Cyclists, however, are at risk for exposure to vehicle-related air pollutants due to their proximity to vehicle traffic and elevated respiratory rates. To promote safe bicycle commuting, the City of Berkeley, California, has designated a network of residential streets as "Bicycle Boulevards." We hypothesized that cyclist exposure to air pollution would be lower on these Bicycle Boulevards when compared to busier roads and this elevated exposure may result in reduced lung function. We recruited 15 healthy adults to cycle on two routes - a low-traffic Bicycle Boulevard route and a high-traffic route. Each participant cycled on the low-traffic route once and the high-traffic route once. We mounted pollutant monitors and a global positioning system (GPS) on the bicycles. The monitors were all synced to GPS time so pollutant measurements could be spatially plotted. We measured lung function using spirometry before and after each bike ride. We found that fine and ultrafine particulate matter, carbon monoxide, and black carbon were all elevated on the high-traffic route compared to the low-traffic route. There were no corresponding changes in the lung function of healthy non-asthmatic study subjects. We also found that wind-speed affected pollution concentrations. These results suggest that by selecting low-traffic Bicycle Boulevards instead of heavily trafficked roads, cyclists can reduce their exposure to vehicle-related air pollution. The lung function results indicate that elevated pollutant exposure may not have acute negative effects on healthy cyclists, but further research is necessary to determine long-term effects on a more diverse population. This study and broader field of research have the potential to encourage policy-makers and city planners to expand infrastructure to

  9. ANALYSIS OF FREE ROUTE AIRSPACE AND PERFORMANCE BASED NAVIGATION IMPLEMENTATION IN THE EUROPEAN AIR NAVIGATION SYSTEM

    Directory of Open Access Journals (Sweden)

    Svetlana Pavlova

    2014-12-01

    Full Text Available European Air Traffic Management system requires continuous improvements as air traffic is increasingday by day. For this purpose it was developed by international organizations Free Route Airspace and PerformanceBased Navigation concepts that allow to offer a required level of safety, capacity, environmental performance alongwith cost-effectiveness. The aim of the article is to provide detailed analysis of Free Route Airspace and PerformanceBased Navigation implementation status within European region including Ukrainian air navigation system.

  10. 78 FR 38236 - Proposed Establishment, Modification and Cancellation of Air Traffic Service (ATS) Routes...

    Science.gov (United States)

    2013-06-26

    ...This action proposes to modify two jet routes, six VOR Federal airways, and three area navigation routes; to establish six area navigation (RNAV) routes; and to cancel two VOR Federal airways in the northeast United States. The FAA is proposing this action due to the scheduled decommissioning of the Lake Henry, PA, VHF Omnidirectional Range/Tactical Air Navigation (VORTAC) facility which provides navigation guidance for portions of the affected routes. This action would enhance the safety and efficient management of aircraft within the National Airspace System.

  11. Air Cargo Transportation Route Choice Analysis

    Science.gov (United States)

    Obashi, Hiroshi; Kim, Tae-Seung; Oum, Tae Hoon

    2003-01-01

    Using a unique feature of air cargo transshipment data in the Northeast Asian region, this paper identifies the critical factors that determine the transshipment route choice. Taking advantage of the variations in the transport characteristics in each origin-destination airports pair, the paper uses a discrete choice model to describe the transshipping route choice decision made by an agent (i.e., freight forwarder, consolidator, and large shipper). The analysis incorporates two major factors, monetary cost (such as line-haul cost and landing fee) and time cost (i.e., aircraft turnaround time, including loading and unloading time, custom clearance time, and expected scheduled delay), along with other controls. The estimation method considers the presence of unobserved attributes, and corrects for resulting endogeneity by use of appropriate instrumental variables. Estimation results find that transshipment volumes are more sensitive to time cost, and that the reduction in aircraft turnaround time by 1 hour would be worth the increase in airport charges by more than $1000. Simulation exercises measures the impacts of alternative policy scenarios for a Korean airport, which has recently declared their intention to be a future regional hub in the Northeast Asian region. The results suggest that reducing aircraft turnaround time at the airport be an effective strategy, rather than subsidizing to reduce airport charges.

  12. 77 FR 24156 - Proposed Amendment of Air Traffic Service Routes; Southwestern United States

    Science.gov (United States)

    2012-04-23

    ...This action proposes to modify Jet Route J-2, and VOR Federal airways V-16, V-66, and V-202 in southern Arizona and New Mexico. The FAA is proposing this action due to the scheduled decommissioning of the Cochise, AZ, VHF omnirange tactical air navigation aid (VORTAC) which currently forms segments of the routes. This would enhance enroute navigation within the National Airspace System.

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  14. Commuters’ Exposure to Particulate Matter Air Pollution Is Affected by Mode of Transport, Fuel Type, and Route

    Science.gov (United States)

    Zuurbier, Moniek; Hoek, Gerard; Oldenwening, Marieke; Lenters, Virissa; Meliefste, Kees; van den Hazel, Peter; Brunekreef, Bert

    2010-01-01

    Background Commuters are exposed to high concentrations of air pollutants, but little quantitative information is currently available on differences in exposure between different modes of transport, routes, and fuel types. Objectives The aim of our study was to assess differences in commuters’ exposure to traffic-related air pollution related to transport mode, route, and fuel type. Methods We measured particle number counts (PNCs) and concentrations of PM2.5 (particulate matter ≤ 2.5 μm in aerodynamic diameter), PM10, and soot between June 2007 and June 2008 on 47 weekdays, from 0800 to 1000 hours, in diesel and electric buses, gasoline- and diesel-fueled cars, and along two bicycle routes with different traffic intensities in Arnhem, the Netherlands. In addition, each-day measurements were taken at an urban background location. Results We found that median PNC exposures were highest in diesel buses (38,500 particles/cm3) and for cyclists along the high-traffic intensity route (46,600 particles/cm3) and lowest in electric buses (29,200 particles/cm3). Median PM10 exposure was highest from diesel buses (47 μg/m3) and lowest along the high- and low-traffic bicycle routes (39 and 37 μg/m3). The median soot exposure was highest in gasoline-fueled cars (9.0 × 10−5/m), diesel cars (7.9 × 10−5/m), and diesel buses (7.4 × 10−5/m) and lowest along the low-traffic bicycle route (4.9 × 10−5/m). Because the minute ventilation (volume of air per minute) of cyclists, which we estimated from measured heart rates, was twice the minute ventilation of car and bus passengers, we calculated that the inhaled air pollution doses were highest for cyclists. With the exception of PM10, we found that inhaled air pollution doses were lowest for electric bus passengers. Conclusions Commuters’ rush hour exposures were significantly influenced by mode of transport, route, and fuel type. PMID:20185385

  15. Potential air pollutant emission from private vehicles based on vehicle route

    Science.gov (United States)

    Huboyo, H. S.; Handayani, W.; Samadikun, B. P.

    2017-06-01

    Air emissions related to the transportation sector has been identified as the second largest emitter of ambient air quality in Indonesia. This is due to large numbers of private vehicles commuting within the city as well as inter-city. A questionnaire survey was conducted in Semarang city involving 711 private vehicles consisting of cars and motorcycles. The survey was conducted in random parking lots across the Semarang districts and in vehicle workshops. Based on the parking lot survey, the average distance private cars travelled in kilometers (VKT) was 17,737 km/year. The machine start-up number of cars during weekdays; weekends were on average 5.19 and 3.79 respectively. For motorcycles the average of kilometers travelled was 27,092 km/year. The machine start-up number of motorcycles during weekdays and weekends were on average 5.84 and 3.98, respectively. The vehicle workshop survey showed the average kilometers travelled to be 9,510 km/year for motorcycles, while for private cars the average kilometers travelled was 21,347 km/year. Odometer readings for private cars showed a maximum of 3,046,509 km and a minimum of 700 km. Meanwhile, for motorcycles, odometer readings showed a maximum of 973,164 km and a minimum of roughly 54.24 km. Air pollutant emissions on East-West routes were generally higher than those on South-North routes. Motorcycles contribute significantly to urban air pollution, more so than cars. In this study, traffic congestion and traffic volume contributed much more to air pollution than the impact of fluctuating terrain.

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

    Science.gov (United States)

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

    2008-01-15

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

  17. 77 FR 3415 - Proposed Modification, Revocation and Establishment of Air Traffic Service Routes; Windsor Locks...

    Science.gov (United States)

    2012-01-24

    ...This action proposes to modify four VOR Federal airways, revoke one VOR Federal airway, and establish three area navigation (RNAV) routes in the vicinity of Windsor Locks, CT. The FAA is proposing this action to adjust the airway route structure due to the planned decommissioning of the Bradley VHF omnirange/tactical air navigation (VORTAC) aid located on Bradley International Airport property, Windsor Locks, CT.

  18. Identifying vital edges in Chinese air route network via memetic algorithm

    Directory of Open Access Journals (Sweden)

    Wenbo Du

    2017-02-01

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

  19. Cognitive process modelling of controllers in en route air traffic control.

    Science.gov (United States)

    Inoue, Satoru; Furuta, Kazuo; Nakata, Keiichi; Kanno, Taro; Aoyama, Hisae; Brown, Mark

    2012-01-01

    In recent years, various efforts have been made in air traffic control (ATC) to maintain traffic safety and efficiency in the face of increasing air traffic demands. ATC is a complex process that depends to a large degree on human capabilities, and so understanding how controllers carry out their tasks is an important issue in the design and development of ATC systems. In particular, the human factor is considered to be a serious problem in ATC safety and has been identified as a causal factor in both major and minor incidents. There is, therefore, a need to analyse the mechanisms by which errors occur due to complex factors and to develop systems that can deal with these errors. From the cognitive process perspective, it is essential that system developers have an understanding of the more complex working processes that involve the cooperative work of multiple controllers. Distributed cognition is a methodological framework for analysing cognitive processes that span multiple actors mediated by technology. In this research, we attempt to analyse and model interactions that take place in en route ATC systems based on distributed cognition. We examine the functional problems in an ATC system from a human factors perspective, and conclude by identifying certain measures by which to address these problems. This research focuses on the analysis of air traffic controllers' tasks for en route ATC and modelling controllers' cognitive processes. This research focuses on an experimental study to gain a better understanding of controllers' cognitive processes in air traffic control. We conducted ethnographic observations and then analysed the data to develop a model of controllers' cognitive process. This analysis revealed that strategic routines are applicable to decision making.

  20. Meeting Air Transportation Demand in 2025 by Using Larger Aircraft and Alternative Routing to Complement NextGen Operational Improvements

    Science.gov (United States)

    Smith, Jeremy C.; Guerreiro, Nelson M.; Viken, Jeffrey K.; Dollyhigh, Samuel M.; Fenbert, James W.

    2010-01-01

    A study was performed that investigates the use of larger aircraft and alternative routing to complement the capacity benefits expected from the Next Generation Air Transportation System (NextGen) in 2025. National Airspace System (NAS) delays for the 2025 demand projected by the Transportation Systems Analysis Models (TSAM) were assessed using NASA s Airspace Concept Evaluation System (ACES). The shift in demand from commercial airline to automobile and from one airline route to another was investigated by adding the route delays determined from the ACES simulation to the travel times used in the TSAM and re-generating new flight scenarios. The ACES simulation results from this study determined that NextGen Operational Improvements alone do not provide sufficient airport capacity to meet the projected demand for passenger air travel in 2025 without significant system delays. Using larger aircraft with more seats on high-demand routes and introducing new direct routes, where demand warrants, significantly reduces delays, complementing NextGen improvements. Another significant finding of this study is that the adaptive behavior of passengers to avoid congested airline-routes is an important factor when projecting demand for transportation systems. Passengers will choose an alternative mode of transportation or alternative airline routes to avoid congested routes, thereby reducing delays to acceptable levels for the 2025 scenario; the penalty being that alternative routes and the option to drive increases overall trip time by 0.4% and may be less convenient than the first-choice route.

  1. Ophthalmic requirements and considerations for the en route air traffic control specialist : an ergonomic analysis of the visual work environment.

    Science.gov (United States)

    1996-04-01

    The Federal Air Surgeon requested continued investigation of visual disorders and vision corrective devices as to their relevance to the medical certification of airmen and controllers. The en route Air Traffic Control Specialist (ATCS) works with a ...

  2. 77 FR 42425 - Amendment of Air Traffic Service (ATS) Routes in the Vicinity of Vero Beach, FL

    Science.gov (United States)

    2012-07-19

    ...This action amends the legal descriptions of Jet Routes J-45 and J-79, and VHF omnidirectional range (VOR) Federal airways V-3, V-51, V-159, V-225, V-295 and V-537, in the vicinity of Vero Beach, FL. The FAA is taking this action because the name of the Vero Beach, FL, VOR Tactical Air Navigation (VORTAC) facility, which is included in the descriptions of the above routes, is being changed to the Treasure VORTAC.

  3. Design and Operational Evaluation of the Traffic Management Advisor at the Ft. Worth Air Route Traffic Control Center

    Science.gov (United States)

    Swenson, Harry N.; Vincent, Danny; Tobias, Leonard (Technical Monitor)

    1997-01-01

    NASA and the FAA have designed and developed and an automation tool known as the Traffic Management Advisor (TMA). The system was operationally evaluated at the Ft. Worth Air Route Traffic Control Center (ARTCC). The TMA is a time-based strategic planning tool that provides Traffic Management Coordinators and En Route Air Traffic Controllers the ability to efficiently optimize the capacity of a demand impacted airport. The TMA consists of trajectory prediction, constraint-based runway scheduling, traffic flow visualization and controllers advisories. The TMA was used and operationally evaluated for forty-one rush traffic periods during a one month period in the Summer of 1996. The evaluations included all shifts of air traffic operations as well as periods of inclement weather. Performance data was collected for engineering and human factor analysis and compared with similar operations without the TMA. The engineering data indicates that the operations with the TMA show a one to two minute per aircraft delay reduction during rush periods. The human factor data indicate a perceived reduction in en route controller workload as well as an increase in job satisfaction. Upon completion of the evaluation, the TMA has become part of the normal operations at the Ft. Worth ARTCC.

  4. FAA Alleged Waste and Mismanagement of Air Route Traffic Control Centers Critical and Essential Power Systems Project

    Science.gov (United States)

    1996-10-16

    The Office of Inspector General (OIG) reviewed a complaint from Congressman Deal on behalf of a constituent. The constituent alleged waste and mismanagement occurred in the Federal Aviation Administration (FAA) Air Route Traffic Control Centers Criti...

  5. Radon in the air in the Millenium of the Polish State Underground Tourist Route in Klodzko (Lower Silesia, PL)

    International Nuclear Information System (INIS)

    Przylibski, T.A.

    1998-01-01

    The paper presents results of measurements of average monthly radon concentrations in drifts of the Millenium of the Polish State Underground Tourist Route in Klodzko. The studies revealed no significant seasonal fluctuations of radon concentration. Constant influx of radon from the geological basement, and most of all from loess-like loams and rhyolite inliers, is compensated by a natural ventilation system. Only in the summer periods of elevated radon concentrations in the air of the drifts and chambers of the Route can occur. In individual sections it is possible to measure occasional higher radon concentrations caused by local air flow fluctuations in the drifts. The highest concentrations were measured in places with the poorest ventilation - blind drifts ventilated only by backward currents. The average radon concentrations measured do not exceed concentrations allowed in apartment buildings. Therefore, in the Route there is no risk of exposure to excessive amounts of radon for personnel and tourists. The results obtained in the Route's drifts may be compared with minimum results expected in basements of houses in the Old Town in Klodzko. The paper stresses also a role of natural ventilation in protection of underground constructions and apartment buildings against high radon concentrations in areas of its elevated emanations from the geological basement. (author)

  6. Measurement and simulation of the in-flight radiation exposure on different air routes

    International Nuclear Information System (INIS)

    Hajek, M.; Berger, T.; Vana, N.

    2003-01-01

    The exposure of air-crew personnel to cosmic radiation is considered to be occupational exposure and requirements for dose assessment are given in the European Council Directive 96/29/EURATOM. The High-Temperature Ratio (HTR) Method for LiF: Mg, Ti TLDs utilizes the well-investigated relative intensity of the combined high-temperature glow peaks 6 and 7 compared with the dominant peak 5 (left-hand side of Figure 1) as an indication of the dose-average LET of a mixed radiation field of unknown composition. The difference in the peak-5 readings of the neutron-sensitive TLD-600 ( 6 LiF: Mg, Ti) and the neutron-insensitive TLD-700 ( 7 LiF: Mg, Ti) can be utilized to assess the neutron dose equivalent accumulated in-flight. For this purpose, the dosemeter crystals were calibrated individually in the CERN-EU High Energy Reference Field (CERF) [8] which simulates the cosmic-ray induced neutron spectrum in good detail. The experiments conducted onboard passenger aircraft on different north-bound and trans-equatorial flight routes were aimed at the following: to measure the total dose equivalent accumulated during the flight, to assess the contribution of neutrons, and to compare the results with calculations by means of the well-known CARI computer code. Measurements were performed on a series of eight north-bound flights between Cologne and Washington as well as on the routes Vienna-Atlanta, Vienna-Sydney and Vienna-Tokyo during different solar activity conditions. Precise altitude and route profiles were recorded by the pilots. The experimental results were compared with model calculations using the latest release 6M of the CARI code. Precise altitude and route data on a ten-minute to one-hour scale were taken as input. The calculated dose values indicate that the algorithms employed for the computational assessment of route doses have been significantly improved during the last decade. The CARI results generally tend to be in reasonable agreement with the measured

  7. Air Traffic Management Technology Demostration: 1 Research and Procedural Testing of Routes

    Science.gov (United States)

    Wilson, Sara R.; Kibler, Jennifer L.; Hubbs, Clay E.; Smail, James W.

    2015-01-01

    NASA's Air Traffic Management Technology Demonstration-1 (ATD-1) will operationally demonstrate the feasibility of efficient arrival operations combining ground-based and airborne NASA technologies. The ATD-1 integrated system consists of the Traffic Management Advisor with Terminal Metering which generates precise time-based schedules to the runway and merge points; Controller Managed Spacing decision support tools which provide controllers with speed advisories and other information needed to meet the schedule; and Flight deck-based Interval Management avionics and procedures which allow flight crews to adjust their speed to achieve precise relative spacing. Initial studies identified air-ground challenges related to the integration of these three scheduling and spacing technologies, and NASA's airborne spacing algorithm was modified to address some of these challenges. The Research and Procedural Testing of Routes human-in-the-loop experiment was then conducted to assess the performance of the new spacing algorithm. The results of this experiment indicate that the algorithm performed as designed, and the pilot participants found the airborne spacing concept, air-ground procedures, and crew interface to be acceptable. However, the researchers concluded that the data revealed issues with the frequency of speed changes and speed reversals.

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

    Science.gov (United States)

    Soler, Lluis

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

  9. Assessment of air quality in and around a steel industry with direct reduction iron route.

    Science.gov (United States)

    Jena, Pradip K; Behera, Dillip K; Mishra, C S K; Mohanty, Saswat K

    2011-10-01

    The coal based Direct Reduced Iron (DRI) route for secondary steel production is now a preferred choice in India. Steel making is invariably associated with emission of air pollutants into the environment. Air quality monitoring was carried out in Winter, Summer and Rainy seasons of 2008 in eight monitoring stations in the work zone and five stations in the residential zone of an Integrated Steel Industry located in Orissa state, India. Four air quality parameters i.e. SPM, RSPM, SO2 and NO2 were monitored. Mean SPM and RSPM values were found to be significantly high (p < 0.01) at stations nearer to source in both work zone and residential zone .The highest average SPM and RSPM values in the work zone recorded were 4869 microg/m3 and 1420 microg/m3 and in the residential zone 294 microg/m3 and 198 microg/m3 respectively. No significant difference in the SO2 and NO2 levels was observed between the work and residential zones. In general, the values of air pollutants were highest in Winter followed by Summer and Rainy season. SPM and RSPM values exceeded the National Air Quality Standards (NAAQS) in both the residential and work zones.

  10. Development of a Healthy Urban Route Planner for cyclists and pedestrians in Amsterdam

    Science.gov (United States)

    van der Molen, Michiel; Ligtenberg, Arend; Vreugdenhil, Corne; Steeneveld, Gert-Jan

    2017-04-01

    Cities are hotspots of air pollution and heat stress, the exposure to which results in nuisance, health risks, cost of medication, reduced labour productivity and sick leave for citizens. Yet the air pollution and heat stress are spatially and temporally unevenly distributed over the city, depending on pollutant emissions, street design and atmospheric turbulent mixing and radiation. This spatiotemporal variation allows pedestrians and bikers to choose alternative routes to minimize their exposure, if the distribution is known. In this project, we develop a route planner for bicyclists and pedestrians for Amsterdam (NL), that proposes routes and departure times based on model simulations of weather and air quality. We use the WRF-Chem atmosphere and air quality model at unprecedented grid spacing of 100-m (Ronda et al, 2015, Super et al, 2016), with an underlying urban canopy model and NOx and PM10 emissions. The emissions by traffic are calculated based on observed traffic intensities and emission factors. An urban land use map will characterize urban density and street configuration to estimate urban heat storage (Attema et al, 2015). WRF-Chem runs will be issued daily for a lead time of 48 hours, resulting in forecast maps of temperature and pollutant concentrations that will be uniquely expressed in a metric that combines both threats. The hourly fields of this metric are provided to the route planner based on the open source routing library pgRouting to identify the more healthy routes on the route network of Amsterdam. The objectives of the healthy urban route planner are to raise awareness of heat and air quality issues in Amsterdam, to provide an innovative adaptation tool for citizens and tourists, to locate the most important bottlenecks in (the exposure to) air pollution and heat stress, and ultimately to test the readiness of the travellers to use the information and adapt the route. We expect to particularly target a group of lung- and cardiovascular

  11. Dynamics of Air Passenger Transportation in Eastern Romania

    Directory of Open Access Journals (Sweden)

    Dan Păuna

    2013-10-01

    Full Text Available The concept of an air route mile is, of course, entirely different from that of a road or rail route mile. An air route is a direct service between two cities. The too-rapid development of the air route system must inevitably result in an average intensity of operations on the route, and this means the frequencies are low or high, or the airplanes used are profitable or unprofitable. The purpose of this paper is to emphasize air passenger dynamics in Romania and to calculate specific indicators regarding this calculation for the airports in eastern Romania in 2011t., this, because the air passenger featurea indicator passenger – kilometer, starting with 2009 no longer calculate for aviation and shipping.

  12. Radon as a tracer of daily, seasonal and spatial air movements in the Underground Tourist Route "Coal Mine" (SW Poland).

    Science.gov (United States)

    Tchorz-Trzeciakiewicz, Dagmara Eulalia; Parkitny, Tomasz

    2015-11-01

    The surveys of radon concentrations in the Underground Tourist Route "Coal Mine" were carried out using passive and active measurement techniques. Passive methods with application of Solid State Nuclear Track Detectors LR115 were used at 4 points in years 2004-2007 and at 21 points in year 2011. These detectors were exchanged at the beginning of every season in order to get information about seasonal and spatial changes of radon concentrations. The average radon concentration noted in this facility was 799 Bq m(-3) and is consistent with radon concentrations noted in Polish coal mines. Seasonal variations, observed in this underground tourist route, were as follows: the highest radon concentrations were noted during summers, the lowest during winters, during springs and autumns intermediate but higher in spring than in autumn. The main external factor that affected seasonal changes of radon concentrations was the seasonal variation of outside temperature. No correlation between seasonal variations of radon concentrations and seasonal average atmospheric pressures was found. Spatial variations of radon concentrations corresponded with air movements inside the Underground Tourist Route "Coal Mine". The most vivid air movements were noted along the main tunnel in adit and at the place located near no blinded (in the upper part) shaft. Daily variations of radon concentrations were recorded in May 2012 using RadStar RS-230 as the active measurement technique. Typical daily variations of radon concentrations followed the pattern that the highest radon concentrations were recorded from 8-9 a.m. to 7-8 p.m. and the lowest during nights. The main factor responsible for hourly variations of radon concentrations was the daily variation of outside temperatures. No correlations were found between radon concentration and other meteorological parameters such as atmospheric pressure, wind velocity or precipitation. Additionally, the influence of human factor on radon

  13. Benefits Analysis of Multi-Center Dynamic Weather Routes

    Science.gov (United States)

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

    2014-01-01

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

  14. Relationship between Air Traffic Selection and Training (AT-SAT)) Battery Test Scores and Composite Scores in the Initial en Route Air Traffic Control Qualification Training Course at the Federal Aviation Administration (FAA) Academy

    Science.gov (United States)

    Kelley, Ronald Scott

    2012-01-01

    Scope and Method of Study: This study focused on the development and use of the AT-SAT test battery and the Initial En Route Qualification training course for the selection, training, and evaluation of air traffic controller candidates. The Pearson product moment correlation coefficient was used to measure the linear relationship between the…

  15. Research on the Optimization of Air Route in Air-interception Based on Threat Situation%基于态势威胁的歼击机截击航路优化方法研究

    Institute of Scientific and Technical Information of China (English)

    李俊; 林云; 韩玉龙; 章世峰; 王兆军

    2016-01-01

    针对如何设计截击空战中的接敌阶段的航路问题,提出基于扩大对敌威胁因子的航路设计算法。根据双方飞机性能与挂载武器性能,改进了飞机的机动模型和威胁因子模型,将截击过程分成若干时间段,建立相对态势威胁与飞机机动策略之间的函数关系,得出每个时间段内对敌威胁最大的策略,视为在该时间段内的最优策略,将每个时间段内做出最优策略后的飞机所在坐标连续记录,即为截击飞机的最优航路。最后对随机假想的初始态势利用 MATLAB 软件进行仿真计算,结果表明:利用该算法可以得到歼击机在截击接敌段的最优航路。%According to the problem that how to design the air route when get approach in air‐interception ,this paper puts forward an algorithm to design air route based on increasing the threat factor to enemy .The battleplane’s mobility model and threat factor model are improved according to the ability of battleplane and airborne weapons system of two side .The time for air‐interception is cut to many little parts ,and a relationship between the threat factor and the battleplane’s mobility strategy in every part are built up to get a best mobility strategy for increasing the threat factor ,recording the coordinate of the battleplane after doing the best strategy continuously ,to get a best air route in target approach of air‐interception .At last ,an example is given to simulate with Matlab ,get an optimized air route in target approach of air‐interception.

  16. The Route Analysis Based On Flight Plan

    Science.gov (United States)

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

    2016-02-01

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

  17. Conflict Resolution Performance in an Experimental Study of En Route Free Maneuvering Operations

    Science.gov (United States)

    Doble, Nathan A.; Barhydt, Richard; Hitt, James M., II

    2005-01-01

    NASA has developed a far-term air traffic management concept, termed Distributed Air/Ground Traffic Management (DAG-TM). One component of DAG-TM, En Route Free Maneuvering, allows properly trained flight crews of equipped autonomous aircraft to assume responsibility for separation from other autonomous aircraft and from Instrument Flight Rules (IFR) aircraft. Ground-based air traffic controllers continue to separate IFR traffic and issue flow management constraints to all aircraft. To examine En Route Free Maneuvering operations, a joint human-in-the-loop experiment was conducted in summer 2004 at the NASA Ames and Langley Research Centers. Test subject pilots used desktop flight simulators to resolve traffic conflicts and adhere to air traffic flow constraints issued by subject controllers. The experimental airspace integrated both autonomous and IFR aircraft at varying traffic densities. This paper presents a subset of the En Route Free Maneuvering experimental results, focusing on airborne and ground-based conflict resolution, and the effects of increased traffic levels on the ability of pilots and air traffic controllers to perform this task. The results show that, in general, increases in autonomous traffic do not significantly impact conflict resolution performance. In addition, pilot acceptability of autonomous operations remains high throughout the range of traffic densities studied. Together with previously reported findings, these results continue to support the feasibility of the En Route Free Maneuvering component of DAG-TM.

  18. Air traffic simulation in chemistry-climate model EMAC 2.41: AirTraf 1.0

    Science.gov (United States)

    Yamashita, Hiroshi; Grewe, Volker; Jöckel, Patrick; Linke, Florian; Schaefer, Martin; Sasaki, Daisuke

    2016-09-01

    Mobility is becoming more and more important to society and hence air transportation is expected to grow further over the next decades. Reducing anthropogenic climate impact from aviation emissions and building a climate-friendly air transportation system are required for a sustainable development of commercial aviation. A climate optimized routing, which avoids climate-sensitive regions by re-routing horizontally and vertically, is an important measure for climate impact reduction. The idea includes a number of different routing strategies (routing options) and shows a great potential for the reduction. To evaluate this, the impact of not only CO2 but also non-CO2 emissions must be considered. CO2 is a long-lived gas, while non-CO2 emissions are short-lived and are inhomogeneously distributed. This study introduces AirTraf (version 1.0) that performs global air traffic simulations, including effects of local weather conditions on the emissions. AirTraf was developed as a new submodel of the ECHAM5/MESSy Atmospheric Chemistry (EMAC) model. Air traffic information comprises Eurocontrol's Base of Aircraft Data (BADA Revision 3.9) and International Civil Aviation Organization (ICAO) engine performance data. Fuel use and emissions are calculated by the total energy model based on the BADA methodology and Deutsches Zentrum für Luft- und Raumfahrt (DLR) fuel flow method. The flight trajectory optimization is performed by a genetic algorithm (GA) with respect to a selected routing option. In the model development phase, benchmark tests were performed for the great circle and flight time routing options. The first test showed that the great circle calculations were accurate to -0.004 %, compared to those calculated by the Movable Type script. The second test showed that the optimal solution found by the algorithm sufficiently converged to the theoretical true-optimal solution. The difference in flight time between the two solutions is less than 0.01 %. The dependence of

  19. A Computer Simulation of the System-Wide Effects of Parallel-Offset Route Maneuvers

    Science.gov (United States)

    Lauderdale, Todd A.; Santiago, Confesor; Pankok, Carl

    2010-01-01

    Most aircraft managed by air-traffic controllers in the National Airspace System are capable of flying parallel-offset routes. This paper presents the results of two related studies on the effects of increased use of offset routes as a conflict resolution maneuver. The first study analyzes offset routes in the context of all standard resolution types which air-traffic controllers currently use. This study shows that by utilizing parallel-offset route maneuvers, significant system-wide savings in delay due to conflict resolution of up to 30% are possible. It also shows that most offset resolutions replace horizontal-vectoring resolutions. The second study builds on the results of the first and directly compares offset resolutions and standard horizontal-vectoring maneuvers to determine that in-trail conflicts are often more efficiently resolved by offset maneuvers.

  20. Radon as a tracer of daily, seasonal and spatial air movements in the Underground Tourist Route “Coal Mine” (SW Poland)

    International Nuclear Information System (INIS)

    Tchorz-Trzeciakiewicz, Dagmara Eulalia; Parkitny, Tomasz

    2015-01-01

    The surveys of radon concentrations in the Underground Tourist Route “Coal Mine” were carried out using passive and active measurement techniques. Passive methods with application of Solid State Nuclear Track Detectors LR115 were used at 4 points in years 2004–2007 and at 21 points in year 2011. These detectors were exchanged at the beginning of every season in order to get information about seasonal and spatial changes of radon concentrations. The average radon concentration noted in this facility was 799 Bq m"−"3 and is consistent with radon concentrations noted in Polish coal mines. Seasonal variations, observed in this underground tourist route, were as follows: the highest radon concentrations were noted during summers, the lowest during winters, during springs and autumns intermediate but higher in spring than in autumn. The main external factor that affected seasonal changes of radon concentrations was the seasonal variation of outside temperature. No correlation between seasonal variations of radon concentrations and seasonal average atmospheric pressures was found. Spatial variations of radon concentrations corresponded with air movements inside the Underground Tourist Route “Coal Mine”. The most vivid air movements were noted along the main tunnel in adit and at the place located near no blinded (in the upper part) shaft. Daily variations of radon concentrations were recorded in May 2012 using RadStar RS-230 as the active measurement technique. Typical daily variations of radon concentrations followed the pattern that the highest radon concentrations were recorded from 8–9 a.m. to 7–8 p.m. and the lowest during nights. The main factor responsible for hourly variations of radon concentrations was the daily variation of outside temperatures. No correlations were found between radon concentration and other meteorological parameters such as atmospheric pressure, wind velocity or precipitation. Additionally, the influence of human factor on

  1. Aircraft route forecasting under adverse weather conditions

    Directory of Open Access Journals (Sweden)

    Thomas Hauf

    2017-04-01

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

  2. The influence of fixed-route taxi on road accidents and air pollution

    Directory of Open Access Journals (Sweden)

    V. Fedotov

    2006-03-01

    Full Text Available The development of market economy in Russia expands the need for movement of groups of people of large mega cities on time to a place at simultaneous reduction of the number of groups with identical purposes. Therefore for many cities a wide use of fixed-route taxis the service of passengers at a constant increase of the numbers of routes and the numbers of transport units was characteristic. At the certain intensity of the movement of fixed-route taxis on separate sites of city highways the transport stream and the changing quality of environment raises the risk of road accident and becomes ecologically unsafe. The results of the estimation of the negative influence of fixed-route taxis in comparison with other categories of vehicles are presented. The research was made on city highways running through the zones with a greater number of cultural and community places, shopping centers and administrative establishments. Perspective ways of the increase of traffic safety and the decrease of concentration of harmful emissions are offered.

  3. Route Monopolie and Optimal Nonlinear Pricing

    Science.gov (United States)

    Tournut, Jacques

    2003-01-01

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

  4. Occurrence of radon in the Polish underground tourist routes

    Directory of Open Access Journals (Sweden)

    Jerzy Olszewski

    2015-08-01

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

  5. Cooperative Route Planning for Multiple Aircraft in a Semifree ATC System

    Directory of Open Access Journals (Sweden)

    Yi Yang

    2018-01-01

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

  6. Air traffic management evaluation tool

    Science.gov (United States)

    Sridhar, Banavar (Inventor); Sheth, Kapil S. (Inventor); Chatterji, Gano Broto (Inventor); Bilimoria, Karl D. (Inventor); Grabbe, Shon (Inventor); Schipper, John F. (Inventor)

    2012-01-01

    Methods for evaluating and implementing air traffic management tools and approaches for managing and avoiding an air traffic incident before the incident occurs. A first system receives parameters for flight plan configurations (e.g., initial fuel carried, flight route, flight route segments followed, flight altitude for a given flight route segment, aircraft velocity for each flight route segment, flight route ascent rate, flight route descent route, flight departure site, flight departure time, flight arrival time, flight destination site and/or alternate flight destination site), flight plan schedule, expected weather along each flight route segment, aircraft specifics, airspace (altitude) bounds for each flight route segment, navigational aids available. The invention provides flight plan routing and direct routing or wind optimal routing, using great circle navigation and spherical Earth geometry. The invention provides for aircraft dynamics effects, such as wind effects at each altitude, altitude changes, airspeed changes and aircraft turns to provide predictions of aircraft trajectory (and, optionally, aircraft fuel use). A second system provides several aviation applications using the first system. Several classes of potential incidents are analyzed and averted, by appropriate change en route of one or more parameters in the flight plan configuration, as provided by a conflict detection and resolution module and/or traffic flow management modules. These applications include conflict detection and resolution, miles-in trail or minutes-in-trail aircraft separation, flight arrival management, flight re-routing, weather prediction and analysis and interpolation of weather variables based upon sparse measurements. The invention combines these features to provide an aircraft monitoring system and an aircraft user system that interact and negotiate changes with each other.

  7. INVESTIGATION INTO ADVANCED AIR TRANSPORTATION NETWORK OF RUSSIAN FEDERATION

    Directory of Open Access Journals (Sweden)

    A. U. Udzhukhu

    2014-01-01

    Full Text Available An approach allowing one to predict the development of air-route network is proposed. It proceeds from the principle of increasing the accessibility of points of destination, that is to make available for passengers non-stop flights or flights with one transit landing in case of the largest number of routes. With comparative analysis of possible variants of extending the structure of air-route network, it is reasonable to take into account a generalized time parameter and a number of alternative routes for passenger delivery from departure point to point of destination.

  8. "Choice of Air Cargo Transshipment Airport: An Application to Air Cargo Traffic to/from Northeast Asia"

    OpenAIRE

    Hiroshi Ohashi; Tae-Seung Kim; Tae Hoon Oum; Chunyan Yu

    2004-01-01

    Based on a unique data set of 760 air cargo transshipment routings to/from the Northeast Asian region in 2000, this paper applies an aggregate form of multinomial logit model to identify the critical factors influencing air cargo transshipment route choice decisions. The analysis focuses on the trade-off between monetary cost and time cost while considering other variables relevant for choice of transshipment airport. The estimation method considers the presence of unobserved attributes, and ...

  9. Attitudes on En Route Air Traffic Control Training and Work: A Comparison of Recruits Initially Trained at the FAA Academy and Recruits Initially Trained at Assigned Centers.

    Science.gov (United States)

    Mathews, John J.; And Others

    In the comparison, questionnaires concerning aspects of training-related and work-related attitudes were sent to 225 Air Traffic Control (ATC) trainees who represented groups of attritions and retentions in two En Route training programs; viz, programs that provided basic training at the FAA Academy and programs that provided basic training at the…

  10. A System Concept for Facilitating User Preferences in En Route Airspace

    Science.gov (United States)

    Vivona, R. A.; Ballin, M. G.; Green, S. M.; Bach, R. E.; McNally, B. D.

    1996-01-01

    The Federal Aviation Administration is trying to make its air traffic management system more responsive to the needs of the aviation community by exploring the concept of 'free flight' for aircraft flying under instrument flight rules. A logical first step toward free flight could be made without significantly altering current air traffic control (ATC) procedures or requiring new airborne equipment by designing a ground-based system to be highly responsive to 'user preference' in en route airspace while providing for an orderly transition to the terminal area. To facilitate user preference in all en route environments, a system based on an extension of the Center/TRACON Automation System (CTAS) is proposed in this document. The new system would consist of two integrated components. An airspace tool (AT) focuses on unconstrained en route aircraft (e.g., not transitioning to the terminal airspace), taking advantage of the relatively unconstrained nature of their flights and using long-range trajectory prediction to provide cost-effective conflict resolution advisories to sector controllers. A sector tool (ST) generates efficient advisories for all aircraft, with a focus on supporting controllers in analyzing and resolving complex, highly constrained traffic situations. When combined, the integrated AT/ST system supports user preference in any air route traffic control center sector. The system should also be useful in evaluating advanced free-flight concepts by serving as a test bed for future research. This document provides an overview of the design concept, explains its anticipated benefits, and recommends a development strategy that leads to a deployable system.

  11. 75 FR 39149 - Establishment of Low Altitude Area Navigation Route (T-284); Houston, TX

    Science.gov (United States)

    2010-07-08

    ... (T-284); Houston, TX AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule... area navigation (RNAV) route T-284 for the Houston, TX, terminal area, is being withdrawn. As a result of Houston Area Air Traffic System (HAATS) Project, Phase 3C, program actions, the route is pending...

  12. A Review of Function Allocation and En Route Separation Assurance

    Science.gov (United States)

    Lewis, Timothy A.; Aweiss, Arwa S.; Guerreiro, Nelson M.; Daiker, Ronald J.

    2016-01-01

    Today's air traffic control system has reached a limit to the number of aircraft that can be safely managed at the same time. This air traffic capacity bottleneck is a critical problem along the path to modernization for air transportation. The design of the next separation assurance system to address this problem is a cornerstone of air traffic management research today. This report reviews recent work by NASA and others in the areas of function allocation and en route separation assurance. This includes: separation assurance algorithms and technology prototypes; concepts of operations and designs for advanced separation assurance systems; and specific investigations into air-ground and human-automation function allocation.

  13. 78 FR 53239 - Establishment, Modification and Cancellation of Air Traffic Service (ATS) Routes; Northeast...

    Science.gov (United States)

    2013-08-29

    ... Traffic Service (ATS) Routes; Northeast United States AGENCY: Federal Aviation Administration (FAA), DOT... northeast United States. This action is necessary due to the decommissioning of the Lake Henry, PA, VHF... navigation (RNAV) routes; and cancel two VOR Federal airways in the northeast United States (78 FR 38236...

  14. The cost of simplifying air travel when modeling disease spread.

    Directory of Open Access Journals (Sweden)

    Justin Lessler

    Full Text Available BACKGROUND: Air travel plays a key role in the spread of many pathogens. Modeling the long distance spread of infectious disease in these cases requires an air travel model. Highly detailed air transportation models can be over determined and computationally problematic. We compared the predictions of a simplified air transport model with those of a model of all routes and assessed the impact of differences on models of infectious disease. METHODOLOGY/PRINCIPAL FINDINGS: Using U.S. ticket data from 2007, we compared a simplified "pipe" model, in which individuals flow in and out of the air transport system based on the number of arrivals and departures from a given airport, to a fully saturated model where all routes are modeled individually. We also compared the pipe model to a "gravity" model where the probability of travel is scaled by physical distance; the gravity model did not differ significantly from the pipe model. The pipe model roughly approximated actual air travel, but tended to overestimate the number of trips between small airports and underestimate travel between major east and west coast airports. For most routes, the maximum number of false (or missed introductions of disease is small (<1 per day but for a few routes this rate is greatly underestimated by the pipe model. CONCLUSIONS/SIGNIFICANCE: If our interest is in large scale regional and national effects of disease, the simplified pipe model may be adequate. If we are interested in specific effects of interventions on particular air routes or the time for the disease to reach a particular location, a more complex point-to-point model will be more accurate. For many problems a hybrid model that independently models some frequently traveled routes may be the best choice. Regardless of the model used, the effect of simplifications and sensitivity to errors in parameter estimation should be analyzed.

  15. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

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

    2010-01-01

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

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

    Science.gov (United States)

    Baldwin, Jarret Taylor

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

  17. The Effects of the Emission Cost on Route Choices of International Container Ships

    Directory of Open Access Journals (Sweden)

    Hyangsook Lee

    2016-01-01

    Full Text Available Maritime freight shipping has increased significantly and air pollution from international ships has grown accordingly, having serious environmental effects all over the world. This paper analyzes the effects of the emission cost on ocean route choices, focusing on international container ships. First, the paper formulates a freight network model that captures decisions and interactions of ocean carriers and port terminal operators in the maritime freight transport system. Then, the emission cost is calculated based on an activity-based approach as a component of the ocean transportation cost function. A case study is examined to find if the emission cost affects ocean route choices. The results indicate that the optimal ocean route and transportation cost are changed distinctively due to the emission cost. The research discusses how the emission cost plays a role in route changes and why ocean carriers have to consider these costs in their routing decisions.

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

    NARCIS (Netherlands)

    Westerbeek, Hans; Maes, Alfons

    2013-01-01

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

  19. The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations

    DEFF Research Database (Denmark)

    Dithmer, Philip; Reinhardt, Line Blander; Kontovas, Christos

    2017-01-01

    This paper deals with the Liner Shipping Routing and Scheduling Problem (LSRSP), which consists of designing the time schedule for a vessel to visit a fixed set of ports while minimizing costs. We extend the classical problem to include the external cost of ship air emissions and we present some...

  20. Routing Service Quality—Local Driver Behavior Versus Routing Services

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

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

  1. 77 FR 23114 - Modification, Revocation and Establishment of Air Traffic Service Routes; Windsor Locks Area; CT

    Science.gov (United States)

    2012-04-18

    ... Traffic Service Routes; Windsor Locks Area; CT AGENCY: Federal Aviation Administration (FAA), DOT. ACTION... coordinate for one point in the description of area navigation (RNAV) route T-300. DATES: Effective date 0901... action under 1 CFR part 51, subject to the annual revision of FAA Order 7400.9 and publication of...

  2. Carbon monoxide levels in popular passenger commuting modes traversing major commuting routes in Hong Kong

    International Nuclear Information System (INIS)

    Chan, L.Y.; Liu, Y.M.

    2001-01-01

    Vehicle exhaust is a major source of air pollution in metropolitan cities. Commuters are exposed to high traffic-related pollutant concentrations. Public transportation is the most popular commuting mode in Hong Kong and there are about 10.8 million passenger trips every day. Two-thirds of them are road commuters. An extensive survey was conducted to measure carbon monoxide in three popular passenger commuting modes, bus, minibus, and taxi, which served, respectively, 3.91 million, 1.76 million and 1.31 million passenger trips per day in 1998. Three types of commuting microenvironments were selected: urban-urban, urban-suburban and urban-rural. Results indicated that in-vehicle CO level increased in the following order: bus, minibus and taxi. The overall average in-vehicle CO level in air-conditioned bus, minibus and taxi were 1.8, 2.9 and 3.3ppm, respectively. The average concentration level between air-conditioned buses (1.8ppm) and non-air-conditioned buses (1.9ppm) was insignificant. The fluctuation of in-vehicle CO level of non-air-conditioned vehicle followed the variation of out-vehicle CO concentration. Our result also showed that even in air-conditioned vehicles, the in-vehicle CO concentration was affected by the out-vehicle CO concentration although there exists a smoothing out effect. The in-vehicle CO level was the highest in urban-suburban commuting routes and was followed by urban-urban routes. The in-vehicle CO level in urban-rural routes was the lowest. The highest CO level was recorded after the vehicle traversed through tunnel.. The average CO exposure level of public road transportation commuters in Honk Kong was lower than most other cities. Factors governing the CO levels were also discussed. (Author)

  3. Development and Application of a Next Generation Air Sensor Network for the Hong Kong Marathon 2015 Air Quality Monitoring.

    Science.gov (United States)

    Sun, Li; Wong, Ka Chun; Wei, Peng; Ye, Sheng; Huang, Hao; Yang, Fenhuan; Westerdahl, Dane; Louie, Peter K K; Luk, Connie W Y; Ning, Zhi

    2016-02-05

    This study presents the development and evaluation of a next generation air monitoring system with both laboratory and field tests. A multi-parameter algorithm was used to correct for the impact of environmental conditions on the electrochemical sensors for carbon monoxide (CO) and nitrogen dioxide (NO2) pollutants. The field evaluation in an urban roadside environment in comparison to designated monitors showed good agreement with measurement error within 5% of the pollutant concentrations. Multiple sets of the developed system were then deployed in the Hong Kong Marathon 2015 forming a sensor-based network along the marathon route. Real-time air pollution concentration data were wirelessly transmitted and the Air Quality Health Index (AQHI) for the Green Marathon was calculated, which were broadcast to the public on an hourly basis. The route-specific sensor network showed somewhat different pollutant patterns than routine air monitoring, indicating the immediate impact of traffic control during the marathon on the roadside air quality. The study is one of the first applications of a next generation sensor network in international sport events, and it demonstrated the usefulness of the emerging sensor-based air monitoring technology in rapid network deployment to supplement existing air monitoring.

  4. State alternative route designations

    International Nuclear Information System (INIS)

    1989-07-01

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

  5. Development and Application of a Next Generation Air Sensor Network for the Hong Kong Marathon 2015 Air Quality Monitoring

    Directory of Open Access Journals (Sweden)

    Li Sun

    2016-02-01

    Full Text Available This study presents the development and evaluation of a next generation air monitoring system with both laboratory and field tests. A multi-parameter algorithm was used to correct for the impact of environmental conditions on the electrochemical sensors for carbon monoxide (CO and nitrogen dioxide (NO2 pollutants. The field evaluation in an urban roadside environment in comparison to designated monitors showed good agreement with measurement error within 5% of the pollutant concentrations. Multiple sets of the developed system were then deployed in the Hong Kong Marathon 2015 forming a sensor-based network along the marathon route. Real-time air pollution concentration data were wirelessly transmitted and the Air Quality Health Index (AQHI for the Green Marathon was calculated, which were broadcast to the public on an hourly basis. The route-specific sensor network showed somewhat different pollutant patterns than routine air monitoring, indicating the immediate impact of traffic control during the marathon on the roadside air quality. The study is one of the first applications of a next generation sensor network in international sport events, and it demonstrated the usefulness of the emerging sensor-based air monitoring technology in rapid network deployment to supplement existing air monitoring.

  6. Development and Application of a Next Generation Air Sensor Network for the Hong Kong Marathon 2015 Air Quality Monitoring

    Science.gov (United States)

    Sun, Li; Wong, Ka Chun; Wei, Peng; Ye, Sheng; Huang, Hao; Yang, Fenhuan; Westerdahl, Dane; Louie, Peter K.K.; Luk, Connie W.Y.; Ning, Zhi

    2016-01-01

    This study presents the development and evaluation of a next generation air monitoring system with both laboratory and field tests. A multi-parameter algorithm was used to correct for the impact of environmental conditions on the electrochemical sensors for carbon monoxide (CO) and nitrogen dioxide (NO2) pollutants. The field evaluation in an urban roadside environment in comparison to designated monitors showed good agreement with measurement error within 5% of the pollutant concentrations. Multiple sets of the developed system were then deployed in the Hong Kong Marathon 2015 forming a sensor-based network along the marathon route. Real-time air pollution concentration data were wirelessly transmitted and the Air Quality Health Index (AQHI) for the Green Marathon was calculated, which were broadcast to the public on an hourly basis. The route-specific sensor network showed somewhat different pollutant patterns than routine air monitoring, indicating the immediate impact of traffic control during the marathon on the roadside air quality. The study is one of the first applications of a next generation sensor network in international sport events, and it demonstrated the usefulness of the emerging sensor-based air monitoring technology in rapid network deployment to supplement existing air monitoring. PMID:26861336

  7. Hurricane Evacuation Routes

    Data.gov (United States)

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

  8. A Machine Learning Approach to Air Traffic Route Choice Modelling

    OpenAIRE

    Marcos, Rodrigo; García-Cantú, Oliva; Herranz, Ricardo

    2018-01-01

    Air Traffic Flow and Capacity Management (ATFCM) is one of the constituent parts of Air Traffic Management (ATM). The goal of ATFCM is to make airport and airspace capacity meet traffic demand and, when capacity opportunities are exhausted, optimise traffic flows to meet the available capacity. One of the key enablers of ATFCM is the accurate estimation of future traffic demand. The available information (schedules, flight plans, etc.) and its associated level of uncertainty differ across the...

  9. Simulation and Optimization Methodologies for Military Transportation Network Routing and Scheduling and for Military Medical Services

    National Research Council Canada - National Science Library

    Rodin, Ervin Y

    2005-01-01

    The purpose of this present research was to develop a generic model and methodology for analyzing and optimizing large-scale air transportation networks including both their routing and their scheduling...

  10. 48 CFR 47.403-1 - Availability and unavailability of U.S.-flag air carrier service.

    Science.gov (United States)

    2010-10-01

    ... farthest interchange point on a usually traveled route. (2) When an origin or interchange point is not... interchange point on a usually traveled route to connect with U.S.-flag air carrier service. (3) When a U.S... travel by a foreign-flag air carrier. (e) For travel between two points outside the United States, the...

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

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  12. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

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

  13. 76 FR 57902 - Amendment and Establishment of Air Traffic Service Routes; Northeast United States

    Science.gov (United States)

    2011-09-19

    ... Routes; Northeast United States AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule.../DME 040[deg] radial northeast of Kennedy VOR/DME. V-16 then turns east bound, bypassing the Deer Park...

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

    NARCIS (Netherlands)

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

    2012-01-01

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

  15. Dynamic traffic management and air quality; Dynamisch verkeersmanagement en luchtkwaliteit

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2010-06-15

    Traffic flow can be improved by means of dynamic routing and regulation as a result of which traffic might choose a different route. Therefore, in this report also attention is paid to the effects on other road sections, such as improvement of the air quality. Calculations were carried out for the cases Southeast Amsterdam, Alkmaar and De Bilt. The detailed impacts on traffic and on air quality are available in the annex. All the reported air quality impacts are calculated using CAR II, version 8.0 for the year 2010. [Dutch] Doorstroming van het verkeer kan worden bevorderd door middel van dynamisch routeren en doseren. Het verkeer zal door deze maatregel een andere route gaan kiezen. Daarom besteedt de publicatie ook aandacht aan de effecten op de overige wegvakken, zoals verbetering van de luchtkwaliteit. Voor deze publikatie zijn berekeningen uitgevoerd voor de cases Amsterdam-zuidoost, Alkmaar en De Bilt. De gedetailleerde verkeerseffecten en effecten op luchtkwaliteit staan in de gratis beschikbare bijlage. Alle in deze rapportage opgenomen effecten op luchtkwaliteit zijn berekend met CAR II, versie 8.0 voor het jaar 2010.

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

    International Nuclear Information System (INIS)

    Johnson, P.E.

    1995-01-01

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

  17. VINE ROUTES IN BULGARIA

    Directory of Open Access Journals (Sweden)

    Lyuben Hristov

    2015-03-01

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

  18. Robust against route failure using power proficient reliable routing in MANET

    Directory of Open Access Journals (Sweden)

    M. Malathi

    2018-03-01

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

  19. Comparison of transhepatic and extrahepatic routes for EUS-guided rendezvous procedure for distal CBD obstruction.

    Science.gov (United States)

    Dhir, Vinay; Bhandari, Suryaprakash; Bapat, Mukta; Joshi, Nitin; Vivekanandarajah, Suhirdan; Maydeo, Amit

    2013-04-01

    EUS-guided rendezvous procedure (EUS-RV) can be done by the transhepatic (TH) or the extrahepatic (EH) route. There is no data on the preferred access route when both routes are available. To compare the success, complications, and duration of hospitalization for patients undergoing EUS-RV by the TH or the EH route. Patients with distal common bile duct (CBD) obstruction, who failed selective cannulation, underwent EUS-RV by the TH route through the stomach or the EH route through the duodenum. A total of 35 patients were analysed (17 TH, 18 EH). The mean procedure time was significantly longer for the TH group (34.4 vs. 25.7 min; p = 0.0004). There was no difference in the technical success (94.1 vs. 100%). However, the TH group had a higher incidence of post-procedure pain (44.1 vs. 5.5%; p = 0.017), bile leak (11.7 vs. 0; p = 0.228), and air under diaphragm (11.7 vs. 0; p = 0.228). All bile leaks were small and managed conservatively. Duration of hospitalization was significantly higher for the TH group (2.52 vs. 0.17 days; p = 0.015). EUS-RV has similar success rate by the TH or the EH route. However, the TH route has higher post-procedure pain, longer procedure time, and longer duration of hospitalization. The EH route should be preferred for EUS-RV in patients with distal CBD obstruction when both access routes are technically feasible.

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  1. Optimization and Flight Schedules of Pioneer Routes in Papua Province

    Science.gov (United States)

    Ronting, Y.; Adisasmita, S. A.; Hamid, S.; Hustim, M.

    2018-04-01

    The province of Papua has a very varied topography, ranging from swampy lowlands, hills, and plateaus up steep hills. The total area of land is 410,660 km2, which consists of 28 counties and one city, 389 districts and 5.420 villages. The population of Papua Province in 2017 was 3.265.202 people with an average growth of 4.21% per year. The transportation services is still low, especially in the mountainous region, which is isolated and could only be reached by an air transportation mode, causing a considerable price disparity between coastal and mountainous areas. The purpose of this paper is to develop the route optimization and pioneer flight schedules models as an airbridge. This research is conducted by collecting primary data and secondary data. Data is based on field surveys; interviews; discussions with airport authority, official government, etc; and also from various agencies. The analytical tools used to optimization flight schedule and route are analyzed by add-in solver in Microsoft Excel. The results of the analysis we can get a more optimal route so that it can save transportation costs by 7.26%.

  2. Analyzing the evolutionary mechanisms of the Air Transportation System-of-Systems using network theory and machine learning algorithms

    Science.gov (United States)

    Kotegawa, Tatsuya

    Complexity in the Air Transportation System (ATS) arises from the intermingling of many independent physical resources, operational paradigms, and stakeholder interests, as well as the dynamic variation of these interactions over time. Currently, trade-offs and cost benefit analyses of new ATS concepts are carried out on system-wide evaluation simulations driven by air traffic forecasts that assume fixed airline routes. However, this does not well reflect reality as airlines regularly add and remove routes. A airline service route network evolution model that projects route addition and removal was created and combined with state-of-the-art air traffic forecast methods to better reflect the dynamic properties of the ATS in system-wide simulations. Guided by a system-of-systems framework, network theory metrics and machine learning algorithms were applied to develop the route network evolution models based on patterns extracted from historical data. Constructing the route addition section of the model posed the greatest challenge due to the large pool of new link candidates compared to the actual number of routes historically added to the network. Of the models explored, algorithms based on logistic regression, random forests, and support vector machines showed best route addition and removal forecast accuracies at approximately 20% and 40%, respectively, when validated with historical data. The combination of network evolution models and a system-wide evaluation tool quantified the impact of airline route network evolution on air traffic delay. The expected delay minutes when considering network evolution increased approximately 5% for a forecasted schedule on 3/19/2020. Performance trade-off studies between several airline route network topologies from the perspectives of passenger travel efficiency, fuel burn, and robustness were also conducted to provide bounds that could serve as targets for ATS transformation efforts. The series of analysis revealed that high

  3. Hazmat Routes (National)

    Data.gov (United States)

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

  4. 78 FR 10560 - Proposed Modification and Revocation of Air Traffic Service Routes; Jackson, MS

    Science.gov (United States)

    2013-02-14

    ...This action proposes to modify two jet routes and seven VOR Federal airways; and remove two VOR Federal airways in the vicinity of Jackson, MS. The FAA is proposing this action due to the scheduled decommissioning of the Jackson, MS, VORTAC, and the commissioning of the Magnolia, MS, VORTAC navigation aids.

  5. Operation Thursday: Birth of the Air Commandos

    National Research Council Canada - National Science Library

    Mason, Herbert A., Jr; Bergeron, Randy G; Renfrow, James A., Jr

    1994-01-01

    .... On March 5-6, 1944, the Allies conducted an air invasion of Burma in an attempt to push back the Japanese in the China-Burma-India Theater and reestablish the land route between India and China. U.S...

  6. Airport Activity Statistics of Certificated Route Air Carriers: Calendar Year 1990

    Science.gov (United States)

    1990-01-01

    0 50 66 50 66 AS 3201 67985 51 40 "/3125 UTOPIA N 0 0) (INDIAN MOUNTAIN AFS) HU-NORTHERN AIR CARGO TOTAL 1 10 i W N I0 110 AS 0 220 220 VALDEZ N 000...60 At 614280 4010.83 1650.33 5661 16 IRON MOUNTAIN /KIGEGSFLD N 0.00 (FORD) FM-FEDERAL EXPRESS .................... ............... TOTAL...and MAN By Type of Servim, ed By Air Carrier 12 Months Ended December 31, 1990 STATE OR U. ALEA 1U eial mg p Tam oewTn w TMTAL (APp NAMmmu

  7. The Air Force Critical Care Air Transport Team (CCATT): Using the Estimating Supplies Program (ESP) to Validate Clinical Requirements

    Science.gov (United States)

    2005-04-05

    Disease, Severe. 0249 Peptic Ulcer , Gastric or Duodenal, Penetrating and/or Perforating . 0250 Peptic Ulcer , Gastric or Duodenal, Uncomplicated. 0251...in US Air Force (USAF) Allowance Standard (AS) development and management . The Critical Care Air Transport Team (CCATT) Unit Type Code (UTC) AS was...tasks enabling the management of the critically ill or injured en route to the appropriate level of care (LOC) or medical treatment facility (MTF

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

    Directory of Open Access Journals (Sweden)

    Liu Liu

    2017-11-01

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

  9. Air pollution emission inventory along a major traffic route within ...

    African Journals Online (AJOL)

    Soyannwo, Olusola

    traffic emissions are the dominant source of gaseous ..... air concentrations, source profiles, and source apportionment of 71 ... heavy metals in Ibadan, Nigeria. Soil Sed. Contam. 10(6):577-591. Sjodin A, Persson K, Andreasson K, Arlander B, ...

  10. Multihop Wireless Networks Opportunistic Routing

    CERN Document Server

    Zeng, Kai; Li, Ming

    2011-01-01

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

  11. Understanding individual routing behaviour.

    Science.gov (United States)

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

    2016-03-01

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

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

    OpenAIRE

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

    2017-01-01

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

  13. Personal continuous route pattern mining

    Institute of Scientific and Technical Information of China (English)

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

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

  14. Evaluation of the Safe Routes to Transit Program in CaliforniaÂ

    OpenAIRE

    Weinzimmer, David; Sanders, Rebecca L.; Dittrich, Heidi; Cooper, Jill F.

    2014-01-01

    This paper elaborates on findings from an evaluation of the San Francisco Bay Area’s Safe Routes to Transit (SR2T) program, which funded enhancements to increase walking and cycling to regional transit stations. To understand how the program influenced travel choices, behavior, and perceptions of safety and local air quality, researchers surveyed transit users and observed driver, pedestrian, and bicyclist behavior in the periods before and after the enhancements were made at multiple trans...

  15. Nanostructured aluminium oxide powders obtained by aspartic acid-nitrate gel-combustion routes

    Energy Technology Data Exchange (ETDEWEB)

    Gardey Merino, Maria Celeste, E-mail: mcgardey@frm.utn.edu.a [Laboratorio de Investigaciones y Servicios Ambientales Mendoza (LISAMEN) - CCT - CONICET, Avda. Ruiz Leal s/n, Parque Gral. San Martin, (M5502IRA) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Grupo CLIOPE, Universidad Tecnologica Nacional - Facultad Regional Mendoza, Rodriguez 273, (M5502AJE) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Lascalea, Gustavo E. [Laboratorio de Investigaciones y Servicios Ambientales Mendoza (LISAMEN) - CCT - CONICET, Avda. Ruiz Leal s/n, Parque Gral. San Martin, (M5502IRA) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Sanchez, Laura M. [CINSO (Centro de Investigaciones en Solidos), CITEFA - CONICET, J.B. de La Salle 4397, (B1603ALO) Villa Martelli, Prov. de Buenos Aires (Argentina); Vazquez, Patricia G. [Centro de Investigacion y Desarrollo en Ciencias Aplicadas ' Dr. Jorge J. Ronco' (CINDECA), CONICET, Universidad Nacional de La Plata, Calle 47 nro. 257, (B1900AJK) La Plata, Prov. de Buenos Aires (Argentina); Cabanillas, Edgardo D. [CONICET and Centro Atomico Constituyentes, Comision Nacional de Energia Atomica, Gral. Paz 1499, (1650) San Martin, Prov. de Buenos Aires (Argentina); Lamas, Diego G. [CINSO (Centro de Investigaciones en Solidos), CITEFA - CONICET, J.B. de La Salle 4397, (B1603ALO) Villa Martelli, Prov. de Buenos Aires (Argentina)

    2010-04-16

    In this work, two new gel-combustion routes for the synthesis of Al{sub 2}O{sub 3} nanopowders with aspartic acid as fuel are presented. The first route is a conventional stoichiometric process, while the second one is a non-stoichiometric, pH-controlled process. These routes were compared with similar synthesis procedures using glycine as fuel, which are well-known in the literature. The samples were calcined in air at different temperatures, in a range of 600-1200 {sup o}C. They were characterized by X-ray diffraction, scanning electron microscopy, transmission electron microscopy and BET specific surface area. Different phases were obtained depending on the calcination temperature: amorphous, {gamma} (metastable) or {alpha} (stable). The amorphous-to-{gamma} transition was found for calcination temperatures in the range of 700-900 {sup o}C, while the {gamma}-to-{alpha} one was observed for calcination temperatures of 1100-1200 {sup o}C. The retention of the metastable {gamma} phase is probably due to a crystallite size effect. It transforms to the {alpha} phase after the crystallite size increases over a critical size during the calcination process at 1200 {sup o}C. The highest BET specific surface areas were obtained for both nitrate-aspartic acid routes proposed in this work, reaching values of about 50 m{sup 2}/g.

  16. Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state

    Science.gov (United States)

    Xiong, Pei-Ying; Yu, Xu-Tao; Zhang, Zai-Chen; Zhan, Hai-Tao; Hua, Jing-Yu

    2017-08-01

    Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multihop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop teleportation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the former, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air interface delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.

  17. Class network routing

    Science.gov (United States)

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

    2009-09-08

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

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

    Science.gov (United States)

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

    2016-01-01

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

  19. Airspace Technology Demonstration 3 (ATD-3): Dynamic Weather Routes (DWR) Technology Transfer Document Summary Version 1.0

    Science.gov (United States)

    Sheth, Kapil; Wang, Easter Mayan Chan

    2016-01-01

    Airspace Technology Demonstration #3 (ATD-3) is part of NASA's Airspace Operations and Safety Program (AOSP) - specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multiyear research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the first of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's legacy Dynamic Weather Routes (DWR) work for efficient routing for en-route weather avoidance. DWR is a ground-based trajectory automation system that continuously and automatically analyzes active airborne aircraft in en route airspace to identify opportunities for simple corrections to flight plan routes that can save significant flying time, at least five minutes wind-corrected, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. The key benefit of the DWR concept is to let automation continuously and automatically analyze active flights to find those where simple route corrections can save significant time and fuel. Operators are busy during weather events. It is more effective to let automation find the opportunities for high-value route corrections.

  20. Developing an eco-routing application.

    Science.gov (United States)

    2014-01-01

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

  1. Air pollution emission inventory along a major traffic route within ...

    African Journals Online (AJOL)

    Increasing road congestion and high traffic volume is often times an indicator of atmospheric air pollution. Ibadan, being the largest metropolitan city in southwestern Nigeria, experiences steady influx of vehicular movement on daily bases. The situation is made worse as a greater number of these vehicles are old and ...

  2. Robustness of airline route networks

    Science.gov (United States)

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

    2016-03-01

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

  3. A Joint Route Choice Model for Electric and Conventional Car Users

    DEFF Research Database (Denmark)

    Jensen, Anders Fjendbo; Rasmussen, Thomas Kjær; Prato, Carlo Giacomo

    Introduction Worldwide, governments have committed to reducing air pollution and carbon emissions. With a higher share of renewable sources in the electricity production, battery electric cars (EVs) could play a significant role in maintaining these commitments. Growing literature shows...... an increasing interest in EVs and their market, but current EV travel demand studies are usually based on data collected from users of conventional gasoline or diesel engine cars (CVs) (see e.g. (Golob and Gould 1998; Pearre et al. 2011; Greaves et al. 2014). EVs are however different from CVs in a number...... effects, such as effects on the electricity network and the transport network. The objective of this study is to use revealed preferences (RP) data to investigate differences in route choice behaviour between CV and EV users. To our knowledge, this is the first time that a state-of-the-art route choice...

  4. 76 FR 69320 - Notice of Applications for Certificates of Public Convenience and Necessity and Foreign Air...

    Science.gov (United States)

    2011-11-08

    ... Public Convenience and Necessity and Foreign Air Carrier Permits Filed Under Subpart B (Formerly Subpart... Convenience and Necessity and Foreign Air Carrier Permits were filed under Subpart B (formerly Subpart Q) of... certificate of public convenience and necessity for Route 568 to engage in scheduled foreign air...

  5. An overview of smart grid routing algorithms

    Science.gov (United States)

    Wang, Junsheng; OU, Qinghai; Shen, Haijuan

    2017-08-01

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

  6. Southern states' routing agency report

    International Nuclear Information System (INIS)

    1989-02-01

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

  7. Southern States' Routing Agency Report

    International Nuclear Information System (INIS)

    1990-03-01

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

  8. Continuous fabrication of a MnS/Co nanofibrous air electrode for wide integration of rechargeable zinc-air batteries.

    Science.gov (United States)

    Wang, Yang; Fu, Jing; Zhang, Yining; Li, Matthew; Hassan, Fathy Mohamed; Li, Guang; Chen, Zhongwei

    2017-10-26

    Exploring highly efficient bifunctional electrocatalysts toward the oxygen reduction and evolution reactions is essential for the realization of high-performance rechargeable zinc-air batteries. Herein, a novel nanofibrous bifunctional electrocatalyst film, consisting of metallic manganese sulfide and cobalt encapsulated by nitrogen-doped carbon nanofibers (CMS/NCNF), is prepared through a continuous electrospinning method followed by carbonization treatment. The CMS/NCNF bifunctional catalyst shows both comparable ORR and OER performances to those of commercial precious metal-based catalysts. Furthermore, the free-standing CMS/NCNF fibrous thin film is directly used as the air electrode in a solid-state zinc-air battery, which exhibits superior flexibility while retaining stable battery performance at different bending angles. This study provides a versatile design route for the rational design of free-standing bifunctional catalysts for direct use as the air electrode in rechargeable zinc-air batteries.

  9. Airport Activity Statistics of Certificated Route Air Carriers.

    Science.gov (United States)

    1983-12-31

    Sitgle or two eabhs phasen "ir-aft sefld ebOw I iparls essuptob The tota number wesd by Win Air Aisi Inc. in it InmaAdonepersisa. of sarm dspartuesactuafl...00 :3 AlLcns t 101 S 14 4301.M 05 1- - 14,6118K0A 5Msa5 0.570.!Is~oOB. 41i S111V-f a-Sl--las602.S 1.40 M 144,6" 15 FS11S 34OTAL4 614009 4140 1594.La .3...Ill SI 8" TW of901 ŕ, 1Ś 91661 - I&~~b-6666ST£f 64-1 60 1 ) 03 *-0 t1 4140 16 196 74 1.6 1-&" 3 6.6 ALLUm~e "t3udme 196 £199 o ee 414 tolosv TOA Sa

  10. Load Balancing Routing with Bounded Stretch

    Directory of Open Access Journals (Sweden)

    Chen Siyuan

    2010-01-01

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

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

    International Nuclear Information System (INIS)

    1989-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Tad T Brunyé

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

  13. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

  14. Intelligent routing protocol for ad hoc wireless network

    Science.gov (United States)

    Peng, Chaorong; Chen, Chang Wen

    2006-05-01

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

  15. Risk assessment of alternative proliferation routes

    International Nuclear Information System (INIS)

    Ahmed, S.; Husseiny, A.A.

    1982-01-01

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

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

    International Nuclear Information System (INIS)

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

    1998-05-01

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

  17. Meeting Air Training Command’s Future Airspace Needs.

    Science.gov (United States)

    1982-08-01

    submitted its report to the President on 22 January 1935 . Several recommendations for change were made. * The Commission suggested air transportation...Pi.rmr epre becoming big business. Emphasis was shitting to ,r ’,: t routes and nationwide systems. These first airways werp nothinq more tinan e on 0...rinw- air accidents. The first traffic control centers were establi-ieo by th airline -ompanies in December 1935 . The Newark, New Jersey, office was f

  18. Sensor Deployment for Air Pollution Monitoring Using Public Transportation System

    OpenAIRE

    Yu, James J. Q.; Li, Victor O. K.; Lam, Albert Y. S.

    2015-01-01

    Air pollution monitoring is a very popular research topic and many monitoring systems have been developed. In this paper, we formulate the Bus Sensor Deployment Problem (BSDP) to select the bus routes on which sensors are deployed, and we use Chemical Reaction Optimization (CRO) to solve BSDP. CRO is a recently proposed metaheuristic designed to solve a wide range of optimization problems. Using the real world data, namely Hong Kong Island bus route data, we perform a series of simulations an...

  19. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

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

  20. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

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

  1. Highway route controlled quantity shipment routing reports - An overview

    International Nuclear Information System (INIS)

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

    1989-01-01

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

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

    Data.gov (United States)

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

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

    Directory of Open Access Journals (Sweden)

    Alaa Azmi Allahham

    2017-02-01

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

  4. Simulation of Population-Based Commuter Exposure to NO2 Using Different Air Pollution Models

    Directory of Open Access Journals (Sweden)

    Martina S. Ragettli

    2014-05-01

    Full Text Available We simulated commuter routes and long-term exposure to traffic-related air pollution during commute in a representative population sample in Basel (Switzerland, and evaluated three air pollution models with different spatial resolution for estimating commute exposures to nitrogen dioxide (NO2 as a marker of long-term exposure to traffic-related air pollution. Our approach includes spatially and temporally resolved data on actual commuter routes, travel modes and three air pollution models. Annual mean NO2 commuter exposures were similar between models. However, we found more within-city and within-subject variability in annual mean (±SD NO2 commuter exposure with a high resolution dispersion model (40 ± 7 µg m−3, range: 21–61 than with a dispersion model with a lower resolution (39 ± 5 µg m−3; range: 24–51, and a land use regression model (41 ± 5 µg m−3; range: 24–54. Highest median cumulative exposures were calculated along motorized transport and bicycle routes, and the lowest for walking. For estimating commuter exposure within a city and being interested also in small-scale variability between roads, a model with a high resolution is recommended. For larger scale epidemiological health assessment studies, models with a coarser spatial resolution are likely sufficient, especially when study areas include suburban and rural areas.

  5. Route-specific analysis for radioactive materials transportation

    International Nuclear Information System (INIS)

    1986-01-01

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

  6. Bellman Ford algorithm - in Routing Information Protocol (RIP)

    Science.gov (United States)

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

    2018-04-01

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

  7. Innovative Sol-Gel Routes for the Bottom-up Preparation of Heterogeneous Catalysts.

    Science.gov (United States)

    Debecker, Damien P

    2017-12-11

    Heterogeneous catalysts can be prepared by different methods offering various levels of control on the final properties of the solid. In this account, we exemplify bottom-up preparation routes that are based on the sol-gel chemistry and allow to tailor some decisive properties of solid catalysts. First, an emulsion templating strategy is shown to lead to macrocellular self-standing monoliths with a macroscopic 3D structure. The latter can be used as catalyst or catalyst supports in flow chemistry, without requiring any subsequent shaping step. Second, the aerosol-assisted sol-gel process allows for the one-step and continuous production of porous mixed oxides. Tailored textural properties can be obtained together with an excellent control on composition and homogeneity. Third, the application of non-hydrolytic sol-gel routes, in the absence of water, leads to mixed oxides with outstanding textural properties and with peculiar surface chemistry. In all cases, the resulting catalytic performance can be correlated with the specificities of the preparation routes presented. This is exemplified in catalytic reactions in the fields of biomass conversion, petro chemistry, enantioselective organic synthesis, and air pollution mitigation. © 2017 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  8. Predicting transportation routes for radioactive wastes

    International Nuclear Information System (INIS)

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

    1981-01-01

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

  9. The competitive landscape of air transport in Europe

    NARCIS (Netherlands)

    Lieshout, R.; Malighetti, P.; Redondi, R.; Burghouwt, G.

    2016-01-01

    Competition between airlines and airports increased significantly since the deregulation of the intra-European air transport market in 1997. The passenger has a wider choice in terms of routings and departure airports than twenty-five years ago and pays a lower price. In this paper we investigate in

  10. RSRP: A Robust Secure Routing Protocol in MANET

    Directory of Open Access Journals (Sweden)

    Sinha Ditipriya

    2014-05-01

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

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

    Science.gov (United States)

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

    2014-10-01

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

  12. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

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

  13. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

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

  14. Zone routing in a torus network

    Science.gov (United States)

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

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

  15. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    National Research Council Canada - National Science Library

    Lu, Qingsong; George, Betsy; Shekhar, Shashi

    2006-01-01

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

  16. Entanglement-Gradient Routing for Quantum Networks.

    Science.gov (United States)

    Gyongyosi, Laszlo; Imre, Sandor

    2017-10-27

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

  17. Air mass origins by back trajectory analysis for evaluating atmospheric 210Pb concentrations at Rokkasho, Aomori, Japan

    International Nuclear Information System (INIS)

    Akata, N.; Kawabata, H.; Hasegawa, H.; Kondo, K.; Chikuchi, Y.; Hisamatsu, S.; Inaba, J.; Sato, T.

    2009-01-01

    Atmospheric concentrations of 210 Pb change with various factors such as meso-scale meteorological conditions. We have already reported the biweekly atmospheric 210 Pb concentrations in Rokkasho, Japan for 5 years and found that they had clear seasonal variations: low concentrations in summer and high values in winter to spring. To study the reasons for the seasonal variations, the origins of the air mass flowing to Rokkasho were analyzed by 3-D backward air mass trajectory analysis. Routes of the calculated trajectories were classified into four regions: northeastern and southeastern Asian Continent, sea and other regions. The atmospheric 210 Pb concentrations were well correlated with the frequency of the routes through the northeastern Asian Continent. A non-linear multiple regression analysis of the 210 Pb concentrations and the relative frequencies of the four routes showed good fitting of the predicted values to the observed ones, and indicated that the atmospheric 210 Pb concentrations in Rokkasho depended on the frequency of the air mass from the northeastern Asian Continent. (author)

  18. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

  19. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

    This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

  20. Routed planar networks

    Directory of Open Access Journals (Sweden)

    David J. Aldous

    2016-04-01

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

  1. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

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

  2. Porcelain tiles by the dry route

    International Nuclear Information System (INIS)

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

    2010-01-01

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

  3. VANET Routing Protocols: Pros and Cons

    OpenAIRE

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

    2012-01-01

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

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

    Science.gov (United States)

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

    2015-11-01

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

  5. Residential exposure to traffic-related air pollution and survival after heart failure.

    Science.gov (United States)

    Medina-Ramón, Mercedes; Goldberg, Robert; Melly, Steven; Mittleman, Murray A; Schwartz, Joel

    2008-04-01

    Although patients with heart failure (HF) have been identified as particularly susceptible to the acute effects of air pollution, the effects of long-term exposure to air pollution on patients with this increasingly prevalent disease are largely unknown. This study was designed to examine the mortality risk associated with residential exposure to traffic-related air pollution among HF patients. A total of 1,389 patients hospitalized with acute HF in greater Worcester, Massachusetts, during 2000 were followed for survival through December 2005. We used daily traffic within 100 and 300 m of residence as well as the distance from residence to major roadways and to bus routes as proxies for residential exposure to traffic-related air pollution. We assessed mortality risks for each exposure variable using Cox proportional hazards models adjusted for prognostic factors. After the 5-year follow-up, only 334 (24%) subjects were still alive. An interquartile range increase in daily traffic within 100 m of home was associated with a mortality hazard ratio (HR) of 1.15 [95% confidence interval (CI), 1.05-1.25], whereas for traffic within 300 m this association was 1.09 (95% CI, 1.01-1.19). The mortality risk decreased with increasing distance to bus routes (HR = 0.88; 95% CI, 0.81-0.96) and was larger for those living within 100 m of a major roadway or 50 m of a bus route (HR = 1.30; 95% CI, 1.13-1.49). Adjustment for area-based income and educational level slightly attenuated these associations. Residential exposure to traffic-related air pollution increases the mortality risk after hospitalization with acute HF. Reducing exposure to traffic-related emissions may improve the long-term prognosis of HF patients.

  6. Highway and interline transportation routing models

    International Nuclear Information System (INIS)

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

    1994-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

  8. Contamination of cars and exposure dose to drivers traveling through the Route 6 in the restricted area

    International Nuclear Information System (INIS)

    Kawakami, Hiroto; Sasaki, Satoru; Shimomura, Masanori; Takano, Hitoshi; Hayashi, Hiroki; Inoue, Ryo; Yamada, Norikazu

    2012-05-01

    Traffic on the Route 6 will increase after the revision of evacuation area and restricted area. At the request of the Local Nuclear Emergency Response Headquarters established in Fukushima Prefecture, Japan Nuclear Energy Safety Organization (JNES) has surveyed the effect on cars and drivers traveling through the Route 6 in the restricted area as listed bellow. (1) Investigation of contamination of cars traveling through the Route 6. (2) Investigation of exposure dose of drivers traveling through the Route 6. The maximum contamination at the surface of tires and tire-houses of cars traveling through the Route 6 is estimated to be 2 Bq/cm"2 (this concentration is correspond to 470 cpm). The external exposure dose of drivers will be about 4 μSv when they run through the restricted area at a pace of 40 km/h. The internal exposure dose will be small because of the low radioactive concentration in the air. It is important not to stay long in high radiation areas to prevent unnecessary exposure. The main source of the contamination is sand cloud thrown up by the wheels. Though, the radioactivity of the sand cloud is proportional to the surface concentration of roads and dose rate of each area, contamination level by the sand cloud will remain low level. Significant contamination is likely to be caused by running on the soil. So, it is important not to run on the soil on the local road around the Route 6 or road shoulder of the Route 6. It is recommended to wash tires and tire-houses when accidentally run on the soil. (author)

  9. Collision risk-capacity tradeoff analysis of an en-route corridor model

    Directory of Open Access Journals (Sweden)

    Ye Bojia

    2014-02-01

    Full Text Available Flow corridors are a new class of trajectory-based airspace which derives from the next generation air transportation system concept of operations. Reducing the airspace complexity and increasing the capacity are the main purposes of the en-route corridor. This paper analyzes the collision risk-capacity tradeoff using a combined discrete–continuous simulation method. A basic two-dimensional en-route flow corridor with performance rules is designed as the operational environment. A second-order system is established by combining the point mass model and the proportional derivative controller together to simulate the self-separation operations of the aircrafts in the corridor and the operation performance parameters from the User Manual for the Base of Aircraft Data are used in this research in order to improve the reliability. Simulation results indicate that the aircrafts can self-separate from each other efficiently by adjusting their velocities, and rationally setting the values of some variables can improve the rate and stability of the corridor with low risks of loss of separation.

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

    Science.gov (United States)

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

    2018-01-01

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

  11. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Nguyen Thanh Long

    2015-02-01

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

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

    Science.gov (United States)

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

    2018-01-01

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

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  15. Climate change alters the optimal wind-dependent flight routes of an avian migrant.

    Science.gov (United States)

    Nourani, Elham; Yamaguchi, Noriyuki M; Higuchi, Hiroyoshi

    2017-05-17

    Migratory birds can be adversely affected by climate change as they encounter its geographically uneven impacts in various stages of their life cycle. While a wealth of research is devoted to the impacts of climate change on distribution range and phenology of migratory birds, the indirect effects of climate change on optimal migratory routes and flyways, through changes in air movements, are poorly understood. Here, we predict the influence of climate change on the migratory route of a long-distant migrant using an ensemble of correlative modelling approaches, and present and future atmospheric data obtained from a regional climate model. We show that changes in wind conditions by mid-century will result in a slight shift and reduction in the suitable areas for migration of the study species, the Oriental honey-buzzard, over a critical section of its autumn journey, followed by a complete loss of this section of the traditional route by late century. Our results highlight the need for investigating the consequences of climate change-induced disturbance in wind support for long-distance migratory birds, particularly species that depend on the wind to cross ecological barriers, and those that will be exposed to longer journeys due to future range shifts. © 2017 The Author(s).

  16. Route selection issues for NWPA shipments

    International Nuclear Information System (INIS)

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

    1993-01-01

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

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

    Science.gov (United States)

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

    2018-05-18

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

  18. Port Authority of Allegheny County Transit Routes

    Data.gov (United States)

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

  19. The QKD network: model and routing scheme

    Science.gov (United States)

    Yang, Chao; Zhang, Hongqi; Su, Jinhai

    2017-11-01

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

  20. Environmental factors along the Northern Sea Route

    International Nuclear Information System (INIS)

    Fjeld, P.E.

    1993-01-01

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

  1. CAN Tree Routing for Content-Addressable Network

    Directory of Open Access Journals (Sweden)

    Zhongtao LI

    2014-01-01

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

  2. Transport spatial model for the definition of green routes for city logistics centers

    Energy Technology Data Exchange (ETDEWEB)

    Pamučar, Dragan, E-mail: dpamucar@gmail.com [University of Defence in Belgrade, Department of Logistics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Gigović, Ljubomir, E-mail: gigoviclj@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Ćirović, Goran, E-mail: cirovic@sezampro.rs [College of Civil Engineering and Geodesy, The Belgrade University, Hajduk Stankova 2, 11000 Belgrade (Serbia); Regodić, Miodrag, E-mail: mregodic62@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia)

    2016-01-15

    This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

  3. Transport spatial model for the definition of green routes for city logistics centers

    International Nuclear Information System (INIS)

    Pamučar, Dragan; Gigović, Ljubomir; Ćirović, Goran; Regodić, Miodrag

    2016-01-01

    This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

  4. Pheromone based alternative route planning

    Directory of Open Access Journals (Sweden)

    Liangbing Feng

    2016-08-01

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

  5. Route planning algorithms: Planific@ Project

    Directory of Open Access Journals (Sweden)

    Gonzalo Martín Ortega

    2009-12-01

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

  6. Vehicle routing problem in investment fund allocation

    Science.gov (United States)

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

    2013-04-01

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

  7. Comparison of routing metrics for wireless mesh networks

    CSIR Research Space (South Africa)

    Nxumalo, SL

    2011-09-01

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

  8. The Silk Route from Land to Sea

    Directory of Open Access Journals (Sweden)

    Jack Weatherford

    2018-04-01

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

  9. Respiratory effects of air pollution on children.

    Science.gov (United States)

    Goldizen, Fiona C; Sly, Peter D; Knibbs, Luke D

    2016-01-01

    A substantial proportion of the global burden of disease is directly or indirectly attributable to exposure to air pollution. Exposures occurring during the periods of organogenesis and rapid lung growth during fetal development and early post-natal life are especially damaging. In this State of the Art review, we discuss air toxicants impacting on children's respiratory health, routes of exposure with an emphasis on unique pathways relevant to young children, methods of exposure assessment and their limitations and the adverse health consequences of exposures. Finally, we point out gaps in knowledge and research needs in this area. A greater understanding of the adverse health consequences of exposure to air pollution in early life is required to encourage policy makers to reduce such exposures and improve human health. © 2015 Wiley Periodicals, Inc.

  10. Perception bias in route choice

    NARCIS (Netherlands)

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

    2014-01-01

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

  11. Cognitive Task Analysis of Prioritization in Air Traffic Control.

    Science.gov (United States)

    Redding, Richard E.; And Others

    A cognitive task analysis was performed to analyze the key cognitive components of the en route air traffic controllers' jobs. The goals were to ascertain expert mental models and decision-making strategies and to identify important differences in controller knowledge, skills, and mental models as a function of expertise. Four groups of…

  12. User habits and multimodal route planning

    Directory of Open Access Journals (Sweden)

    Géza Katona

    2017-10-01

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

  13. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

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

    2001-01-01

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

  14. Low-cost airlines consolidation as a feature of air transpoet globalization

    OpenAIRE

    Maltsev Andrey A.; Matveeva Anastasiya V.

    2017-01-01

    The increased industry consolidation resulting in the formation of new highly organized forms of cooperation is referred as one of the main features of air transport globalization at the present stage. Consolidation allows carriers to overcome the excessive competition and to strengthen their market position. It also helps them to optimize the route network and organizational structure of the company. This article includes the analysis of the dynam-ics of global air passenger traffic by low-c...

  15. The Time Window Vehicle Routing Problem Considering Closed Route

    Science.gov (United States)

    Irsa Syahputri, Nenna; Mawengkang, Herman

    2017-12-01

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

  16. Air Traffic Control: Status of FAA's Implementation of the Display System Replacement Project

    National Research Council Canada - National Science Library

    1999-01-01

    ...) implementation of the Display System Replacement (DSR) project. DSR, which replaces the controllers' workstations and other equipment in the nation's en route centers, is one of FAA's major projects under the air traffic control modernization program...

  17. Co-control of local air pollutants and CO2 in the Chinese iron and steel industry.

    Science.gov (United States)

    Mao, Xianqiang; Zeng, An; Hu, Tao; Zhou, Ji; Xing, Youkai; Liu, Shengqiang

    2013-01-01

    The present study proposes an integrated multipollutant cocontrol strategy framework in the context of the Chinese iron and steel industry. The unit cost of pollutant reduction (UCPR) was used to examine the cost-effectiveness of each emission reduction measure. The marginal abatement cost (MAC) curves for SO2, NOx, PM2.5, and CO2 were drawn based on the UCPR and the abatement potential. Air pollutant equivalence (APeq) captures the nature of the damage value-weights of various air pollutants and acts as uniformization multiple air pollutants index. Single pollutant abatement routes designed in accordance with the corresponding reduction targets revealed that the cocontrol strategy has promising potential. Moreover, with the same reduction cost limitations as the single pollutant abatement routes, the multipollutant cocontrol routes are able to obtain more desirable pollution reduction and health benefits. Co-control strategy generally shows cost-effective advantage over single-pollutant abatement strategy. The results are robust to changing parameters according to sensitivity analysis. Co-control strategy would be an important step to achieve energy/carbon intensity targets and pollution control targets in China. Though cocontrol strategy has got some traction in policy debates, there are barriers to integrate it into policy making in the near future in China.

  18. A Machine Learning Concept for DTN Routing

    Science.gov (United States)

    Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

    2017-01-01

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

  19. Dynamic airspace configuration algorithms for next generation air transportation system

    Science.gov (United States)

    Wei, Jian

    The National Airspace System (NAS) is under great pressure to safely and efficiently handle the record-high air traffic volume nowadays, and will face even greater challenge to keep pace with the steady increase of future air travel demand, since the air travel demand is projected to increase to two to three times the current level by 2025. The inefficiency of traffic flow management initiatives causes severe airspace congestion and frequent flight delays, which cost billions of economic losses every year. To address the increasingly severe airspace congestion and delays, the Next Generation Air Transportation System (NextGen) is proposed to transform the current static and rigid radar based system to a dynamic and flexible satellite based system. New operational concepts such as Dynamic Airspace Configuration (DAC) have been under development to allow more flexibility required to mitigate the demand-capacity imbalances in order to increase the throughput of the entire NAS. In this dissertation, we address the DAC problem in the en route and terminal airspace under the framework of NextGen. We develop a series of algorithms to facilitate the implementation of innovative concepts relevant with DAC in both the en route and terminal airspace. We also develop a performance evaluation framework for comprehensive benefit analyses on different aspects of future sector design algorithms. First, we complete a graph based sectorization algorithm for DAC in the en route airspace, which models the underlying air route network with a weighted graph, converts the sectorization problem into the graph partition problem, partitions the weighted graph with an iterative spectral bipartition method, and constructs the sectors from the partitioned graph. The algorithm uses a graph model to accurately capture the complex traffic patterns of the real flights, and generates sectors with high efficiency while evenly distributing the workload among the generated sectors. We further improve

  20. Warehouse order-picking process. Order-picker routing problem

    Directory of Open Access Journals (Sweden)

    E. V. Korobkov

    2015-01-01

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

  1. Routing algorithms in networks-on-chip

    CERN Document Server

    Daneshtalab, Masoud

    2014-01-01

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

  2. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

    Science.gov (United States)

    Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

    2018-02-01

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

  4. 32 CFR 861.4 - DOD air transportation quality and safety requirements.

    Science.gov (United States)

    2010-07-01

    ... or category of aircraft, over certain routes or stage lengths, or under differing air traffic control... the operation of large multi-engine aircraft in an international environment. The CARB may also... least 250 hours combined experience in the type aircraft being operated. The scheduling system involves...

  5. Identification of Robust Terminal-Area Routes in Convective Weather

    Science.gov (United States)

    Pfeil, Diana Michalek; Balakrishnan, Hamsa

    2012-01-01

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

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

    Science.gov (United States)

    Hanold, Gregg T.; Hanold, David T.

    2010-01-01

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

  7. Great Ellipse Route Planning Based on Space Vector

    Directory of Open Access Journals (Sweden)

    LIU Wenchao

    2015-07-01

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

  8. Is Entrepreneurship a Route Out of Deprivation?

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  9. Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

    Science.gov (United States)

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

    2013-01-01

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

  10. 78 FR 29613 - Modification and Revocation of Air Traffic Service Routes; Jackson, MS

    Science.gov (United States)

    2013-05-21

    ... structure as required to preserve the safe and efficient flow of air traffic. Environmental Review The FAA... Guthrie 156[deg] and Millsap, TX, 274[deg] radials; Millsap; Glen Rose, TX; Cedar Creek, TX; Quitman, TX...

  11. Foreign Internal Defense. Does Air Force Special Operations Have What it Takes?,

    Science.gov (United States)

    1993-12-01

    anything in the air or on the ground. However, while the desert conditions in areas of Peru and Chile are similarly without rain, their surrounding...example, during CABANAS 89, a joint/combined exercise, Honduran officials did not allow the use of CASA -212 aircraft in the. exercise because of...correctly understood while flying en route to Desert One on the Iranian hostage rescue mission. The experience is described by Col James H. Kyle, US Air Force

  12. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-07-01

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

  13. Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mann Raminder P

    2005-01-01

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

  14. A study of routing algorithms for SCI-Based multistage networks

    International Nuclear Information System (INIS)

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

    1994-03-01

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

  15. Towards seasonal Arctic shipping route predictions

    Science.gov (United States)

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

    2017-12-01

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

  16. Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

    Directory of Open Access Journals (Sweden)

    DWI ARYANTA

    2016-02-01

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

  17. Lessons learned by southern states in designating alternative routes

    International Nuclear Information System (INIS)

    1989-08-01

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

  18. Quantum chemistry-assisted synthesis route development

    International Nuclear Information System (INIS)

    Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

    2015-01-01

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

  19. Route Choice Model Based on Game Theory for Commuters

    Directory of Open Access Journals (Sweden)

    Licai Yang

    2016-06-01

    Full Text Available The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.

  20. On line routing per mobile phone

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  1. A tree routing protocol for cognitive radio network

    Directory of Open Access Journals (Sweden)

    Mohammed Hashem

    2017-07-01

    Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

  2. Route Network Construction with Location-Direction-Enabled Photographs

    Science.gov (United States)

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

    2018-05-01

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

  3. Development of safe routes for children in urban environment

    Science.gov (United States)

    Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

    2018-01-01

    The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

  4. Routing architecture and security for airborne networks

    Science.gov (United States)

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

    2009-05-01

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

  5. Trajectory Assessment and Modification Tools for Next Generation Air Traffic Management Operations

    Science.gov (United States)

    Brasil, Connie; Lee, Paul; Mainini, Matthew; Lee, Homola; Lee, Hwasoo; Prevot, Thomas; Smith, Nancy

    2011-01-01

    This paper reviews three Next Generation Air Transportation System (NextGen) based high fidelity air traffic control human-in-the-loop (HITL) simulations, with a focus on the expected requirement of enhanced automated trajectory assessment and modification tools to support future air traffic flow management (ATFM) planning positions. The simulations were conducted at the National Aeronautics and Space Administration (NASA) Ames Research Centers Airspace Operations Laboratory (AOL) in 2009 and 2010. The test airspace for all three simulations assumed the mid-term NextGenEn-Route high altitude environment utilizing high altitude sectors from the Kansas City and Memphis Air Route Traffic Control Centers. Trajectory assessment, modification and coordination decision support tools were developed at the AOL in order to perform future ATFM tasks. Overall tool usage results and user acceptability ratings were collected across three areas of NextGen operatoins to evaluate the tools. In addition to the usefulness and usability feedback, feasibility issues, benefits, and future requirements were also addressed. Overall, the tool sets were rated very useful and usable, and many elements of the tools received high scores and were used frequently and successfully. Tool utilization results in all three HITLs showed both user and system benefits including better airspace throughput, reduced controller workload, and highly effective communication protocols in both full Data Comm and mixed-equipage environments.

  6. System and method for conditioning intake air to an internal combustion engine

    Science.gov (United States)

    Sellnau, Mark C.

    2015-08-04

    A system for conditioning the intake air to an internal combustion engine includes a means to boost the pressure of the intake air to the engine and a liquid cooled charge air cooler disposed between the output of the boost means and the charge air intake of the engine. Valves in the coolant system can be actuated so as to define a first configuration in which engine cooling is performed by coolant circulating in a first coolant loop at one temperature, and charge air cooling is performed by coolant flowing in a second coolant loop at a lower temperature. The valves can be actuated so as to define a second configuration in which coolant that has flowed through the engine can be routed through the charge air cooler. The temperature of intake air to the engine can be controlled over a wide range of engine operation.

  7. Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

    Directory of Open Access Journals (Sweden)

    Yan Han

    2014-01-01

    Full Text Available The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scene spot and tourists demand and tour behaviors characteristic such as visit frequency, number of attractions visited was obtained and analyzed. Based on the convey datum, tour routes multiobjective optimization functions were prompted for the tour route design regarding the maximum satisfaction and the minimum tour distance as the optimal objective. The available routes are listed and categorized. Based on the particle swarm optimization model, the priorities of the tour route are calculated and finally the suggestion depth tour route and quick route tour routes are given considering the different tour demands of tourists. The results can offer constructive suggestions on how to design tour routes on the part of tourism enterprises and how to choose a proper tour route on the part of tourists.

  8. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

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

    2008-01-01

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

  9. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...... depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0....

  10. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

    depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

  11. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

  12. Taking an Alternative Route: A guide for fleet operators and individual owners using alternative fuels in cars and trucks

    International Nuclear Information System (INIS)

    LaRocque, T.

    2001-01-01

    Taking an Alternative Route is a 30-page guide for fleet managers and individual owners on using alternative fuels in cars and trucks. Discussed in detail are all fuels authorized for federal credits under the Energy Policy Act of 1992 (EPAct). The publication informs federal and state fleet managers about how to comply with EPAct, and provides information about the Clean Air Act Amendments

  13. New TPG bus route 28

    CERN Multimedia

    2003-01-01

    Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

  14. Route prediction model of infectious diseases for 2018 Winter Olympics in Korea

    International Nuclear Information System (INIS)

    Kim, Eungyeong; Lee, Seok; Byun, Young Tae; Kim, Jae Hun; Lee, Taikjin; Lee, Hyuk-jae

    2014-01-01

    There are many types of respiratory infectious diseases caused by germs, virus, mycetes and parasites. Researchers recently have tried to develop mathematical models to predict the epidemic of infectious diseases. However, with the development of ground transportation system in modern society, the spread of infectious diseases became faster and more complicated in terms of the speed and the pathways. The route of infectious diseases during Vancouver Olympics was predicted based on the Susceptible-Infectious-Recovered (SIR) model. In this model only the air traffic as an essential factor for the intercity migration of infectious diseases was involved. Here, we propose a multi-city transmission model to predict the infection route during 2018 Winter Olympics in Korea based on the pre-existing SIR model. Various types of transportation system such as a train, a car, a bus, and an airplane for the interpersonal contact in both inter- and intra-city are considered. Simulation is performed with assumptions and scenarios based on realistic factors including demographic, transportation and diseases data in Korea. Finally, we analyze an economic profit and loss caused by the variation of the number of tourists during the Olympics

  15. Route prediction model of infectious diseases for 2018 Winter Olympics in Korea

    Science.gov (United States)

    Kim, Eungyeong; Lee, Seok; Byun, Young Tae; Kim, Jae Hun; Lee, Hyuk-jae; Lee, Taikjin

    2014-03-01

    There are many types of respiratory infectious diseases caused by germs, virus, mycetes and parasites. Researchers recently have tried to develop mathematical models to predict the epidemic of infectious diseases. However, with the development of ground transportation system in modern society, the spread of infectious diseases became faster and more complicated in terms of the speed and the pathways. The route of infectious diseases during Vancouver Olympics was predicted based on the Susceptible-Infectious-Recovered (SIR) model. In this model only the air traffic as an essential factor for the intercity migration of infectious diseases was involved. Here, we propose a multi-city transmission model to predict the infection route during 2018 Winter Olympics in Korea based on the pre-existing SIR model. Various types of transportation system such as a train, a car, a bus, and an airplane for the interpersonal contact in both inter- and intra-city are considered. Simulation is performed with assumptions and scenarios based on realistic factors including demographic, transportation and diseases data in Korea. Finally, we analyze an economic profit and loss caused by the variation of the number of tourists during the Olympics.

  16. Perspectives on Illegal Routes in Nigeria

    African Journals Online (AJOL)

    Nneka Umera-Okeke

    University of Kwazulu-Natal. Pietermaritzburg, South ... Key Words: Nigeria Immigration Service, Illegal Routes, Security Policing, Border,. State .... transported weapons across borders to sell them in exchange for food or other commodities. ... The study's respondents were of the opinion that illegal routes exist around the ...

  17. Optimizing Departure Times in Vehicle Routes

    NARCIS (Netherlands)

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

    2011-01-01

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

  18. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

    Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.

    2007-01-01

    This chapter discusses important characteristics seen within dynamic vehicle routing problems. We discuss the differences between the traditional static vehicle routing problems and its dynamic counterparts. We give an in-depth introduction to the degree of dynamism measure which can be used to c...

  19. "To Control Tibet, First Pacify Kham": Trade Routes and "Official Routes" (Guandao in Easternmost Kham

    Directory of Open Access Journals (Sweden)

    Patrick Booz

    2016-06-01

    Full Text Available This article focuses on the trade routes in the western Sichuan borderlands that facilitated contact and trade between Chinese counties and Eastern Tibet. In particular, the article offers a description of “official routes” (guandao—which the Chinese emperor twice proclaimed to be the vital mode of access between China and Tibet—from Chengdu, Sichuan’s provincial capital, to Khampa areas, with Lhasa as the final destination. The exchange of goods in this region followed various routes during different periods. From the tenth to sixteenth centuries, transactions occurred primarily along the borders of Amdo (Tib. A mdo, Northeastern Tibet, but for political, economic, and practical reasons, such exchanges became more limited geographically and eventually focused along the Sichuan–Kham/Ngawa border. Many routes shifted to the towns of Kangding (Tib. Dartsedo and Songpan (Tib. Zungchu, the main sites of distribution, where rich opportunities for trade and a strictly limiting transport geography made them important entrepôts that evolved into centers of prosperity. The geographic range of this article reaches to these two towns and leaves the investigation of the routes that led to western centers such as Derge, Batang, Chamdo, and Jyekundo for future research.

  20. Simulated Annealing Technique for Routing in a Rectangular Mesh Network

    Directory of Open Access Journals (Sweden)

    Noraziah Adzhar

    2014-01-01

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

  1. Sigma Routing Metric for RPL Protocol

    Directory of Open Access Journals (Sweden)

    Paul Sanmartin

    2018-04-01

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

  2. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  3. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that, until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  4. An adversarial queueing model for online server routing

    NARCIS (Netherlands)

    Bonifaci, V.

    2007-01-01

    In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

  5. 41 CFR 109-40.302 - Standard routing principle.

    Science.gov (United States)

    2010-07-01

    ... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Standard routing principle. 109-40.302 Section 109-40.302 Public Contracts and Property Management Federal Property... Standard routing principle. (a) Shipments shall be routed using the mode of transportation, or individual...

  6. Modeling and Performance Analysis of Route-Over and Mesh-Under Routing Schemes in 6LoWPAN under Error-Prone Channel Condition

    Directory of Open Access Journals (Sweden)

    Tsung-Han Lee

    2013-01-01

    Full Text Available 6LoWPAN technology has attracted extensive attention recently. It is because 6LoWPAN is one of Internet of Things standard and it adapts to IPv6 protocol stack over low-rate wireless personal area network, such as IEEE 802.15.4. One view is that IP architecture is not suitable for low-rate wireless personal area network. It is a challenge to implement the IPv6 protocol stack into IEEE 802.15.4 devices due to that the size of IPv6 packet is much larger than the maximum packet size of IEEE 802.15.4 in data link layer. In order to solve this problem, 6LoWPAN provides header compression to reduce the transmission overhead for IP packets. In addition, two selected routing schemes, mesh-under and route-over routing schemes, are also proposed in 6LoWPAN to forward IP fragmentations under IEEE 802.15.4 radio link. The distinction is based on which layer of the 6LoWPAN protocol stack is in charge of routing decisions. In route-over routing scheme, the routing distinction is taken at the network layer and, in mesh-under, is taken by the adaptation layer. Thus, the goal of this research is to understand the performance of two routing schemes in 6LoWPAN under error-prone channel condition.

  7. Energy Efficient Routing in Nomadic Networks

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

    We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary...

  8. A Novel CAN Tree Coordinate Routing in Content-Addressable Network

    Directory of Open Access Journals (Sweden)

    Zhongtao Li

    2014-09-01

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

  9. Sinkhole Avoidance Routing in Wireless Sensor Networks

    Science.gov (United States)

    2011-05-09

    COVERED (From- To) 09-05-2011 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Sinkhole Avoidance Routing in Wireless Sensor Networks 5b . GRANT NUMBER . 5c...reliability of wireless sensor networks. 15. SUBJECT TERMS wireless sensor networks, sinkhole attack, routing protocol 16. SECURITY CLASSIFICATION...Include area code) Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std . Z39.18 1 Sinkhole Avoidance Routing in Wireless Sensor Networks MIDN 1/C

  10. Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

    OpenAIRE

    Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

    2011-01-01

    This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

  11. Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

    Directory of Open Access Journals (Sweden)

    Baozhen Yao

    2014-02-01

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

  12. A Clustering Routing Protocol for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jinke Huang

    2016-01-01

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

  13. Routing in Optical and Stochastic Networks

    NARCIS (Netherlands)

    Yang, S.

    2015-01-01

    In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of the biggest concerns of network users and providers. This process is known as routing. The routing problems differ accordingly depending on different

  14. Transportation Routing Analysis Geographic Information System (WebTRAGIS) User's Manual

    International Nuclear Information System (INIS)

    Michelhaugh, R.D.

    2000-01-01

    In the early 1980s, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Both of these models have been used by the U.S. Department of Energy (DOE) community for a variety of routing needs over the years. One of the primary uses of the models has been to determine population-density information, which is used as input for risk assessment with the RADTRAN model, which is available on the TRANSNET computer system. During the recent years, advances in the development of geographic information systems (GISs) have resulted in increased demands from the user community for a GIS version of the ORNL routing models. In April 1994, the DOE Transportation Management Division (EM-261) held a Baseline Requirements Assessment Session with transportation routing experts and users of the HIGHWAY and INTERLINE models. As a result of the session, the development of a new GIS routing model, Transportation Routing Analysis GIS (TRAGIS), was initiated. TRAGIS is a user-friendly, GIS-based transportation and analysis computer model. The older HIGHWAY and INTERLINE models are useful to calculate routes, but they cannot display a graphic of the calculated route. Consequently, many users have experienced difficulty determining the proper node for facilities and have been confused by or have misinterpreted the text-based listing from the older routing models. Some of the primary reasons for the development of TRAGIS are (a) to improve the ease of selecting locations for routing, (b) to graphically display the calculated route, and (c) to provide for additional geographic analysis of the route

  15. PNW River Reach Files -- 1:100k LLID Routed Streams (routes)

    Data.gov (United States)

    Pacific States Marine Fisheries Commission — This feature class includes the ROUTE features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes are also...

  16. Pharmacokinetics of Alternative Administration Routes of Melatonin

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  17. Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sohail Jabbar

    2015-01-01

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

  18. Route Flap Damping Made Usable

    Science.gov (United States)

    Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

    The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

  19. Using Sphinx to Improve Onion Routing Circuit Construction

    Science.gov (United States)

    Kate, Aniket; Goldberg, Ian

    This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless onion routing. Our new circuit constructions are also secure in the universal composability framework, a property that was missing from the original constructions. Further, we compare the performance of our schemes with their older counterparts as well as with each other.

  20. An Assessment of Air Quality in the Surrounding Holy Places of Mecca, Saudi Arabia during Hajj

    Science.gov (United States)

    Khwaja, H. A.; Aburizaiza, O. S.; Siddique, A.; Hussain, M. M.; Khatib, F.; Zeb, J.; Blake, D. R.

    2014-12-01

    The associations of exposure to air pollution and adverse human health effects have been demonstrated in many epidemiologic studies. Hajj, an annual pilgrimage of Islam, draws millions of pilgrims from more than 200 countries for religious rituals in Mecca, Saudi Arabia. The city is surrounded by mountains with a population of 1.7 million, which gets doubles or even more during Hajj. The city centers on the Grand Mosque (Masjid Al-haram), connected with the network of tunnels. Main Hajj pilgrimage route for five days extends 20 km to the east and includes "Mina", "Arafat", and "Muzdalifah". A detailed study was conducted in Mecca, its tunnels, and surrounding holy places during Hajj (October 13-17, 2013). Spatial and temporal variations in total suspended particulate (TSP), PM10 , PM7 , PM2.5 , PM1 , ozone (O3), and black carbon (BC) levels along the route were recorded using portable monitors and GPS to assess the status of air quality. This is the first study to elucidate the exposure to air pollutants among pilgrims. Extremely high levels of all pollutants were observed during the intensive measuring periods. For example, the PM7 , PM2.5 , O3, and BC concentrations of up to 9,433 µg/m3, 484 µg/m3, 444 ppb, and 468 µg/m3, respectively, were observed. Results of this investigation revealed that most routes had on average exceeded the World Health Organization (WHO) standards for PM10 and PM2.5 . The reasons for the high air pollutants concentrations are most probably high volume of traffic, construction work, re-suspension of particles, and geographical conditions (arid regions). The pilgrim's longer trip duration lead to their highest whole trip exposure to air pollutants, which indicate that they are possibly subject to higher health risk. Better understanding of air pollution exposure and their determinants in the environments will contribute to the development of more appropriate exposure reductive strategies and have significant public health meanings.

  1. An Experimental Study of the Effect of Shared Information on Pilot/Controller Re-Route Negotiation

    Science.gov (United States)

    Farley, Todd C.; Hansman, R. John

    1999-01-01

    Air-ground data link systems are being developed to enable pilots and air traffic controllers to share information more fully. The sharing of information is generally expected to enhance their shared situation awareness and foster more collaborative decision making. An exploratory, part-task simulator experiment is described which evaluates the extent to which shared information may lead pilots and controllers to cooperate or compete when negotiating route amendments. The results indicate an improvement in situation awareness for pilots and controllers and a willingness to work cooperatively. Independent of data link considerations, the experiment also demonstrates the value of providing controllers with a good-quality weather representation on their plan view displays. Observed improvements in situation awareness and separation assurance are discussed. It is argued that deployment of this relatively simple, low-risk addition to the plan view displays be accelerated.

  2. Iconic memory-based omnidirectional route panorama navigation.

    Science.gov (United States)

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

    2005-01-01

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

  3. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  4. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

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

  5. Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

    Directory of Open Access Journals (Sweden)

    DWI ARYANTA

    2014-07-01

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

  6. Analyzing multiday route choice behavior of commuters using GPS data

    Directory of Open Access Journals (Sweden)

    Wenyun Tang

    2016-02-01

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

  7. Route assessment using comparative risk factors integrated through a GIS

    International Nuclear Information System (INIS)

    Toth, D.M.; O'Connell, W.J.

    1996-01-01

    The assessment of potential alternative routes for the shipment of spent nuclear fuel was simplified through the use of comparative risk factors evaluated using detailed route and environmental attributes. The route characteristics, integrated into risk measures, vary strongly with location and were developed from national, state, and local sources. The route data and evaluation were managed using a geographic information system (GIS). An assessment of four real North Florida routes was performed and an interstate highway route exhibited the lowest risk based on the application of the risk factors

  8. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless ¿real-time¿ home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  9. Cost analysis of hybrid adaptive routing protocol for heterogeneous ...

    Indian Academy of Sciences (India)

    NONITA SHARMA

    Event detection; wireless sensor networks; hybrid routing; cost benefit analysis; proactive routing; reactive routing. 1. ... additional energy, high processing power, etc. are deployed to extend the .... transmit to its parent node. (2) Reactive ...

  10. A joint routing and speed optimization problem

    OpenAIRE

    Fukasawa, Ricardo; He, Qie; Santos, Fernando; Song, Yongjia

    2016-01-01

    Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study of optimizing speeds over a given fixed route. In this paper, we propose a joint routing and speed optimization problem to minimize the total cost, which includes the fuel consumption cost. The only assumption made on the dependence between the fuel cost an...

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2010-05-15

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

  12. Suppressing traffic-driven epidemic spreading by adaptive routing strategy

    International Nuclear Information System (INIS)

    Yang, Han-Xin; Wang, Zhen

    2016-01-01

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

  13. Satellite network robust QoS-aware routing

    CERN Document Server

    Long, Fei

    2014-01-01

    Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book.   Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.

  14. An inventory location routing model with environmental considerations

    Directory of Open Access Journals (Sweden)

    Lerhlaly Sanaa

    2017-01-01

    Full Text Available In this work we consider an integrated Inventory Location Routing problem ILRP. The objective is to select depots to open, the routes to perform distribution from the capacitated depots to the clients by a homogeneous fleet of vehicles and over a multi-period planning horizon. To solve the problem, an exact model is designed in order to minimize the total cost (location, routing and inventory and the routing CO2 emissions, while respecting transport and storage constraints for a hazardous material. We have also studied an industrial real case to illustrate the problem.

  15. The Conference Proceedings of the 2003 Air Transport Research Society (ATRS) World Conference, Volume 3

    Science.gov (United States)

    Bowen, Brent (Editor); Gudmundsson, Sveinn (Editor); Oum, Tae (Editor)

    2003-01-01

    Volume 3 of the 2003 Air Transport Reserch Society (ATRS) World Conference includes papers on topics relevant to airline operations worldwide. Specific topics include: European Union and civil aviation regimens;simulating decision making in airline operations, passenger points of view on convenient airports; route monopolies and nonlinear pricing; cooperation among airports in Europe; fleet modernizaiton in Brazil;the effects of deregulation on the growth of air transportation in Europe and the United States.

  16. Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

    Science.gov (United States)

    Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

    2018-04-23

    The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

  17. Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weigang Bai

    2018-04-01

    Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

  18. Manpower Requirements for Air Traffic Control and Flight Service Specialists in Indiana.

    Science.gov (United States)

    Purdue Univ., Lafayette, IN. Office of Manpower Studies.

    As of January 1, 1968 the Federal Aviation Administration (FAA) of the United States Department of Transportation employed 6,963 controllers in airport towers, 7,617 controllers in Air Route Traffic Control Centers, and 4,459 flight service specialists at airport locations. Projected needs are as follows: (1) Controllers in airport towers:…

  19. Region based route planning - Multi-abstraction route planning based on intermediate level vision processing

    Science.gov (United States)

    Doshi, Rajkumar S.; Lam, Raymond; White, James E.

    1989-01-01

    Intermediate and high level processing operations are performed on vision data for the organization of images into more meaningful, higher-level topological representations by means of a region-based route planner (RBRP). The RBRP operates in terrain scenarios where some or most of the terrain is occluded, proceeding without a priori maps on the basis of two-dimensional representations and gradient-and-roughness information. Route planning is accomplished by three successive abstractions and yields a detailed point-by-point path by searching only within the boundaries of relatively small regions.

  20. Transportation of radioactive materials routing analysis: The Nevada experience

    International Nuclear Information System (INIS)

    Ardila-Coulson, M.V.

    1991-01-01

    In 1987, the Nevada State Legislature passed a Bill requiring the Nevada Dept. of Transportation to develop and enforce a plan for highway routing of highway route controlled quantity shipments of radioactive materials and high-level radioactive waste. A large network with all the major highways in Nevada was created and used in a computer model developed by Sandia National Labs. Twenty-eight highway parameters that included geometrics, traffic characteristics, environment and special facilities were collected. Alternative routes were identified by minimizing primary parameters (population density and accident rates). An analysis using the US DOT Guidelines were performed to identify a preferred route from the alternative routes

  1. Mobility Tolerant Firework Routing for Improving Reachability in MANETs

    Directory of Open Access Journals (Sweden)

    Gen Motoyoshi

    2014-03-01

    Full Text Available In this paper, we investigate our mobility-assisted and adaptive broadcast routing mechanism, called Mobility Tolerant Firework Routing (MTFR, which utilizes the concept of potentials for routing and improves node reachability, especially in situations with high mobility, by including a broadcast mechanism. We perform detailed evaluations by simulations in a mobile environment and demonstrate the advantages of MTFR over conventional potential-based routing. In particular, we show that MTFR produces better reachability in many aspects at the expense of a small additional transmission delay and intermediate traffic overhead, making MTFR a promising routing protocol and feasible for future mobile Internet infrastructures.

  2. Routing strategies in traffic network and phase transition in network ...

    Indian Academy of Sciences (India)

    The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information.

  3. Routing protocols for wireless sensor networks: What the literature says?

    Directory of Open Access Journals (Sweden)

    Amit Sarkar

    2016-12-01

    Full Text Available Routing in Wireless Sensor Networks (WSNs plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

  4. An Indirect Route for Ethanol Production

    Energy Technology Data Exchange (ETDEWEB)

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

    2005-04-29

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

  5. Alternative routes to olefins. Chances and challenges

    Energy Technology Data Exchange (ETDEWEB)

    Meiswinkel, A.; Delhomme, C.; Ponceau, M. [Linde AG, Pullach (Germany)

    2013-11-01

    In the future, conventional raw materials which are used for the production of olefins will get shorter and more expensive and alternative raw materials and production routes will gain importance. Natural gas, coal, shale oil or bio-mass are potential sources for the production of olefins, especially ethylene and propylene, as major base chemicals. Several potential production routes were already developed in the past, but cost, energy and environmental considerations might make these unattractive or unfeasible in comparison to traditional processes (e.g. steam cracking). Other processes such as methanol to olefins processes were successfully developed and first commercial units are running. In addition, combination of traditional processes (e.g. coal/biomass gasification, Fischer-Tropsch and steam cracking) might enable new pathways. Besides, dehydration of ethanol is opening direct routes from biomass to 'green' ethylene. However, for these 'bio-routes', feedstock availability and potential land use conflict with food production (sugar cane, wheat,..) still need to be evaluated. finally, new oxidative routes, including processes such as oxidative coupling of methane or oxidative dehydrogenation, are still at an early development stage but present potential for future industrial applications. (orig.) (Published in summary form only)

  6. Privacy-Preserving Interdomain Routing at Internet Scale

    Directory of Open Access Journals (Sweden)

    Asharov Gilad

    2017-07-01

    Full Text Available The Border Gateway Protocol (BGP computes routes between the organizational networks that make up today’s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains’ routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC for interdomain routing which was proposed by Gupta et al. (ACM HotNets’12. We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today’s Internet (55 809 nodes, our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale.

  7. Emission control with route optimization in solid waste collection ...

    Indian Academy of Sciences (India)

    system is used, route distance and route time will be decreased by 24·6% and. 44·3% as ... Keywords. Exhaust emission; route optimization; solid waste collection; GIS, .... Catchment areas for a sales campaign can be analysed. Customers ...

  8. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

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

  9. On the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2006-01-01

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

  10. Improved Efficient Routing Strategy on Scale-Free Networks

    Science.gov (United States)

    Jiang, Zhong-Yuan; Liang, Man-Gui

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

  11. Routing Optimization of Intelligent Vehicle in Automated Warehouse

    Directory of Open Access Journals (Sweden)

    Yan-cong Zhou

    2014-01-01

    Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

  12. OSM-ORIENTED METHOD OF MULTIMODAL ROUTE PLANNING

    Directory of Open Access Journals (Sweden)

    X. Li

    2015-07-01

    Full Text Available With the increasing pervasiveness of basic facilitate of transportation and information, the need of multimodal route planning is becoming more essential in the fields of communication and transportation, urban planning, logistics management, etc. This article mainly described an OSM-oriented method of multimodal route planning. Firstly, it introduced how to extract the information we need from OSM data and build proper network model and storage model; then it analysed the accustomed cost standard adopted by most travellers; finally, we used shortest path algorithm to calculate the best route with multiple traffic means.

  13. Multifactor-Driven Hierarchical Routing on Enterprise Service Bus

    Science.gov (United States)

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

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

  14. A Survey of Routing Protocols in Wireless Body Sensor Networks

    Science.gov (United States)

    Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

    2014-01-01

    Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses. PMID:24419163

  15. Advanced Air Transportation Technologies Project, Final Document Collection

    Science.gov (United States)

    Mogford, Richard H.; Wold, Sheryl (Editor)

    2008-01-01

    This CD ROM contains a compilation of the final documents of the Advanced Air Transportation Technologies (AAIT) project, which was an eight-year (1996 to 2004), $400M project managed by the Airspace Systems Program office, which was part of the Aeronautics Research Mission Directorate at NASA Headquarters. AAIT focused on developing advanced automation tools and air traffic management concepts that would help improve the efficiency of the National Airspace System, while maintaining or enhancing safety. The documents contained in the CD are final reports on AAIT tasks that serve to document the project's accomplishments over its eight-year term. Documents include information on: Advanced Air Transportation Technologies, Autonomous Operations Planner, Collaborative Arrival Planner, Distributed Air/Ground Traffic Management Concept Elements 5, 6, & 11, Direct-To, Direct-To Technology Transfer, Expedite Departure Path, En Route Data Exchange, Final Approach Spacing Tool - (Active and Passive), Multi-Center Traffic Management Advisor, Multi Center Traffic Management Advisor Technology Transfer, Surface Movement Advisor, Surface Management System, Surface Management System Technology Transfer and Traffic Flow Management Research & Development.

  16. Exploring en-route parking type and parking-search route choice

    DEFF Research Database (Denmark)

    Kaplan, Sigal; Bekhor, Sholomo

    2011-01-01

    This paper describes the first phase of an on-going research investigating the joint choice of parking type, parking facility and cruising-for-parking route. The importance of this issue derives from the significant share of cruising-for-parking traffic in urban areas, the relevance of parking po...

  17. Simulation-based planning for theater air warfare

    Science.gov (United States)

    Popken, Douglas A.; Cox, Louis A., Jr.

    2004-08-01

    Planning for Theatre Air Warfare can be represented as a hierarchy of decisions. At the top level, surviving airframes must be assigned to roles (e.g., Air Defense, Counter Air, Close Air Support, and AAF Suppression) in each time period in response to changing enemy air defense capabilities, remaining targets, and roles of opposing aircraft. At the middle level, aircraft are allocated to specific targets to support their assigned roles. At the lowest level, routing and engagement decisions are made for individual missions. The decisions at each level form a set of time-sequenced Courses of Action taken by opposing forces. This paper introduces a set of simulation-based optimization heuristics operating within this planning hierarchy to optimize allocations of aircraft. The algorithms estimate distributions for stochastic outcomes of the pairs of Red/Blue decisions. Rather than using traditional stochastic dynamic programming to determine optimal strategies, we use an innovative combination of heuristics, simulation-optimization, and mathematical programming. Blue decisions are guided by a stochastic hill-climbing search algorithm while Red decisions are found by optimizing over a continuous representation of the decision space. Stochastic outcomes are then provided by fast, Lanchester-type attrition simulations. This paper summarizes preliminary results from top and middle level models.

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

    Science.gov (United States)

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

    2015-11-02

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

  19. Applications of RADTRAN 4 to route-specific analysis

    International Nuclear Information System (INIS)

    Neuhauser, Sieglinde; Weiner, Ruth F.

    1992-01-01

    The transportation risk evaluation code RADTRAN 4 is designed to evaluate doses and risks associated with the transportation of radioactive materials. RADTRAN 4 may be used to calculate dose consequences for incident- free transportation and dose risks for accidents. Consequences of normal (or incident-free) transportation include doses to crew members, persons at stops, and members of the public sharing a route segment (on-link) and residing near the segment (off-link) during normal transportation. These dose estimates are not multiplied by a probability factor and, hence, are referred to as dose consequences. Calculated doses that might be incurred during accidents arc multiplied by the probabilities of those accidents, and hence are referred to as dose risks. RADTRAN 4 includes a LINK option that allows the user to characterize each link or segment of a transportation route in greater detail than that provided by average or default values for route-related parameters. The LINK option increases the flexibility of the code in several ways: LINK allows the same route segment to be evaluated under a variety of conditions. This capability may be used to prepare environmental documentation and to evaluate alternative routes under V.S. Department of Transportation Docket HM-164 (49 CFR 171-177); LINK capability may be used to assess the impact of projected population shifts on transportation routes; LINK facilitates comparison of the national average data included as defaults in RADTRAN with available 'route-specific' data. (author)

  20. Syntheses of the Bi(Pb)-2212 high-Tc superconductor through a novel oxide nitrate route

    International Nuclear Information System (INIS)

    Gibson, K; Ziegler, P; Meyer, H-J

    2004-01-01

    A novel route is presented for the syntheses of Bi 2 Sr 2 CaCu 2 O x (Bi-2212) and (Bi,Pb) 2 Sr 2 CaCu 2 O x (Bi,Pb-2212). Mixtures of oxides, nitrates and carbonates with approximate 2:2:1:2 metal ion compositions are dissolved in HNO 3 and dried at 200 deg. C in air. Afterwards they are reacted under their in situ generated NO x atmosphere in a closed reactor (Staurohr). This reaction forces the system to form the nitrate precursors (Bi,Sr,Ca) 2 O 2 NO 3 /CuO and (Bi,Pb,Sr,Ca) 2 O 2 NO 3 /CuO, respectively. In the final reaction stage these mixtures are converted into Bi(Pb)-2212 under NO x discharge in air. All important reaction stages and phase compositions are analysed by means of powder XRD

  1. Link reliability based hybrid routing for tactical mobile ad hoc network

    Institute of Scientific and Technical Information of China (English)

    Xie Xiaochuan; Wei Gang; Wu Keping; Wang Gang; Jia Shilou

    2008-01-01

    Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network,without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the networkperformance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.

  2. OSPF-TE Extensions for Green Routing in Optical Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ricciardi, S.; Fagertun, Anna Manolova

    2012-01-01

    This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing.......This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing....

  3. Computer-based route-definition system for peripheral bronchoscopy.

    Science.gov (United States)

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

    2012-04-01

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

  4. Simple relationship between the virial-route hypernetted-chain and the compressibility-route Percus-Yevick values of the fourth virial coefficient.

    Science.gov (United States)

    Santos, Andrés; Manzano, Gema

    2010-04-14

    As is well known, approximate integral equations for liquids, such as the hypernetted chain (HNC) and Percus-Yevick (PY) theories, are in general thermodynamically inconsistent in the sense that the macroscopic properties obtained from the spatial correlation functions depend on the route followed. In particular, the values of the fourth virial coefficient B(4) predicted by the HNC and PY approximations via the virial route differ from those obtained via the compressibility route. Despite this, it is shown in this paper that the value of B(4) obtained from the virial route in the HNC theory is exactly three halves the value obtained from the compressibility route in the PY theory, irrespective of the interaction potential (whether isotropic or not), the number of components, and the dimensionality of the system. This simple relationship is confirmed in one-component systems by analytical results for the one-dimensional penetrable-square-well model and the three-dimensional penetrable-sphere model, as well as by numerical results for the one-dimensional Lennard-Jones model, the one-dimensional Gaussian core model, and the three-dimensional square-well model.

  5. Deduction of passengers' route choice from smart card data

    NARCIS (Netherlands)

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

    2013-01-01

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

  6. Changes in the Trade and Promotion of Passenger Air Transport

    Directory of Open Access Journals (Sweden)

    Cornelia Petroman

    2010-10-01

    Full Text Available Passenger air carriers will be able to systematically overbook transport capacities on certain aerial routes due to the quick adaptation to modern trading means, to the modern promotion of services and to the modern means of information of potential travellers. Though ticket booking in aerial transport made its debut as a simple process of automation of ticket sale, it soon turned into a strong marketing instrument with unexpected effects on competitiveness on the market of tourism aerial transport. The use of modern ways of operating Computer Reservation Systems and Billing Settlement Plans by passenger air companies and by tour operators improves service standards.

  7. Fast reactor calculational route for Pu burning core design

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-01-01

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

  8. Conflict resolution and alert zone estimation in air traffic management

    Science.gov (United States)

    Kuo, Vincent Hao-Hung

    The current air traffic control (ATC) system provides separations among all aircraft through pre-defined routes and flight procedures, and active controller participation. In particular, en route separations are achieved by choices of different flight routes, different flight levels, and speed control. During the final descent approach over an extended terminal area, aircraft separations are achieved by speed changes, altitude changes, and path stretching. Recently, a concept of free flight has been proposed for future air traffic management. In the proposed free flight environment, aircraft operators can change flight paths in real time, in order to achieve the best efficiency for the aircraft. Air traffic controllers are only supposed to intervene when situation warrants, to resolve potential conflicts among aircraft. In both cases, there is a region around each aircraft called alert zone. As soon as another aircraft touches the alert zone of own aircraft, either the own aircraft or both aircraft must initiate avoidance maneuvers to resolve a potential conflict. This thesis develops a systematic approach based on nonlinear optimal control theories to estimate alert zones in two aircraft conflict scenarios. Specifically, point-mass aircraft models are used to describe aircraft motions. Separate uses of heading, speed, and altitude control are first examined, and then the synergetic use of two control authorities are studied. Both cooperative maneuvers (in which both aircraft act) and non-cooperative maneuvers (in which the own aircraft acts alone) are considered. Optimal control problems are formulated to minimize the initial relative separation between the two aircraft for all possible initial conditions, subject to the requirement that inter-aircraft separation at any time satisfies the separation requirement. These nonlinear optimal control problems are solved numerically using a collation approach and the NPSOL software line for nonlinear programming. In

  9. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  10. A model of ant route navigation driven by scene familiarity.

    Directory of Open Access Journals (Sweden)

    Bart Baddeley

    2012-01-01

    Full Text Available In this paper we propose a model of visually guided route navigation in ants that captures the known properties of real behaviour whilst retaining mechanistic simplicity and thus biological plausibility. For an ant, the coupling of movement and viewing direction means that a familiar view specifies a familiar direction of movement. Since the views experienced along a habitual route will be more familiar, route navigation can be re-cast as a search for familiar views. This search can be performed with a simple scanning routine, a behaviour that ants have been observed to perform. We test this proposed route navigation strategy in simulation, by learning a series of routes through visually cluttered environments consisting of objects that are only distinguishable as silhouettes against the sky. In the first instance we determine view familiarity by exhaustive comparison with the set of views experienced during training. In further experiments we train an artificial neural network to perform familiarity discrimination using the training views. Our results indicate that, not only is the approach successful, but also that the routes that are learnt show many of the characteristics of the routes of desert ants. As such, we believe the model represents the only detailed and complete model of insect route guidance to date. What is more, the model provides a general demonstration that visually guided routes can be produced with parsimonious mechanisms that do not specify when or what to learn, nor separate routes into sequences of waypoints.

  11. Ising model for packet routing control

    International Nuclear Information System (INIS)

    Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

    2004-01-01

    For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

  12. A Method for Driving Route Predictions Based on Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Ning Ye

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Wu Jieyi

    2005-01-01

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

  14. Proxies for Anonymous Routing

    National Research Council Canada - National Science Library

    Reed, Michael G; Syverson, Paul F; Goldschlag, David M

    1996-01-01

    ...), and file transfers (FTP) have been implemented. Onion routing provides application independent, real-time, and bi-directional anonymous connections that are resistant to both eavesdropping and traffic analysis...

  15. Introducing radiality constraints in capacitated location-routing problems

    Directory of Open Access Journals (Sweden)

    Eliana Mirledy Toro Ocampo

    2017-03-01

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

  16. An improved AODV routing protocol based on tower structure

    Directory of Open Access Journals (Sweden)

    Li Yong Qiang

    2016-01-01

    Full Text Available The paper proposed a new routing protocol(IAODV based on tower structure in the Ad Hoc network for the problem which Location Routing Protocol need hardware and Complex algorithm. By the simulation, The complexity of the new routing protocol is reduced without reducing the performance of the network.

  17. Delay Management with Re-Routing of Passengers

    NARCIS (Netherlands)

    T.A.B. Dollevoet (Twan); D. Huisman (Dennis); M.E. Schmidt (Marie); A. Schöbel (Anita)

    2010-01-01

    textabstractThe question of delay management is whether trains should wait for a delayed feeder train or should depart on time. In classical delay management models passengers always take their originally planned route. In this paper, we propose a model where re-routing of passengers is

  18. Joint route planning under varying market conditions

    NARCIS (Netherlands)

    Cruijssen, Frans; Bräysy, Olli; Dullaert, Wout; Fleuren, Hein; Salomon, Marc

    2007-01-01

    Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics. Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their

  19. Air quality in inter-city buses : final report

    International Nuclear Information System (INIS)

    2005-01-01

    Various studies have suggested that air quality inside automobiles and school buses may be poorer than ambient or nearby air quality, and that concentrations of vehicle-related pollutants in city buses may be sufficiently elevated to pose concerns for vehicle occupants and operators. This paper presented the results of preliminary investigation of levels of some pollutants in inter-city buses to determine whether a fuller investigation is warranted. Another objective of the investigation was to develop methods for assessing air quality within road vehicles. Students carried monitoring equipment on 28 inter-city trips made by Greyhound Canada buses during July and August 2004. The equipment recorded average levels of carbon monoxide (CO) and nitrogen dioxide (NO 2 ), as well as concentrations of particulate matter. Bus routes were selected that allowed for an average of 10 hours of total sampling time in a day. Data was recorded on pumps, run times and routes taken. Results indicated that levels of CO in the buses were much lower than the national standard of acceptable levels for CO. Levels of NO 2 were on average lower, but 5 of the 19 recorded values exceeded acceptable levels. Average particulate levels recorded in the buses were considered acceptable, although some of the recorded levels were higher than desirable. It was concluded that further work on in-vehicle levels of NO 2 and particulate matter could be warranted. Although several procedural and equipment problems were encountered, the methods used in the investigation appeared to be valid, and were thought to be suitable for further work on in-vehicle concentrations of pollutants. 21 refs

  20. Many routes leading to Rome: Potential causes for the multi-route migration system of Red Knots Calidris canutus islandica

    NARCIS (Netherlands)

    Bauer, S.; Ens, B.J.; Klaassen, M.R.J.

    2010-01-01

    Migrants, such as birds or representatives of other taxa, usually make use of several stopover sites to cover the distance between their site of origin and destination. Potentially, multiple routes exist, but often little is known about the causes and consequences of alternative migration routes.

  1. A novel insight into beaconless geo-routing

    KAUST Repository

    Bader, Ahmed

    2012-12-01

    Beaconless geo-routing protocols have been traditionally analyzed assuming equal communication ranges for the data and control packets. This is not true in reality, since the communication range is in practice function of the packet length. As a consequence, a substantial discrepancy may exist between analytical and empirical results offered in beaconless geo-routing literature. Furthermore, performance of beaconless geo-routing protocols has typically considered using single-hop metrics only. End-to-end performance is considered in literature only occasionally and mainly in terms of simulation only. In this paper, we re-examine this class of protocols. We first incorporate practical packet detection models in order to capture the dependency of the communication range on the packet\\'s length. We then develop a detailed analytical framework for the end-to-end delay and energy performance of beaconless geo-routing protocols. Finally, we present two different application scenarios and study various tradeoffs in light of the framework developed. © 2012 IEEE.

  2. Location-Aided Reliable Routing for Opportunistic Networks

    Institute of Scientific and Technical Information of China (English)

    Yong Yang; Zhi Ren; Jibi Li

    2012-01-01

    In our study, we investigate the problem of location-based routing in opportunistic networks. Due to the uncertainty of end-to-end paths between sources and destinations, the classical location-based ad hoc routing protocols cannot adapt to the environment of opportunistic networks, which leads to the decrease of the delivery rate of data. To address it, we propose in this paper a novel location-aided routing protocol which is suitable for opportunistic networks. In our protocol, a node can send location information on demand by using prediction mechanism, and when sending a data packet, the node chooses multiple neighbors which are closer to the destination as next hops. If the candidate neighbors do not exist, the node carries the data till it meets a proper neighbor or the destination. Theoretical analysis and simulation results show that our proposed protocol outperforms DREAM (Distance Routing Effect Protocol Mobility) and one of its improved versions, BFDREAM (Boundary Forwarding DREAM), in terms of the delivery rate and overhead.

  3. Coordinated Platoon Routing in a Metropolitan Network

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

    2016-10-10

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

  4. Characterization of Static/Dynamic Topological Routing For Grid Networks

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

    2009-01-01

    Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...... and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a "Dynamic" attribute. This new property attempts to improve the overall network performance for future...

  5. Technical Report: Sleep-Route - Routing through Sleeping Sensors

    OpenAIRE

    Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

    2014-01-01

    In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

  6. Cognitive load during route selection increases reliance on spatial heuristics.

    Science.gov (United States)

    Brunyé, Tad T; Martis, Shaina B; Taylor, Holly A

    2018-05-01

    Planning routes from maps involves perceiving the symbolic environment, identifying alternate routes and applying explicit strategies and implicit heuristics to select an option. Two implicit heuristics have received considerable attention, the southern route preference and initial segment strategy. This study tested a prediction from decision-making theory that increasing cognitive load during route planning will increase reliance on these heuristics. In two experiments, participants planned routes while under conditions of minimal (0-back) or high (2-back) working memory load. In Experiment 1, we examined how memory load impacts the southern route heuristic. In Experiment 2, we examined how memory load impacts the initial segment heuristic. Results replicated earlier results demonstrating a southern route preference (Experiment 1) and initial segment strategy (Experiment 2) and further demonstrated that evidence for heuristic reliance is more likely under conditions of concurrent working memory load. Furthermore, the extent to which participants maintained efficient route selection latencies in the 2-back condition predicted the magnitude of this effect. Together, results demonstrate that working memory load increases the application of heuristics during spatial decision making, particularly when participants attempt to maintain quick decisions while managing concurrent task demands.

  7. Air quality assessment in the vicinity of nuclear and thermal power stations

    International Nuclear Information System (INIS)

    Sivaramasundaram, K.; Vijay Bhaskar, B.; Muthusubramanian, P.; Rajan, M.P.; Hegde, A.G.

    2007-01-01

    The status and ranking of any country, in the context of globalisation, is decided by its economic progress, which is directly linked into power generation. The power is generated by many routes and the nuclear and thermal routes are noteworthy among them. As the power production and its associated activities may cause qualitative deterioration, it is essential to study the impact of power production on atmospheric environment. In this connection, a comparative study has been carried out to assess the air quality with special reference to criteria pollutants in the vicinity of nuclear and thermal power stations. In the present investigation, the air samples are collected on weekly basis and the pollutants such as sulphur dioxide (SO 2 ), nitrogen oxides (NOx), carbon monoxide (CO), suspended particulate matter (SPM) and respirable particulate matter (RPM) are estimated by adopting standard procedures set by United States-Environmental Protection Agency (US-EPA) and Central Pollution Control Board (CPCB). As the micro meteorological parameters influence on the status of air quality, simultaneous measurements of these parameters are also carried, out during sampling. It is studied that estimated concentrations of all criteria pollutants in the vicinity of these power stations are within the permissible limits set by CPCB. On the basis of the generated database pertaining to the concentrations of criteria air pollutants in the vicinity of nuclear and thermal power stations, it is concluded that nuclear power production may be considered as a viable option in terms of environmental protection in our country. (author)

  8. A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    H.S.Zhao

    2013-12-01

    Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.

  9. Selective epidemic vaccination under the performant routing algorithms

    Science.gov (United States)

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

    2018-04-01

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

  10. Modeling Stochastic Route Choice Behaviors with Equivalent Impedance

    Directory of Open Access Journals (Sweden)

    Jun Li

    2015-01-01

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

  11. Analysis of Pervasive Mobile Ad Hoc Routing Protocols

    Science.gov (United States)

    Qadri, Nadia N.; Liotta, Antonio

    Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

  12. Trade routes and plague transmission in pre-industrial Europe.

    Science.gov (United States)

    Yue, Ricci P H; Lee, Harry F; Wu, Connor Y H

    2017-10-11

    Numerous historical works have mentioned that trade routes were to blame for the spread of plague in European history, yet this relationship has never been tested by quantitative evidence. Here, we resolve the hypothetical role of trade routes through statistical analysis on the geo-referenced major trade routes in the early modern period and the 6,656 geo-referenced plague outbreak records in AD1347-1760. Ordinary Least Square (OLS) estimation results show that major trade routes played a dominant role in spreading plague in pre-industrial Europe. Furthermore, the negative correlation between plague outbreaks and their distance from major trade ports indicates the absence of a permanent plague focus in the inland areas of Europe. Major trade routes decided the major plague outbreak hotspots, while navigable rivers determined the geographic pattern of sporadic plague cases. A case study in Germany indicates that plague penetrated further into Europe through the local trade route network. Based on our findings, we propose the mechanism of plague transmission in historical Europe, which is imperative in demonstrating how pandemics were spread in recent human history.

  13. Preventing Restricted Space Inference in Online Route Planning Services

    Directory of Open Access Journals (Sweden)

    Florian Dorfmeister

    2016-03-01

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

  14. CityAir app: Mapping air-quality perception using people as sensors

    Science.gov (United States)

    Castell, Nuria; Fredriksen, Mirjam; Cole-Hunter, Thomas; Robinson, Johanna; Keune, Hans; Nieuwenhuijsen, Mark; Bartonova, Alena

    2016-04-01

    . Currently, 400 + Android OS and 180+ iOS smartphone users in 12+ countries have downloaded, installed and used CityAir. The central advantage of the People as Sensors approach is that it can complement costly physical sensor networks. The observations made in smartphones are shared and other persons can consult those to take decisions as for instance choosing a cleaner route to bicycle to work or avoid exercising in certain areas that day. The drawbacks are limited comparability and interpretability, and the inherent uncertainty. CityAir can be seen as a democratic platform for empowering citizens to contribute to environmental governance, facilitating the communication between the citizen and the decision makers. Citizens are encouraged to participate in sharing their perception on the air quality in their city. Citizens become agents of change by uncovering and sharing their perception of air quality in a place that matters to them. We discuss the current challenges: how to involve citizens in the use of the app and how to communicate and visualize the information in a way that is useful for the citizens; point out possible solutions, and pin-point directions for future research.

  15. Time and timing in vehicle routing problems

    NARCIS (Netherlands)

    Jabali, O.

    2010-01-01

    The distribution of goods to a set of geographically dispersed customers is a common problem faced by carrier companies, well-known as the Vehicle Routing Problem (VRP). The VRP consists of finding an optimal set of routes that minimizes total travel times for a given number of vehicles with a fixed

  16. Principles of Vessel Route Planning in Ice on the Northern Sea Route

    Directory of Open Access Journals (Sweden)

    Tadeusz Pastusiak

    2016-12-01

    Full Text Available A complex of ice cover characteristics and the season of the year were considered in relation to vessel route planning in ice-covered areas on the NSR. The criteria for navigation in ice - both year-round and seasonal were analyzed. The analysis of the experts knowledge, dissipated in the literature, allowed to identify some rules of route planning in ice-covered areas. The most important processes from the navigation point of view are the development and disintegration of ice, the formation and disintegration of fast ice and behavior of the ice massifs and polynyas. The optimal route is selected on basis of available analysis and forecast maps of ice conditions and ice class, draught and seaworthiness of the vessel. The boundary of the ice indicates areas accessible to vessels without ice class. Areas with a concentration of ice from 0 to 6/10 are used for navigation of vessels of different ice classes. Areas of concentration of ice from 7/10 up are eligible for navigation for icebreakers and vessels with a high ice class with the assistance of icebreakers. These rules were collected in the decision tree. Following such developed decision-making model the master of the vessel may take decision independently by accepting grading criteria of priorities resulting from his knowledge, experience and the circumstances of navigation. Formalized form of decision making model reduces risk of the "human factor" in the decision and thereby help improve the safety of maritime transport.

  17. IMT-2000 Satellite Standards with Applications to Mobile Air Traffic Communications Networks

    Science.gov (United States)

    Shamma, Mohammed A.

    2004-01-01

    The International Mobile Telecommunications - 2000 (IMT-2000) standard and more specifically the Satellite component of it, is investigated as a potential alternative for communications to aircraft mobile users en-route and in terminal area. Its application to Air Traffic Management (ATM) communication needs is considered. A summary of the specifications of IMT-2000 satellite standards are outlined. It is shown via a system research analysis that it is possible to support most air traffic communication needs via an IMT-2000 infrastructure. This technology can compliment existing, or future digital aeronautical communications technologies such as VDL2, VDL3, Mode S, and UAT.

  18. Journal of Air Transportation, Volume 10, No. 3

    Science.gov (United States)

    Bowen, Brent D. (Editor); Kabashkin, Igor (Editor)

    2005-01-01

    The following topics are discussed: The Effects of Safety Information on Aeronautical Decision Making; Design, Development, and Validation of an Interactive Multimedia Training Simulator for Responding to Air Transportation Bomb Threats; Discovering the Regulatory Considerations of the Federal Aviation Administration: Interviewing the Aviation Rulemaking Advisory Committee; How to Control Airline Routes from the Supply Side: The Case of TAP; An Attempt to Measure the Traffic Impact of Airline Alliances; and Study Results on Knowledge Requirements for Entry-level Airport Operations and Management Personnel.

  19. Throughput Capacity of Ad Hoc Networks with Route Discovery

    Directory of Open Access Journals (Sweden)

    Blum Rick S

    2007-01-01

    Full Text Available Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network . However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.

  20. What is the optimal architecture for visual information routing?

    Science.gov (United States)

    Wolfrum, Philipp; von der Malsburg, Christoph

    2007-12-01

    Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.

  1. Self-Interested Routing in Queueing Networks

    OpenAIRE

    Ali K. Parlaktürk; Sunil Kumar

    2004-01-01

    We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

  2. Identifying and prioritizing ungulate migration routes for landscape-level conservation

    Science.gov (United States)

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

    2009-01-01

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

  3. Comparison of Mucosal, Subcutaneous and Intraperitoneal Routes of Rat Leptospira Infection

    Science.gov (United States)

    Zilber, Anne-Laure; Belli, Patrick; Grezel, Delphine; Artois, Marc; Kodjo, Angeli; Djelouadji, Zoheira

    2016-01-01

    Leptospirosis is a zoonosis found worldwide that is caused by a spirochete. The main reservoirs of Leptospira, which presents an asymptomatic infection, are wild rodents, including the brown rat (Rattus norvegicus). Experimental studies of the mechanisms of its renal colonization in rats have previously used an intraperitoneal inoculation route. However, knowledge of rat-rat transmission requires the use of a natural route of inoculation, such as a mucosal or subcutaneous route. We investigated for the first time the effects of subcutaneous and mucosal inoculation routes compared to the reference intraperitoneal route during Leptospira infection in adult rats. Infection characteristics were studied using Leptospira renal isolation, serology, and molecular and histological analyses. Leptospira infection was asymptomatic using each inoculation route, and caused similar antibody production regardless of renal colonization. The observed renal colonization rates were 8 out of 8 rats, 5 out of 8 rats and 1 out of 8 rats for the intraperitoneal, mucosal and subcutaneous inoculation routes, respectively. Thus, among the natural infection routes studied, mucosal inoculation was more efficient for renal colonization associated with urinary excretion than the subcutaneous route and induced a slower-progressing infection than the intraperitoneal route. These results can facilitate understanding of the infection modalities in rats, unlike the epidemiological studies conducted in wild rats. Future studies of other natural inoculation routes in rat models will increase our knowledge of rat-rat disease transmission and allow the investigation of infection kinetics. PMID:27031867

  4. Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Roy Sohini

    2015-09-01

    Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

  5. DRO: domain-based route optimization scheme for nested mobile networks

    Directory of Open Access Journals (Sweden)

    Chuang Ming-Chin

    2011-01-01

    Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

  6. Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

    Science.gov (United States)

    Zhang, Yuanfei; Pei, Qianwen; Dai, Feifei; Zhang, Lei

    2017-10-01

    Vehicular ad-hoc network (VANET) is a core component of intelligent traffic management system which could provide various of applications such as accident prediction, route reporting, etc. Due to the problems caused by traffic congestion, route reporting becomes a prospective application which can help a driver to get optimal route to save her travel time. Before enjoying the convenience of route reporting, security and privacy-preserving issues need to be concerned. In this paper, we propose a new secure and privacy-preserving route reporting scheme for VANETs. In our scheme, only an authenticated vehicle can use the route reporting service provided by the traffic management center. Further, a vehicle may receive the response from the traffic management center with low latency and without violating the privacy of the vehicle. Experiment results show that our scheme is much more efficiency than the existing one.

  7. Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

    Science.gov (United States)

    Zhang, Hang; Maddula, Soumya V.; Maloney, Laurence T.

    2010-01-01

    We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value). We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics) for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes. PMID:21833269

  8. PLANNING ROUTES ACROSS ECONOMIC TERRAINS: MAXIMIZING UTILITY, FOLLOWING HEURISTICS

    Directory of Open Access Journals (Sweden)

    Hang eZhang

    2010-12-01

    Full Text Available We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value. We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes.

  9. 29 CFR 1910.36 - Design and construction requirements for exit routes.

    Science.gov (United States)

    2010-07-01

    ... construction requirements for exit routes. (a) Basic requirements. Exit routes must meet the following design... your workplace, consult NFPA 101-2000, Life Safety Code. (c) Exit discharge. (1) Each exit discharge... route must be adequate. (1) Exit routes must support the maximum permitted occupant load for each floor...

  10. Research on the optimization of vehicle distribution routes in logistics enterprises

    Science.gov (United States)

    Fan, Zhigou; Ma, Mengkun

    2018-01-01

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

  11. Segmented Routing for Speed-Performance and Routability in Field-Programmable Gate Arrays

    Directory of Open Access Journals (Sweden)

    Stephen Brown

    1996-01-01

    Full Text Available This paper addresses several issues involved for routing in Field-Programmable Gate Arrays (FPGAs that have both horizontal and vertical routing channels, with wire segments of various lengths. Routing is studied by using CAD routing tools to map a set of benchmark circuits into FPGAs, and measuring the effects that various parameters of the CAD tools have on the implementation of the circuits. A two-stage routing strategy of global followed by detailed routing is used, and the effects of both of these CAD stages are discussed, with emphasis on detailed routing. We present a new detailed routing algorithm designed specifically for the types of routing structures found in the most recent generation of FPGAs, and show that the new algorithm achieves significantly better results than previously published FPGA routers with respect to the speed-performance of implemented circuits.

  12. Porcelain tiles by the dry route

    Directory of Open Access Journals (Sweden)

    Boschi, A. O.

    2010-10-01

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

    En Brasil, en este momento segundo productor mundial, el 70% de los pavimentos cerámicos se obtiene por vía seca. Una de las razones fundamentales se debe a que esta vía supone un consumo energético inferior, en un 30%, a la via húmeda tradicional. La creciente preocupación mundial sobre los problemas medioambientales y el reconocimiento del papel central que juega el agua en este proceso han favorecido el desarrollo de la vía seca. En este contexto, el objetivo del presente trabajo es estudiar la viabilidad de la producción de pavimentos porcelánicos de alta calidad por vía seca. Una breve comparación entre ambas vías, en las condiciones standard de producción vigentes para producciones que no son de porcelánico, indican que existen dos diferencias substanciales; el tamaño de

  13. Research on routing algorithm based on the VANET

    Directory of Open Access Journals (Sweden)

    AN Li

    2016-01-01

    Full Text Available For the characteristics of high speed mobility of nodes, frequent changes of dynamic topology and frequent interrupts of the communication links in the VANET, this paper analyzed the defect of the current mobile ad-hoc network routing protocol, and carried on the simulation analysis on the adaptability of AODV, DSR and DSDV routing protocols in VANET applications in the VANET. Through the above research, this paper obtained the conclusion that the AODV routing protocol is more suitable for vehicular ad hoc network environment

  14. Route selection for the transport of hazardous materials

    Energy Technology Data Exchange (ETDEWEB)

    Seiler, F A

    1988-12-01

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

  15. ARBR: Adaptive reinforcement-based routing for DTN

    KAUST Repository

    Elwhishi, Ahmed

    2010-10-01

    This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function at each contact with another node. The proposed protocol is characterized by not only considering the contact time statistics under a novel contact model, but also looks into the feedback on user behavior and network conditions, such as congestion and buffer occupancy sampled during each previous contact with any other node. Therefore, the proposed protocol can achieve high efficiency via an adaptive and intelligent routing mechanism according to network conditions. Extensive simulation is conducted to verify the proposed protocol, where a comparison is made with a number of existing encounter-based routing protocols in term of the number of transmissions of each message, message delivery delay, and delivery ratio. The results of the simulation demonstrate the effectiveness of the proposed technique.

  16. Route Fidelity during Marine Megafauna Migration

    Directory of Open Access Journals (Sweden)

    Travis W. Horton

    2017-12-01

    Full Text Available The conservation and protection of marine megafauna require robust knowledge of where and when animals are located. Yet, our ability to predict animal distributions in space and time remains limited due to difficulties associated with studying elusive animals with large home ranges. The widespread deployment of satellite telemetry technology creates unprecedented opportunities to remotely monitor animal movements and to analyse the spatial and temporal trajectories of these movements from a variety of geophysical perspectives. Reproducible patterns in movement trajectories can help elucidate the potential mechanisms by which marine megafauna navigate across vast expanses of open-ocean. Here, we present an empirical analysis of humpback whale (Megaptera novaeangliae, great white shark (Carcharodon carcharias, and northern elephant seal (Mirounga angustirostris satellite telemetry-derived route fidelity movements in magnetic and gravitational coordinates. Our analyses demonstrate that: (1 humpback whales, great white sharks and northern elephant seals are capable of performing route fidelity movements across millions of square kilometers of open ocean with a spatial accuracy of better than 150 km despite temporal separations as long as 7 years between individual movements; (2 route fidelity movements include significant (p < 0.05 periodicities that are comparable in duration to the lunar cycles and semi-cycles; (3 latitude and bedrock-dependent gravitational cues are stronger predictors of route fidelity movements than spherical magnetic coordinate cues when analyzed with respect to the temporally dependent moon illumination cycle. We further show that both route fidelity and non-route fidelity movement trajectories, for all three species, describe overlapping in-phase or antiphase sinusoids when individual movements are normalized to the gravitational acceleration present at migratory departure sites. Although these empirical results provide an

  17. A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

    Science.gov (United States)

    Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

    2017-01-01

    In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

  18. A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

    Science.gov (United States)

    Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

    2017-05-22

    In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

  19. Evolution Strategies in the Multipoint Connections Routing

    Directory of Open Access Journals (Sweden)

    L. Krulikovska

    2010-09-01

    Full Text Available Routing of multipoint connections plays an important role in final cost and quality of a found connection. New algorithms with better results are still searched. In this paper, a possibility of using the evolution strategies (ES for routing is presented. Quality of found connection is evaluated from the view of final cost and time spent on a searching procedure. First, parametrical analysis of results of the ES are discussed and compared with the Prim’s algorithm, which was chosen as a representative of the deterministic routing algorithms. Second, ways for improving the ES are suggested and implemented. The obtained results are reviewed. The main improvements are specified and discussed in conclusion.

  20. Pheromone Static Routing Strategy for Complex Networks

    Science.gov (United States)

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

    2012-12-01

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

  1. Hazardous materials routing - risk management of mismanagement

    International Nuclear Information System (INIS)

    Glickman, T.S.

    1988-01-01

    Along with emergency planning and preparedness, the placement of restrictions on routing has become an increasingly popular device for managing the highway and rail risks of hazardous materials transportation. Federal studies conducted in 1985 indicate that at that time there were 513 different state and local restrictions on the routing of hazardous materials for these two modes of transportation, and that there were 136 state and local notification requirements, that is, restrictions that take the form of a statute or ordinance requiring advance warning or periodic reporting about hazardous materials shipments. Routing restrictions also take the form of prohibiting the use of road, a tunnel, or a bridge for a specified set of hazardous materials

  2. Evaluation of geocast routing trees on random and actual networks

    NARCIS (Netherlands)

    Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

    2017-01-01

    Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

  3. Energy Reduction Multipath Routing Protocol for MANET Using Recoil Technique

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar Sahu

    2018-04-01

    Full Text Available In Mobile Ad-hoc networks (MANET, power conservation and utilization is an acute problem and has received significant attention from academics and industry in recent years. Nodes in MANET function on battery power, which is a rare and limited energy resource. Hence, its conservation and utilization should be done judiciously for the effective functioning of the network. In this paper, a novel protocol namely Energy Reduction Multipath Routing Protocol for MANET using Recoil Technique (AOMDV-ER is proposed, which conserves the energy along with optimal network lifetime, routing overhead, packet delivery ratio and throughput. It performs better than any other AODV based algorithms, as in AOMDV-ER the nodes transmit packets to their destination smartly by using a varying recoil off time technique based on their geographical location. This concept reduces the number of transmissions, which results in the improvement of network lifetime. In addition, the local level route maintenance reduces the additional routing overhead. Lastly, the prediction based link lifetime of each node is estimated which helps in reducing the packet loss in the network. This protocol has three subparts: an optimal route discovery algorithm amalgamation with the residual energy and distance mechanism; a coordinated recoiled nodes algorithm which eliminates the number of transmissions in order to reduces the data redundancy, traffic redundant, routing overhead, end to end delay and enhance the network lifetime; and a last link reckoning and route maintenance algorithm to improve the packet delivery ratio and link stability in the network. The experimental results show that the AOMDV-ER protocol save at least 16% energy consumption, 12% reduction in routing overhead, significant achievement in network lifetime and packet delivery ratio than Ad hoc on demand multipath distance vector routing protocol (AOMDV, Ad hoc on demand multipath distance vector routing protocol life

  4. A Multicast Protocol Utilizing On-demand Routing Strategy for MPRN

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    This paper proposes a multicast protocol utilizing ondemand routing strategy for mobile packet radio network. It does not maintain permanent route tables with full topological views. Instead, multicast senders apply on-demand procedures to dynamically discover routes and build forwarding group in this protocol. The data packets are propagated by each forwarding group member via scoped flooding, so the protocol can reduce network bandwidth overhead and avoid the propagation of potentially large routing updates throughout the network.

  5. An Evolutionary Real-Time 3D Route Planner for Aircraft

    Institute of Scientific and Technical Information of China (English)

    郑昌文; 丁明跃; 周成平

    2003-01-01

    A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.

  6. CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network

    OpenAIRE

    Rashed, M. G.; Kabir, M. Hasnat; Rahim, M. Sajjadur; Ullah, Sk. Enayet

    2012-01-01

    A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol ...

  7. A lower bound for the node, edge, and arc routing problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Hasle, Geir; Wøhlk, Sanne

    2013-01-01

    The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem (MCGRP), generalizes the classical Capacitated Vehicle Routing Problem (CVRP......), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It captures important aspects of real-life routing problems that were not adequately modeled in previous Vehicle Routing Problem (VRP) variants. The authors also proposed a memetic algorithm procedure and defined a set of test instances...... called the CBMix benchmark. The NEARP definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound procedure for the NEARP. It is a further development of lower bounds for the CARP. We also define two novel sets of test instances to complement...

  8. Interval Routing and Minor-Monotone Graph Parameters

    NARCIS (Netherlands)

    Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van

    2006-01-01

    We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the

  9. Indoor 3D Route Modeling Based On Estate Spatial Data

    Science.gov (United States)

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

    2014-04-01

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

  10. HIGHWAY, a transportation routing model: program description and users' manual

    International Nuclear Information System (INIS)

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

    1982-12-01

    A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire interstate highway system, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of interstate highways or routes that will bypass urbanized areas containing populations > 100,000. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

  11. Routing of Electric Vehicles: City Distribution in Copenhagen

    DEFF Research Database (Denmark)

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

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

  12. Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

    2012-01-01

    In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

  13. Air Mobility Command’s En Route Support Infrastructure: A Construct of Aircraft Type and Geographic Location Utilized to Assess En Route Aircraft Logistic Support

    Science.gov (United States)

    2007-06-01

    Minor EDDF Rhein Main AB, Germany 721 AMOG 726 Air Mobility Squadron Minor EGUN RAF Mildenhall, United Kingdom 721 AMOG 727 Air Mobility Squadron...45.7 58.8 EGUL KC-135 5 221.7 44.3 13.5 0.8 177.0 176.2 66.8 4463.4 0.05 58.6 -14.2 102.9 EGUN C-130 34 1439.3 42.3 38.7 0.5 127.3 126.8 32.1 1028.5...0.05 10.8 31.6 53.1 EGUN C-141 28 1098.6 39.2 20.2 0.8 170.5 169.7 43.9 1925.2 0.05 16.3 23.0 55.5 EGUN C-17 22 1016.5 46.2 30.0 0.3 198.5 198.2 52.1

  14. Acquisition of business intelligence from human experience in route planning

    Science.gov (United States)

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

    2015-04-01

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

  15. Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jugminder Kaur

    2016-01-01

    Full Text Available Security is always a major concern in wireless sensor networks (WSNs. Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

  16. Application of cloud computing in power routing for clusters of microgrids using oblivious network routing algorithm

    DEFF Research Database (Denmark)

    Amini, M. Hadi; Broojeni, Kianoosh G.; Dragicevic, Tomislav

    2017-01-01

    of microgrid while preventing congestion as well as minimizing the power loss. Then, we present a two-layer simulation platform which considers both communication layer and physical layer of the microgrids' cluster. In order to improve the security of communication network, we perform the computations...... regarding the oblivious power routing via a cloud-based network. The proposed framework can be used for further studies that deal with the real-time simulation of the clusters of microgrids. In order to validate the effectiveness of the proposed framework, we implement our proposed oblivious routing scheme...

  17. Air crew exposure to cosmic radiation. New analysis, recommendations EURADOS

    International Nuclear Information System (INIS)

    Spurny, F.; Votockova, I.

    1995-01-01

    Cosmic radiation on the board of an aircraft consist of two components: directly ionizing radiation (electron, proton - low LET) and neutrons (high LET). Neither composition nor the energy spectrum of usual on-Earth calibration sources ( 60 Co, 252 Cf) do not correspond to the field on a board. Therefore high energy reference fields behind shielding high energy accelerator at CERN and Dubna have been created and intensively studied. Their typical characteristics following from the results of our measurements were obtained. In-flight measurements on the board of commercial aircraft have been realized since 1991 during about 20 flights, Flight routes extended from the 1.3 grad N up to about 65 grad N, flying altitudes varied from 8.2 km to 12.5 km. The exposure level due to galactic cosmic radiation is inversely proportional to the solar activity. Some radiation protection aspects were concluded: (a) The usual limits of annual air crew flight hours correspond at 11.3 km to about 4 mSv per year, with new ICRP conversion factors to about 5 mSv per year; (b) Monthly flight hours limit does not exclude that the exposure of a pregnant women can exceed 1 mSv during this period; (c) The air crew exposure should therefore be checked, controlled a nd administered as conscientiously as for any other group of occupationally exposed persons. A Working group 11 of EURADOS 'Exposure of air crew to cosmic radiation' has been formed (1992-1995) to prepare basic analysis and recommendations concerning the topics. The basic recommendations are the following: (a) air crew flying routinely at altitudes over 8 km are deemed to be category B workers, it is therefore important to estimate, record, control and, where necessary, to limit the doses; (b) the preferred procedure in order to estimate doses to air crew or frequent flyers is to determine route doses and fold these data with data on staff rostering; (c) where doses may exceed the limit for category B workers (6 mSv per year), on

  18. Optimization Model for Headway of a Suburban Bus Route

    Directory of Open Access Journals (Sweden)

    Xiaohong Jiang

    2014-01-01

    Full Text Available Due to relatively low passenger demand, headways of suburban bus route are usually longer than those of urban bus route. Actually it is also difficult to balance the benefits between passengers and operators, subject to the service standards from the government. Hence the headway of a suburban bus route is usually determined on the empirical experience of transport planners. To cope with this problem, this paper proposes an optimization model for designing the headways of suburban bus routes by minimizing the operating and user costs. The user costs take into account both the waiting time cost and the crowding cost. The feasibility and validity of the proposed model are shown by applying it to the Route 206 in Jiangning district, Nanjing city of China. Weightages of passengers’ cost and operating cost are further discussed, considering different passenger flows. It is found that the headway and objective function are affected by the weightages largely.

  19. Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

    Science.gov (United States)

    Dudukovich, Rachel; Raible, Daniel E.

    2016-01-01

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

  20. Using Historical Data to Automatically Identify Air-Traffic Control Behavior

    Science.gov (United States)

    Lauderdale, Todd A.; Wu, Yuefeng; Tretto, Celeste

    2014-01-01

    This project seeks to develop statistical-based machine learning models to characterize the types of errors present when using current systems to predict future aircraft states. These models will be data-driven - based on large quantities of historical data. Once these models are developed, they will be used to infer situations in the historical data where an air-traffic controller intervened on an aircraft's route, even when there is no direct recording of this action.

  1. Influence of the Built Environment on Pedestrian Route Choices of Adolescent Girls

    DEFF Research Database (Denmark)

    Rodriguez, Daniel A.; Merlin, Louis; Prato, Carlo Giacomo

    2015-01-01

    We examined the influence of the built environment on pedestrian route selection among adolescent girls. Portable global positioning system units, accelerometers, and travel diaries were used to identify the origin, destination, and walking routes of girls in San Diego, California, and Minneapolis...... of route choice. Shorter distance had the strongest positive association with route choice, whereas the presence of a greenway or trail, higher safety, presence of sidewalks, and availability of destinations along a route were also consistently positively associated with route choice at both sites...

  2. Comparison of MANET routing protocols using a scaled indoor wireless grid

    CSIR Research Space (South Africa)

    Johnson, DL

    2008-04-01

    Full Text Available accumulation feature of Dynamic Source Routing (DSR) by adding the accumulated route, back to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left... than the inbound traffic as the routing algorithm makes a decision to rebroadcast the packet or not and Figure 20 confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further...

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

    Science.gov (United States)

    2014-01-01

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

  4. 77 FR 54805 - Revocation of Jet Route J-528; WA

    Science.gov (United States)

    2012-09-06

    ...-0749; Airspace Docket No. 11-ANM-29] RIN 2120-AA66 Revocation of Jet Route J-528; WA AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule. SUMMARY: This action removes Jet Route J-528... 20591; telephone: (202) 267-8783. SUPPLEMENTARY INFORMATION: Background Jet Route J-528 is currently...

  5. On the Core of Routing Games with Revenues

    NARCIS (Netherlands)

    A. Estévez-Fernandéz (Arantza); P. Borm; M. Meertens; H. Reijnierse

    2006-01-01

    htmlabstract Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours

  6. On the Core of Routing Games with Revenues

    NARCIS (Netherlands)

    Estevez Fernandez, M.A.; Borm, P.E.M.; Meertens, M.; Reijnierse, J.H.

    2006-01-01

    Traveling salesman problems with revenues form a generalization of traveling salesman problems.Here, next to travel costs an explicit revenue is generated by visiting a city.We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along

  7. Generalized routing protocols for multihop relay networks

    KAUST Repository

    Khan, Fahd Ahmed

    2011-07-01

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

  8. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2011-01-01

    that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. To achieve this result, we reduce k-LocVRP to the following generalization of k median, which might be of independent interest. Given a metric (V, d), bound k...... median forest, which leads to a (12+E)-approximation algorithm for k-LocVRP, for any constant E > 0. The algorithm for k median forest is t-swap local search, and we prove that it has locality gap 3 + 2 t ; this generalizes the corresponding result for k median [3]. Finally we consider the k median......We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so...

  9. Energy Efficient MANET Routing Using a Combination of Span and BECA/AFECA

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2008-01-01

    This paper presents some novel approaches for energy efficient routing in mobile ad-hoc networks. Two known energy preserving techniques, Span and BECA/AFECA, are combined with a well-known re-active routing protocol, AODV, to create a new energy efficient routing protocol. Furthermore, the proto......This paper presents some novel approaches for energy efficient routing in mobile ad-hoc networks. Two known energy preserving techniques, Span and BECA/AFECA, are combined with a well-known re-active routing protocol, AODV, to create a new energy efficient routing protocol. Furthermore...

  10. Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

    NARCIS (Netherlands)

    Bräysy, Olli; Dullaert, Wout; Gendreau, Michel

    2004-01-01

    This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way

  11. Congestion transition in air traffic networks.

    Directory of Open Access Journals (Sweden)

    Bernardo Monechi

    Full Text Available Air Transportation represents a very interesting example of a complex techno-social system whose importance has considerably grown in time and whose management requires a careful understanding of the subtle interplay between technological infrastructure and human behavior. Despite the competition with other transportation systems, a growth of air traffic is still foreseen in Europe for the next years. The increase of traffic load could bring the current Air Traffic Network above its capacity limits so that safety standards and performances might not be guaranteed anymore. Lacking the possibility of a direct investigation of this scenario, we resort to computer simulations in order to quantify the disruptive potential of an increase in traffic load. To this end we model the Air Transportation system as a complex dynamical network of flights controlled by humans who have to solve potentially dangerous conflicts by redirecting aircraft trajectories. The model is driven and validated through historical data of flight schedules in a European national airspace. While correctly reproducing actual statistics of the Air Transportation system, e.g., the distribution of delays, the model allows for theoretical predictions. Upon an increase of the traffic load injected in the system, the model predicts a transition from a phase in which all conflicts can be successfully resolved, to a phase in which many conflicts cannot be resolved anymore. We highlight how the current flight density of the Air Transportation system is well below the transition, provided that controllers make use of a special re-routing procedure. While the congestion transition displays a universal scaling behavior, its threshold depends on the conflict solving strategy adopted. Finally, the generality of the modeling scheme introduced makes it a flexible general tool to simulate and control Air Transportation systems in realistic and synthetic scenarios.

  12. Congestion transition in air traffic networks.

    Science.gov (United States)

    Monechi, Bernardo; Servedio, Vito D P; Loreto, Vittorio

    2015-01-01

    Air Transportation represents a very interesting example of a complex techno-social system whose importance has considerably grown in time and whose management requires a careful understanding of the subtle interplay between technological infrastructure and human behavior. Despite the competition with other transportation systems, a growth of air traffic is still foreseen in Europe for the next years. The increase of traffic load could bring the current Air Traffic Network above its capacity limits so that safety standards and performances might not be guaranteed anymore. Lacking the possibility of a direct investigation of this scenario, we resort to computer simulations in order to quantify the disruptive potential of an increase in traffic load. To this end we model the Air Transportation system as a complex dynamical network of flights controlled by humans who have to solve potentially dangerous conflicts by redirecting aircraft trajectories. The model is driven and validated through historical data of flight schedules in a European national airspace. While correctly reproducing actual statistics of the Air Transportation system, e.g., the distribution of delays, the model allows for theoretical predictions. Upon an increase of the traffic load injected in the system, the model predicts a transition from a phase in which all conflicts can be successfully resolved, to a phase in which many conflicts cannot be resolved anymore. We highlight how the current flight density of the Air Transportation system is well below the transition, provided that controllers make use of a special re-routing procedure. While the congestion transition displays a universal scaling behavior, its threshold depends on the conflict solving strategy adopted. Finally, the generality of the modeling scheme introduced makes it a flexible general tool to simulate and control Air Transportation systems in realistic and synthetic scenarios.

  13. On the core of routing games with revenues

    NARCIS (Netherlands)

    Estevez Fernandez, M.A.; Borm, P.; Meertens, M.; Reijnierse, H.

    2009-01-01

    Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along subgroups.

  14. k-Shortest routing of trains on shunting yards

    NARCIS (Netherlands)

    Riezebos, Jan; van Wezel, Wout

    2009-01-01

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

  15. Reverse stream flow routing by using Muskingum models

    Indian Academy of Sciences (India)

    Reverse stream flow routing is a procedure that determines the upstream hydrograph given the downstream hydrograph. This paper presents the development of methodology for Muskingum models parameter estimation for reverse stream flow routing. The standard application of the Muskingum models involves calibration ...

  16. Tourism Routes, Local Economic Promotion and Pro-Poor ...

    African Journals Online (AJOL)

    In southern Africa, there is growing interest in the potential for establishing tourism routes as vehicles for tourism expansion and the promotion of local economic development. This article contributes towards understanding the potential and importance of organising routes for local tourism promotion and economic ...

  17. Efficient Routing in Wireless Sensor Networks with Multiple Sessions

    OpenAIRE

    Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

    2014-01-01

    Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

  18. Applied Multiprotocol Routing in IP Telephony

    Directory of Open Access Journals (Sweden)

    Miroslav Voznak

    2010-01-01

    Full Text Available The aim of the project was to create a multi-protocol system using SIP, H.323 and MGCP standards, which would ensure routing to various types of VoIP networks. The priority was to provide multi-protocol support to SIP and H.323 signalling and the support of the routing using the ENUM standard which has recently passed from the trial phase into full operation in the Czech Republic. The document describes the system's architecture and the components used. It also briefly describes ENUM.

  19. The influence of advertisements on the conspicuity of routing information.

    Science.gov (United States)

    Boersema, T; Zwaga, H J

    1985-12-01

    An experiment is described in which the influence of advertisements on the conspicuity of routing information was investigated. Stimulus material consisted of colour slides of 12 railway station scenes. In two of these scenes, number and size of advertisements were systematically varied. Subjects were instructed to locate routing signs in the scenes. Performance on the location task was used as a measure of the routing sign conspicuity. The results show that inserting an advertisement lessens the conspicuity of the routing information. This effect becomes stronger if more or larger advertisements are added.

  20. Laser-induced plasmas in air studied using two-color interferometry

    International Nuclear Information System (INIS)

    Yang, Zefeng; Wu, Jian; Li, Xingwen; Han, Jiaxun; Jia, Shenli; Qiu, Aici; Wei, Wenfu

    2016-01-01

    Temporally and spatially resolved density profiles of Cu atoms, electrons, and compressed air, from laser-induced copper plasmas in air, are measured using fast spectral imaging and two-color interferometry. From the intensified CCD images filtered by a narrow-band-pass filter centered at 515.32 nm, the Cu atoms expansion route is estimated and used to determine the position of the fracture surface between the Cu atoms and the air. Results indicate that the Cu atoms density at distances closer to the target (0–0.4 mm) is quite low, with the maximum density appearing at the edge of the plasma's core being ∼4.6 × 10"2"4" m"−"3 at 304 ns. The free electrons are mainly located in the internal region of the plume, which is supposed to have a higher temperature. The density of the shock wave is (4–6) × 10"2"5" m"−"3, corresponding to air compression of a factor of 1.7–2.5.

  1. Laser-induced plasmas in air studied using two-color interferometry

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Zefeng; Wu, Jian, E-mail: jxjawj@mail.xjtu.edu.cn; Li, Xingwen; Han, Jiaxun; Jia, Shenli; Qiu, Aici [State Key Laboratory of Electrical Insulation and Power Equipment, Xi' an Jiaotong University, Shaanxi 710049 (China); Wei, Wenfu [School of Electrical Engineering, Southwest Jiaotong University, Chengdu 610031 (China)

    2016-08-15

    Temporally and spatially resolved density profiles of Cu atoms, electrons, and compressed air, from laser-induced copper plasmas in air, are measured using fast spectral imaging and two-color interferometry. From the intensified CCD images filtered by a narrow-band-pass filter centered at 515.32 nm, the Cu atoms expansion route is estimated and used to determine the position of the fracture surface between the Cu atoms and the air. Results indicate that the Cu atoms density at distances closer to the target (0–0.4 mm) is quite low, with the maximum density appearing at the edge of the plasma's core being ∼4.6 × 10{sup 24 }m{sup −3} at 304 ns. The free electrons are mainly located in the internal region of the plume, which is supposed to have a higher temperature. The density of the shock wave is (4–6) × 10{sup 25 }m{sup −3}, corresponding to air compression of a factor of 1.7–2.5.

  2. Comparison of MANET Routing Protocols in Different Traffic and Mobility Models

    Directory of Open Access Journals (Sweden)

    J. Baraković

    2010-06-01

    Full Text Available Routing protocol election in MANET (Mobile Ad Hoc Network is a great challenge, because of its frequent topology changes and routing overhead. This paper compares performances of three routing protocols: Destination Sequenced Distance Vector (DSDV, Ad Hoc Ondemand Distance Vector (AODV and Dynamic Source Routing (DSR, based on results analysis obtained using simulations with different load and mobility scenarios performed with Network Simulator version 2 (NS-2. In low load and low mobility scenarios routing protocols perform in a similar manner. However, with mobility and load increasing DSR outperforms AODV and DSDV protocols.

  3. Alternative route to metal halide free ionic liquids

    International Nuclear Information System (INIS)

    Takao, Koichiro; Ikeda, Yasuhisa

    2008-01-01

    An alternative synthetic route to metal halide free ionic liquids using trialkyloxonium salt is proposed. Utility of this synthetic route has been demonstrated by preparing 1-ethyl-3-methylimidazolium tetrafluoroborate ionic liquid through the reaction between 1-methylimidazole and triethyloxonium tetra-fluoroborate in anhydrous ether. (author)

  4. Adaptive Probabilistic Routing in Wireless Ad Hoc Networks

    OpenAIRE

    Hasan, Affaf; Liaqat, Ismail

    2013-01-01

    The goal of this thesis work is to analyze how design elements and wireless attributes affect opportunistic routing, and in this context develop a new protocol. The algorithm developed aims to improve opportunistic elements in comparison to a well-known opportunistic protocol Simple Opportunistic Adaptive Routing (SOAR).

  5. Assessing green waste route by using Network Analysis

    Science.gov (United States)

    Hasmantika, I. H.; Maryono, M.

    2018-02-01

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

  6. Routing Protocol for Mobile Ad-hoc Wireless Networks

    Directory of Open Access Journals (Sweden)

    I. M. B. Nogales

    2007-09-01

    Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

  7. I/O routing in a multidimensional torus network

    Science.gov (United States)

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

    2018-04-24

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

  8. On the Capacity of Hybrid Wireless Networks with Opportunistic Routing

    Directory of Open Access Journals (Sweden)

    Le Tan

    2010-01-01

    Full Text Available This paper studies the capacity of hybrid wireless networks with opportunistic routing (OR. We first extend the opportunistic routing algorithm to exploit high-speed data transmissions in infrastructure network through base stations. We then develop linear programming models to calculate the end-to-end throughput bounds from multiple source nodes to single as well as multiple destination nodes. The developed models are applied to study several hybrid wireless network examples. Through case studies, we investigate several factors that have significant impacts on the hybrid wireless network capacity under opportunistic routing, such as node transmission range, density and distribution pattern of base stations (BTs, and number of wireless channels on wireless nodes and base stations. Our numerical results demonstrate that opportunistic routing could achieve much higher throughput on both ad hoc and hybrid networks than traditional unicast routing (UR. Moreover, opportunistic routing can efficiently utilize base stations and achieve significantly higher throughput gains in hybrid wireless networks than in pure ad hoc networks especially with multiple-channel base stations.

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

    Science.gov (United States)

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

    2005-03-01

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

  10. Comparison of actual and predicted routes used in the shipment of radioactive materials

    International Nuclear Information System (INIS)

    Joy, D.S.; Johnson, P.E.; Harrison, I.G.

    1985-01-01

    A number of highway controlled shipments of radioactive materials have been made over the past several years. An excellent example showing the variability of actual routes is the transfer of 45 shipments between the Three Mile Island reactor in Pennsylvania and Scoville, Idaho in 1982 and 1983. Six different routes varying between 2273 and 2483 miles were used. Approximately 75% of these shipments followed a common route which passed through ten Urbanized Areas, defined by the Census Bureau as having a population exceeding 100,000 people. Other routes, while shorter in distance, passed through as many as 14 Urbanized Areas. Routes predicted by the Oak Ridge routing model did not exactly duplicate actual routes used. However, the analysis shows that the routing model does make a good estimate of transportation routes actually chosen by shippers of radioactive materials. In actual practice, a number of factors (weather, road conditions, driver preference, etc.) influence the actual route taken. 5 refs., 1 fig., 1 tab

  11. En Route Descent Advisor Multi-Sector Planning Using Active and Provisional Controller Plans

    Science.gov (United States)

    Vivona, Robert; Green, Steven

    2003-01-01

    As decision support tools are developed to support controllers in complex air traffic control environments, new approaches to maintaining situation awareness and managing traffic planning must be developed to handle the ever-increasing amounts of alerting and advisory data. Within high-density metering and other environments where flight path changes are the rule, not the exception, and where interactions between these changes are required, current trial planning approaches are limited by potential increases in workload. The Enroute Descent Advisor (EDA) is a set of decision support tool capabilities for managing high-density en route traffic subject to metering restrictions. The EDA system s novel approach builds aircraft plans from combinations of user intent data and builds controller plans from combinations of aircraft plans to effectively maintain situation awareness during traffic planning. By maintaining both active (current) and provisional (proposed) controller plans, EDA supports controllers in coordinated traffic planning both within and between sectors. Ultimately, EDA s multi-sector planning approach will facilitate a transition from current sector-oriented operations to a new trajectory-oriented paradigm, enabling new levels of efficiency and collaboration in air traffic control.

  12. PROPOSAL OF ALGORITHM FOR ROUTE OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Robert Ramon de Carvalho Sousa

    2016-06-01

    Full Text Available This article uses “Six Sigma” methodology for the elaboration of an algorithm for routing problems which is able to obtain more efficient results than those from Clarke and Wright´s (CW algorithm (1964 in situations of random increase of product delivery demands, facing the incapability of service level increase . In some situations, the algorithm proposed obtained more efficient results than the CW algorithm. The key factor was a reduction in the number of mistakes (one way routes and in the level of result variation.

  13. Eco-sustainable routing in optical networks

    DEFF Research Database (Denmark)

    Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

    2013-01-01

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

  14. Multi-objective evacuation routing optimization for toxic cloud releases

    International Nuclear Information System (INIS)

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

    2017-01-01

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

  15. 75 FR 66344 - Amendment of Jet Route J-93; CA

    Science.gov (United States)

    2010-10-28

    ...-1022; Airspace Docket No. 10-AWP-4] RIN 2120-AA66 Amendment of Jet Route J-93; CA AGENCY: Federal... proposes to amend Jet Route J-93 in California between the Julian VHF Omnidirectional Radio Range Tactical... is necessary to realign Jet Route J-93 with the revised location of the Penasco VOR. The Proposal The...

  16. A Distributed Simulation Facility to Support Human Factors Research in Advanced Air Transportation Technology

    Science.gov (United States)

    Amonlirdviman, Keith; Farley, Todd C.; Hansman, R. John, Jr.; Ladik, John F.; Sherer, Dana Z.

    1998-01-01

    A distributed real-time simulation of the civil air traffic environment developed to support human factors research in advanced air transportation technology is presented. The distributed environment is based on a custom simulation architecture designed for simplicity and flexibility in human experiments. Standard Internet protocols are used to create the distributed environment, linking all advanced cockpit simulator, all Air Traffic Control simulator, and a pseudo-aircraft control and simulation management station. The pseudo-aircraft control station also functions as a scenario design tool for coordinating human factors experiments. This station incorporates a pseudo-pilot interface designed to reduce workload for human operators piloting multiple aircraft simultaneously in real time. The application of this distributed simulation facility to support a study of the effect of shared information (via air-ground datalink) on pilot/controller shared situation awareness and re-route negotiation is also presented.

  17. The extended TRIP supporting VoIP routing reservation with distributed QoS

    Science.gov (United States)

    Wang, Furong; Wu, Ye

    2004-04-01

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

  18. Synthesis of graphene platelets by chemical and electrochemical route

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-10-15

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

  19. Synthesis of graphene platelets by chemical and electrochemical route

    International Nuclear Information System (INIS)

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

    2013-01-01

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

  20. Closure of the Route de Meyrin as of 11 February 2008

    CERN Multimedia

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: - Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d'Avril and the Route du Mandement, - Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d'Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. The map is available at the following link. Relations with the Host States Service Tel. 72848

  1. Closure of the Route de Meyrin as of 11 February 2008

    CERN Multimedia

    DSU Department

    2008-01-01

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d’Avril and the Route du Mandement, Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d’Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. Full details of the project (in French) can be consulted on the following website: http://w...

  2. One Kind of Routing Algorithm Modified in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Wei Ni Ni

    2016-01-01

    Full Text Available The wireless sensor networks are the emerging next generation sensor networks, Routing technology is the wireless sensor network communication layer of the core technology. To build reliable paths in wireless sensor networks, we can consider two ways: providing multiple paths utilizing the redundancy to assure the communication reliability or constructing transmission reliability mechanism to assure the reliability of every hop. Braid multipath algorithm and ReInforM routing algorithm are the realizations of these two mechanisms. After the analysis of these two algorithms, this paper proposes a ReInforM routing algorithm based braid multipath routing algorithm.

  3. Influence of queue propagation and dissipation on route travel times

    DEFF Research Database (Denmark)

    Raovic, Nevena

    into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

  4. Degradation of phosphorene in air: understanding at atomic level

    International Nuclear Information System (INIS)

    Wang, Gaoxue; Slough, William J; Pandey, Ravindra; Karna, Shashi P

    2016-01-01

    Phosphorene is a promising two-dimensional (2D) material with a direct band gap, high carrier mobility, and anisotropic electronic properties. Phosphorene-based electronic devices, however, are found to degrade upon exposure to air. In this paper, we provide an atomic level understanding of the stability of phosphorene in terms of its interaction with O 2 and H 2 O. The results based on density functional theory together with first principles molecular dynamics calculations show that O 2 could the spontaneously dissociate on phosphorene at room temperature. H 2 O will not strongly interact with pristine phosphorene, however, an exothermic reaction could occur if phosphorene is first oxidized. The pathway of oxidation first, followed by exothermic reaction with water is the most likely route for the chemical degradation of phosphorene-based devices in air. (paper)

  5. School buses, air pollution and children's health: follow-up report

    International Nuclear Information System (INIS)

    Perrotta, K.

    2010-10-01

    This document is designed to be a follow-up report to the Ontario Public Health Association (OPHA) school bus report published in 2005, and was produced through a collaboration between the Clean Air Partnership and the OPHA. The level of awareness of school bus emissions are evaluated in this report. The document also provides a review of projects handled by the federal government, programs developed by governments of other provinces and the policies followed by school boards in other provinces, to mitigate emissions and exposures related to school buses. Several recommendations were made, including the replacement of older school buses, adapt the routes considering the emissions generated and promote the use of biodiesel to reduce emissions of air pollutants and greenhouse gases. 36 refs, 8 tabs.

  6. PARTICULATE MATTER IN ATMOSPHERIC AIR IN URBAN AGGLOMERATION

    Directory of Open Access Journals (Sweden)

    Halina Marczak

    2017-05-01

    Full Text Available The study aimed to determine the mass concentration of PM10 in the air in urban area. The specific objective of the research was to analyze and assess the impact of transport road emissions on the level of concentration of particulate matter in the atmosphere in the Lublin agglomeration. The measuring points were located in places at different distances from the communications emission sources and, at the same time, possibly varying degrees of air pollution dust. Measuring the concentration of dust at the measuring points was performed using an indirect method using a laser photometer. In the research point which was not under direct influence of a heavy traffic road dust levels lower by 10.5% to 65.4% than in the vicinity of the transport route were reported. Small particle air pollution at all the points covered by the study increased significantly during the heating season. Based on the comparison of the obtained values of PM10 concentrations with legal standards, it was found that the air pollution exceeded the limits in all measurement points only during a series of measurements in the months of November-December. The recorded increase in air pollution during the heating season should be associated with an increased dust emissions in this period from the "low" emitters - local house boilers and detached houses.

  7. Routing Unmanned Vehicles in GPS-Denied Environments

    OpenAIRE

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

    2017-01-01

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

  8. Radon exposure in selected underground touring routes in Poland

    International Nuclear Information System (INIS)

    Olszewski, J.; Chruscielewski, W.; Jankowski, J.

    2006-01-01

    The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h -1 , while atmospheric radon concentration is 4.4 Bq m -3 [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

  9. Radon exposure in selected underground touring routes in Poland

    Energy Technology Data Exchange (ETDEWEB)

    Olszewski, J.; Chruscielewski, W.; Jankowski, J. [Nofer Institute of Occupational Medicine, Dept. of Radiation Protection, Lodz (Poland)

    2006-07-01

    The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h{sup -1}, while atmospheric radon concentration is 4.4 Bq m{sup -3} [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

  10. Improved routing strategies for data traffic in scale-free networks

    International Nuclear Information System (INIS)

    Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

    2008-01-01

    We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

  11. Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

    Science.gov (United States)

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

    2018-01-01

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

  12. DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

    OpenAIRE

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

    2018-01-01

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

  13. Short-term memory, executive control, and children's route learning

    OpenAIRE

    Purser, H. R.; Farran, E. K.; Courbois, Y.; Lemahieu, A.; Mellier, D.; Sockeel, P.; Blades, M.

    2012-01-01

    The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and visuospatial long-term memory; the route-learning task was conducted using a maze in a virtual environment. In contrast to previous research, correlation...

  14. Sternal Route More Effective than Tibial Route for Intraosseous Amiodarone Administration in a Swine Model of Ventricular Fibrillation.

    Science.gov (United States)

    Burgert, James M; Martinez, Andre; O'Sullivan, Mara; Blouin, Dawn; Long, Audrey; Johnson, Arthur D

    2018-01-01

    The pharmacokinetics of IO administered lipid soluble amiodarone during ventricular fibrillation (VF) with ongoing CPR are unknown. This study measured mean plasma concentration over 5 minutes, maximum plasma concentration (Cmax), and time to maximum concentration (Tmax) of amiodarone administered by the sternal IO (SIO), tibial IO (TIO), and IV routes in a swine model of VF with ongoing CPR. Twenty-one Yorkshire-cross swine were randomly assigned to three groups: SIO, TIO, and IV. Ventricular fibrillation was induced under general anesthesia. After 4 minutes in VF, 300 mg amiodarone was administered as indicated by group assignment. Serial blood specimens collected at 30, 60, 90, 120, 150, 180, 240, and 300 seconds were analyzed using high performance liquid chromatography with tandem mass spectrometry. The mean plasma concentration of IV amiodarone over 5 minutes was significantly higher than the TIO group at 60 seconds (P = 0.02) and 90 seconds (P = 0.017) post-injection. No significant differences in Cmax between the groups were found (P <0.05). The Tmax of amiodarone was significantly shorter in the SIO (99 secs) and IV (86 secs) groups compared to the TIO group (215 secs); P = 0.002 and P = 0.002, respectively. The SIO and IV routes of amiodarone administration were comparable. The TIO group took nearly three times longer to reach Tmax than the SIO and IV groups, likely indicating depot of lipid-soluble amiodarone in adipose-rich tibial yellow bone marrow. The SIO route was more effective than the TIO route for amiodarone delivery in a swine model of VF with ongoing CPR. Further investigations are necessary to determine if the kinetic differences found between the SIO and TIO routes in this study affect survival of VF in humans.

  15. Routing protocol extension for resilient GMPLS multi-domain networks

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  16. Predicting Catastrophic BGP Routing Instabilities

    National Research Council Canada - National Science Library

    Nguyen, Lien

    2004-01-01

    .... Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 RF01771. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness...

  17. Performance analysis of routing protocols for IoT

    Science.gov (United States)

    Manda, Sridhar; Nalini, N.

    2018-04-01

    Internet of Things (IoT) is an arrangement of advancements that are between disciplinary. It is utilized to have compelling combination of both physical and computerized things. With IoT physical things can have personal virtual identities and participate in distributed computing. Realization of IoT needs the usage of sensors based on the sector for which IoT is integrated. For instance, in healthcare domain, IoT needs to have integration with wearable sensors used by patients. As sensor devices produce huge amount of data, often called big data, there should be efficient routing protocols in place. To the extent remote systems is worried there are some current protocols, for example, OLSR, DSR and AODV. It additionally tosses light into Trust based routing protocol for low-power and lossy systems (TRPL) for IoT. These are broadly utilized remote directing protocols. As IoT is developing round the corner, it is basic to investigate routing protocols that and evaluate their execution regarding throughput, end to end delay, and directing overhead. The execution experiences can help in settling on very much educated choices while incorporating remote systems with IoT. In this paper, we analyzed different routing protocols and their performance is compared. It is found that AODV showed better performance than other routing protocols aforementioned.

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

    Directory of Open Access Journals (Sweden)

    Ahmad Maleki

    2014-09-01

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

  19. CulRoute: Gamified WebGIS3D platform for selection of touristic routes

    Directory of Open Access Journals (Sweden)

    E.P.L. Baptista

    2015-11-01

    Full Text Available The importance of tourist information disclosure on digital platforms is, nowadays, reinforced by public entities such as Turismo de Portugal and Turismo do Algarve. The incorporation of strategies to encourage greater interest and involvement of the users are likely to contribute to a more effective dissemination of tourist destinations and their historical and cultural heritage. This paper presents the concepts, strategies and technologies in the design and implementation of the gamified WebGIS3D platform named CulRoute. This platform enables the users to visualize and navigate the three-dimensional virtual models of monuments and to explore the 'treasures' of each monument in a gaming environment, as well as to test their knowledge by answering optional quizzes. From the list of visited monuments and other information available on the platform, the user can create customized routes, save them into files or print as maps for later use.

  20. Neighboring and Connectivity-Aware Routing in VANETs

    Directory of Open Access Journals (Sweden)

    Huma Ghafoor

    2014-01-01

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

  1. Methods for air cleaning and protection of building occupants from airborne pathogens

    Energy Technology Data Exchange (ETDEWEB)

    Bolashikov, Z.D.; Melikov, A.K. [International Centre for Indoor Environment and Energy, Department of Civil Engineering, Technical University of Denmark, Nils Koppels Alle, building 402, 2800 Lyngby (Denmark)

    2009-07-15

    This article aims to draw the attention of the scientific community towards the elevated risks of airborne transmission of diseases and the associated risks of epidemics or pandemics. The complexity of the problem and the need for multidisciplinary research is highlighted. The airborne route of transmission, i.e. the generation of pathogen laden droplets originating in the respiratory tract of an infected individual, the survivability of the pathogens, their dispersal indoors and their transfer to a healthy person are reviewed. The advantages and the drawbacks of air dilution, filtration, ultraviolet germicidal irradiation (UVGI), photocatalytic oxidation (PCO), plasmacluster ions and other technologies for air disinfection and purification from pathogens are analyzed with respect to currently used air distribution principles. The importance of indoor air characteristics, such as temperature, relative humidity and velocity for the efficiency of each method is analyzed, taking into consideration the nature of the pathogens themselves. The applicability of the cleaning methods to the different types of total volume air distribution used at present indoors, i.e. mixing, displacement and underfloor ventilation, as well as advanced air distribution techniques (such as personalized ventilation) is discussed. (author)

  2. Next Generation Network Routing and Control Plane

    DEFF Research Database (Denmark)

    Fu, Rong

    proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...... lacks the ability to cooperate between different domains and operators. The emergence of label switching transport technology such as of Multi-Protocol Label Switching (MPLS) or Generalized MPLS (GMPLS) supports the traffic transport in a finer granularity and more dedicated end-to-end Quality...... (RACF) provides the platform that enables cooperation and ubiquitous integration between networks. In this paper, we investigate in the network architecture, protocols and algorithms for inter-domain QoS routing and traffic engineering. The PCE based inter-domain routing architecture is enhanced...

  3. Potential Valuation of Route Prague – Trutnov after D11 Completion

    Directory of Open Access Journals (Sweden)

    Hašek Jakub

    2017-11-01

    Full Text Available In the Czech Republic, there are many regions with unbalanced competition between bus and rail transport on main transport routes. This is due to differences in the quality of transport infrastructure, the attractiveness of the region, routing traffic routes or economic attractiveness for new investors and industry. The aim of this article is to evaluate the potential for bus operators on the route from Prague to Trutnov after completion of D11 highway project.

  4. Metro passengers’ route choice model and its application considering perceived transfer threshold

    Science.gov (United States)

    Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

    2017-01-01

    With the rapid development of the Metro network in China, the greatly increased route alternatives make passengers’ route choice behavior and passenger flow assignment more complicated, which presents challenges to the operation management. In this paper, a path sized logit model is adopted to analyze passengers’ route choice preferences considering such parameters as in-vehicle time, number of transfers, and transfer time. Moreover, the “perceived transfer threshold” is defined and included in the utility function to reflect the penalty difference caused by transfer time on passengers’ perceived utility under various numbers of transfers. Next, based on the revealed preference data collected in the Guangzhou Metro, the proposed model is calibrated. The appropriate perceived transfer threshold value and the route choice preferences are analyzed. Finally, the model is applied to a personalized route planning case to demonstrate the engineering practicability of route choice behavior analysis. The results show that the introduction of the perceived transfer threshold is helpful to improve the model’s explanatory abilities. In addition, personalized route planning based on route choice preferences can meet passengers’ diversified travel demands. PMID:28957376

  5. Main routes for the thermo-conversion of biomass into fuels and chemicals. Part 1: Pyrolysis systems

    International Nuclear Information System (INIS)

    Balat, Mustafa; Balat, Mehmet; Kirtay, Elif; Balat, Havva

    2009-01-01

    Since the energy crises of the 1970s, many countries have become interest in biomass as a fuel source to expand the development of domestic and renewable energy sources and reduce the environmental impacts of energy production. Biomass is used to meet a variety of energy needs, including generating electricity, heating homes, fueling vehicles and providing process heat for industrial facilities. The methods available for energy production from biomass can be divided into two main categories: thermo-chemical and biological conversion routes. There are several thermo-chemical routes for biomass-based energy production, such as direct combustion, liquefaction, pyrolysis, supercritical water extraction, gasification, air-steam gasification and so on. The pyrolysis is thermal degradation of biomass by heat in the absence of oxygen, which results in the production of charcoal (solid), bio-oil (liquid), and fuel gas products. Pyrolysis liquid is referred to in the literature by terms such as pyrolysis oil, bio-oil, bio-crude oil, bio-fuel oil, wood liquid, wood oil, liquid smoke, wood distillates, pyroligneous tar, and pyroligneous acid. Bio-oil can be used as a fuel in boilers, diesel engines or gas turbines for heat and electricity generation.

  6. Efficient Networks Communication Routing Using Swarm Intelligence

    OpenAIRE

    Koushal Kumar

    2012-01-01

    As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

  7. Nature-Inspired and Energy Efficient Route Planning

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  8. Learning Points and Routes to Recommend Trajectories

    OpenAIRE

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

    2016-01-01

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

  9. High throughput route selection in multi-rate wireless mesh networks

    Institute of Scientific and Technical Information of China (English)

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

    2008-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Zahariadis Theodore

    2016-01-01

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

  11. An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

    Directory of Open Access Journals (Sweden)

    Ji Ung Sun

    2015-01-01

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

  12. HIGHWAY, a transportation routing model: program description and revised users' manual

    International Nuclear Information System (INIS)

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

    1983-10-01

    A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire Interstate System, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of Interstate highways or routes that will bypass urbanized areas containing populations greater than 100,000 persons. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

  13. Southern routes for high-level radioactive waste: Agencies, contacts, and designations

    International Nuclear Information System (INIS)

    1991-05-01

    The Southern Routes for High-Level Radioactive Waste: Agencies, Contacts and Designations is a compendium of sixteen southern states' routing programs for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed. This report also examines alternative route designations made by southern states and the lessons that were learned from the designation process

  14. Air crew monitoring in Germany

    International Nuclear Information System (INIS)

    Stegemann, R.; Frasch, G.; Kammerer, L.

    2006-01-01

    Cosmic radiation at high altitudes, especially high energetic neutrons, significantly increases exposure to man. Pilots and flight attendants may receive annual effective doses comparable to doses received in occupations, in which ionising radiation is used or radioactive sources are handled. For this reason, the European Council Directive 96/29 EURATOM requires that air-crew members also be monitored for radiation protection. Flight personnel, receiving an effective dose from cosmic radiation of more than 1 mSv per year are subject to monitoring i.e. radiation exposure has to be assessed, limited and minimized. As the physical conditions causing cosmic radiation doses are well established, it is possible to calculate the expected radiation dose with sufficient accuracy. Several codes for this purpose are available. Since August 2003, the operators of airlines in Germany are obliged to assess the doses of their air crew personnel from cosmic radiation exposure and to minimise radiation exposure by means of appropriate work schedules, flight routes and flight profiles. Approx. 31 000 persons of 45 airlines are monitored by the German Radiation Protection Register. Gender, age and 3 different occupational categories are used to characterise different groups and their doses. The presentation will give an overview about the legislation and organisation of air crew monitoring in Germany and will show detailed statistical results from the first year of monitoring. (authors)

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

    Science.gov (United States)

    Wang, Yufei; Liu, Feng

    2016-04-01

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

  16. Putting emotions in routes: the influence of emotionally laden landmarks on spatial memory.

    Science.gov (United States)

    Ruotolo, F; Claessen, M H G; van der Ham, I J M

    2018-04-16

    The aim of this study was to assess how people memorize spatial information of emotionally laden landmarks along a route and if the emotional value of the landmarks affects the way metric and configurational properties of the route itself are represented. Three groups of participants were asked to watch a movie of a virtual walk along a route. The route could contain positive, negative, or neutral landmarks. Afterwards, participants were asked to: (a) recognize the landmarks; (b) imagine to walk distances between landmarks; (c) indicate the position of the landmarks along the route; (d) judge the length of the route; (e) draw the route. Results showed that participants who watched the route with positive landmarks were more accurate in locating the landmarks along the route and drawing the route. On the other hand, participants in the negative condition judged the route as longer than participants in the other two conditions and were less accurate in mentally reproducing distances between landmarks. The data will be interpreted in the light of the "feelings-as-information theory" by Schwarz (2010) and the most recent evidence about the effect of emotions on spatial memory. In brief, the evidence collected in this study supports the idea that spatial cognition emerges from the interaction between an organism and contextual characteristics.

  17. Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles

    National Research Council Canada - National Science Library

    Sonmezocak, Erkan; Kurt, Senol

    2008-01-01

    .... The route planning of UAVs is the most critical and challenging problem of wartime. This thesis will develop three algorithms to solve a model that produces executable routings in order to dispatch three Unmanned Aerial Vehicles (UAV...

  18. Air travel market in Serbia: New carriers: New types of passengers

    Directory of Open Access Journals (Sweden)

    Kuljanin Jovana G.

    2015-01-01

    Full Text Available This paper considers characteristics of passengers on routes where there is a competition between low cost carriers and traditional airlines. The low cost carriers entered the Serbian air travel market only after Serbia joined the European Common Aviation Area, simultaneously enabling both the development of healthy competition and significant increase in traffic at the Belgrade Airport. The newly arisen circumstances mostly affected the national flag carrier whose market power was evidently endangered by the penetration of new players in the market. Multivariate statistical techniques (discriminant analysis and canonical correlation were employed in order to analyze the data collected through a survey carried out at the Belgrade airport in 2013. Results of the analysis of passengers' attitudes at competitive routes indicate the level of market development, highlighting ticket price as a key factor affecting the selection of an airline.

  19. STIMULATION METHODS IMPROVEMENT OF EXIT ROUTE ON RAILWAY TRANSPORT

    Directory of Open Access Journals (Sweden)

    A. I. Verlan

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Huang Qiong

    2014-01-01

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

  1. A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Junwei Jin

    2016-01-01

    Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

  2. Trams and roadworks on the route de Meyrin

    CERN Multimedia

    2007-01-01

    The project to bring trams to CERN’s doorstep will require a lot of roadworks on the route de Meyrin, so traffic diversions and restrictions are to be expected. Traffic will be diverted away from the route de Meyrin as of the beginning of February 2008. Work on the future Cornavin-Meyrin-CERN tram route (TCMC) is progressing nicely. The first section up to Avanchet was inaugurated on 8 December but users will not be able to ride the tram all the way to CERN, via Meyrin Village and Cité de Meyrin, until 2010. Until then, all road users will have to be patient. To make room for the tram and to alleviate traffic flow in the centre of Meyrin Village, a 755-m long underpass will be constructed. Traffic coming from the centre of Geneva will enter the underpass at the Ecole de Golette and emerge at the Carrosserie de la Tour, having passed 15 metres below Meyrin Village centre. This "cut-and-cover" construction will entail traffic diversions via the rout...

  3. Route-Based Signal Preemption Control of Emergency Vehicle

    Directory of Open Access Journals (Sweden)

    Haibo Mu

    2018-01-01

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

  4. An Improved Differential Evolution Algorithm for Maritime Collision Avoidance Route Planning

    Directory of Open Access Journals (Sweden)

    Yu-xin Zhao

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Su Xia

    2014-05-01

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

  6. Economic Possibilities of Shipping though Northern Sea Route1

    Directory of Open Access Journals (Sweden)

    Sung-Woo Lee

    2014-12-01

    Full Text Available Global warming and climate change haves brought a new issue in the Arctic sea. Therefore, we can now explore new shipping routes through the Arctic Ocean instead of the existing commercial route. In particular, the Northern Sea Route (NSR is one of the feasible shipping routes and, has provided tremendous shipping benefits. If the NSR becomes commercialized, we will be able to save about 5,000 nautical miles in distance and sailing time. In this study, we will emphasize some of the important results on the possibility of commercializing the shipping route in the Arctic. The NSR may bring positive economic effects in terms of shipping distance and time. For example, when utilizing the NSR, the maximum cargo traffic between Asia and Europe is expected to be around 46 million TEU. However, we also need to consider an expensive passage fee that is currently imposed by Russia. In conclusion, we maintain our efforts to protect the environment in the Arctic, in terms of logistics, and we need to explore every possible avenue to bring possible economic benefits to the North Pacific countries.

  7. An Improved 6LoWPAN Hierarchical Routing Protocol

    Directory of Open Access Journals (Sweden)

    Xue Li

    2015-10-01

    Full Text Available IETF 6LoWPAN working group is engaged in the IPv6 protocol stack research work based on IEEE802.15.4 standard. In this working group, the routing protocol is one of the important research contents. In the 6LoWPAN, HiLow is a well-known layered routing protocol. This paper puts forward an improved hierarchical routing protocol GHiLow by improving HiLow parent node selection and path restoration strategy. GHiLow improves the parent node selection by increasing the choice of parameters. Simutaneously, it also improves path recovery by analysing different situations to recovery path. Therefore, GHiLow contributes to the ehancement of network performance and the decrease of network energy consumption.

  8. Nanocrystalline spinel ferrites by solid state reaction route

    Indian Academy of Sciences (India)

    Wintec

    Nanocrystalline spinel ferrites by solid state reaction route. T K KUNDU* and S MISHRA. Department of Physics, Visva-Bharati, Santiniketan 731 235, India. Abstract. Nanostructured NiFe2O4, MnFe2O4 and (NiZn)Fe2O4 were synthesized by aliovalent ion doping using conventional solid-state reaction route. With the ...

  9. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

    Full Text Available The theoretical interpretation of thematic routes helps to predict the effects on the territories visited by cultured tourists who want to enrich their cultural and emotional baggage. After the analysis of some interpretations, this paper will examine how the practical implementation of an itinerary approved by the Council of Europe has evolved over the years. And it will also reflect on the practical results in the areas involved in that project. "The Hannibal Pathway ", the main overland walk on the "Phoenician Route - Cultural Route recognized by the Council of Europe" – represents a case of study that allows to reflect over the impact of cultural tourism based on immaterial heritage. In fact, in the areas where the battle of 21 June 217 BC took place, nothing tangible is left, except the landscape that has kept its conformation intact. In these areas, thanks to the foresight of the local governments in the last three decades, the landscape of the plain has been preserved. This makes possible today to propose an historical path precisely based on the landscape and on the new techniques for the valorization of the heritage. In the Tuoro plain it is possible to see the battlefields, thus retracing the various stages of the battle, supported by the Documentation Centre of the Capra Palace and virtual reconstructions of high technical quality.

  10. DTN routing in body sensor networks with dynamic postural partitioning.

    Science.gov (United States)

    Quwaider, Muhannad; Biswas, Subir

    2010-11-01

    This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

  11. Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm

    Science.gov (United States)

    Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro

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

  12. ASR performance analysis of an experimental call routing system

    CSIR Research Space (South Africa)

    Modipa, T

    2009-11-01

    Full Text Available Call routing is an important application of Automatic Speech Recognition (ASR) technology. In this paper the authors discuss the main issues affecting the performance of a call routing system and describe the ASR component of the "Auto...

  13. Estimating Common Pedestrian Routes through Indoor Path Networks using Position Traces

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  14. Radiological mapping of Mumbai-Arakkonam rail route

    International Nuclear Information System (INIS)

    Chavan, R.V.; Patil, S.S.; Solase, S.; Saindane, S.S.; Murali, S.

    2018-01-01

    Presently usage of sources of radiation in various fields of application has increased significantly. If such radiation sources get misplaced, lost from administrative control mechanism or smuggled out, it is advisable to have the countrywide baseline data on radiological aspects. As a part of emergency preparedness programme, it had been planned to generate the radiological baseline data for various road routes and cities in India. The radiological mapping is useful for updates on the trend of the radiation level at various locations/routes. The radiation mapping of Mumbai-Arakkonam rail route was carried out by using various state of the art monitoring systems/instruments. The radiological data at every railway stations were analyzed thoroughly. The overall increase in radiation level was found mainly due to the presence of higher concentration of naturally occurring radionuclide's in the environment mainly 40 K and 232 Th

  15. Glaciers along proposed routes extending the Copper River Highway, Alaska

    Science.gov (United States)

    Glass, R.L.

    1996-01-01

    Three inland highway routes are being considered by the Alaska Department of Transportation and Public Facilities to connect the community of Cordova in southcentral Alaska to a statewide road system. The routes use part of a Copper River and Northwest Railway alignment along the Copper River through mountainous terrain having numerous glaciers. An advance of any of several glaciers could block and destroy the roadway, whereas retreating glaciers expose large quantities of unconsolidated, unvegetated, and commonly ice-rich sediments. The purpose of this study was to map historical locations of glacier termini near these routes and to describe hazards associated with glaciers and seasonal snow. Historical and recent locations of glacier termini along the proposed Copper River Highway routes were determined by reviewing reports and maps and by interpreting aerial photographs. The termini of Childs, Grinnell, Tasnuna, and Woodworth Glaciers were 1 mile or less from a proposed route in the most recently available aerial photography (1978-91); the termini of Allen, Heney, and Schwan Glaciers were 1.5 miles or less from a proposed route. In general, since 1911, most glaciers have slowly retreated, but many glaciers have had occasional advances. Deserted Glacier and one of its tributary glaciers have surge-type medial moraines, indicating potential rapid advances. The terminus of Deserted Glacier was about 2.1 miles from a proposed route in 1978, but showed no evidence of surging. Snow and rock avalanches and snowdrifts are common along the proposed routes and will periodically obstruct the roadway. Floods from ice-dammed lakes also pose a threat. For example, Van Cleve Lake, adjacent to Miles Glacier, is as large as 4.4 square miles and empties about every 6 years. Floods from drainages of Van Cleve Lake have caused the Copper River to rise on the order of 20 feet at Million Dollar Bridge.

  16. Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation

    Science.gov (United States)

    Yang, Shangwen; Guo, Baohua; Xiao, Xuefei; Gao, Haichao

    2018-01-01

    To allocate the en-routes and slots to the flights with collaborative decision making, a collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation was proposed. Evaluation indexes include flight delay costs, delay time and the number of turning points. Analytic hierarchy process is applied to determining index weights. Remark set for current two flights not yet obtained the en-route and slot in flight schedule is established. Then, fuzzy comprehensive evaluation is performed, and the en-route and slot for the current two flights are determined. Continue selecting the flight not yet obtained an en-route and a slot in flight schedule. Perform fuzzy comprehensive evaluation until all flights have obtained the en-routes and slots. MatlabR2007b was applied to numerical test based on the simulated data of a civil en-route. Test results show that, compared with the traditional strategy of first come first service, the algorithm gains better effect. The effectiveness of the algorithm was verified.

  17. Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

    Science.gov (United States)

    Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

    2015-01-01

    In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

  18. Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jeevaa Katiravan

    2015-01-01

    Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

  19. B-iTRS: A Bio-Inspired Trusted Routing Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2015-01-01

    Full Text Available In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS based on ant colony optimization (ACO and Physarum autonomic optimization (PAO. For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms.

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

    Directory of Open Access Journals (Sweden)

    Admir Barolli

    2011-01-01

    Full Text Available Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing.

  1. Enhanced DSR Routing Protocol for the Short Time Disconnected MANET

    Directory of Open Access Journals (Sweden)

    PAPAJ Ján

    2013-05-01

    Full Text Available Data delivery in Mobile Ad-Hoc network (MANET is a very difficult task due to the fact the sporadic connections between mobile nodes. For this reason, we introduce the new modified routing protocol that enables the data delivery in the case that the connections are disconnected. A key aspect of the protocol is a process of finding connections between source and destination nodes that can provide low end-to-end delay and better delivery performance in a disconnected MANET. The protocol provides the concepts of opportunistic routing of the routing packets in disconnected MANETs. In this paper we present a modification of the DSR routing protocol and also some results of a simulation.

  2. Reconstruction after esophagectomy for esophageal cancer: Retrosternal or posterior mediastinal route?

    Directory of Open Access Journals (Sweden)

    Mei-Lin Chan

    2011-11-01

    Conclusion: For patients with esophageal cancer who undergo an esophagectomy followed by gastric conduit reconstruction, the posterior mediastinal route is superior to the retrosternal route in regard to anastomotic leakage and hospital mortality. Adjuvant radiotherapy did not influence the postoperative functions of the gastric conduit used for reconstruction in either route.

  3. VT Route Log Points 2017

    Data.gov (United States)

    Vermont Center for Geographic Information — This data layer is used with VTrans' Integrated Route Log System (IRA). It is also used to calibrate the linear referencing systems, including the End-to-End and...

  4. Roots/Routes: Part II

    Science.gov (United States)

    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,…

  5. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

  6. Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Hasan A. A. Al-Rawi

    2014-01-01

    Full Text Available Cognitive radio (CR enables unlicensed users (or secondary users, SUs to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs. Reinforcement learning (RL is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs’ network performance without significantly jeopardizing PUs’ network performance, specifically SUs’ interference to PUs.

  7. A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

    Directory of Open Access Journals (Sweden)

    Xing Zhao

    2012-01-01

    Full Text Available This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

  8. Multipath routing in wireless sensor networks: survey and research challenges.

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  9. A dual-route approach to orthographic processing.

    Science.gov (United States)

    Grainger, Jonathan; Ziegler, Johannes C

    2011-01-01

    In the present theoretical note we examine how different learning constraints, thought to be involved in optimizing the mapping of print to meaning during reading acquisition, might shape the nature of the orthographic code involved in skilled reading. On the one hand, optimization is hypothesized to involve selecting combinations of letters that are the most informative with respect to word identity (diagnosticity constraint), and on the other hand to involve the detection of letter combinations that correspond to pre-existing sublexical phonological and morphological representations (chunking constraint). These two constraints give rise to two different kinds of prelexical orthographic code, a coarse-grained and a fine-grained code, associated with the two routes of a dual-route architecture. Processing along the coarse-grained route optimizes fast access to semantics by using minimal subsets of letters that maximize information with respect to word identity, while coding for approximate within-word letter position independently of letter contiguity. Processing along the fined-grained route, on the other hand, is sensitive to the precise ordering of letters, as well as to position with respect to word beginnings and endings. This enables the chunking of frequently co-occurring contiguous letter combinations that form relevant units for morpho-orthographic processing (prefixes and suffixes) and for the sublexical translation of print to sound (multi-letter graphemes).

  10. A dual-route approach to orthographic processing

    Directory of Open Access Journals (Sweden)

    Jonathan eGrainger

    2011-04-01

    Full Text Available In the present theoretical note we examine how different learning constraints, thought to be involved in optimizing the mapping of print to meaning during reading acquisition, might shape the nature of the orthographic code involved in skilled reading. On the one hand, optimization is hypothesized to involve selecting combinations of letters that are the most informative with respect to word identity (diagnosticity constraint, and on the other hand to involve the detection of letter combinations that correspond to pre-existing sublexical phonological and morphological representations (chunking constraint. These two constraints give rise to two different kinds of prelexical orthographic code, a coarse-grained and a fine-grained code, associated with the two routes of a dual-route architecture. Processing along the coarse-grained route optimizes fast access to semantics by using minimal subsets of letters that maximize information with respect to word identity, while coding for approximate within-word letter position independently of letter contiguity. Processing along the fined-grained route, on the other hand, is sensitive to the precise ordering of letters, as well as to position with respect to word beginnings and endings. This enables the chunking of frequently co-occurring contiguous letter combinations that form relevant units for morpho-orthographic processing (prefixes and suffixes and for the sublexical translation of print to sound (multi-letter graphemes.

  11. A Geographical Heuristic Routing Protocol for VANETs

    Science.gov (United States)

    Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

    2016-01-01

    Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). PMID:27669254

  12. Atlanta Rail Yard Study: Evaluation of local-scale air pollution ...

    Science.gov (United States)

    Intermodal rail yards are important nodes in the freight transportation network, where freight is organized and moved from one mode of transport to another, critical equipment is serviced, and freight is routed to its next destination. Rail yard environments are also areas with multiple sources of air pollutant emissions (e.g., heavy-duty vehicles, locomotives, cranes), which may affect local air quality in residential areas nearby. In order to understand emissions and related air quality impacts, two field studies took place over the time span of 2010-2012 to measure air pollution trends in close proximity to the Inman and Tilford rail yard complex in Atlanta, GA. One field study involved long-term stationary monitoring of black carbon, fine particles, and carbon dioxide at two stations nearby the rail yard. In addition, a second field study performed intensive mobile air monitoring for a one month period in the summer of 2012 at a roadway network surrounding the rail yard complex and measured a comprehensive array of pollutants. Real-time mobile particulate measurements included particle counts, extinction coefficient, black carbon via light-absorption and particle incandescence, and particle composition derived by aerosol mass spectrometry. Gas-phase measurements included oxides of nitrogen, sulfur dioxide, carbon dioxide, and air toxics (e.g., benzene). Both sets of measurements determined detectable local influence from rail yard-related emissions.

  13. A Sociability-Based Routing Scheme for Delay-Tolerant Networks

    Directory of Open Access Journals (Sweden)

    Fabbri Flavio

    2011-01-01

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

  14. Alternative routes for highway shipments of radioactive materials and lessons learned from state designations

    International Nuclear Information System (INIS)

    1990-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 docket numbers 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 altemative 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 DOTs Guidelines for Selecting Preferred Highway Routes for 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 to DOT of any alternative route designation before the routes are deemed effective. The purpose of this report is to discuss the ''lessons learned'' by the five states within the southern region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations

  15. Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Arafatur RAHMAN

    2009-01-01

    Full Text Available Wireless Mesh Networks (WMNs have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.. However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Dynamic MANET On-demand (DYMO routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.

  16. The influence of advertisements on the conspicuity of routing information

    OpenAIRE

    Boersema, T.; Zwaga, H.J.G.

    1985-01-01

    An experiment is described in which the influence of advertisements on the conspicuity of routing information was investigated. Stimulus material consisted of colour slides of 12 railway station scenes. In two of these scenes, number and size of advertisements were systematically varied. Subjects were instructed to locate routing signs in the scenes. Performance on the location task was used as a measure of the routing sign conspicuity. The results show that inserting an advertisement lessens...

  17. Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

    OpenAIRE

    Yan Han; Hongzhi Guan; Jiaying Duan

    2014-01-01

    The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scen...

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

    Science.gov (United States)

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

    2018-01-01

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

  19. Vehicle routing with dynamic travel times : a queueing approach

    NARCIS (Netherlands)

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

    2008-01-01

    Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic

  20. Deduction of passengers' route choices from smart card data

    NARCIS (Netherlands)

    van der Hurk, E.; Kroon, L.G.; Maroti, G.; Vervest, P.

    2015-01-01

    Deducing passengers' route choices from smart card data provides public transport operators the opportunity to evaluate and improve their passenger service. Particularly in the case of disruptions, when traditional route choice models may not be valid, this is an advantage. This paper proposes a

  1. Multicriteria vehicle routing problem solved by artificial immune system

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2015-09-01

    Full Text Available Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

  2. Optimizing investment fund allocation using vehicle routing problem framework

    Science.gov (United States)

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

    2014-07-01

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

  3. Role of route previewing strategies on climbing fluency and exploratory movements

    Science.gov (United States)

    Cordier, Romain; Orth, Dominic; Courtine, Yoan; Croft, James L.

    2017-01-01

    This study examined the role of route previewing strategies on climbing fluency and on exploratory movements of the limbs, in order to understand whether previewing helps people to perceive and to realize affordances. Eight inexperienced and ten experienced climbers previewed a 10 m high route of 5b difficulty on French scale, then climbed it with a top-rope as fluently as possible. Gaze behavior was collected from an eye tracking system during the preview and allowed us to determine the number of times they scanned the route, and which of four route previewing strategies (fragmentary, ascending, zigzagging, and sequence-of-blocks) they used. Five inertial measurement units (IMU) (3D accelerometer, 3D gyroscope, 3D magnetometer) were attached to the hip, both feet, and forearms to analyze the vertical acceleration and direction of each limb and hip during the ascent. We were able to detect movement and immobility phases of each IMU using segmentation and classification processes. Depending on whether the limbs and/or hip were moving, five states of behavior were detected: immobility, postural regulation, hold exploration, hold change, and hold traction. Using cluster analysis we identified four clusters of gaze behavior during route previewing depending on route preview duration, number of scan paths, fixations duration, ascending, zigzagging, and sequence-of-blocks strategies. The number of scan paths was positively correlated with relative duration of exploration and negatively correlated with relative duration of hold changes during the ascent. Additionally, a high relative duration of sequence-of-blocks strategy and zigzagging strategy were associated with a high relative duration of immobility during the ascent. Route previewing might help to pick up functional information about reachable, graspable, and usable holds, in order to chain movements together and to find the route. In other words, route previewing might contribute to perceiving and realizing nested

  4. Role of route previewing strategies on climbing fluency and exploratory movements.

    Directory of Open Access Journals (Sweden)

    Ludovic Seifert

    Full Text Available This study examined the role of route previewing strategies on climbing fluency and on exploratory movements of the limbs, in order to understand whether previewing helps people to perceive and to realize affordances. Eight inexperienced and ten experienced climbers previewed a 10 m high route of 5b difficulty on French scale, then climbed it with a top-rope as fluently as possible. Gaze behavior was collected from an eye tracking system during the preview and allowed us to determine the number of times they scanned the route, and which of four route previewing strategies (fragmentary, ascending, zigzagging, and sequence-of-blocks they used. Five inertial measurement units (IMU (3D accelerometer, 3D gyroscope, 3D magnetometer were attached to the hip, both feet, and forearms to analyze the vertical acceleration and direction of each limb and hip during the ascent. We were able to detect movement and immobility phases of each IMU using segmentation and classification processes. Depending on whether the limbs and/or hip were moving, five states of behavior were detected: immobility, postural regulation, hold exploration, hold change, and hold traction. Using cluster analysis we identified four clusters of gaze behavior during route previewing depending on route preview duration, number of scan paths, fixations duration, ascending, zigzagging, and sequence-of-blocks strategies. The number of scan paths was positively correlated with relative duration of exploration and negatively correlated with relative duration of hold changes during the ascent. Additionally, a high relative duration of sequence-of-blocks strategy and zigzagging strategy were associated with a high relative duration of immobility during the ascent. Route previewing might help to pick up functional information about reachable, graspable, and usable holds, in order to chain movements together and to find the route. In other words, route previewing might contribute to perceiving and

  5. The Prohibitive Link between Position-based Routing and Planarity

    Directory of Open Access Journals (Sweden)

    David Cairns

    2013-12-01

    Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

  6. Performance Evaluation of AODV Routing Protocol in VANET with NS2

    Directory of Open Access Journals (Sweden)

    Divya Rathi

    2017-03-01

    Full Text Available In intelligent transportation systems, the collaboration between vehicles and the road side units is essential to bring these systems to realization. The emerging Vehicular Ad Hoc Network (VANET is becoming more and more important as it provides intelligent transportation application, comfort, safety, entertainment for people in vehicles. In order to provide stable routes and to get good performance in VANET, there is a need of proper routing protocols must be designed. In this paper, we are working with the very well-known ad-hoc on-demand distance vector (AODV routing protocol. The existing Routing protocol AODV-L which is based on the Link expiration time is extended to propose a more reliable AODV-AD which is based on multichannel MAC protocol. For the performance evaluation of routing protocols, a simulation tool ‘NS2’ has been used. Simulation results show that the proposed AODV-AD protocol can achieves better performances in forms of high Route stability, Packet Delivery ratio and packet loss rate than traditional AODV-L and traditional AODV.

  7. Walkable Route Perceptions and Physical Features: Converging Evidence for En Route Walking Experiences

    Science.gov (United States)

    Brown, Barbara B.; Werner, Carol M.; Amburgey, Jonathan W.; Szalay, Caitlin

    2007-01-01

    Guided walks near a light rail stop in downtown Salt Lake City, Utah, were examined using a 2 (gender) x 3 (route walkability: low-mixed-, or high-walkability features) design. Trained raters confirmed that more walkable segments had more traffic, environmental, and social safety; pleasing aesthetics; natural features; pedestrian amenities; and…

  8. Waste Collection Vehicle Routing Problem: Literature Review

    Directory of Open Access Journals (Sweden)

    Hui Han

    2015-08-01

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

  9. Contention Aware Routing for Intermittently Connected Mobile Networks

    KAUST Repository

    Elwhishi, Ahmed; Ho, Pin Han; Naik, Sagar; Shihada, Basem

    2011-01-01

    This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

  10. Contention Aware Routing for Intermittently Connected Mobile Networks

    KAUST Repository

    Elwhishi, Ahmed

    2011-08-21

    This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

  11. Traffic routing for multicomputer networks with virtual cut-through capability

    Science.gov (United States)

    Kandlur, Dilip D.; Shin, Kang G.

    1992-01-01

    Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

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

    Science.gov (United States)

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

    2014-01-01

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

  13. Assessment of Novel Routes of Biomethane Utilization in a Life Cycle Perspective

    Directory of Open Access Journals (Sweden)

    Elham Ahmadi Moghaddam

    2016-12-01

    Full Text Available Biomethane, as a replacement for natural gas, reduces the use of fossil-based sources and supports the intended change from fossil to bio-based industry. The study assessed different biomethane utilization routes for production of methanol, dimethyl ether (DME, and ammonia, as fuel or platform chemicals, and combined heat and power (CHP. Energy efficiency and environmental impacts of the different pathways was studied in a life cycle perspective covering the technical system from biomass production to the end product. Among the routes studied, CHP had the highest energy balance and least environmental impact. DME and methanol performed competently in energy balance and environmental impacts in comparison with the ammonia route. DME had the highest total energy output, as fuel, heat, and steam, among the different routes studied. Substituting the bio-based routes for fossil-based alternatives would give a considerable reduction in environmental impacts such as global warming potential and acidification potential for all routes studied, especially CHP, DME, and methanol. Eutrophication potential was mainly a result of biomass and biomethane production, with marginal differences between the different routes.

  14. Detecting air traffic controller interventions in recorded air transportation system data

    Science.gov (United States)

    Kwon, Yul

    In this study, I propose a systematic method of detecting aircraft deviation due to air traffic controller (ATC) intervention. The aircraft deviations associated with ATC interventions are detected using a heuristic algorithm developed from analyzing the actual positions of an aircraft to its filed flight plan when the aircraft trajectories were identified as having an encounter in a loss-of-separation incident. An actual (closed-loop) flight trajectory of the Cleveland Air Route Traffic Control Center (ZOB ARTCC) was collected from the FlightAware database. This was compared with the corresponding planned (open-loop) trajectory dataset generated by the Microsoft(c) Flight Simulator X (FSX). I implemented a conflict-detection algorithm in Matlab to identify open-loop flight trajectories that encounters in loss-of-separation. I analyzed the differences between the closed-loop and open-loop flight trajectories of aircrafts that were identified to have encounters in loss of separation. The analysis identified operationally significant deviations in the closed-loop trajectory data with respect to the horizontal paths of the aircrafts. I then developed and validated a heuristic algorithm, the ATC intervention detection algorithm, based on the findings from the analysis. When used with a test dataset to validate the algorithm, it achieved an 85.7% detection rate in detecting horizontal deviations made by the ATC in resolving identified conflicts, and a false-alarm rate of 68%. In addition to the ATC intervention detection algorithm, I present in this paper an analysis of deviated flight trajectories in an effort to display how the presented methodology can be utilized to provide insight into air traffic controller resolution strategies.

  15. Performance evaluation of routing metrics for wireless mesh networks

    CSIR Research Space (South Africa)

    Nxumalo, SL

    2009-08-01

    Full Text Available for WMN. The routing metrics have not been compared with QoS parameters. This paper is a work in progress of the project in which researchers want to compare the performance of different routing metrics in WMN using a wireless test bed. Researchers...

  16. Influence of urban vegetation on air pollution and noise exposure - A case study in Gothenburg, Sweden.

    Science.gov (United States)

    Klingberg, Jenny; Broberg, Malin; Strandberg, Bo; Thorsson, Pontus; Pleijel, Håkan

    2017-12-01

    Air pollution levels (NO 2 , PAHs, O 3 ) were investigated, before (BLE) and after (ALE) leaf emergence, in the urban landscape of Gothenburg, Sweden. The aims were to study the 1) spatial and temporal variation in pollution levels between urban green areas, 2) effect of urban vegetation on air pollution levels at the same distance from a major emission source (traffic route), 3) improvement of urban air quality in urban parks compared to adjacent sites near traffic, 4) correlation between air pollution and noise in a park. O 3 varied little over the urban landscape. NO 2 varied strongly and was higher in situations strongly influenced by traffic. Four PAH variables were included: total PAH, total particle-bound PAH, the quantitatively important gaseous phenanthrene and the highly toxic particle-bound benzo(a)pyrene. The variation of PAHs was similar to NO 2 , but for certain PAHs the difference between highly and less polluted sites was larger than for NO 2 . At a vegetated site, NO 2 and particulate PAH levels were lower than at a non-vegetated site at a certain distance from a busy traffic route. This effect was significantly larger ALE compared to BLE for NO 2 , indicating green leaf area to be highly significant factor for air quality improvement. For particulate PAHs, the effect was similar BLE and ALE, indicating that tree bark and branches also could be an important factor in reducing air pollution. Parks represented considerably cleaner local environments (park effect), which is likely to be a consequence of both a dilution (distance effect) and deposition. Noise and air pollution (NO 2 and PAH) levels were strongly correlated. Comparison of noise levels BLE and ALE also showed that the presence of leaves significantly reduced noise levels. Our results are evidence that urban green spaces are beneficial for urban environmental quality, which is important to consider in urban planning. Copyright © 2017 Elsevier B.V. All rights reserved.

  17. The vehicle routing problem latest advances and new challenges

    CERN Document Server

    Golden, Bruce L; Wasil, Edward A

    2008-01-01

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

  18. GIS-Based Population Model Applied to Nevada Transportation Routes

    International Nuclear Information System (INIS)

    Mills, G.S.; Neuhauser, K.S.

    1999-01-01

    Recently, a model based on geographic information system (GIS) processing of US Census Block data has made high-resolution population analysis for transportation risk analysis technically and economically feasible. Population density bordering each kilometer of a route may be tabulated with specific route sections falling into each of three categories (Rural, Suburban or Urban) identified for separate risk analysis. In addition to the improvement in resolution of Urban areas along a route, the model provides a statistically-based correction to population densities in Rural and Suburban areas where Census Block dimensions may greatly exceed the 800-meter scale of interest. A semi-automated application of the GIS model to a subset of routes in Nevada (related to the Yucca Mountain project) are presented, and the results compared to previous models including a model based on published Census and other data. These comparisons demonstrate that meaningful improvement in accuracy and specificity of transportation risk analyses is dependent on correspondingly accurate and geographically-specific population density data

  19. Delay Tolerance in Underwater Wireless Communications: A Routing Perspective

    Directory of Open Access Journals (Sweden)

    Safdar Hussain Bouk

    2016-01-01

    Full Text Available Similar to terrestrial networks, underwater wireless networks (UWNs also aid several critical tasks including coastal surveillance, underwater pollution detection, and other maritime applications. Currently, once underwater sensor nodes are deployed at different levels of the sea, it is nearly impossible or very expensive to reconfigure the hardware, for example, battery. Taking this issue into account, considerable amount of research has been carried out to ensure minimum energy costs and reliable communication between underwater nodes and base stations. As a result, several different network protocols were proposed for UWN, including MAC, PHY, transport, and routing. Recently, a new paradigm was introduced claiming that the intermittent nature of acoustic channel and signal resulted in designing delay tolerant routing schemes for the UWN, known as an underwater delay tolerant network. In this paper, we provide a comprehensive survey of underwater routing protocols with emphasis on the limitations, challenges, and future open issues in the context of delay tolerant network routing.

  20. A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

    KAUST Repository

    Elwhishi, Ahmed

    2013-05-01

    Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.